|
💥 CLICK HERE TO JOIN WHATSAPP GROUP 💥
|
|
|
Chapter1 - Introduction to Data Structures
|
|
|
|
Introduction to Data Strucutres
|
|
|
|
Classification of Data Structures
|
|
|
|
Concept of Abstract Data Type
|
|
|
Chapter2 - Algorithm Analysis
|
|
|
|
Time complexity analysis - How to calculate running time?
|
|
|
|
What is Asymptotic Analysis?
|
|
|
|
Asymptotically Equal Functions
|
|
|
|
Asymptotically Unequal Functions
|
|
|
|
Comparing Functions - Asymptotic Analysis
|
|
|
|
Big O Notation
|
|
|
|
Examples on Big O Notation
|
|
|
|
Big Omega Notation
|
|
|
|
Theta Notation
|
|
|
|
Little Oh and Little Omega
|
|
|
|
Transitivity Property
|
|
|
|
Reflexivity Property
|
|
|
|
Symmetry Property
|
|
|
|
Transpose Symmetry Property
|
|
|
|
Trichotomy Property
|
|
|
|
How To Measure Space Complexity?
|
|
|
Chapter3 - Linked List
|
|
|
|
Introduction to Linked List Data Structure | Why Linked List?
|
|
|
|
Array vs Linked List | Advantages & Disadvantages of Linked List over Arrays
|
|
|
|
Types of Link List
|
|
|
|
Concept of malloc()
|
|
|
|
How to create Singly Linked List
|
|
|
|
Insertion at front of Singly Linked List
|
|
|
|
Insertion at end of Singly Linked List
|
|
|
|
Insertion at middle of Singly Linked List
|
|
|
|
Deletion at front of Singly Linked List
|
|
|
|
Deletion at Middle of Singly Linked List
|
|
|
|
Deletion at end of Singly Linked List
|
|
|
|
Reversing a Linked List
|
|
|
|
Concatenation of two Linked list
|
|
|
|
How to create Doubly Linked List
|
|
|
|
How to insert an element at the start of Doubly Linked List
|
|
|
|
How to insert an element at the middle of Doubly Linked List
|
|
|
|
How to insert an element at the end of Doubly Linked List
|
|
|
|
How to delete starting node in Doubly Linked List
|
|
|
|
How to delete middle node in Doubly Linked List
|
|
|
|
Deleting last node in Doubly Linked List
|
|
|
|
What is Singly Circular Linked List
|
|
|
|
How to create Singly Circular Linked List
|
|
|
|
How to delete a specified node in Singly Circular Linked List
|
|
|
|
How to create Circular Doubly Linked List
|
|
|
|
Polynomial Representation using Linked List
|
|
|
|
Creation and Printing of Polynomial
|
|
|
|
Evaluating a Polynomial
|
|
|
|
Addition of two Polynomial
|
|
|
|
Multiplication of two Polynomial
|
|
|
Chapter4 - Stacks
|
|
|
|
What is Stack and its applications ?
|
|
|
|
Stack Abstract Data Type
|
|
|
|
Implementation of Stack using Array
|
|
|
|
Implementation of Stack using Linked List
|
|
|
|
Reversing String using Stacks
|
|
|
|
What are Infix and Postfix Expression
|
|
|
|
Infix to Postfix Example set 1
|
|
|
|
Infix to Postfix Example set 2
|
|
|
|
Infix to Postfix Example set 3
|
|
|
|
Infix to Postfix Example set 4
|
|
|
|
C Program for Infix to Postfix conversion
|
|
|
|
Evaluation of Postfix Expression using Stack
|
|
|
|
C Program for Postfix Evaluation
|
|
|
|
Check for balanced parentheses using Stack
|
|
|
|
C Program for Parentheses Matching
|
|
|
|
Prefix Conversion
|
|
|
|
Prefix Evaluation
|
|
|
Chapter5 - Queues
|
|
|
|
Introduction to Queue | Why Should we Learn Queue Data Structure ?
|
|
|
|
Queue ADT
|
|
|
|
Queue Implementation
|
|
|
|
Circular Queue
|
|
|
|
Priority Queue
|
|
|
|
Dequeue
|
|
|
|
Round Robin(RR) CPU Scheduling Algorithm | Application of Queue Data Structure
|
|
|
Chapter6 - Trees
|
|
|
|
Introduction to Trees | Why Should We Learn Tree Data Structure ?
|
|
|
|
Basic Terminology in Tree Data Structures
|
|
|
|
Binary Tree Representation
|
|
|
|
Preorder Tree Traversal
|
|
|
|
Inorder Tree Traversal
|
|
|
|
Postorder Tree Traversal
|
|
|
|
Tree Traversal Examples
|
|
|
|
Creation of a Binary Tree
|
|
|
|
C program for Tree Traversal - Preorder, Postorder and Inorder
|
|
|
|
Counting Total Number of Node in Trees
|
|
|
|
Counting number of Leaf Nodes
|
|
|
|
Counting number of nodes with Degree 1
|
|
|
|
Finding Height of a Binary Tree
|
|
|
|
Equivalence of Binary Trees
|
|
|
|
Different types of Binary Trees
|
|
|
|
How to create Binary Tree from Preorder and Inorder Traversal
|
|
|
|
How to create Binary Tree from Postorder and Inorder Traversal
|
|
|
|
BST Introduction
|
|
|
|
BST Creation
|
|
|
|
Operations on BST
|
|
|
|
Inorder Traversal on BST
|
|
|
|
Deleting Nodes in BST
|
|
|
|
AVL Trees : Introduction and Insertion Operation
|
|
|
|
AVL Tree Properties
|
|
|
|
AVL_Trees
|
|
|
Chapter7 - Graphs
|
|
|
|
Graphs Representation and Breadth First Search
|
|
|
|
Breadth First Search and Depth First Search
|
|
|
|
Prims and Kruskal Algorithm
|
|
|
|
Dijkstra's Algorithm
|
|
|
|
Topological Sorting
|
|
|
Chapter8 - Searching and Sorting
|
|
|
|
Searching Techniques - Linear and Binary Search
|
|
|
|
Selection and Insertion sort
|
|
|
|
Quick Sort
|
|
|
|
Time Complexity Analysis Quick Sort
|
|
|
|
Merge sort
|
|
|
|
Radix and Heap Sort
|
|
|
|
Hashing Technique Part 2
|
|
|
|
Hashing Techniques Part 3
|
|
|
|
Sorting Notes
|
|
|
IMPORTANT DISCUSSION
|
|
|
|
TREES IMPORTANT FORMULAE
|
|
|
|
Previous Year Questios
|
|
|
|
Model Paper Set 2
|
|
|
|
Model Paper Set 1
|
|
|
|
PAPER SETS FOR CS
|
|
|
|
DS MODEL PAPER SET 2
|
|
|
|
DS MODEL PAPER SET 1
|
|
|
|
Write a program to implement Singly Linked List
|
|
|
|
Write a C program for polynomial addition using a Linked-list.
|
|
|
|
Write a program to implement Doubly Linked List.
|
|
|
|
Write a program to implement Circular Linked List
|
|
|
|
Write a program in ' C ' to implement Stack using Linked-List
|
|
|
|
Write a C program to implement Double Ended Queue.
|
|
|
|
Write a C program to implement priority queue using linked list
|
|
|
|
Write a C program to implement priority queue using arrays.
|
|
|
|
Write a program in ' C ' to implement QUEUE ADT using Linked-List.
|
|
|
|
Write a program in ' C ' to implement Circular queue using arrays.
|
|
|
|
Write a program in ' C ' to implement Queue using array.
|
|
|
|
Write a program in ' C ' to check for balanced parenthesis in an expression using stack
|
|
|
|
Write a c program to implement stack using array.
|
|
|
|
Write a c program to implement stack using array.
|
|
|
|
Write a program to evaluate postfix expression using stack data structure.
|
|
|
|
Write a C program to convert infix expression to postifix expression
|
|
|
|
Write a program in ' C ' to check for balanced parenthesis in an expression using stack
|
|