# ALGORITHMS CHECKLIST:-

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
posted Jun 23, 2018
0
Like
0
Love
0
Haha
0
Wow
0
Angry
0

Dynamic programming:

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

Greedy method:

8,9 are not in syllabus.
Who said these are/are not in syllabus?
job sequencing problem in greedy method.
@Arjun Sir, some people are crazy here. Saying that Longest Common Subsequence is not in syllabus, is shocking.
@Mukesh Chaudhary Please verify the syllabus before commenting.
@Balaji Jegan Have you counted all the sorting and searching algorithms? For eg., heap sort, quick sort, merge sort, binary search etc.?
Suggestion...please read the theory and do the programming in some IDE yourself....you will get the pattern and thinking pattern...there is no particular syllabus type algorithms...Try geeksforgeeks website for related problems...

Most likely questions in gate might be some arbitary problem given and you might have to guess an algorithm with lowest time complexity...
Dynamic Programming:-

In syllabus
1. Matrix Chain Multiplication
2. LCS
3. Subset Sum
4. 0/1 Knapsack

Below ARE LESS IMP
5. Floyd Warshall
6. OBST

Greedy Method:-

in syllabus
1. Prim's
2. Kruskal's
3. Djikstra
4. Bellman Ford
5. Huffman Coding
6. BFS
7. Fractional Knapsack
8. Topological Sort
9. Strongly Connected Component (in graphs)

Backtracking:-

in syllabus
1. DFS

Branch and Bound:-

Not in the syllabus (no questions yet)
1. Travelling Salesman

Note: If anybody can tell about TSP that we should do it or not it would be better.