Q. If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?

View solution

Q. A 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 ?

View solution

Q. The data structure required for Breadth First Traversal on a graph is?

View solution

Q. A queue is a ?

View solution

Q. If 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?

View solution

Q. A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

View solution

Q. A normal queue, if implemented using an array of size MAX_SIZE, gets full when

View solution

Q. Which of the following real world scenarios would you associate with a stack data structure?

View solution

Q. What does ‘stack underflow’ refer to?

View solution

Q. What is the time complexity of pop() operation when the stack is implemented using an array?

View solution

Q. Which of the following array position will be occupied by a new element being pushed for a stack of size N elements(capacity of stack > N).

View solution

Q. What happens when you pop from an empty stack while implementing using the Stack ADT in Java?

View solution

Q. ‘Array implementation of Stack is not dynamic’, which of the following statements supports this argument?

View solution

Q. Which of the following array element will return the top-of-the-stack-element for a stack of size N elements(capacity of stack > N).

View solution

Q. What is the complexity of searching for a particular element in a Singly Linked List?

View solution

Q. Which of the following statements are correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?

View solution

Q. What does ‘stack overflow’ refer to?

View solution

Q. Consider these functions:
push() : push an element into the stack

pop() : pop the top-of-the-stack element

top() : returns the item stored in top-of-the-stack-node

What will be the output after performing these sequence of operations

push(20);

push(4);

top();

pop();

pop();

pop();

push(5);

top();

View solution

Q. Which of the following data structures can be used for parentheses matching?

View solution

Q. Minimum number of queues to implement stack is ___________

View solution