Filter
1
Day Date Contents Slides Assignments  1  Aug 12 Time complexities with examples - Asymptotic notations - Theta for tight bound,
big-O for upper bound and big-Omega for lower bound. Analogous to =, <= and >=.
o- strictly higher upper bound and small-omega- strictly lower lower bound analogous to > and < respectively.
Definitions to be learned from Cormen.       2  Aug 13 Masters theorem with examples - finding epsilon > 0 for case 1 and case 3, c < 1 for case 3,
Going to substitution for exact solution, brute...
2
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
3

Important Questions

http://gateoverflow.in/questions/algorithms?sort=featured

Sometimes we need to walk through a given algorithm to get the answer. These questions must not be missed as there is very little chance of a mistake.

To see more, click for the full list of questions or popular tags.