Preview Data Structure Lecture + Notes + Certificate

Back

Introduction

1.1: Introduction to Data Structure | Basic Terminology of DS | Elementary Data Organization

1.2: Classification of Data Structure | Linear and Non-Linear | Primitive vs Non-Primitive DS

1.3: Operations on Data Structures | Abstract data type (ADT) | Built in Data Types in C

1.4: Time Space trade off with Example in Data Structure | Space Time Trade Off

1.5: Design And Analysis of Algorithms| Introduction to DAA | What is Algorithm| Characteristic

1.6: Analyzing Algorithms| Analysis of Algorithms| Time and Space |Worst, Best & Average case

1.7: Complexity of Algorithm | Time Complexity| Rules for calculating time complexity with example

1.8: Complexity of Algorithm | Time Complexity Examples | Rules for calculating time complexity

1.9: Complexity of Algorithm | Space Complexity analysis | Tules for Space complexity

1.10: Growth of Function in Algorithm| Asymptotic Notations|Big O Omega and Theta notation examples

Arrays

2.1: Arrays Definition, Single and Multidimensional Arrays in Data Structure

2.2: Address Calculation in One Dimension Array|Single Dimensional (1 D) Array Memory Calculation

2.3: Two Dimensional Array in Data Structure | Memory Representation of 2D Array

2.4: Row Major and Column Major Representation of Two Dimensional Array|Calculate Address 2D Array

2.5: How to Calculate Row Major and Column Major Address in Two Dimentional Array 2D Array

2.6: Three Dimensional Array in Data Structure | Memory Representation of 3D Array

2.7: Row Major & Column Major formula for 3d Array | How to Find Address of an Element in 3d Array

2.8: how to calculate address in three dimensional array | Row and Column Mejor Solved Example

2.9: Multidimensional Array Representation in Memory | n dimensional array in data structure

2.10: Applications of Array in data structure| Sparse matrix and its representation

2.11: What is Sparse Matrix | Sparse matrices array and linked list representations

2.12: Operations on Linear Array in Data Structure | Travarsal an array | Traversing Linear Array

2.13: Insertion Operations on Linear Array in Data Structure | Inserting Element in the Array

2.14: Deletion Operations on Linear Array in Data Structure | Deletion Element in the Array

Linked lists

3.1: Linked list in Data Structure | Introduction to Linked List | Memory Representation

3.2: Pointer Implementation of Singly Linked Lists | Linked list program in C

3.3: Difference between Linked List and Arrays | Arrays Vs Linked Lists | Data Structures

3.4: Types of Linked List - Singly Linked, Doubly Linked , Circular Linked List | Data Structure

3.5: Linked List Operations:Traverse,Insert, Delete|How to Traverse a Linked List|Data Structure

3.6: Inserting a New Node in a Linked List | C Program to Insertion Element in Linked List

3.7: Delete Node From Singly Linked List | Deletion from Linked List in Data Structure

3.8: Doubly Linked List |Travarsal ,Insertion and Deletion in doubly Linked List|Data Structure

3.9: Circular Linked List Operations | Insertion, Deletion, and Traversal of the Circular List

3.10: Polynomial Representation using Linked List | Polynomial Addition Using Linked List

3.11: Generalized linked lists | What is the generalized list in a data structure |Representation

3.12: Multivariable Polynomial Representation Using Generalized Linked List

Stacks

4.1: Stack in Data Structure | LIFO Principle of Stack| Applications of Stack | Feature of Stack

4.2: Array Implementation of Stack in C | Stack Representation Using Array | PUSH POP Operation

4.3: Linked List Implementation of Stack in C | Stack representation using linked list

4.4: Arithmetic Expression | Polish Notation | infix prefix and postfix expression|Data structure

4.5: Infix to Postfix Expression Using Stack Algorithm| infix to postfix using stack | Example

4.6: Infix to Postfix using Stack | Infix to Postfix Solved Examples | Data Structure

4.7: Infix to Prefix Conversion using Stack | Stack Application in Data Structure |Solved example

4.8: Postfix to Infix using Stack | Postfix to Prefix Conversion using Stack | Data Structure

4.9: Prefix to Infix Conversion Using Stack | prefix to postfix using stack | Data Structure

4.10:Evaluation of Postfix Expression using Stack in Data Structure with Example|Postfix Evaluaton

4.11:Types of Recursion Function | Tail Recursion | Non Tail Recursion Stack | Data Structure

4.12: Recursion Implementation using Stack in Data Structure | Direct and Indirect recursion

4.13: Recursive Algorithm for Factorial | Stack Implementation of Factorial | Data Structure

4.14: Fibonacci Series Using Stack | Recursion Fibonacci Explained With Example | Data Structure

4.15: Tower of Hanoi Algorithm | Tower of Hanoi Using Stack in Data Structure |TOH Using Recursion

Queues

5.1: Introduction to Queues | What is Queue | Features of Queue | Applications of Queue

5.2: Implementation of Queue Data Structure | Array Representation | Insertion and Deletion Algo

5.3: Linked List Representation of Queue |Queue Implementation Using Linked List | Data structure

5.4: Types of Queues in DS | Simple Queue | Circular Queue Insertion and Deletion Algorithm

5.5: Priority Queue in Data Structure | Priority Queue using Linked List and Array Representation

5.6: Double Ended Queue (Deque) | Deque Insertion and Deletion Algorithm | Data Structure

Searching

6.1: Linear Search Algorithms in Data Structures With Example | Linear Search in C

6.2: Binary Search Algorithm | Binary Search C Program | Time Complexity | Data Structure

Sorting

7.1: Bubble Sort Algorithm in Data Structure | Bubble Sorting Analysis Complexity

7.2: Sorting Algorithms | Bubble Sort, Concept, Algorithm, Examples, Time And Space Complexity

7.3: Sorting Algorithms | Selection Sort,Concept, Algorithm, Examples, Time And Space Complexity

7.4: Sorting Algorithms | Insertion sort ,Concept, Algorithm, Examples, Time And Space Complexity

7.5: Sorting Algorithms | Shell sort ,Concept, Algorithm, Examples, Time And Space Complexity

7.6: Sorting Algorithms | Quick Sort algo, Concept, Algorithm, Examples, Time And Space Complexity

7.7: Sorting Algorithms | Merge Sort Algorithm, Concept, Examples, Time And Space Complexity

7.8: Sorting Algorithms | Heap Sort Algorithm | Complete Binary Tree| Max Heap | Min Heap in hindi

7.9:Sorting Algorithms| Heap Sort Algorithm| Build Max Heap| Max Heapify Algorithm solved example

7.10: Sorting in Linear Time| Counting Sort Algorithm, Examples TIme And Space complexity

Graphs

8.1: Graph in Data Structure | Introduction to Graphs | Graph Terminology , Degree, Path etc.

8.2: Types of Graph in Data Structure | Complete Graph, Finite and Infinite Gaph etc

8.3: Graph Representation in Data Structure | Sequential Representation of Graph

8.4: Linked Representation of Graph in Data Structure | Adjacency List Representation

8.5: Graph Traversing in Data Structure | Depth First Search | Breadth First Search | DFS and BFS

8.6: Depth First Search | Breadth First Search | DFS and BFS Solved Example

8.7: Minimum Spanning Tree Algorithm | Sapnning Tree | Properties of Spanning Tree

8.8:Minimum Spanning Tree Kruskal Algorithm | Kruskal's Algorithm Step by Step Explanation

8.9: Minimum Spanning Tree Prim's Algorithm Pseudocod|Prims Algorithm Step by Step Solved

8.10: Single Source Shortest Path Algorithm Using Greedy Method | Step by Step Solved Examples

8.11: Dijkstra Algorithm - Single Source Shortest Path - Greedy Method | Dijkstra algo Example

8.12: Bellman Ford Algorithm Step by Step|Bellman Ford Algorithm using Dynamic Programming technique

8.13: All Pair Shortest Path Floyd Warshall Algorithm Dynamic Programming

Trees

9.1: Tree in Data Structure | Tree Properties | Basic Terminology of Tree in Hindi

9.2: Binary Tree in Data Structure | Types of Binary Tree | Strictly Binary Tree

9.3: Complete Binary Tree in Data Structure with Example | Perfect Binary Tree

9.4: Balanced Binary Tree | ExtendedBinaryTree in Data Structure | 2 Tree

9.5: Representation of Binary Tree in Memory | Linked Representation Using Linked List

9.6: Sequential Representation of Binary Tree | Binary Tree Representation Using Array

9.7: Traversing of Binary Tree in Data Structure | Inorder, Preorder and Postorder | Recursion

9.8: Preorder Tree Traversal Using Stack| Preorder BinaryTree Traversal without Recursion

9.9: Inorder Tree Traversal Using Stack| Inorder BinaryTree Traversal without Recursion

9.10: PostorderTree Traversal Using Stack| Postorder BinaryTree Traversal without Recursion

9.11: Constructing Binary Tree from given Tree Traversal | Binary Tree from Preorder and Inorder

9.12: Constructing Binary Tree from given Tree Postorder and Inorder Traversal

9.13: Constructing Binary Tree from given Tree Preorder and Postorder Traversal

9.14: Binary Search Tree (BST) | Introduction | Advantages and disadvantages of BST

9.15: Binary Search Tree Operations| Data Structure | Insertion and Deletion in Binary Search Tree

9.16: Binary Search Tree Deletion in data Structure | Binary Search Tree Deletion of a Node

9.17: AVL Trees in Data Structures| AVL Rotation | Left- Left | Right- Right | Left- Right

9.18: AVL Tree Insertion Example Step by Step | AVL Tree Rotation

9.19: AVL Tree Insertion Example-2 Step by Step | AVL Tree Rotation

9.20: AVL Tree Deletion | Deleton in AVL Tree | R0 Rotation | R1 Rotation | R-1 Rotation

9.21: AVL Tree Deletion Example Step by Step | Solved Example of AVL Tree Deletion

9.22: Threaded Binary Tree | Threaded Binary Trees in Data Structure | Solved Example

9.23: B-Tree Definition| B Tree Properties | B Tree Explained In Hindi

9.24: B Tree Operations | B- Tree Search Algorithm | B Tree Seaching Examples

9.25: Creating an empty B-tree| Splitting a node in a B-tree|Inserting a key into a B-tree in hindi

9.26: B Tree insertion Solved example| B Tree Insertion Important Question

9.27: Delete Operation in B-Tree| B Tree Deletion Algorithm | B Tree Deletion process

9.28: Delete Operation in B-Tree| B Tree Deletion Solved Examples

9.29: Huffman Coding Algorithm| Huffman Coding Example Problems in Hindi

Complete Notes (PDF)

DSUC_Notes

DSUC Question Bank

DSCUC C Program

DSUC Quiz for Certification

Preview - Data Structure Lecture + Notes + Certificate