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) Red-Black tree
B) B-tree
C) binary search tree (BST)
D) AVL tree
  • 2. In a binary tree, what is the depth of a node?
A) The height of the node
B) The number of levels in the tree
C) The value 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) Binary search tree (BST)
B) Red-Black tree
C) B-tree
D) AVL 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) Inorder
D) Preorder
  • 5. Which node in a tree is at the top and has no parent?
A) Leaf node
B) Sibling node
C) Root node
D) Internal node
  • 6. What is the depth of a tree?
A) The number of edges from the root to the deepest leaf
B) The maximum number of children of any node
C) The total number of nodes
D) The height of the tree
  • 7. In a binary tree, each node can have a maximum of how many children?
A) 0
B) 2
C) 1
D) 3
  • 8. Which tree structure is used in database indexing to optimize search and retrieval operations?
A) Binary search tree
B) B-tree
C) Trie
D) AVL tree
  • 9. Which type of tree is used in balancing binary search trees to maintain their height and performance?
A) Binary tree
B) B-tree
C) AVL tree
D) Trie
  • 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 distance from the root to the deepest leaf
B) The maximum number of children a node can have
C) The number of nodes in the tree
D) The number of leaves in the tree
  • 12. Which traversal of a binary tree visits the root first, then the left subtree, and finally the right subtree?
A) Postorder
B) Inorder
C) Preorder
D) Level order
  • 13. A node in a binary tree with no children is known as a:
A) Leaf node
B) Unary node
C) Internal node
D) Sibling node
  • 14. What is a tree in data structures?
A) A hash table
B) A linear data structure
C) A graph
D) A hierarchical 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 store data in a sorted order
B) To store data in a random order
C) To minimize the height of the tree
D) To ensure the tree is balanced
  • 17. In a binary tree, a node with only one child is called a:
A) Sibling node
B) Leaf node
C) Unary node
D) Internal node
  • 18. In a balanced binary search tree, what is the height typically restricted to?
A) Linear in the number of nodes
B) Quadratic in the number of nodes
C) Logarithmic in the number of nodes
D) Constant
  • 19. In graph terminology, what is a "path"?
A) A cycle without any vertices
B) A route connecting two nodes
C) A set of all nodes in the graph
D) A collection of edges
  • 20. What characterizes a connected graph?
A) It is a directed graph only
B) There are no edges
C) It has multiple components
D) All vertices are reachable from one another
  • 21. What is a graph?
A) A collection of arrays
B) A collection of nodes and edges
C) A linear data structure
D) A type of tree
  • 22. Which algorithm is commonly used to find the shortest path in a weighted graph?
A) Dijkstra's algorithm
B) Depth-first search
C) Prim's algorithm
D) Kruskal's algorithm
  • 23. What does a bipartite graph consist of?
A) Vertices that form a cycle
B) Two sets of vertices where edges only connect nodes from different sets
C) Only one vertex
D) A single set of vertices
  • 24. What is the degree of a vertex in a graph?
A) The number of edges connected to it
B) The distance to the farthest vertex
C) The number of paths from that vertex
D) The total number of vertices in the graph
  • 25. What does the term "adjacency" refer to in graph theory?
A) The distance between two vertices
B) The number of vertices in a graph
C) The total number of edges
D) A connection between two vertices
  • 26. In a directed graph, an edge has a direction. What does this imply?
A) The edge connects two nodes of different types
B) The edge can be traversed in both ways
C) The edge can only be traversed in one way
D) The edge does not exist
  • 27. In an undirected graph, how many edges can connect two vertices?
A) 0 or 1
B) 1 or more
C) Exactly 2
D) Infinite
  • 28. What is a weighted graph?
A) A graph where edges have values associated with them
B) A graph with no edges
C) A graph where all edges have the same weight
D) A graph where vertices have weights
  • 29. What is the purpose of an adjacency matrix?
A) To store edge weights only.
B) To represent node and edge connectivity in a graph.
C) To simplify graph traversal.
D) To perform sorting operations.
  • 30. What is a connected graph?
A) A graph that can be divided into two or more subgraphs
B) A graph that contains cycles
C) A graph where all vertices are connected by edges
D) A graph with no 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 disconnected graph
B) A path that visits every vertex
C) A closed path where the starting and ending vertices are the same
D) A graph with no edges
  • 33. Which data structure is commonly used to represent a graph?
A) Adjacency matrix
B) Linked list
C) Array only
D) Stack
  • 34. What type of graph has all pairs of vertices connected by exactly one edge?
A) Directed Graph
B) Complete Graph
C) Bipartite 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) Complete Graph
B) Bipartite Graph
C) Directed Graph
D) Weighted Graph
  • 36. What is a Queue?
A) A data type in C++
B) A hierarchical data structure
C) A non-linear data structure
D) A linear data structure
  • 37. In a queue, which item gets removed first?
A) The first item added
B) The item at random
C) The last item added
D) The item in the middle
  • 38. What is the process of adding an element to a queue called?
A) Pop
B) Enqueue
C) Push
D) Dequeue
  • 39. What is the process of removing an element from a queue called?
A) Push
B) Enqueue
C) Pop
D) Dequeue
  • 40. Which data structure follows the First-In-First-Out (FIFO) principle?
A) tree
B) queue
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) Insertion and deletion at both ends
D) Only deletion
  • 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 end of the queue
D) Elements are added at the beginning of the queue
  • 43. Which of the following is not a type of queue?
A) Deque
B) Banana queue
C) Circular Queue
D) Priority Queue
  • 44. What is the time complexity of enqueue and dequeue operations in a basic queue implemented using an array?
A) O(n) 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(1) for both enqueue and dequeue
  • 45. Which of the following is not a valid method to implement a queue?
A) Using dynamic arrays
B) Using linked lists
C) Using stacks
D) Using 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 in which elements are processed based on their priority
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 enqueue and dequeue elements at both ends.
B) A deque can only enqueue elements at the front.
C) A deque can only dequeue elements from the front.
D) A regular queue is faster than a deque.
  • 49. In a priority queue, which element gets processed first?
A) The element added most recently
B) The element added least recently
C) The element with the lowest priority
D) The element with the highest priority
  • 50. Which type of queue allows elements to be inserted and removed from both ends, like a deck of cards?
A) Circular Queue
B) deque
C) Normal 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) Deque
B) Circular Queue
C) Priority Queue
D) Stack
  • 52. What is the size of a queue after enqueueing n elements and then dequeuing m elements, where m > n?
A) m
B) n
C) n-m
D) 0
  • 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) The order is implementation-specific.
C) The first element added is processed first.
D) They are processed in a random order.
  • 54. Which of the following is not a common application of a queue data structure?
A) Print spooling
B) Breadth-first search (BFS)
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) Enqueue
C) Dequeue
D) None of the above
  • 56. In a double-ended queue (deque), which operation allows you to retrieve the element at the front without removing it?
A) pop_front()
B) remove_front()
C) front()
D) dequeue()
  • 57. What is the primary advantage of using a circular queue over a basic queue?
A) No advantage; they are equivalent
B) Faster enqueue operation
C) Simpler implementation
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) Deque
B) Cache
C) Circular Queue
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) Priority Queue
C) Deque
D) Stack
  • 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 may lead to wasted memory for a large maximum size.
C) It is not suitable for implementing a priority queue.
D) It has faster enqueue and dequeue operations.
  • 61. In a priority queue, which element will be removed first?
A) The last element added
B) The first element added
C) The element with the highest value
D) The element with the lowest value
  • 62. Which type of queue allows elements to be processed in the order they were added?
A) Priority Queue
B) Normal Queue
C) Deque
D) Circular 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) Binary Tree
B) Linked List
C) heap data structure
D) Stack
  • 64. In a double-ended queue (deque), which operation allows you to retrieve the element at the back without removing it?
A) dequeue()
B) remove_back()
C) back()
D) pop_back()
  • 65. Which type of queue allows elements to be processed based on their age, with older elements processed first?
A) Priority Queue
B) Circular Queue
C) Normal Queue
D) Age-Ordered Queue
  • 66. In a circular queue, how do you detect that the queue is full?
A) Check if the rear pointer is ahead of the front pointer by 1.
B) Circular queues cannot be full.
C) Compare the rear and front pointers modulo the queue size.
D) Check if the front pointer is ahead of the rear pointer by 1.
  • 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) It's implementation-dependent.
C) The element added first is removed.
D) The element with the higher value is removed.
  • 68. Which is not a Characteristics of an Algorithm
A) Input
B) Unambiguous
C) Dependent
D) Output
E) Feasibility
  • 69. This signifies the total time required by the program to run till its completion.
A) Reusability
B) Abstraction
C) Space Complexity
D) Time complexity
E) Efficiency
  • 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) Efficiency
B) Space Complexity
C) Time complexity
D) Reusability
E) Abstraction
  • 71. once we have implemented a particular data structure, we can use it at any other place.
A) Efficiency
B) Abstraction
C) Reusability
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) Homogeneous or non-homogeneous
B) Linear or non-linear
C) Static or dynamic
  • 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) Linear or non-linear
C) Homogeneous or non-homogeneous
  • 74. This characteristic describes how the data structures are compiled.
A) Static or dynamic
B) Homogeneous or non-homogeneous
C) Linear or non-linear
  • 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) Content
B) User
C) Data classification
D) Context
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.