Data Structure (Hindi) (Part 1)

   Sunday, May 05, 2024   

Starting a new Lecture Notes Series on Data Structure

Youtube Lecture Playlist Credits 

Channel Name: THE GATEHUB

So Let Us Start to This Journey of Learning 

Data Structure By Lecture Notes together!

Lecture 1: Introduction to Data Structures || Data Structure

Lecture 2: Arrays in Data Structure || Memory Representation || Data Structure

Lecture 3: One Dimensional Array || 1-D Array || Data Structure

Lecture 4: One Dimensional Array Solved Questions | Address Calculation in 1-D Array | Data Structure

Lecture 5: Two Dimensional Array || 2d Array || Data Structure

Lecture 6: Two Dimensional Array Solved Example | Address Calculation in 2-D Array | Data Structure

Lecture 7: Three Dimensional Array Representation (3D) | Row Major Order | Column Major Order | Data Structure

Lecture 8: Pointers and Arrays | Pointers to One Dimensional Array | GATECSE | Data Structure

Lecture 9: Pointers to One Dimensional Array GATE Solved Examples | Data Structure

Lecture 10: Three Dimensional Array Representation (3D) | Row Major Order | Column Major Order | Data Structure

Lecture 11: Pointers and Arrays | Pointers to One Dimensional Array | GATECSE | Data Structure

Lecture 12: Pointers to One Dimensional Array GATE Solved Examples | Data Structure

Lecture 13: Array Operations - Deletion | full explanation with Code | Data Structure

Lecture 14: Sparse Matrix | Sparse matrices array and linked list representations | Data Structure

Lecture 15: Linear Search Algorithm with Code & Complexity (Iterative & Recursive) | GATECSE | Data Structure

Lecture 16: Binary Search Algorithm with Code & Complexity (Iterative Method) | GATECSE | Data Structure

Lecture 17: Bubble Sort Algorithm with Code and Time Complexity | Sorting Techniques | GATECSE | Data Structure

Lecture 18: Insertion Sort Algorithm with Code and Time Complexity | Sorting Algorithm | Data Structure

Lecture 19: GATE-2003 Insertion Sort Solved Example | GATECSE | Data Structure

Lecture 20: Selection Sort Algorithm (Part 1) Complexity and Code | Sorting Technique | GATECSE| Data Structure

Lecture 21: Selection Sort Algorithm (Part 2) Complexity and Code | Sorting Technique | GATECSE| Data Structure

Lecture 22: Introduction to Linked List | Advantage and Disadvantage | Need of Linked list | Data Structure

Lecture 23: Linked List Implementation | Creation and Display | GATECSE | Data Structure

Lecture 24: Traversing a Single Linked List | Iterative Method | Printing the elements | GATECSE |Data Structure

Lecture 25: Insertion of a Node in a Linked List(at beginning, end, specified position)| GATECSE| Data Structure

Lecture 26: Deletion of a Node in a Linked List(at beginning, end, specified position)with code| Data Structure

Lecture 27: Find length of singly linked list | Count no of nodes in Single linked list | Data Structure

Lecture 28: Searching a Node in Singly Linked List | Time complexity analysis | Data Structure

Lecture 29: Reverse a Singly Linked list | Iterative Method | Full Code| Data Structure

Lecture 30: Singly Linked List Solved Example | Linked List | Data Structure

Lecture 31: Searching a Node in Singly Linked List | Time complexity analysis | Data Structure

Lecture 32: Reverse a Singly Linked list | Iterative Method | Full Code| Data Structure

Lecture 33: Singly Linked List Solved Example | Linked List | Data Structure

Lecture 34: Singly Linked List Solved Example | Linked List | Data Structure

Lecture 35: Introduction to Circular Linked List | Data Structure

Lecture 36: Circular Linked List Implementation (Creation and Display) | Data Structure

Lecture 37: Circular Linked list (Insertion at Beginning, Ending, Specified Position) | Data Structure

Lecture 38: Circular linked list - deletion (from beginning, end, given position) with code | Data Structures

Lecture 39: Introduction to Doubly Linked List (Creation And Display) | Data structures

Lecture 40: Insertion in Doubly Linked List(beginning, end, specific position) | Data Structures

Lecture 41: Deletion from doubly linked list (from beginning,end,specific position) | Data Structures

Lecture 42: Doubly Circular Linked List | Creation and Display | Data Structures

Lecture 43: Doubly Circular Linked List Insertion (Begin, end and Specified Position) | Data Structure

Lecture 44: Doubly Circular Linked List Deletion (Begin, end and Specified Position) | Data Structure

Lecture 45: Introduction to Stack | Application of Stack | Data Structure

Lecture 46: Stack Implementation using Array | Data Structure

Lecture 47: Stack implementation using linked list | Data Structures

Lecture 48: Infix Prefix and Postfix expressions | Data structures