Q201
Open questionQueues serve major role in . . . . . . . .
Select an option to see the answer and solution.
Data Structure · all questionsIntroduction to Data Structures
Introduction to Data Structures
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
210
Questions
11/11
Page
Pick an option on a question to see the right answer and solution.
Q202
Open questionWhat differentiates a circular linked list from a normal linked list?
Select an option to see the answer and solution.
Q203
Open questionA linear collection of data elements where the linear node is given by means of pointer is called?
Select an option to see the answer and solution.
Q204
Open questionArray implementation of Stack is not dynamic, which of the following statements supports this argument?
Select an option to see the answer and solution.
Q205
Open questionMinimum number of queues to implement stack is . . . . . . . .
Select an option to see the answer and solution.
Q206
Open questionPushing an element into stack already having five elements and stack size of 5, then stack becomes . . . . . . . .
Select an option to see the answer and solution.
Q207
Open questionA 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)
Select an option to see the answer and solution.
Q208
Open questionWhat data structure would you most likely see in non recursive implementation of a recursive algorithm?
Select an option to see the answer and solution.
Q209
Open questionConsider 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?
Select an option to see the answer and solution.
Q210
Open questionThe concatenation of two lists can be performed in O(1) time. Which of the following variation of the linked list can be used?
Select an option to see the answer and solution.