CS315 - Design and Analysis of Algorithms
Sorry !. CS315 not offered in current semester.
Credits: 2 Credits
Prerequests: (CS 201, CS 202)
Analysis of algorithms: time complexity, big O notation. Sorting algorithms: bubble sort, selection sort, insertion sort, quick sort, heap sort, merge sort and external sorting methods. Hashing: hash functions and collision resolution: separate chaining, linear probing and double hashing. Classification of Algorithms by Implementation and Design Paradigm: Divide & Conquer Algorithms, Dynamic Programming, Greedy Algorithms, Recursive Algorithms, Backtracking, Alfa-Beta pruning, Branch & Bound Search; Graph Algorithms and Network Flows, NP- completeness, Approximation Algorithms
- Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stien (MIT Press, Third Edition)