Congratulations - you have completed Data Structure.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%


Your answers are highlighted below.
Question 1
Generally collection of Nodes is called as __________.
A
Heap
B
Stack
C
Pointer
D
Linked List
Question 2
A linear collection of data element given by mean of pointer is called ______________.
A
Graph
B
Queue
C
Stack
D
Linked List
Question 3
Which of the following is not a type of Linked List ?
A
Circular Linked List
B
Hybrid Linked List
C
Doubly Linked List
D
Singly Linked List
Question 4
Linked list is generally considered as an example of _________ type of memory allocation.
A
Static
B
Dynamic
C
None of these
D
Compile Time
Question 5
Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.
A
Pointer to Node
B
Pointer to Class
C
Pointer to Character
D
Pointer to an Integer
Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results