1. What is a precondition for a binary search?
2. Which of the following is NOT a property of a B-Tree?
3. Worst case for a binary search tree is
4. Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behavior in O(n*log(n))?
5. The operation for adding an entry to a stack is traditionally called ________.
6. What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/(f+g-h)]
7. A sparse matrix can be a lower-triangular matrix when____.
8. Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child, where will the right child's value be stored (the array's first index is 0)?
9. Consider a linked list implementation of a queue with two pointers: front and rear. The time needed to insert element in a queue of length n is:
10. You have implemented a queue with a circular array keeping track of the first, the last, and the count (the number of items in the array). Suppose the first is zero, and the last is CAPACITY-1, what can you say about the count?
11. Which of the following lines of the code will delete two successive nodes of a single linked linear list(with more than two nodes)? Here 'LINK[X]' denotes the address field of node X.
12. Which of the following formulae in big-Oh notation best represents the expression n2+35n+6?
13. The hashing function which dynamically adapts to changes in the table being accessed is called ________.
14. What is the worst-case scenario for the binary search for finding a single item in an sorted array?
15. Which formula is the best approximation for the depth of a heap with n nodes?
16. The breadth-first traversal (BFS) is a method to traverse______
17. Which of the following stack operations could result in a stack underflow?
18. In an AVL tree, if the balance factor of a node is -1, which of the following statement/s is/are true?
19. Which statement is true for a B-tree?
20. What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.
21. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
22. When you use an index, you can store records on a ____ storage device.
23. The priming read is an example of a(n) ____ task.
Data Structures And Algorithms MCQs | Topic-wise