Download PDF
Free download pdf of Data Structures and Algorithms Multiple Choice Questions and Answers for papers of graduate and post-graduate examinations in Computer Science & Engineering Branch.
(91)
........ is not the operation that can be performed on queue.
[A]
Traversal
[B]
Retrieval
[C]
Deletion
[D]
Insertion
Comment
(92)
A linear list in which the last node points to the first node is ........
[A]
singly linked list
[B]
doubly linked list
[C]
circular linked list
[D]
none of the above
Comment
(93)
A linear list in which the pointer points only to the successive node is......
[A]
singly linked list
[B]
circular linked list
[C]
doubly linked list
[D]
none of the above
Comment
(94)
A ...... indicates the end of the list.
[A]
Guard
[B]
Sentinel
[C]
End pointer
[D]
Last pointer
Comment
(95)
LLINK is the pointer pointing to the ......
[A]
head node
[B]
last node
[C]
successor node
[D]
predecessor node
Comment
(96)
Indexing the........ element in the list is not possible in linked lists.
[A]
first
[B]
middle
[C]
last
[D]
All of the above
Comment
(97)
A doubly linked list has .......... pointers with each node.
Comment
(98)
A linear list in which each node has point to the predecessor and successors nodes is called ........
[A]
singly linked list
[B]
linear linked list
[C]
doubly linked list
[D]
None of the above
Comment
(99)
RLINK is the pointer pointing to the......
[A]
last node
[B]
head node
[C]
successor node
[D]
predecessor node
Comment
(100)
In a linked list, insertion can be done as.........
[A]
beginning
[B]
middle
[C]
end
[D]
all of the above
Comment
Take Mock Tests