Embedded Files
Week 1&2: The Role of Algorithms in Computing, Insertion sort and Analyzing Algorithms
All topics are covered by Applied Course's channel in their playlist, Data Structures & Algorithms- GATE Computer Science.
starting from (video#1 to video#11) include Why study Data Structures and Algorithms, How it works: Card-sorting, Pseudo code, Correctness, Stable sort, Model of computation, Space and time analysis of Insertion Sorting, Insertion sort: Big O-notation...etc.
(video#28 to video#36) covering merge sort.
Sorting algorithms are covered by Jenny's Lectures in her playlist, Data Structures and Algorithms.
Insertion Sort Algorithm
Correctness
Loop Invariance
Analysis of Algorithm
Insertion Sort
Analysis of Insertion Sorting | Analyzing an algorithm
Part 1/2
Insertion Sort
Analysis of Insertion Sorting | Analyzing an algorithm
Part 2/2
Bubble Sort Algorithm
Algorithmic Analysis of Bubble Sort
Selection Sort
Selection Sort Algorithm
Selection Sort Algorithm and Analysis
Divide and Conquer
Merge Sort Algorithm
Merge Sort Algorithm
Analyzing time & space complexity | Merge Sort
Recursion Tree Method | Merge Sort
MergeSort in-depth Analysis
Why Is Merge Sort O(n*log(n))? The Long Answer
Time analysis of Mergesort
Proof of Correctness Using Loop Invariance
Analysis of Algorithms, Insertion Sort and Mergesort (Lecture)
Week 3: Growth of Functions
All topics are covered by Applied Course's channel in their playlist, Data Structures & Algorithms- GATE Computer Science, starting from (video#12 to video#27)
Algorithm Running Times, Big O Notation, Omega Notation, and Theta Notation
Watch until 00:39:09
Big-O notation - The basics
Growth of Functions
Asymptotic Notations Part#1
Asymptotic Notations Part#2
Comparison of Functions Part#1
Comparison of Functions Part#2
Asymptotic Analysis
Big O, Big Omega, & Theta
Small O, Omega
Relationships Between Various Notations
Asymptotic Notation
Week 4&5&6: Divide and Conquer
Binary Search
Iteration Method to Solve the Recurrence
Iteration Method for Solving Recurrence
(Example)
The Substitution Method for Solving Recurrence
Substitution Method
Substitution Method
Recursion Tree Method
Recursion Tree
Recursion Tree Method
Recursion Tree Method
(Examples)
Master Method
Master Theorem
Master Theorem
The Master Method
Why Master Method Works
Asymptotic Notation | Recurrences | Substitution, Master Method (Lecture)
Strassen's Matrix Multiplication
Week 7: Heap Sort
Heap Sort Part1
Heap Sort Part#2
Heap Sort Part#3
Heap Sort Part#4
Complete Binary Tree
Binary Tree, Complete Binary Tree and Fully Complete Binary Tree
Heaps and Heap Sort
Heap - Heap Sort - Heapify
Min -Max Heap
Heap Sort
Heap Sort | Heapify Method | Build Max Heap Algorithm
Investigating Heap Sort
Heap Sort - Complete Tree (1/2)
Heap Sort (2/2)
Week 8: Quick Sort
Why do we need another sorting algorithm? | Quick Sort
How it works: intuition | Quick sort
Partitioning | Quick Sort
"Different than our slides"
Partitioning
"Same as our slides"
Quick sort by recursion | Quick Sort
Quick Sort
The Quicksort Sorting Algorithm: Pick A Pivot, Partition, & Recurse
Time complexity: Best and Worst cases | Quick Sort
Randomized quick sort and amortized analysis | Quick Sort
Quicksort and Randomized Quicksort
QuickSort Analysis
Quick Sort
Quick Sort
Week 9: Red Black Trees
BST Properties
Binary Search Trees (BST) - Insertion and Deletion Explained
Binary Search Tree (BST) Time Complexity
Red-black trees in 4 Minutes — The basics
Red-Black Trees
Introduction to Red Black Trees
Rotations(LL, RR, LR, RL) with Example
Red-black trees in 3 minutes — Rotations
Red-Black Tree Insertion
Red Black Tree Insertion
Red-black trees in 5 minutes — Insertions (strategy)
Red-black trees in 5 minutes — Insertions (examples)
Proof of Red-Black Tree Worst-Case Time Complexity
Red Black Tree (Arabic) Part#1
Red Black Tree (Arabic) Part#2
Week 10&11: Dynamic Programming
Dynamic Programming Lecture
Dynamic Programming Lecture
Dynamic Programming
What is Dynamic Programming
Overlapping Subproblems Property
Optimal Substructure Property
Principle of Optimality
The Rod Cutting Problem
Dynamic Programming Rod Cutting
The Rod Cutting Problem Part#1
The Rod Cutting Problem Part#2
Longest Common Subsequence
Longest Common Subsequence
Longest Common Subsequence
LCS Part #1
LCS Part#2
LCS Part#3
Week 12&13: Greedy Algorithms
Activity Selection Problem
Activity Selection Problem
Fractional knapsack problem-Greedy Algorithm
Activity Selection Problem
0/1 knapsack problem-Dynamic Programming
Knapsack Problem
0/1 knapsack problem-Dynamic Programming
Greedy Algorithm
Knapsack Problem
0/1 Knapsack
Week 14: Graphs
Graph Definition and Types
Connected Graphs (Directed)
BFS and DFS Graph Traversals
BFS and DFS Graph Traversals
BFS
Types of edges in DFS | Edge classification
DFS Start and End times
DFS Types of Edges
DFS
DFS Review Exercise
Page updated
Google Sites
Report abuse