Find minimum spanning tree using prim and kruskal’s algorithm:

Home/daa

## SIKSHAPATH Latest Questions

practice503

Asked: October 23, 2022In: Data Structure

Which algorithm is more efficient in constructing the minimum spanning tree of a given graph: Prim’s Algorithm or Kruskal’s Algorithm and why?

practice503

Asked: October 23, 2022In: Data Structure

Analyse the algorithm (in terms of both time and space) of subset sum problem using dynamic programming technique. Also write down the part of mentioned algorithm that contributes most towards the time and space complexity.

practice503

Asked: October 23, 2022In: Data Structure

A networking company uses a compression technique to encode the message before transmitting over the network. Suppose the message contains the following characters with their frequency:

practice503

Asked: October 23, 2022In: Data Structure

Solve the activity selection problem by sorting the activities according to increasing finish times:

practice503

Asked: October 23, 2022In: Data Structure

Solve using fractional knapsack: M=20, n=4 P= (3, 10, 15, 5) W= (5, 13, 12, 8).