Algorithms
Searching, sorting, hashing, Asymptotic Worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer. Graph traversals, minimum spanning trees, shortest paths.
Detailed Syllabus covered in Notes
Time and Space Analysis, Sorting Techniques, Greedy Algorithm, Dijkstra Algorithm, Bellman-ford Algorithm, DAG (Directed acyclic Graph), Dynamic Programming, 0-1 Knapsack, subset sum problem, TSP (Travelling Salesman Problem), Floyd Warshal algorithm
Related Links
- Engineering Maths – Click Here
- Digital Logic (PDF Notes) – Click Here
- Programming and DS (PDF Notes) – Click Here
- Computer Organization and Arch. (PDF Notes) – Click Here
- Theory of Computation (PDF Notes) – Click Here
- Compiler Design (PDF Notes) – Click Here
- Operating System (PDF Notes) – Click Here
- DBMS (PDF Notes) – Click Here
- Computer Networks (PDF Notes) – Click Here