|
Linked List
|
|
|
|
1. Introduction to Data Structures
|
|
|
|
2 Introduction to Linked list
|
|
|
|
3 Printing and Finding Length of Linked List
|
|
|
|
Lecture 1 Annotated notes
|
|
|
|
4. Insertions in linked list
|
|
|
|
5.Deletion in Linked list
|
|
|
|
OPTIONAL : Linked list C code
|
|
|
|
linkedList
|
|
|
|
Lecture 2 Annotated Notes
|
|
|
|
6. Circular Linked List
|
|
|
|
7. Doubly Linked List
|
|
|
|
Lecture 3 Annotated Notes
|
|
|
Asymptotic Analysis
|
|
|
|
Introduction to Asymptotic Analysis
|
|
|
|
Big oh and Big omega Asymptotic Notations
|
|
|
|
Theta Asymptotic notation
|
|
|
|
Lecture 4 Annotated notes
|
|
|
|
What is Asymptotic comparison | how LOG works | rice grain story
|
|
|
|
Comparing Different Functions Asymptotically
|
|
|
|
Lecture 5 Annotated Notes
|
|
|
|
Little Oh Little Omega | Properties of asymptotic notation | Stirling approximation
|
|
|
|
Formal set notation of Asymptote symbols
|
|
|
|
Asymptotic Notations GATE PYQs 1994, 96, 2000,1,3,4,8,11,17
|
|
|
|
Analysing the loops time complexity
|
|
|
|
Time Complexity of loops -2
|
|
|
|
Lecture 6 Annotated Notes
|
|
|
|
Lecture 6 Annotated Notes
|
|
|
Stack and Queue
|
|
|
|
Introduction to Stack and Stack Permutations
|
|
|
|
Implementation of Stack using Array and Linked list
|
|
|
|
Lecture 7 Annotated Notes
|
|
|
|
Introduction to Queue
|
|
|
|
Implementation of Queue
|
|
|
|
Lecture 8 Annotated notes
|
|
|
|
Queue another Implementation using Array with F=R=0
|
|
|
|
Implementing Queue using Linked List
|
|
|
|
Lecture 9 - Annotated Slides
|
|
|
|
Queue using two stacks
|
|
|
|
Stack using two queues
|
|
|
|
Balancing parentheses and Two Stacks in one array
|
|
|
|
Infix, Prefix & Postfix and Conversion to each other
|
|
|
|
Infix to Postfix using Stack and Postfix evaluation using Stack
|
|
|
|
Lecture 10 Annotated Notes
|
|
|
Binary Trees
|
|
|
|
Introduction to Binary trees
|
|
|
|
Some questions and represetation of tree
|
|
|
|
Questions on Binary trees
|
|
|
|
Lecture 11 Annotated Notes
|
|
|
|
Questions on Binary trees 2
|
|
|
|
Binary Tree Traversals
|
|
|
|
Binary tree construction using preorder postorder and inorder
|
|
|
|
Binary tree construction using preorder postorder and inorder 2
|
|
|
|
Lecture 12 Annotated Notes
|
|
|
|
Introduction to Binary Search Tree
|
|
|
|
Range Search in Binary Search Tree
|
|
|
|
BST Deletion
|
|
|
|
GATE 1996 Possible probe sequences
|
|
|
|
BST PYQs 1997, 2001, 06, 07, 16
|
|
|
|
BST Time Complexities
|
|
|
|
Lecture 13 Annotated Notes
|
|
|
AVL Trees
|
|
|
|
Motivation to AVL trees
|
|
|
|
Insertion in AVL trees
|
|
|
|
AVL Insert -2 and Optional Rotation Codes
|
|
|
|
Deletion in AVL- 1
|
|
|
|
Deletion in AVL- 2
|
|
|
|
Minimum and Maximum number of nodes in AVL tree
|
|
|
|
Question on AVL tree and Outro to AVL trees
|
|
|
|
AVL Tree Annotated Notes
|
|
|
Heap
|
|
|
|
Introduction to Heaps
|
|
|
|
Kth Minimum in min heap
|
|
|
|
Insertion in Heap and Top Down build heap
|
|
|
|
Heapify Method
|
|
|
|
Build Heap Procedure
|
|
|
|
Build Heap (Bottom-up) time complexity
|
|
|
|
Delete Min in min Heap
|
|
|
|
Number of Min Heaps
|
|
|
|
Number of Binary tees
|
|
|
|
[Optional] Average Time complexity in heap insertion
|
|
|
|
Heap Time Complexities
|
|
|
|
Heap Sort
|
|
|
|
Heap Part1
|
|
|
|
Heap vs BST | Merging two heaps
|
|
|
|
Priority Queues
|
|
|
|
Heap Part 2
|
|
|
Hashing
|
|
|
|
Motivation to hashing and Direct address table
|
|
|
|
Introduction to hashing
|
|
|
|
Collision resolution techniques
|
|
|
|
Avg case performance chaining
|
|
|
|
Linear Probing
|
|
|
|
Quardatic probing and Double hashing
|
|
|
|
Possible Number of probes
|
|
|
|
Optional UnSucessfull search time open addressing
|
|
|
|
Optional Sucessful search time open addressing
|
|
|
|
Hashing
|
|
|
|
Probability Background (video from Probability course)
|
|
|
|
Three popular expectation questions in hashing
|
|
|
Arrays
|
|
|
|
Row major and Column major 2D Arrays
|
|
|
|
ND Arrays
|
|
|
|
Examples and GATE PYQs 1998, 94
|
|
|
Practice Sets
|
|
|
|
Linked list
|
|
|
Doubt Classes
|
|
|
|
Linked List and Asymptotic notations
|
|
|
|
Data Structures: Standard Questions Session 1 - Linked List
|
|
|
|
Notes - Data Structures: Standard Questions Session 1 - Linked List
|
|
|
|
Data Structures: Standard Questions Session 2 - Linked List Recursion
|
|
|
|
Notes - Data Structures- Standard Questions Session 2- Linked List
|
|
|
|
Stacks and Queues Standard Questions Part 1 | GATE 2023 | GO classes | By Sachin Mittal sir
|
|
|
|
Stack and Queue Standard Session 1
|
|
|
Quizzes Links
|
|
|
|
GO Classes Weekly Quiz 9 | Data Structures | Linked List
|
|
|
|
GO Classes Weekly Quiz 11 | Data Structures | Asymptotic Notation and Loop Time Complexity
|
|
|
|
GO Classes Weekly Quiz 14 | Data Structures | Stack, Queue, Linked List
|
|
|
Weekly Quiz PDFs
|
|
|
|
GO Classes Weekly Quiz 9 Data Structures Linked List
|
|
|
|
GO Classes Weekly Quiz 11 Data Structures Asymptotic Notation and Loop Time Complexity
|
|
|
|
GO Classes Weekly Quiz 14 | Data Structures | Stack, Queue, Linked List
|
|
Launch your Graphy