Data Structures and Algorithms 2 (Nex-5263)
Course Content
Join Whatsapp Group
-
Click here
Lectures
-
Lecture-1: Time Complexity-1(Analyzing Algorithm, Asymptotic Notation)
55:59 -
Lecture-2: Time Complexity-2(Exact Cost, Best/Worst Cases)
01:14:55 -
Lecture-3: Recurrence Relation and Masters Theorem
01:10:31 -
Lecture-4: Recursive Tree
51:49 -
Lesson-5: Merge Sort and Quick Sort
56:27 -
Lesson-6: Divide and Conquer(Max/Min and Maximum/Minimum Subarray)
01:24:54 -
Lesson-7: Huffman Coding
42:25 -
Lesson-8: Greedy Algorithm(Activity Selection, Fractional Knapsack)
01:02:54 -
Lesson-9: Dynamic Programming(Coin Change, 0/1 Knapsack)
01:02:41
LAB Classes
-
Lesson-1: Merge and Quick Sort Lab
58:46 -
Lesson-2: Divide and Conquer Lab
41:01 -
Lesson-3: Greedy Algorithm Lab
39:00 -
Lesson-4: Dynamic Programming Lab
43:52
Lecture archive
-
Time Complexity-1
01:08:42 -
Time Complexity-2
00:00 -
Recurrence Relation and Masters Theorem
01:26:10 -
Divide and Conquer Algorithm
01:42:59 -
Recursive Tree
00:00 -
Merge Sort and Quick Sort
59:270 -
Greedy Algorithm
46:42 -
Greedy Algorithm Lab
48:49 -
Divide and Conquer Lab
01:30:55 -
Merge and Quick Sort Lab
40:37 -
Dynamic Programming
01:35:22 -
Dynamic Programming Lab
43:52
Qn Solve
-
Topic 1 Time Complexity & Recurrence Relation
56:07 -
Topic 2 Divide & Conquer
46:56 -
Topic 3 Greedy Algorithm.
51:16 -
Topic 4 Dynamic Programming
01:34:14 -
Topic 5 Huffman Coding
16:56 -
FALL25
01:27:54 -
Summer 25
01:13:53 -
Spring-261
01:26:34
Quick Recap
-
Quick recap
03:55:36
Student Ratings & Reviews
No Review Yet