-
Algorithm Analysis
14 Lessons-
PreviewData Structures and Algorithms
-
PreviewMeasuring Running time of Algorithms
-
PreviewAsymptotic Analysis
-
PreviewBig O Notation
-
PreviewFinding Big O
-
PreviewTight and Loose Upper Bounds
-
StartIntroduction Quiz A
-
StartBig O analysis of Algorithms
-
StartFinding Time complexity
-
StartBig O analysis of Algorithms: Examples
-
StartWorst case, Best case and Average Case Analysis
-
StartCommon Complexities
-
StartAbstract Data Types
-
StartIntroduction Quiz B
-
-
Linked List
24 Lessons-
StartIntroduction to Linked List
-
StartTraversing and Searching a Linked List
-
StartFinding references in a Single Linked List
-
StartDifference between while p is not None: and while p.link is not None:
-
StartInsertion in a Single Linked List
-
StartInsertion in a Single Linked List...contd
-
StartDeletion in a Single Linked List
-
StartReversing a Single Linked List
-
StartLinked List Quiz A
-
StartSorting a Linked list using Bubble Sort
-
StartMerging of sorted Linked lists
-
StartSorting a Linked list using Merge Sort
-
StartFinding and Removing a cycle in a Linked list
-
StartDoubly Linked List
-
StartInsertion in a doubly linked list
-
StartDeletion from doubly linked list
-
StartReversing a doubly linked list
-
StartCircular linked list
-
StartInsertion in a circular Linked List
-
StartDeletion in a circular linked list
-
StartConcatenation
-
StartLinked List with Header Node
-
StartSorted linked list
-
StartLinked List Quiz B
-
-
Stack and Queue
17 Lessons-
StartIntroduction
-
StartStack
-
StartArray Implementation of Stack
-
StartLinked List Implementation of Stack
-
StartQueue
-
StartArray Implementation of Queue
-
StartLinked List implementation of Queue
-
StartQueue through Circular Linked List
-
StartCircular Queue
-
StartDeque
-
StartPriority Queue
-
StartChecking validity of an expression containing nested parentheses
-
StartEvaluating Arithmetic Expressions
-
StartPolish Notations
-
StartConverting infix expression to postfix expression
-
StartEvaluation of postfix expression
-
StartStack and Queue Quiz
-
-
Binary Tree
18 Lessons-
StartIntroduction to trees
-
StartBinary Tree
-
StartStrictly Binary Tree and Extended Binary Tree
-
StartFull binary tree and Complete Binary Tree
-
StartArray Representation of Binary trees
-
StartLinked Representation of Binary Trees
-
StartBinary Tree Quiz A
-
StartBinary Tree in Python
-
StartTraversal in Binary Tree
-
StartPreorder Traversal
-
StartInorder Traversal
-
StartPostorder Traversal
-
StartLevel order traversal
-
StartFinding height of a Binary tree
-
StartConstructing Binary tree from Traversals
-
StartConstructing binary tree from inorder and preorder traversals
-
StartConstructing binary tree from inorder and postorder traversals
-
StartBinary Tree Quiz B
-
-
Sorting
37 Lessons-
StartIntroduction to Sorting Algorithms
-
StartSort Stability
-
StartSelection Sort
-
StartSelection Sort : Example
-
StartSelection Sort in Python
-
StartAnalysis of Selection Sort
-
StartBubble Sort
-
StartBubble Sort : Example
-
StartBubble Sort in Python
-
StartImprovement in Bubble Sort
-
StartAnalysis of Bubble Sort
-
StartSorting Quiz A
-
StartInsertion Sort
-
StartInsertion Sort : Example
-
StartInsertion Sort in Python
-
StartAnalysis of Insertion sort
-
StartShell Sort
-
StartShell Sort : Example
-
StartShell Sort in Python
-
StartAnalysis of Shell Sort
-
StartMerging two Sorted Arrays
-
StartRecursive Merge Sort
-
StartRecursive Merge Sort in Python
-
StartAnalysis of Merge Sort
-
StartIterative Merge Sort
-
StartIterative Merge Sort in Python
-
StartQuick Sort
-
StartQuick Sort in Python
-
StartAnalysis of Quick Sort
-
StartBinary tree sort
-
StartBinary Tree Sort in Python
-
StartAnalysis of Binary Tree Sort
-
StartHeap Sort
-
StartHeap Sort : Python implementation and Analysis
-
StartRadix Sort
-
StartRadix Sort : Python implementation and Analysis
-
StartSorting Quiz B
-
-
Hashing
12 Lessons-
StartDirect Addressing
-
StartHashing
-
StartCollisions
-
StartHash Functions
-
StartOpen Addressing : Linear Probing
-
StartOpen Addressing : Quadratic Probing
-
StartOpen Addressing : Double Hashing
-
StartDeletion in Open Addressed Tables
-
StartImplementation of Open Addressing
-
StartSeparate Chaining
-
StartImplementation of Separate Chaining
-
StartHashing Quiz
-
-
AVL Tree
14 Lessons-
StartIntroduction
-
StartRotations
-
StartInsertion in AVL tree - 1
-
StartInsertion in AVL tree - 2
-
StartInsertion in AVL tree - 3
-
StartInsertion in AVL tree - 4
-
StartAVL Tree insertion cases
-
StartExamples of insertion in AVL Tree
-
StartDeletion in AVL Tree - 1
-
StartDeletion in AVL Tree - 2
-
StartDeletion in AVL Tree - 3
-
StartAVL Tree deletion cases
-
StartExamples of Deletion in AVL Tree
-
StartAVL Tree Quiz
-
-
B Tree
11 Lessons-
StartIntroduction
-
StartInorder Traversal
-
StartSearching
-
StartInsertion
-
StartImplementation of Insertion - 1
-
StartImplementation of Insertion - 2
-
StartDeletion
-
StartExamples of Deletion from Leaf Node
-
StartExamples of Deletion from Non-Leaf Node
-
StartImplementation of Deletion
-
StartB-tree Quiz
-
-
Graph
14 Lessons-
StartIntroduction
-
StartTerminology
-
StartCycles
-
StartConnectivity in Undirected Graph
-
StartConnectivity in Directed Graphs
-
StartTree and Forest
-
StartGraph Quiz A
-
StartRepresentation of Graph : Adjacency Matrix
-
PreviewAdjacency Matrix in Python
-
PreviewAdjacency List in Python
-
StartTransitive closure of a directed graph and Path Matrix
-
StartWarshall’s Algorithm
-
PreviewWarshall’s Algorithm in Python
-
StartGraph Quiz B
-
-
Traversal In Graph
11 Lessons-
StartIntroduction
-
StartBreadth First Search
-
StartImplementation of Breadth First Search
-
StartFinding Shortest path in an unweighted graph
-
StartBFS Spanning Tree
-
StartBFS in Undirected Graphs : Finding Connected Components
-
StartDepth First Search
-
StartImplementation of Depth First Search through Stack
-
StartRecursive Implementation of Depth First Search
-
StartClassification of Edges in DFS of Directed Graph
-
StartClassification of Edges in DFS of Undirected Graph
-
-
Minimum Spanning Tree of a Graph
9 Lessons
