Design and Analysis of Algorithm Assigniment (1)
Design and Analysis of Algorithm Assigniment (1)
Group Assignment-I
Submission Date: 27/12/2024 G.C
Target group: CS-3rd SEM. III
Max. Mark 20%
I. Discuss the following terms/titles/ using a suitable example
1. Greedy Algorithms
a. Scheduling
b. Prim's Algorithm
c. Kruskal's Algorithm
2. Dynamic Programming
a. 0/1 Knapsack
b. Floyd Warshall’s Algorithm
c. Assembly-line scheduling
d. Brute Force Algorithm
3. Back Tracking
a. Knapsack Problems
b. Traveling Salesman Problems
c. Hamiltonian Circuits Problem
4. Sets Representation
a. Disjoint Sets
b. Union of Sets
5. Probabilistic Algorithms
a. Parallel Algorithms
7. Advanced Sorting
a. Shell sort
b. Quick sort
c. Heap Sort
d. Merge sort
6. Advanced Searching
a. Hashing Algorithms