ThatQuiz Test Library Take this test now
DSALGO-reviewer(midterm)
Contributed by: Fernandez
  • 1. Which type of tree ensures that the left subtree contains only nodes with values less than the root node, and the right subtree contains nodes with values greater than the root node?
A) AVL tree
B) B-tree
C) Red-Black tree
D) binary search tree (BST)
  • 2. In a binary tree, what is the depth of a node?
A) The number of levels in the tree
B) The value of the node
C) The height of the node
D) The number of nodes on the path from the root to that node
  • 3. Which type of tree has a special condition that the left subtree is less than the root, and the right subtree is greater than the root?
A) AVL tree
B) Binary search tree (BST)
C) Red-Black tree
D) B-tree
  • 4. Which traversal of a binary tree visits the left subtree, then the right subtree, and finally the root?
A) Postorder
B) Level order
C) Preorder
D) Inorder
  • 5. Which node in a tree is at the top and has no parent?
A) Internal node
B) Sibling node
C) Root node
D) Leaf node
  • 6. What is the depth of a tree?
A) The height of the tree
B) The total number of nodes
C) The number of edges from the root to the deepest leaf
D) The maximum number of children of any node
  • 7. In a binary tree, each node can have a maximum of how many children?
A) 1
B) 0
C) 2
D) 3
  • 8. Which tree structure is used in database indexing to optimize search and retrieval operations?
A) AVL tree
B) Trie
C) B-tree
D) Binary search tree
  • 9. Which type of tree is used in balancing binary search trees to maintain their height and performance?
A) AVL tree
B) B-tree
C) Binary tree
D) Trie
  • 10. Which traversal of a binary tree visits the left subtree, then the root, and finally the right subtree?
A) Preorder
B) Level order
C) Inorder
D) Postorder
  • 11. What is the height of a tree? *
A) The distance from the root to the deepest leaf
B) The number of leaves in the tree
C) The maximum number of children a node can have
D) The number of nodes in the tree
  • 12. Which traversal of a binary tree visits the root first, then the left subtree, and finally the right subtree?
A) Inorder
B) Preorder
C) Postorder
D) Level order
  • 13. A node in a binary tree with no children is known as a:
A) Internal node
B) Leaf node
C) Unary node
D) Sibling node
  • 14. What is a tree in data structures?
A) A graph
B) A hash table
C) A hierarchical data structure
D) A linear data structure
  • 15. In a binary tree, if a node has only one child, is it a left child or a right child?
A) It cannot have only one child.
B) It could be either a left or a right child.
C) It must be a right child.
D) It must be a left child.
  • 16. What is the primary purpose of a binary search tree (BST)?
A) To minimize the height of the tree
B) To store data in a random order
C) To ensure the tree is balanced
D) To store data in a sorted order
  • 17. In a binary tree, a node with only one child is called a:
A) Unary node
B) Sibling node
C) Internal node
D) Leaf node
  • 18. In a balanced binary search tree, what is the height typically restricted to?
A) Constant
B) Linear in the number of nodes
C) Quadratic in the number of nodes
D) Logarithmic in the number of nodes
  • 19. In graph terminology, what is a "path"?
A) A cycle without any vertices
B) A route connecting two nodes
C) A collection of edges
D) A set of all nodes in the graph
  • 20. What characterizes a connected graph?
A) All vertices are reachable from one another
B) There are no edges
C) It is a directed graph only
D) It has multiple components
  • 21. What is a graph?
A) A type of tree
B) A collection of arrays
C) A linear data structure
D) A collection of nodes and edges
  • 22. Which algorithm is commonly used to find the shortest path in a weighted graph?
A) Kruskal's algorithm
B) Depth-first search
C) Prim's algorithm
D) Dijkstra's algorithm
  • 23. What does a bipartite graph consist of?
A) Only one vertex
B) Vertices that form a cycle
C) A single set of vertices
D) Two sets of vertices where edges only connect nodes from different sets
  • 24. What is the degree of a vertex in a graph?
A) The total number of vertices in the graph
B) The number of edges connected to it
C) The distance to the farthest vertex
D) The number of paths from that vertex
  • 25. What does the term "adjacency" refer to in graph theory?
A) A connection between two vertices
B) The number of vertices in a graph
C) The distance between two vertices
D) The total number of edges
  • 26. In a directed graph, an edge has a direction. What does this imply?
A) The edge does not exist
B) The edge connects two nodes of different types
C) The edge can only be traversed in one way
D) The edge can be traversed in both ways
  • 27. In an undirected graph, how many edges can connect two vertices?
A) Exactly 2
B) Infinite
C) 1 or more
D) 0 or 1
  • 28. What is a weighted graph?
A) A graph where vertices have weights
B) A graph with no edges
C) A graph where all edges have the same weight
D) A graph where edges have values associated with them
  • 29. What is the purpose of an adjacency matrix?
A) To perform sorting operations.
B) To simplify graph traversal.
C) To represent node and edge connectivity in a graph.
D) To store edge weights only.
  • 30. What is a connected graph?
A) A graph where all vertices are connected by edges
B) A graph that contains cycles
C) A graph with no edges
D) A graph that can be divided into two or more subgraphs
  • 31. In a "simple graph," which of the following characteristics holds true?
A) It has no parallel edges or self-loops.
B) It contains at least one cycle.
C) It allows weighted edges.
D) It is always directed.
  • 32. What is a cycle in a graph?
A) A disconnected graph
B) A path that visits every vertex
C) A graph with no edges
D) A closed path where the starting and ending vertices are the same
  • 33. Which data structure is commonly used to represent a graph?
A) Array only
B) Adjacency matrix
C) Linked list
D) Stack
  • 34. What type of graph has all pairs of vertices connected by exactly one edge?
A) Bipartite Graph
B) Complete Graph
C) Undirected Graph
D) Directed Graph
  • 35. What type of graph can be divided into two disjoint sets where each edge connects a vertex from one set to the other?
A) Directed Graph
B) Complete Graph
C) Weighted Graph
D) Bipartite Graph
  • 36. What is a Queue?
A) A data type in C++
B) A linear data structure
C) A non-linear data structure
D) A hierarchical data structure
  • 37. In a queue, which item gets removed first?
A) The item at random
B) The item in the middle
C) The last item added
D) The first item added
  • 38. What is the process of adding an element to a queue called?
A) Dequeue
B) Enqueue
C) Pop
D) Push
  • 39. What is the process of removing an element from a queue called?
A) Enqueue
B) Pop
C) Dequeue
D) Push
  • 40. Which data structure follows the First-In-First-Out (FIFO) principle?
A) tree
B) stack
C) queue
D) linked list
  • 41. Which of the following operations are typically performed on a queue?
A) Only insertion
B) Insertion at one end and deletion at the other end
C) Only deletion
D) Insertion and deletion at both ends
  • 42. In a circular queue, what happens when you reach the end of the queue and want to add more elements?
A) Elements are discarded
B) An error is generated
C) Elements are added at the beginning of the queue
D) Elements are added at the end of the queue
  • 43. Which of the following is not a type of queue?
A) Circular Queue
B) Priority Queue
C) Banana queue
D) Deque
  • 44. What is the time complexity of enqueue and dequeue operations in a basic queue implemented using an array?
A) O(1) for both enqueue and dequeue
B) O(n) for both enqueue and dequeue
C) O(n) for enqueue and O(1) for dequeue
D) O(n) for both enqueue and dequeue
  • 45. Which of the following is not a valid method to implement a queue?
A) Using stacks
B) Using arrays
C) Using linked lists
D) Using dynamic arrays
  • 46. What is a priority queue?
A) A queue that gives priority to older elements
B) A queue that processes elements in a random order
C) A queue with a fixed size
D) A queue in which elements are processed based on their priority
  • 47. Which data structure is commonly used to implement a priority queue?
A) Binary heap
B) Stack
C) Queue
D) Circular queue
  • 48. What is the primary difference between a regular queue and a double-ended queue (deque)?
A) A regular queue is faster than a deque.
B) A deque can enqueue and dequeue elements at both ends.
C) A deque can only dequeue elements from the front.
D) A deque can only enqueue elements at the front.
  • 49. In a priority queue, which element gets processed first?
A) The element with the lowest priority
B) The element added most recently
C) The element with the highest priority
D) The element added least recently
  • 50. Which type of queue allows elements to be inserted and removed from both ends, like a deck of cards?
A) Normal Queue
B) deque
C) Circular Queue
D) Priority Queue
  • 51. Which data structure can be used to implement a queue with a fixed size and overwrite old elements when it's full?
A) Circular Queue
B) Priority Queue
C) Stack
D) Deque
  • 52. What is the size of a queue after enqueueing n elements and then dequeuing m elements, where m > n?
A) n
B) 0
C) n-m
D) m
  • 53. In a priority queue, if two elements have the same priority, how are they typically handled?
A) They are processed in a random order.
B) The last element added is processed first.
C) The first element added is processed first.
D) The order is implementation-specific.
  • 54. Which of the following is not a common application of a queue data structure?
A) Breadth-first search (BFS)
B) Print spooling
C) Undo functionality in text editors
D) Sorting algorithms
  • 55. Which operation can be performed in constant time (O(1)) on a well-implemented queue?
A) Both enqueue and dequeue
B) None of the above
C) Enqueue
D) Dequeue
  • 56. In a double-ended queue (deque), which operation allows you to retrieve the element at the front without removing it?
A) dequeue()
B) front()
C) pop_front()
D) remove_front()
  • 57. What is the primary advantage of using a circular queue over a basic queue?
A) Better memory utilization
B) Simpler implementation
C) No advantage; they are equivalent
D) Faster enqueue operation
  • 58. Which data structure is often used to implement a queue with a maximum size, where adding elements beyond the limit removes the oldest elements?
A) Deque
B) Circular Queue
C) Cache
D) Priority Queue
  • 59. What is the term used to describe a queue that allows elements to be added and removed at both ends, but does not have a fixed size?
A) Deque
B) Priority Queue
C) Stack
D) Circular Queue
  • 60. Which of the following is a disadvantage of using an array-based implementation for a queue?
A) It may lead to wasted memory for a large maximum size.
B) It has faster enqueue and dequeue operations.
C) It is not suitable for implementing a priority queue.
D) It allows for dynamic sizing.
  • 61. In a priority queue, which element will be removed first?
A) The element with the lowest value
B) The first element added
C) The last element added
D) The element with the highest value
  • 62. Which type of queue allows elements to be processed in the order they were added?
A) Circular Queue
B) Deque
C) Normal Queue
D) Priority Queue
  • 63. What data structure can be used to efficiently implement a priority queue that allows fast insertion and removal of elements with the highest priority?
A) heap data structure
B) Stack
C) Binary Tree
D) Linked List
  • 64. In a double-ended queue (deque), which operation allows you to retrieve the element at the back without removing it?
A) remove_back()
B) back()
C) dequeue()
D) pop_back()
  • 65. Which type of queue allows elements to be processed based on their age, with older elements processed first?
A) Normal Queue
B) Circular Queue
C) Age-Ordered Queue
D) Priority Queue
  • 66. In a circular queue, how do you detect that the queue is full?
A) Circular queues cannot be full.
B) Check if the front pointer is ahead of the rear pointer by 1.
C) Check if the rear pointer is ahead of the front pointer by 1.
D) Compare the rear and front pointers modulo the queue size.
  • 67. In a priority queue, what happens when two elements have the same priority and are removed?
A) The element with the lower value is removed.
B) The element added first is removed.
C) It's implementation-dependent.
D) The element with the higher value is removed.
  • 68. Which is not a Characteristics of an Algorithm
A) Feasibility
B) Dependent
C) Unambiguous
D) Output
E) Input
  • 69. This signifies the total time required by the program to run till its completion.
A) Time complexity
B) Reusability
C) Space Complexity
D) Efficiency
E) Abstraction
  • 70. This is the amount of memory used by the algorithm (including the input values to the algorithm) to execute and produce the result.
A) Time complexity
B) Space Complexity
C) Efficiency
D) Reusability
E) Abstraction
  • 71. once we have implemented a particular data structure, we can use it at any other place.
A) Efficiency
B) Time complexity
C) Abstraction
D) Reusability
  • 72. This characteristic describes whether the data items are arranged in chronological sequence, such as with an array, or in an unordered sequence, such as with a graph.
A) Homogeneous or non-homogeneous
B) Static or dynamic
C) Linear or non-linear
  • 73. This characteristic describes whether all data items in a given repository are of the same type or of various types.
A) Linear or non-linear
B) Homogeneous or non-homogeneous
C) Static or dynamic
  • 74. This characteristic describes how the data structures are compiled.
A) Linear or non-linear
B) Homogeneous or non-homogeneous
C) Static or dynamic
  • 75. This is broadly defined as the process of organizing data by relevant categories so that it may be used and protected more efficiently.
A) Data classification
B) User
C) Content
D) Context
Created with That Quiz — where a math practice test is always one click away.