Consider a complete binary tree with n nodes, where the left and the right subtrees of the root are
min heaps. The upper bound to convert the tree to a min heap by an efficient algorithm is _______.
A.B.C.D.
A published solution is not available for this question yet.
Which of the following statement(s) is/are correct about the traversals in a **binary search tree?**
1. The root of the tree is always the first element of the **inorder** traversal.
2. The root of the tree is always the last element of the **postorder** traversal.
A.
Only statement 1 is correct
B.
Only statement 2 is correct
C.
Both the statements are correct
D.
None of the statements are correct
A published solution is not available for this question yet.
A popular conference is being held, and there are several types of seats: VIP, Regular, and
Economy. Each type of seat has a limited number of available spots. Each attendee has a
preference for the type of seat they want, and the total number of attendees is greater than the
number of available seats. The goal is to allocate the seats to attendees such that each attendee is
assigned to their preferred seat type, and no seat type exceeds its capacity.
How can the given problem of allocating seats to attendees based on their preferences and seat
type capacities be effectively solved?
A.
Using a greedy algorithm to assign seats based on attendee preferences.
B.
Modeling the problem as a maximum flow network with capacities
representing seat limits and flows representing the number of attendees assigned to each seat
type.
C.
Implementing a first-come, first-serve approach without considering the
preferences or seat type capacities.
D.
Assigning all attendees to the VIP seats first and distributing the remaining
attendees among Regular and Economy seats.
A published solution is not available for this question yet.
Consider the following statements.
1. If an NP-hard problem **A** is polynomial time reducible to another problem **B**, then **B** belongs to
the class NP.
2. If an NP-hard problem **A** is polynomial time reducible to another problem **B**, then **B** is NP-
complete.
Which of the following option is correct?
A.
Only statement 1 is true
B.
Only statement 2 is true
C.
Both statements 1 and 2 are true
D.
Both statements 1 and 2 are false
A published solution is not available for this question yet.
**MLF**
**Section Id :** 64065375506
**Section Number :** 9
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 13
**Number of Questions to be attempted :** 13
**Section Marks :** 40
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
**Section Maximum Duration :** 0
**Section Minimum Duration :** 0
**Section Time In :** Minutes
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.