Algorithms — GATE Computer Science and Information Technology (CS)
Algorithms for GATE Computer Science and Information Technology (CS): all 10 topics, with study resources and previous year questions for each.
Topics in Algorithms
- Searching (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Sorting (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Hashing (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Asymptotic Worst Case Time and Space Complexity (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Greedy Algorithms (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Dynamic Programming (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Divide and Conquer (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Graph Traversals (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Minimum Spanning Trees (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…
- Shortest Paths (GATE CS) — Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer.…