DAA Assignment -3

1. Discuss "Greedy Technique" with general plan and coin change problem as an example.

2. What is minimum spanning tree (MST)? Discuss.

3. List the algorithms used to find MST.

4. Discuss the following algorithms with "Algorithm" and example.
    Prim's Algorithm
    Kruskal's Algorithm.

5. Discuss "Dijkstra Algorithm" with algorithm and example.

6. Discuss "Huffman Codes and Huffman Trees" with example.

7. Discuss "Heaps and Heap Sort" algorithms with examples.

8. Discuss "Job Sequencing with deadlines" with example.

NOTE: Submit the assignments at the earliest......