1. Queues serve major role in . . . . . . . .
2. What differentiates a circular linked list from a normal linked list?
3. A linear collection of data elements where the linear node is given by means of pointer is called?
4. Array implementation of Stack is not dynamic, which of the following statements supports this argument?
5. Minimum number of queues to implement stack is . . . . . . . .
6. Pushing an element into stack already having five elements and stack size of 5, then stack becomes . . . . . . . .
7. A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What's the time complexity of performing addFront and addRear? (Assume 'm' to be the size of the stack and 'n' to be the number of elements)
8. What data structure would you most likely see in non recursive implementation of a recursive algorithm?
9. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
10. The concatenation of two lists can be performed in O(1) time. Which of the following variation of the linked list can be used?
Read More Section(Introduction to Data Structures)
Each Section contains maximum 100 MCQs question on Introduction to Data Structures. To get more questions visit other sections.