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