| 1. | node.next -> node.next.next; will make |
|
Answer: (a).node.next inaccessible
|
| 2. | A circular linked list can be used for |
|
Answer: (c).Both Stack & Queue
|
| 3. | In doubly linked lists |
|
Answer: (b).two pointers are maintained to store next and previous nodes.
|
| 4. | ………… is very useful in situation when data have to stored and then retrieved in reverse order. |
|
Answer: (a).Stack
|
| 5. | The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. |
|
Answer: (b).Linked Lists
|
| 6. | There is an extra element at the head of the list called a ………. |
|
Answer: (b).Sentinel
|
| 7. | Each node in a linked list has two pairs of ………….. and ………………. |
|
Answer: (a).Link field and information field
|
| 8. | The disadvantage in using a circular linked list is ……………………. |
|
Answer: (a).It is possible to get into infinite loop
|
| 9. | A linear list in which each node has pointers to point to the predecessor and successors nodes is called as |
|
Answer: (c).Doubly Linked List
|
| 10. | Linked lists are best suited |
|
Answer: (b).for the size of the structure and the data in the structure are constantly changing
|
