• CS4040/5040

    1. Master Method, Substitution method, Recurrence tree method
    2. Insertion Sort
    3. Maximum Subarray: Divid and Conquer
    4. Merge Sort: Divid and Conquer
    5. Heap representation
    6. Quick Sort
    7. Counting Sort
    8. Radix Sort
    9. Closest Pair problem
    10. MST problem, Greedy method
    11. Shortest Path problem, Dijkstra's algorithm
    12. Fractional Knapsack problem
    13. 0/1 Knapsack problem, Dynamic programming
    14. Matrix Chain Multiplication
    15. Longest Common Subsequence
    16. Coin change problem
    17. All-Pairs Shortest Paths
    18. P VS. NP
    19. Useful materiels

results matching ""

    No results matching ""