Questions
51
Which data structure allows deleting data elements from and inserting at rear?
Answer: Option [B]
52
Which data structure is used in breadth first search of a graph to hold nodes?
Answer: Option [D]
53
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Answer: Option [D]
55
In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
Answer: Option [B]
56
There is an extra element at the head of the list called a .........
Answer: Option [A]
58
When new data are to be inserted into a data structure, but there is not available space; this situation is usually called .......
Answer: Option [A]
59
A data structure where elements can be added or removed at either end but not in the middle is called ......
Answer: Option [C]
60
The use of pointers to refer elements of a data structure in which elements are logically adjacent is ......
Answer: Option [D]
