Computer Sc - Data Structures and Algorithms (English)

   Saturday, February 08, 2025   

Starting a new Lecture Notes Series on Computer Sc - Data Structures and Algorithms

Youtube Lecture Playlist Credits 

Channel Name: nptelhrd

So Let Us Start to This Journey of Learning 

Computer Sc - Data Structures and Algorithms By Lecture Notes together!

Lecture 1: Lecture - 1 Introduction to Data Structures and Algorithms

Lecture 2: Lecture - 2 Stacks

Lecture 3: Lecture - 3 Queues and Linked Lists

Lecture 4: Lecture - 4 Dictionaries

Lecture 5: Lecture - 5 Hashing

Lecture 6: Lecture - 6 Trees

Lecture 7: Lecture - 7 Tree Walks / Traversals

Lecture 8: Lecture - 8 Ordered Dictionaries

Lecture 9: Lecture - 9 Deletion

Lecture 10: Lecture - 10 Quick Sort

Lecture 11: Lecture - 11 AVL Trees

Lecture 12: Lecture - 12 AVL Trees

Lecture 13: Lecture - 13 Trees

Lecture 14: Lecture - 14 Red Black Trees

Lecture 15: Lecture - 15 Insertion in Red Black Trees

Lecture 16: Lecture - 16 Disk Based Data Structures

Lecture 17: Lecture - 17 Case Study: Searching for Patterns

Lecture 18: Lecture - 18 Tries

Lecture 19: Lecture - 19 Data Compression

Lecture 20: Lecture - 20 Priority Queues

Lecture 21: Lecture - 21 Binary Heaps

Lecture 22: Lecture - 22 Why Sorting

Lecture 23: Lecture - 23 More Sorting

Lecture 24: Lecture - 24 Graphs

Lecture 25: Lecture - 25 Data Structures for Graphs

Lecture 26: Lecture - 26 Two Applications of Breadth First Search

Lecture 27: Lecture - 27 Depth First Search

Lecture 28: Lecture - 28 Applications of DFS

Lecture 29: Lecture - 29 DFS in Directed Graphs

Lecture 30: Lecture - 30 Applications of DFS in Directed Graphs

Lecture 31: Lecture - 31 Minimum Spanning Trees

Lecture 32: Lecture - 32 The Union

Lecture 33: Lecture - 33 Prims Algorithm for Minimum Spanning Trees

Lecture 34: Lecture - 34 Single Source Shortest Paths

Lecture 35: Lecture - 35 Correctness of Dijkstras Algorithm

Lecture 36: Lecture - 36 Single Source Shortest Paths