Can anyone tell any other algorithm which is there in syllabus apart from those mentioned below. Also, tell if something below is not there in syllabus

Dynamic Programming:-

1. Matrix Chain Multiplication

2. LCS

3. Subset Sum

4. 0/1 Knapsack

5. Floyd Warshall

6. OBST

7. Closest Pair

Greedy Method:-

1. Prim's

2. Kruskal's

3. Djikstra

4. Bellman Ford

5. Huffman Coding

6. BFS

7. Fractional Knapsack

8. Topological Sort

9. Stongly Connected Component

Backtracking:-

1. DFS

Branch and Bound:-

1. Travelling Salesman

1,2,6,7 are not in syllabus.

Greedy method:

8,9 are not in syllabus.