Advance Algorithms and Computational Techniques
| Hours: 3 0 3 |
|---|
“Probability and random variables, Complexity analysis of algorithms, NP hard and NP complete problems, approximate solutions, Various shapes of hashing, Graph Algorithms, Dynamic Programming, Randomized algorithms, Randomized online algorithms, adversaries. k-server, Linear Programming, Advance graph algorithms –I & II, Probabilistic algorithms e.g. Monte Carlo algorithms, Markov Chain models, Bayesian algorithms, Efficiency issues in algorithms, Streaming algorithms, Advanced topics in Algorithms
”
Pre-requisites: None
| Co-requisites: None
|
|---|
Hours: XYZ where X = Lecture, Y = Lab, Z = Credit
All hours are per week.
3 Lab hours constitute 1 credit hour
1 credit hour implies 1 lecture of 50mins per academic week. 16 weeks in total.
Pre-Requisite courses are courses required to be completed before this course may be taken
Co-Requisite courses are courses required to be taken along with this course
