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.
(51)
Which data structure allows deleting data elements from and inserting at rear?
[A]
Stacks
[B]
Queues
[C]
Dequeues
[D]
Binary search tree
Comment
(52)
Which data structure is used in breadth first search of a graph to hold nodes?
[A]
Array
[B]
Tree
[C]
Stack
[D]
queue
Comment
(53)
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
[A]
Stack
[B]
Priority queues
[C]
Output restricted qequeue
[D]
Input restricted dequeue
(54)
Which of the following data structure is non linear type?
[A]
Graph
[B]
Stacks
[C]
Lists
[D]
None of the above
Comment
(55)
In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
[A]
0 and 1
[B]
0 and -1
[C]
-1 and 0
[D]
1 and 0
Comment
(56)
There is an extra element at the head of the list called a .........
[A]
Sentinel
[B]
Antinel
[C]
List head
[D]
List header
Comment
(57)
The property of binary tree is
[A]
The root cannot contain NULL
[B]
The first subset is called left subtree
[C]
The second subtree is called right subtree
[D]
The right subtree can be empty
Comment
(58)
When new data are to be inserted into a data structure, but there is not available space; this situation is usually called .......
[A]
overflow
[B]
Underflow
[C]
housefull
[D]
memoryfull
Comment
(59)
A data structure where elements can be added or removed at either end but not in the middle is called ......
[A]
stacks
[B]
queues
[C]
dequeue
[D]
linked lists
Comment
(60)
The use of pointers to refer elements of a data structure in which elements are logically adjacent is ......
[A]
stack
[B]
queue
[C]
pointers
[D]
linked allocation
Comment
Please share this page