Design & Analysis of Algorithms - Vol 1
Engineering · 28 chapters · 347 sections · about 234 hours
Chapters
28 chapters · 347 sections- 1Design and Analysis of Algorithms36 sections
- 2Introduction to Air Travel Problem14 sections
- 3Design and Analysis of Algorithms12 sections
- 4Document Similarity and Its Applications13 sections
- 5Design and Analysis of Algorithms22 sections
- 6Input Size and Running Time9 sections
- 7Design and Analysis of Algorithms19 sections
- 8Design and Analysis of Algorithms21 sections
- 9Arrays and lists3 sections
- 10Searching in an array7 sections
- 11Selection Sort9 sections
- 12Insertion Sort8 sections
- 13Merge Sort14 sections
- 14Merge Sort: Analysis9 sections
- 15Quicksort8 sections
- 16Introduction to Quicksort9 sections
- 17Sorting: Concluding Remarks9 sections
- 18Design and Analysis of Algorithms10 sections
- 19Representing Graphs7 sections
- 20Breadth First Search (BFS)18 sections
- 21Depth First Search (DFS)8 sections
- 22Applications of BFS and DFS16 sections
- 23Directed Acyclic Graphs (DAGs)10 sections
- 24Topological Ordering of Directed Acyclic Graphs (DAG)8 sections
- 25DAGs: Longest Paths12 sections
- 26Shortest Paths in Weighted Graphs13 sections
- 27Mathematical Institute12 sections
- 28Module – 0311 sections
About this course
Design and analysis of algorithms is a field of computer science focused on creating efficient and effective problem-solving procedures (algorithms) and analyzing their performance. It involves understanding how to develop algorithms that are both correct and optimal in terms of time and space complexity