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

Q. Which of the following properties is associated with a queue?

View solution

Q. In a circular queue, how do you increment the rear end of the queue?

View solution

Q. What is the term for inserting into a full queue known as?

View solution

Q. What is the time complexity of enqueue operation?

View solution

Q. What is the need for a circular queue?

View solution

Q. What is the space complexity of a linear queue having n elements?

View solution

Q. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

View solution

Q. In linked list implementation of a queue, where does a new element be inserted?

View solution

Q. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?

View solution

Q. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?

View solution

Q. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.

View solution