CS60007: Algorithm Design And Analysis

From Metakgp Wiki
Jump to navigation Jump to search
CS60007
Course name ALGORITHM DESIGN AND ANALYSIS
Offered by Computer Science & Engineering
Credits 4
L-T-P 4-0-0
Previous Year Grade Distribution
2
2
1
1




EX A B C D P F
Semester {{{semester}}}


Syllabus

Syllabus mentioned in ERP

Algorithmic paradigms: Dynamic Programming, Greedy, Branch-and-bound; Asymptotic complexity, Amortized analysis; Graph Algorithms: Shortest paths, Flow networks; NP-completeness; Approximation algorithms; Randomized algorithms; Linear programming; Special topics: Geometric algorithms (range searching, convex hulls, segment intersections, closest pairs), Numerical algorithms (integer, matrix and polynomial multiplication, FFT, extended Euclids algorithm, modular exponentiation, primality testing, cryptographic computations), Internet algorithms (text pattern matching, tries, information retrieval, data compression, Web caching).


Concepts taught in class

Student Opinion

How to Crack the Paper

Classroom resources

Additional Resources

Time Table

Day 8:00-8:55 am 9:00-9:55 am 10:00-10:55 am 11:00-11:55 am 12:00-12:55 pm 2:00-2:55 pm 3:00-3:55 pm 4:00-4:55 pm 5:00-5:55 pm
Monday NC332
Tuesday NC332 NC332
Wednesday
Thursday NC332
Friday