Author name: admin

What is the maximum number of children a node can have in a binary tree? a) 1 b) 2 c) 3 d) 4 Answer: b) 2 Explanation: In a binary tree, each node can have at most two children: a left child and a right child. This structure is what defines a binary tree, as […]

Which of the following algorithms is not stable? a) Merge Sort b) Quick Sort c) Bubble Sort d) Insertion Sort Answer: b) Quick Sort Explanation: Quick Sort is not a stable sorting algorithm, meaning it does not guarantee that two equal elements will retain their relative order after sorting. The order of equal elements can

Which data structure is used to implement a breadth-first search in a tree? a) Stack b) Queue c) Priority Queue d) Array Answer: b) Queue Explanation: Breadth-First Search (BFS) in a tree is implemented using a queue data structure. BFS explores the tree level by level, starting from the root and visiting all nodes at

In which case does Merge Sort outperform Quick Sort? a) When sorting small datasets b) When the dataset is already sorted c) When dealing with large datasets and worst-case scenarios d) When the dataset contains duplicates Answer: c) When dealing with large datasets and worst-case scenarios Explanation: Merge Sort outperforms Quick Sort in worst-case scenarios,

What data structure is used for Depth-First Search (DFS) in a graph? a) Stack b) Queue c) Priority Queue d) Heap Answer: a) Stack Explanation: Depth-First Search (DFS) is implemented using a stack data structure. DFS explores a graph by going as deep as possible along a branch before backtracking, and this is naturally supported

What is the worst-case time complexity of Quick Sort? a) O(n log n) b) O(n) c) O(n^2) d) O(log n) Answer: c) O(n^2) Explanation: Quick Sort has a worst-case time complexity of O(n^2), which occurs when the pivot chosen is always the smallest or largest element in the array. This results in highly unbalanced partitions,

Which data structure is most suitable for implementing Breadth-First Search (BFS) in a graph? a) Stack b) Queue c) Linked List d) Heap Answer: b) Queue Explanation: Breadth-First Search (BFS) is implemented using a queue data structure. BFS explores a graph level by level, visiting all nodes at the current level before moving to the

What is the time complexity of inserting an element at the beginning of an array? a) O(1) b) O(n) c) O(log n) d) O(n^2) Answer: b) O(n) Explanation: Inserting an element at the beginning of an array requires shifting all existing elements one position to the right to make space for the new element, resulting

In a binary search algorithm, what is the time complexity of searching for an element? a) O(log n) b) O(n) c) O(n^2) d) O(1) Answer: a) O(log n) Explanation: Binary search is a divide-and-conquer algorithm that splits the search space in half with each comparison, resulting in a time complexity of O(log n). It works

What is the time complexity of deleting an element from a doubly linked list? a) O(1) b) O(n) c) O(log n) d) O(n log n) Answer: a) O(1) Explanation: In a doubly linked list, if you have a pointer to the node you want to delete, you can perform the deletion in constant time O(1)

Which of the following sorting algorithms is the fastest in the average case for large datasets? a) Quick Sort b) Bubble Sort c) Selection Sort d) Insertion Sort Answer: a) Quick Sort Explanation: Quick Sort is one of the fastest sorting algorithms in the average case, with a time complexity of O(n log n). It

In a graph, what is the time complexity of searching for an edge in an adjacency matrix representation? a) O(1) b) O(n) c) O(log n) d) O(n^2) Answer: a) O(1) Explanation: In an adjacency matrix representation of a graph, searching for an edge between two vertices can be done in constant time O(1). The adjacency

What is the time complexity of inserting an element into a binary heap? a) O(1) b) O(n) c) O(log n) d) O(n log n) Answer: c) O(log n) Explanation: The time complexity of inserting an element into a binary heap is O(log n). This is because after inserting the element at the end, the heap

Which of the following data structures is most suitable for implementing a priority queue? a) Stack b) Heap c) Linked List d) Queue Answer: b) Heap Explanation: A heap is the most suitable data structure for implementing a priority queue because it allows efficient retrieval of the highest (or lowest) priority element. Heaps provide logarithmic

What is the main advantage of using a doubly linked list over a singly linked list? a) Each node points to both the previous and the next node, allowing for bidirectional traversal b) It uses less memory than a singly linked list c) It allows direct access to the middle of the list d) It

In a linked list, how do you insert an element at the beginning of the list? a) By updating the pointer of the new node to point to the head and then updating the head to the new node b) By traversing to the end of the list and inserting the element c) By shifting

What is the time complexity of accessing an element in an array? a) O(log n) b) O(n) c) O(1) d) O(n log n) Answer: c) O(1) Explanation: Accessing an element in an array is done in constant time O(1), as arrays provide direct access to any element using its index. This makes arrays a very

Which of the following is not a self-balancing binary search tree? a) AVL Tree b) Red-Black Tree c) Binary Heap d) Splay Tree Answer: c) Binary Heap Explanation: A Binary Heap is not a self-balancing binary search tree. It is a complete binary tree where each parent node is greater than or equal to (max

What is the time complexity of searching for an element in a binary search tree (BST) in the average case? a) O(n) b) O(log n) c) O(1) d) O(n log n) Answer: b) O(log n) Explanation: In a balanced binary search tree (BST), the average time complexity for searching an element is O(log n). This

Which of the following data structures is used to implement recursion? a) Stack b) Queue c) Linked List d) Tree Answer: a) Stack Explanation: Recursion is implemented using a stack data structure. Every recursive function call is pushed onto the stack, and when the function returns, it is popped off the stack. This behavior mimics