a) Rear = MAX_SIZE – 1 b) Front = (rear + 1)mod MAX_SIZE c) Front = rear + 1 d) Rear ...
View QuestionA data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?
a) Queue b) Circular queue c) Dequeue d) Priority queue Answer: c Explanation: In dequeuer, we ...
View QuestionIf the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
a) ABCD b) DCBA c) DCAB d) ABDC Answer: a Explanation: Queue follows FIFO approach. i.e. First in ...
View QuestionCircular Queue is also known as ________
a) Ring Buffer b) Square Buffer c) Rectangle Buffer d) Curve ...
View QuestionA queue follows __________
a) FIFO (First In First Out) principle b) LIFO (Last In First Out) principle c) Ordered array d) ...
View QuestionThe data structure required for Breadth First Traversal on a graph is?
a) Stack b) Array c) Queue d) Tree Answer: c Explanation: In Breadth First Search Traversal, BFS, starting ...
View QuestionA linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _____________
a) Queue b) Stack c) Tree d) Linked list Answer: a Explanation: Linear ...
View QuestionWhich data structure is used for implementing recursion?
a) Queue b) Stack c) Array d) List Answer: b Explanation: Stacks ...
View QuestionThe prefix form of an infix expression (p + q) – (r * t) is?
The prefix form of an infix expression (p + q) – (r * t) is? a) ...
View Question
What is the result of the following operation?
Top (Push (S, X))
What is the result of the following operation? Top (Push (S, X)) a) X b) X+S c) S d) XS
View Question