arrow_back
Study Material
INDEX
DS Notes
Data Structures with C Material
Data Structures with C Video Sessions
Session - 1 Introduction to Data Structure,Arithmetic Operator and Relational Operator
Session - 2 Logical Operator,Assignment Operator,Increment,Conditional and Comma Operator
Session - 3 Address of Operator, Value At Address Operator, sizeof Operator
Session - 04 Operator Precedence and Associativity and if-else
Session - 5 if-else and switch case, menu driven programming
Session - 6 Different types of loops
Session - 7 Functions
Session - 8 Call By Value and Introduction to Pointer
Session - 9 Call by Address
Session - 10 Recursion in Depth
Session - 11 Tower of Hanoi
Session - 12 Tail Recursion and Tree Recursion
Session - 13 Dereferencing Pointer and Type Conversions, Void Pointer
Session - 14 Dynamic Memory Allocation
Session - 15 Dangling Pointer,Introduction on Structure, diff between dot and arrow operator
Session - 16 Linked List Introduction and Single Linked List Insert At End and Display Function
Session - 17 SLL Insert at end and Insert at Any Function
Session - 18 Delete from begin,end and at any position from a Single Linked List
Session - 19 Counting no of nodes and Reverse of Single Linked List
Session - 20 Sort on Single Linked List
Session - 21 Merging two Linked List
Session - 22 Polynomial Representation by Single Linked List
Session - 23 Polynomial Addition by Single Linked List
Session - 24 Finding MAX-Min from SLL and Introduction to Double Linked list,Insertion At begin fucntiuon
Session - 25 Double Linked List Insertion at End and Insertion at any position
Session - 26 DLL deletion from begin, end and from any position
Session - 27 Circular Linked List Insert at begin and Insert at end
Session - 28 Circular Linked List Insert at any and Delete from begin
Session - 29 CLL deletion from end and deletion from any position
Session - 30 Josephus Problem
Session - 31 Introduction to Stack and Stack Operations(push,pop,display)
Session - 32 Stack implemented using Linked List and Stack Application reversal of a string
Session - 33 Stack Applications(String Reversal using pointer and Decimal to Binary)
Session - 34 Introduction to Arithmetic Expression,Algorithm,Infix,Prefix and Postfix Notation
Session - 35 Infix to Postfix Using Stack
Session - 36 Infix to Postfix Program Using C
Session - 37 Evaluation on Postfix Using Stack and Code Using C
Session - 38 Infix to Prefix Conversion and Evaluation of Prefix Using Stack
Session - 39 Infix to Prefix Conversion and Prefix Evaluation Code Using C
Session - 40 Checking Validity of an Expression having balanced parenthesis using Stack
Session - 41 All possible Conversion and Queue Introduction
Session - 42 Queue Opertaions(Insertion,Deletion and Display)
Session - 43 Circular Queue and its operations
Session - 44 Deque and its operations
Session - 45 Priority Queue
Session - 46 Tree Introduction,Basic Terminology and Traversals
Session - 47 Tree Construction from difeerent traversals and Binary Search Tree Introduction
Session - 48 Different ways of Implementation of Tree
Session - 49 Binary Search Tree Creatioin Coding Using C
Session - 50 Recursive Traversal of BST Algorithm and C implementation
Session - 51 Searching a node in a BST and Recursive BST Creation
Session - 52 Recursive BST Creation in depth
Session - 53 Recursive searching in BST and Non-Recursive Preorder Traversal
Session - 54 Non-Recursive Inorder Traversal
Session - 55 Non-Recursive Postorder Traversal
Session - 56 Code Implementation of Non-Recursive Post Order Traversal
Session - 57 Binary Search Tree Deletion with Case#1 and Case#2
Session - 58 Binary Search Tree Deletion with Case#3
Session - 59 BST Limitation and Introduction of AVL tree
Session - 60 AVL Tree all rotations with example
Session - 61 AVL Tree Example Contnd..
Session - 62 Deletion from AVL tree
Session - 63 B-tree Introduction and Insertion
Session - 64 B-Tree Insertion Example Contnd..
Session - 65 AVL Tree Insertion Example
Session - 66 B-Tree Deletion
Session - 67 B-Tree Deletion contnd..and Expression Tree
Session- 68 enum in C
Session - 69 Threaded Binary Tree
Session- 70 Inorder traversal of Threaded Binary Tree
Session - 71 Preorder traversal of Threaded Binary Tree
Session - 72 Algorithm Analysis
Session - 73 Discussion on Big Oh Big Theta and Big Omega
Session - 74 Mathematical problems on Big Oh,Big Theat and Big Omega
Session - 75 Analysis on loops and Complexity of Modified Bubble Sort Algorithm
Session - 76 Selection Sort and its Time Complexity
Session - 77 Insertion Sort and its Time Complexity
Session - 78 Quick Sort Algorithm
Session - 79 Quick Sort Best and Worst Case Complexity
Session - 80 Quick Sort Average Case Complexity
Session - 81 Merge Sort Algorithm
Session - 82 Merge Sort C implementation and Complexity Analysis
Session - 83 Radix Sort Algorithm and C implementation
Session - 84 Heap Sort Algorithm
Session - 85 Heap Sort C implementation
Session - 86 Graph Introduction and basic terminologies
Session - 87 Different ways of Graph Representations
Session - 88 Breadth First Search Algorithm
Session - 89 Depth First Search Algorithm
Session - 90 Spanning Tree,Minimum Spanning tree and Kruskal_s Algorithm
Session - 91 Prim_s Algorithm
Session - 92 Linear Search and Binary Search
Session - 93 Analysis on Binary Search Complexity and Introduction of Hashing
Session - 94 Different hashing technique and Collison Resolution