Excellent		12 Reviews
Good		6 Reviews
medium		2 Reviews
Acceptable		0 Reviews
Not Good		0 Reviews

Divide and Conquer Algorithm General Method Lec 5 DAA

1 Algorithms Introduction Performance Analysis DAA

2 Time Complexity Of Algorithms with Example Best Worst Average Case Time Complexities DAA

3 Space Complexity Of Algorithms with Example Calculating Space Complexity DAA

4 Asymptotic Notations Big Oh Omega Theta Little Oh Notation DAA

Divide and Conquer Algorithm General Method Lec 5 DAA

Binary Search Algorithm Concept Code Example Time Complexity L 6 DAA

Quick Sort Algorithm Concept Code Example Time Complexity L 7 DAA

Merge Sort Algorithm Concept Code Example Time Complexity L 8 DAA

Strassen s Matrix Multiplication Concept Algorithm Time Complexity L 9 DAA

Disjoint Set Operations Simple Union Find Algorithms L 10 DAA

Back Tracking General Method Example Applications L 11 DAA

N Queens Problem in Back Tracking Method Example L 12 DAA

Sum Of Subsets Problem in Back Tracking Method Example L 13 DAA

Graph Coloring Problem in Back Tracking Method Example L 14 DAA

Dynamic Programming General Method Example Applications L 15 DAA

Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 1 L 16 DAA

Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 2 L 17 DAA

0 1 Knapsack Algorithm with Example using Dynamic Programming L 18 DAA

All Pairs Shortest Path Algorithm with Example using Dynamic Programming Part 1 L 19 DAA

All Pairs Shortest Path Algorithm with Example using Dynamic Programming Part 2 L 20 DAA

Travelling Salesperson Problem with Example using Dynamic Programming L 21 DAA

Reliability Design with Example using Dynamic Programming L 22 DAA

Greedy Method General Method Example Applications L 23 DAA

Job Sequencing with Deadlines with Example using Greedy Method L 24 DAA

Knapsack Problem with Example using Greedy Method L 25 DAA

Minimum Cost Spanning Tree with Example using Greedy Method L 25 DAA

Single Source Shortest Path Problem with Example using Greedy Method L 25 DAA

Tree Traversal Techniques Inorder Preorder and Postorder with Example L 26 DAA

Graph Traversal Techniques Depth First Search and Breadth First Search with Example L 27 DAA

Branch and Bound Method Example Applications DAA

Travelling Sales Person Branch Bound with Example Part 1 DAA

Travelling Sales Person Branch Bound with Example Part 2 DAA

0 1 Knapsack with Least Cost Branch Bound with Example Part 1 DAA

0 1 Knapsack with Least Cost Branch Bound with Example Part 2 DAA

0 1 Knapsack with FIFO Branch Bound with Example Part 1 DAA

0 1 Knapsack with FIFO Branch Bound with Example Part 2 DAA

NP Hard and NP Complete Problems Non Deterministic Algorithms DAA

Linear Algebra for Computer Scientists

Insertion Sort

Bubble Sort

GCSE Computer Science

Random Access Memory

Binary Trees

Bitwise Operators

Introduction to Stacks Data Structures

Organization Theory Structure and Design

Handling Large Scale Unit Level Data

Introduction to Machine Learning

Applied Linear Algebra Vectors Matrices

Artificial Intelligence beginners

Machine Learning Autumn 2018

Robotics and Autonomous Systems

Natural Language Understanding