Comprehensive Course on Algorithms for CSIT - Part II
Hinglish
Comprehensive Course on Algorithms for CSIT - Part II
Khaleel Ur Rahman Khan
In this Course the Educator will cover the Algorithm Design Strategies, Divide and Conquer, Greedy Method, Dynamic Programming. In addition to the design strategies, we will cover topic on Graph Techniques, Heap... Read more
Ended on Oct 3
Sep 2 - Oct 3, 2024
24 lessons
0 practices
0 questions by educators
Week 1
Sep 2 - 8
5 lessons
Sep
2
Divide and Conquer - Part I
Lesson 1 • Sep 2 • 2h
Sep
3
Divide and Conquer - Part II
Lesson 2 • Sep 3 • 1h 59m
Sep
4
Divide and Conquer - Part III
Lesson 3 • Sep 4 • 2h 1m
Sep
5
Divide and Conquer - Part IV
Lesson 4 • Sep 5 • 1h 44m
Sep
6
Divide and Conquer - Part V
Lesson 5 • Sep 6 • 1h 38m
Week 2
Sep 9 - 15
5 lessons
Sep
9
Heap Algorithms
Lesson 6 • Sep 9 • 2h 1m
Sep
10
Sets and Operations
Lesson 7 • Sep 10 • 2h 2m
Sep
11
Greedy Method - Part I
Lesson 8 • Sep 11 • 2h
Sep
12
Greedy Method - Part II
Lesson 9 • Sep 12 • 2h
Sep
13
Greedy Method - Part III
Lesson 10 • Sep 13 • 2h 1m
Week 3
Sep 16 - 22
5 lessons
Sep
16
Greedy Method - Part IV
Lesson 11 • Sep 16 • 2h
Sep
17
Greedy Method - Part V
Lesson 12 • Sep 17 • 2h
Sep
18
Dynamic Programming - Part I
Lesson 13 • Sep 18 • 2h
Sep
19
Dynamic Programming - Part II
Lesson 14 • Sep 19 • 2h
Sep
20
Dynamic Programming - Part III
Lesson 15 • Sep 20 • 2h 1m