Q. A queue data-structure can be used for −

View solution

Q. If locality is a concern, you can use _______ to traverse the graph.

View solution

Q. Aposterior analysis are more accurate than apriori analysis because −

View solution

Q. Prefix notation is also known as

View solution

Q. In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is

View solution

Q. If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?

View solution

Q. Queue data structure works on

View solution

Q. Which of the following uses FIFO method

View solution

Q. In C programming, when we remove an item from bottom of the stack, then −

View solution

Q. What data structure can be used to check if a syntax has balanced parenthesis ?

View solution

Q. Stack is also called as

View solution

Q. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

View solution

Q. ……………. Is a pile in which items are added at one end and removed from the other.

View solution

Q. Which data structure allows deleting data elements from and inserting at rear?

View solution

Q. A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

View solution

Q. Which data structure is used in breadth first search of a graph to hold nodes?

View solution

Q. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

View solution

Q. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.

View solution

Q. In a circular queue the value of r will be ..

View solution

Q. Which of the following statement is true?

i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.

ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

View solution