COMP 502: Design and Analysis of Algorithm
ITPG 502: Data Structures and Algorithms
CODE: Algorithms.ipynb
Divide and Conquer Techniques
- ✔️ Binary Search
- ✔️ Finding Maximum and Minimum Value
- ✔️ Merge Sort
- ✔️ Quicksort
- Karatsuba Algorithm (Multiplication Algorithm)
- Strassen Algorithm (Matrix Multiplication)
Greedy Methods
- Knapsack Problem (Solving Fractional Knapsack Problem)
- Prim's Algorithm (Minimum Spanning Tree)
- Kruskal's Algorithm (Minimum Spanning)
- Dijkstra's Algorithm (Single Source Shortest Path Problem)
- Huffman Coding
Dynamic Programming
- Solving 0-1 Knapsack Problem
- Introduction to Graph; Representation
- Depth First Search
- Breadth First Search
- Topological Sorting
- Multistage Graph
- Matrix Chain Multiplication
- Subset Sum Problem
- Travelling Salesman Problem
Backtracking
- Solving 8-Queens Problem
- Solving Coloring Problem
- Solving Knapsack Problem
Number Theory
- Greatest Common Divisor
- Chinese Remainder Theorem