Understanding the Problem:
The question asks us to determine the maximum number of nodes at a given height h in a heap with n total elements. Let’s analyze this based on the properties of a heap.
English
10 Questions
20 Marks
12 Mins English English50 Questions100 Marks60 Mins English English10 Questions20 Marks12 Mins English| List - I |
List - II |
||
| A. |
Dijkstra’s Algorithms |
I. |
Find the shortest path between all pairs of vertices in a graph with positive or negative edge weights. |
| B. |
Floyd-Warshall Algorithms |
II. |
Finds the shortest path in a weighted graph with non-negative edge weights. |
| C. |
Bellman-frod Algorithms |
III. |
Sorts elements by repeatedly moving them post neighboring elements that are smaller. |
| D. |
Prim’s Algorithms |
IV. |
Determines the strongest connected components in a directed graph. |
Suggested Test Series
Suggested Test Series
