Which of the following techniques is used to resolve collision in hashing?

You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion into a NONEMPTY queue?

Which of the following operations is performed more efficiently by the doubly linked list than by the linear linked list?

Four characters are placed in a queue in the following order: D, C, B, and A. If they are removed one at a time, what will be the order of their removal?

What is the meaning of the statement: "Entries in a stack are 'ordered'"?

A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

Which statement is true for a B-tree?

In an AVL tree, if the balance factor of a node is -1, which of the following statement/s is/are true?

Which of the following stack operations could result in a stack underflow?

Which of the following operations is more expensive in the array implementation of the linked list than it is in the dynamically created linked list?

Which of the following tree traversal techniques reads the root before its children nodes?