Starting a new Lecture Notes Series on Data Structures
Click Here!
Youtube Lecture Playlist Credits:
Channel Name: Tutorials Point (India) Ltd.
So Let Us Start to This Journey of Learning
Data Structures By Lecture Notes together!
Click Here!
Lecture 1: Data Structure - Getting Started
Lecture 2: Definition Of Data Structure
Lecture 3: Classification Of Data Structure
Lecture 4: What Is An Algorithm?
Lecture 5: Space and Time Complexity of an Algorithm
Lecture 6: Time Complexity Big-Oh Notation
Lecture 7: Time Complexity Big-Omega Notation
Lecture 8: Time Complexity Big-Theta Notation
Lecture 9: Asymptotic Notations GATE Exercise 1
Lecture 10: Asymptotic Notations GATE Exercise 2
Lecture 11: Time Complexity GATE Exercise
Lecture 12: Algorithm Classification Introduction
Lecture 14: Algorithm Classification Back Tracking Algorithm
Lecture 15: Algorithm Classification Divide And Conquer
Lecture 16: Algorithm Classification Dynamic Programming
Lecture 17: Algorithm Classification Greedy Algorithm
Lecture 18: Algorithm Classification Branch And Bound
Lecture 19: Algorithm Classification Brute Force
Lecture 20: Algorithm Classification Randomized Algorithm
Lecture 21: String Introduction
Lecture 22: String Operations
Lecture 23: String Processing Insert
Lecture 24: String Processing Delete
Lecture 25: String Processing Replace
Lecture 26: Pattern Matching Algorithm - Brute Force
Lecture 28: Example On KMP Pattern Matching Algorithm
Lecture 29: Definition Of Linear Array Data Structure
Lecture 30: Insert Operation On An Array
Lecture 31: Delete Operation On An Array
Lecture 32: Memory Representation Of One Dimensional Array
Lecture 35: Saddle Point Of A Matrix
Lecture 36: Saddle Point Implementation Algorithm
Lecture 37: Lower Triangular Sparse Matrix
Lecture 38: Tridiagonal Sparse Matrix
Lecture 39: Tridiagonal Sparse Matrix
Lecture 40: Array GATE Exercise
Lecture 41: Definition Of Recursion
Lecture 42: Recursion Variations Direct
Lecture 43: Recursion Variations Indirect
Lecture 44: Recursion Variations Nested
Lecture 45: Recursion Variations Excessive
Lecture 46: Recursion Variations Tail
Lecture 47: Recursion Overheads
Lecture 48: Towers of Hanoi as an Example of Recursion
Lecture 49: Recursion GATE Exercise 1
Lecture 50: Recursion GATE Exercise 2
Lecture 51: Linked List Introduction
Lecture 52: Linked List Traversing And Processing
Lecture 54: Linked List Searching On Unsorted Linked List
Lecture 55: Linked List Searching On Sorted Linked List
Lecture 56: Linked List Insert A New Node As The First Node
Lecture 57: Linked List Insert A New Node After Search Node
Lecture 58: Linked List Deletion Of A Node With Given Info
Lecture 59: Header Linked List Introduction
Lecture 60: Header Linked List Insertion As The First Node
Lecture 61: Circular Header Linked List Introduction
Lecture 62: Two Way Linked List Introduction
Lecture 63: Two Way Linked List Insertion
Lecture 64: Two Way Linked List Deletion
Lecture 65: Reverse Of A Linked List
Lecture 66: Polynomial Representation Using A Linked List
Lecture 67: Polynomial Addition Using Linked List Example
Lecture 68: Polynomial Addition Using Linked List Algorithm
Lecture 69: Stack - Introduction
Lecture 70: Stack Operations Introduction
Lecture 71: Stack Operations - PUSH & POP
Lecture 72: Implementing Two Stacks In One Array