Algorithm Complexity,Efficiency,O(Big-Oh)-N,(Big-Omega)-N,(Theta)N

Algorithms & Data Structures 2/3:Combinatorial,BT,MST,Prim

Orientation

Problem Solving,Algorithm Complexity,Bit Operations,Number Bases,Floating Point

Intro, Learning objectives (0:42)
SW Problem Solving and Strategies for Solving Problems (5:30)
Algorithm Complexity,Efficiency,O(Big-Oh)-N,(Big-Omega)-N,(Theta)N (6:35)
Bit Operations and Endianness (9:23)
Number Bases (2:38)
Floating Point Numbers (4:24)
Summary (1:25)

Combinatorial,Permutation,Lexicographic–Order,Johonson-Trotter,Permutation

Intro, Learning objectives (0:29)
Exhaustive Search Method, Baby Gin Problem, Brute-Force (6:19)
Combinatorial,Permutation,Minimum-exchange Requirement,Johonson-Trotter,Permutation (18:23)
Summary (0:45)

Greedy Algorithm,Knapsack,Huffman coding,Change Reducing Problem,Meeting Room Scheduling

Intro, Learning objectives (0:43)
Greedy Algorithm (2:10)
Change Reducing Problem (4:02)
Knapsack Problem and Use of Exhaustive Search, Fractional Knapsack Method (5:56)
Meeting Room Scheduling,Comparison of Greedy Method and Dynamic Programming (9:27)
Representative Algorithms of Greedy Methods, Huffman coding (3:06)
Summary (2:21)

Divide & Conquer,Merge,Quick sort,Hoare Partition,Lomuto Partition,Binary Search

Intro, Learning objectives (0:28)
Divide and Conquer, Power (3:24)
Merge Sort (2:25)
Quick sort (8:48)
Binary Search and Use of Divide and Conquer (3:36)
Summary (1:02)

Backtracking,State Space Tree,8-Queens Problem,Subset,Power Set,Permutation

Intro, Learning objectives (0:28)
Backtracking,Maze Finding,Subset Sum,State Space Tree,Depth First Search,N-Queens (10:38)
Subset and Power Set (5:42)
Permutation and State Space Tree of a Permutation (4:59)
Coin Change Problem (2:02)
Summary (1:32)

Graph and Search,Disjoint Sets,Expression of Linked List

Intro, Learning objectives (0:28)
Graphs:Path,Simple Path,Cycle,Adjacent Matrix,Adjacent List,Array of Edges (9:55)
Graph Search,Depth First Search DFS,Breadth First Search BFS (10:38)
Disjoint Sets and Operations,Representation of Disjoint Sets–Linked List (9:51)
Summary (1:57)

Minimum Spanning,Prim,Kruskal,Shortest Path,Dijkstra,Bellman-Ford,Floyd-Warshall

Intro, Learning objectives (0:30)
Minimum Spanning Tree (1:43)
Prim Algorithm (7:13)
Kruskal Algorithm (6:19)
Shortest Path,Dijkstra,Bellman-Ford,Floyd-Warshall Algorithms (0:58)
Dijkstra Algorithm,Bellman-Ford Algorithm (10:08)
Summary (1:41)

Lesson content locked

If you're already enrolled, you'll need to login.