Data Structure in which one predecessor may have one or more successor – McqOptions

MCQOPTIONS

1.	Data Structure in which one predecessor may have one or more successor , that data structure is called as __________.
A.	Non Primitive Data Structure
B.	Primitive Data Structure
C.	Linear Data Structure
D.	Non Linear Data Structure
Answer» E.

Discussion

No Comment Found

Related MCQs

How will you free the memory allocated by the following program?  #include<stdio.h> #include<stdlib.h> #define MAXROW 3 #define MAXCOL 4 int main() {      int **p, i, j;      p = (int **) malloc(MAXROW * sizeof(int*));      return 0; }
What is x in the following program?  #include<stdio.h> int main() {      typedef char (*(*arrfptr[3])())[10];      arrfptr x;      return 0; }
In the following code, the P2 is Integer Pointer or Integer?  typedef int *ptr; ptr p1, p2;
What do the 'c' and 'v' in argv stands for?
___________ programs automatically connects to web sites and download documents and save them to local drive.
Which of the following language is used to write animation and games in browser ?
Software which allows user to view the webpage is called as __________.
Computer that requests the resources or data from other computer is called as ________ computer.
________ programs are automatically loaded and operates as a part of browser.
Data Structure in which one predecessor may have one or more successor , that data structure is called as __________.