Fundamental Algorithms: Design and Analysis free videos and free material uploaded by Indian Institute of Technology, Kharagpur (IIT Kharagpur). This session contains about Fundamental Algorithms: Design and Analysis Updated syllabus , Lecture notes , videos , MCQ , Privious Question papers and Toppers Training Provided Training of this course. If Material not uploaded check another subject
Divide and Conquer Paradigm.
Solving Recurrences.
Quick Sort.
Heap Sort.
Insertion Sort and Asymptotic Analysis.
Decision Tree.
Linear Time Sorting.
Order Statistics.
Hashing.
Universal Hashing, BST Sort.
Red-Black Tree.
Augmenting Data Structure.
Computational Geometry.
Van Emde Boas Data Structure.
Dynamic Programming.
Graph Algorithm.
BFS and DFS.
Dijkstra.
Bellman Ford.Floyd Marshall.
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.
- 0 Reviews
- 8 Students
- 351 Courses
Write a public review