(a) Apply Kruskal's algorithm to the following graph to find the cost of the minimum spanning tree (MST). The graph is undirected; the number on…
(a) Apply Kruskal's algorithm to the following graph to find the cost of the minimum spanning tree (MST). The graph is undirected; the number on each edge is its weight.
(b) What is heap sort? Build a heap tree from the following list of numbers: [44, 30, 50, 22, 60, 55, 77, 55]
From the BPSC Assistant Director (ICT) May 2025 – Written exam, question 7 of 9.
More from this paper
- Previous: (a) Write a program in any high-level language to read an integer and display a pattern like the one below. For example, if the given…
- Next: (a) What is 2-factor authentication? Describe it with an example. (b) What is a hash table? What are the advantages of using a hash table?…
- All questions in BPSC Assistant Director (ICT) May 2025 – Written