Search
Question: In a priority queue implemented with a binary heap, what happens when the maximum element ..
Question: In a priority queue implemented with a binary heap, what happens when the heap property is..
Question: What is the worst-case time complexity for deleting the minimum element from a binary heap..
Question: Which algorithm uses a priority queue to find the minimum spanning tree?Options: Kruskal\'..
Question: What is the primary advantage of using a Fibonacci heap over a binary heap?Options: Faster..
Question: In Dijkstra\'s algorithm, what role does a priority queue play?Options: To store all verti..
Question: What is the result of performing a \'decrease key\' operation in a min-heap?Options: The k..
Question: What is the maximum height of a binary heap with n elements?Options: nlog nn log n2nCorrec..
Question: Which algorithm is commonly used to convert an array into a heap?Options: HeapifyMerge Sor..
Question: How can the performance of a hash table be improved?Options: By using a larger initial siz..
Question: What is a potential issue with using a poor hash function?Options: Increased memory usageF..
Question: Which of the following scenarios is best suited for using a hash table?Options: When order..
Question: Which of the following hash functions is least likely to produce collisions?Options: Simpl..
Question: Which of the following is a common method for implementing a hash function?Options: Using ..
Question: What is the time complexity of searching for an element in a hash table in the average cas..
Question: Which of the following applications can benefit from hash tables?Options: Implementing a s..
Question: Which of the following is NOT a benefit of using hash tables?Options: Fast access timeDyna..
Question: What is the result of a poor hash function?Options: Increased memory usageFaster access ti..
Question: Which of the following scenarios would benefit most from using a hash table?Options: When ..
Question: What is the main advantage of using path compression in the \'Find\' operation?Options: It..
Question: What is the result of performing a union operation on two sets A and B in a Disjoint Set U..
Question: What is the initial state of each element in a Disjoint Set Union when it is first created..
Question: In a Disjoint Set Union, what does the \'Union by Rank\' technique help to achieve?Options..
Question: What is the \'union by rank\' optimization in Disjoint Set Union?Options: Always attaching..
Question: Which of the following is NOT a typical use case for Disjoint Set Union?Options: Kruskal\'..
Question: How does path compression improve the efficiency of the Disjoint Set Union?Options: By red..
Question: What is the time complexity of the \'find\' operation in a well-optimized Disjoint Set Uni..
Question: If two elements belong to different sets, what will the \'Find\' operation return after a ..
Question: How can you convert an array into a binary heap?Options: Insert elements one by oneUse the..
Question: Which of the following is NOT a characteristic of a binary heap?Options: Complete binary t..
