This course will cover basic concepts in the design and analysis of algorithms.Asymptotic complexity, O() notationSorting and searchAlgorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees
Design techniques: divide and conquer, greedy, dynamic programming
Data structures: heaps, union of disjoint sets, search treesIntractability
INTENDED AUDIENCE: Students in BE/BTech Computer Science, 2nd/3rd year.
PRE-REQUISITES: Exposure to introductory courses on programming and data structures.
INDUSTRY SUPPORT: This course should be of value to any company working in the area of software services and products.
Start your review of Design and analysis of algorithms
O170172 RAZOLU VENKATA SATYA SAI
I really want to appreciate and thank you for being such a wonderful teacher....the way you were interacting with students, way of teaching, making learning so interesting and explaining everything was outstanding..... I wanted to thank you for being such an amazing person/ teacher.