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) binary search tree (BST)
B) B-tree
C) AVL tree
D) Red-Black 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) Red-Black tree
B) AVL tree
C) Binary search tree (BST)
D) B-tree
  • 4. Which traversal of a binary tree visits the left subtree, then the right subtree, and finally the root?
A) Inorder
B) Preorder
C) Postorder
D) Level order
  • 5. Which node in a tree is at the top and has no parent?
A) Internal node
B) Leaf node
C) Sibling node
D) Root 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) 1
B) 2
C) 0
D) 3
  • 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) Trie
B) Binary tree
C) B-tree
D) AVL tree
  • 10. Which traversal of a binary tree visits the left subtree, then the root, and finally the right subtree?
A) Postorder
B) Preorder
C) Inorder
D) Level order
  • 11. What is the height of a tree? *
A) The maximum number of children a node can have
B) The number of leaves in the tree
C) The distance from the root to the deepest leaf
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) Preorder
B) Postorder
C) Level order
D) Inorder
  • 13. A node in a binary tree with no children is known as a:
A) Unary node
B) Internal node
C) Leaf node
D) Sibling node
  • 14. What is a tree in data structures?
A) A hierarchical data structure
B) A graph
C) A hash table
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 must be a right child.
B) It cannot have only one child.
C) It could be either a left or 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 store data in a sorted order
D) To ensure the tree is balanced
  • 17. In a binary tree, a node with only one child is called a:
A) Internal node
B) Leaf node
C) Sibling node
D) Unary node
  • 18. In a balanced binary search tree, what is the height typically restricted to?
A) Logarithmic in the number of nodes
B) Constant
C) Quadratic in the number of nodes
D) Linear in the number of nodes
  • 19. In graph terminology, what is a "path"?
A) A route connecting two nodes
B) A set of all nodes in the graph
C) A collection of edges
D) A cycle without any vertices
  • 20. What characterizes a connected graph?
A) It is a directed graph only
B) There are no edges
C) All vertices are reachable from one another
D) It has multiple components
  • 21. What is a graph?
A) A type of tree
B) A linear data structure
C) A collection of arrays
D) A collection of nodes and edges
  • 22. Which algorithm is commonly used to find the shortest path in a weighted graph?
A) Dijkstra's algorithm
B) Depth-first search
C) Kruskal's algorithm
D) Prim's algorithm
  • 23. What does a bipartite graph consist of?
A) Vertices that form a cycle
B) Only one vertex
C) Two sets of vertices where edges only connect nodes from different sets
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 total number of vertices in the graph
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) The number of vertices in a graph
B) The total number of edges
C) A connection between two vertices
D) The distance between two vertices
  • 26. In a directed graph, an edge has a direction. What does this imply?
A) The edge can be traversed in both ways
B) The edge does not exist
C) The edge can only be traversed in one way
D) The edge connects two nodes of different types
  • 27. In an undirected graph, how many edges can connect two vertices?
A) Infinite
B) 1 or more
C) Exactly 2
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 store edge weights only.
B) To perform sorting operations.
C) To simplify graph traversal.
D) To represent node and edge connectivity in a graph.
  • 30. What is a connected graph?
A) A graph where all vertices are connected by edges
B) A graph with no edges
C) A graph that contains cycles
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 contains at least one cycle.
B) It allows weighted edges.
C) It has no parallel edges or self-loops.
D) It is always directed.
  • 32. What is a cycle in a graph?
A) A graph with no edges
B) A disconnected graph
C) A path that visits every vertex
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) Linked list
B) Adjacency matrix
C) Array only
D) Stack
  • 34. What type of graph has all pairs of vertices connected by exactly one edge?
A) Bipartite Graph
B) Undirected Graph
C) Complete 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) Bipartite Graph
C) Weighted Graph
D) Complete Graph
  • 36. What is a Queue?
A) A linear data structure
B) A data type in C++
C) A hierarchical data structure
D) A non-linear data structure
  • 37. In a queue, which item gets removed first?
A) The first item added
B) The item in the middle
C) The last item added
D) The item at random
  • 38. What is the process of adding an element to a queue called?
A) Enqueue
B) Dequeue
C) Pop
D) Push
  • 39. What is the process of removing an element from a queue called?
A) Enqueue
B) Push
C) Dequeue
D) Pop
  • 40. Which data structure follows the First-In-First-Out (FIFO) principle?
A) queue
B) linked list
C) tree
D) stack
  • 41. Which of the following operations are typically performed on a queue?
A) Insertion and deletion at both ends
B) Insertion at one end and deletion at the other end
C) Only insertion
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 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) 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 enqueue and O(1) for dequeue
C) O(1) 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 stacks
B) Using dynamic arrays
C) Using linked lists
D) Using arrays
  • 46. What is a priority queue?
A) A queue that processes elements in a random order
B) A queue in which elements are processed based on their priority
C) A queue that gives priority to older elements
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 dequeue elements from the front.
C) A deque can only enqueue elements at 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) Normal Queue
B) Circular Queue
C) Priority 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) 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-m
B) n
C) 0
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) The first element added is processed first.
C) The order is implementation-specific.
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) None of the above
B) Enqueue
C) Both enqueue and dequeue
D) Dequeue
  • 56. In a double-ended queue (deque), which operation allows you to retrieve the element at the front without removing it?
A) remove_front()
B) front()
C) dequeue()
D) pop_front()
  • 57. What is the primary advantage of using a circular queue over a basic queue?
A) No advantage; they are equivalent
B) Simpler implementation
C) Better memory utilization
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) Priority Queue
B) Cache
C) Circular Queue
D) Deque
  • 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) Priority Queue
D) Deque
  • 60. Which of the following is a disadvantage of using an array-based implementation for a queue?
A) It has faster enqueue and dequeue operations.
B) It may lead to wasted memory for a large maximum size.
C) It allows for dynamic sizing.
D) It is not suitable for implementing a priority queue.
  • 61. In a priority queue, which element will be removed first?
A) The first element added
B) The last 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) heap data structure
B) Binary Tree
C) Linked List
D) Stack
  • 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) Priority Queue
C) Age-Ordered Queue
D) Circular Queue
  • 66. In a circular queue, how do you detect that the queue is full?
A) Check if the front pointer is ahead of the rear pointer by 1.
B) Circular queues cannot be full.
C) Compare the rear and front pointers modulo the queue size.
D) Check if the rear pointer is ahead of the front 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) The element with the higher value is removed.
C) It's implementation-dependent.
D) The element added first is removed.
  • 68. Which is not a Characteristics of an Algorithm
A) Input
B) Feasibility
C) Output
D) Dependent
E) Unambiguous
  • 69. This signifies the total time required by the program to run till its completion.
A) Space Complexity
B) Time complexity
C) Reusability
D) Abstraction
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) Space Complexity
B) Time 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) Abstraction
B) Time complexity
C) Efficiency
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) 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) Data classification
C) Context
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.