Data Structures (English) (Part 1)

   Friday, April 26, 2024   

Starting a new Lecture Notes Series on Data Structures

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

Data Structures By Lecture Notes together!

Lecture 1: Introduction to Data Structures

Lecture 2: Data Types vs. Abstract Data Types

Lecture 3: Data Structure Definition & Advantages

Lecture 4: Types of Data Structures

Lecture 5: Basics of Asymptotic Analysis (Part 1)

Lecture 6: Basics of Asymptotic Analysis (Part 2)

Lecture 7: Basics of Asymptotic Analysis (Part 3)

Lecture 8: Basics of Asymptotic Analysis (Part 4)

Lecture 9: Basics of Asymptotic Analysis (Part 5)

Lecture 10: Guidelines for Asymptotic Analysis (Part 1)

Lecture 11: Guidelines for Asymptotic Analysis (Part 2)

Lecture 12: Asymptotic Analysis (Solved Problem 1)

Lecture 13: Asymptotic Analysis (Solved Problem 2)

Lecture 14: Asymptotic Analysis (Solved Problem 3)

Lecture 15: Understanding the Void Pointers

Lecture 16: Understanding the Null Pointers

Lecture 17: Understanding the Dangling Pointers

Lecture 18: Understanding the Wild Pointers

Lecture 19: Basics of Dynamic Memory Allocation

Lecture 20: Dynamic Memory Allocation using malloc()

Lecture 21: Dynamic Memory Allocation using calloc()

Lecture 22: Dynamic Memory Allocation using realloc()

Lecture 23: Releasing the Dynamically Allocated Memory using free()

Lecture 24: Structures and Functions (Part 1)

Lecture 25: Structures and Functions (Part 2)

Lecture 26: Structures and Functions (Part 3)

Lecture 27: Structures and Functions (Part 4)

Lecture 28: Structures and Functions (Part 5)

Lecture 29: Structures and Functions (Part 6)

Lecture 30: Self Referential Structures

Lecture 31: Introduction to Linked List

Lecture 32: Array vs. Single Linked List (In Terms of Representation)

Lecture 33: Creating the Node of a Single Linked List

Lecture 34: Creating a Single Linked List (Part 1)

Lecture 35: Creating a Single Linked List (Part 2)

Lecture 36: Traversing a Single Linked List (Counting the Nodes)

Lecture 37: Traversing a Single Linked List (Printing the Data)

Lecture 38: Traversing the List (Linked List vs. Arrays)

Lecture 39: Single Linked List (Inserting a Node at the End)

Lecture 40: Insertion at the End (Linked List vs. Array) - Part 1

Lecture 41: Insertion at the End (Linked List vs. Array) - Part 2

Lecture 42: Single Linked List (Inserting a Node at the Beginning)

Lecture 43: Inserting the Data at the Beginning of Single Linked Lists (Possible Mistake)

Lecture 44: Inserting the Data at the Beginning of Single Linked List (2nd Method)

Lecture 45: Inserting the Data at the Beginning (Singly Linked List vs. Array)

Lecture 46: Single Linked List (Inserting a Node at a Certain Position)

Lecture 47: Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 1

Lecture 48: Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 2

Lecture 49: Single Linked List (Deleting the First Node)

Lecture 50: Single Linked List (Deleting the Last Node)

Lecture 51: Single Linked List (Deleting the Last Node using Single Pointer)

Lecture 52: Deletion at the End (Singly Linked List vs. Array)

Lecture 53: Deletion at the Beginning (Single Linked List vs. Array)

Lecture 54: Single Linked List (Deleting the Node at a Particular Position)

Lecture 55: Deleting the Entire Single Linked List

Lecture 56: Reverse a Single Linked List

Lecture 57: Singly Linked List (Solved Problem 1)

Lecture 58: Singly Linked List (Solved Problem 2)

Lecture 59: Singly Linked List (Solved Problem 3)

Lecture 60: Singly Linked List (Solved Problem 4)

Lecture 61: Singly Linked List (Solved Problem 5)

Lecture 62: Singly Linked List (Solved Problem 6)

Lecture 63: Rapid Fire Quiz (Singly Linked List)

Lecture 64: Introduction to Doubly Linked List

Lecture 65: Doubly Linked List (Inserting a Node in an Empty List)

Lecture 66: Doubly Linked List (Insertion at the Beginning)

Lecture 67: Doubly Linked List (Insertion at the End)

Lecture 68: Doubly Linked List (Insertion between the Nodes) - Part 1

Lecture 69: Doubly Linked List (Insertion between the Nodes) - Part 2

Lecture 70: Creating an Entire Doubly Linked List

Lecture 71: Doubly Linked List (Deleting the First Node)

Lecture 72: Doubly Linked List (Deleting the Last Node)