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