Data Structures and Algorithms 1 (Nex-5255)
About Course


Welcome to the jungle of arrays, loops, and recursion!
Survive here and you might just become a Code Warrior!!
Course Content
Course Description
-
Whatsapp Group (Must Join)
Theory Lecture – Md Tamim Hossain
-
Lecture-01- Introduction to Time Complexity, Insertion Sort
01:40:47 -
Lecture-02 || Time Complexity (Upper Bound, Lower Bound, Tight Bound)
01:32:06 -
Lecture-03|| Time Complexity Practice on Different types of Questions
01:30:01 -
Lecture-04 || Asymptotic Notation
01:54:35 -
Lecture-05|| Array Mapping
41:02 -
Lecture-06|| Recursion
01:24:09 -
Lecture-07 || Linear Search & Binary Search
01:15:16 -
Lecture-08 || Count Sort
01:18:43 -
Lecture-09 || Singly Linked List
01:31:06 -
Lecture-10 || Doubly Linked List
01:15:40 -
Doubly Linked List (Delete From Random)
15:39 -
Lecture -11 Circular Linked List
01:40:04 -
Lecture-12 || Stack
57:29 -
Lecture-13 || Queue
53:23 -
Queue Using Circular Array
15:27 -
Lcture-14
Theory Slide – Md Tamim Hossain
-
Lecture-01 slide
-
Lecture-02 Slide
-
Lecture-03 Slide
-
Lecture-04 slide
-
Lecture-05 Slide
-
Lecture-06 Slide
-
Lecture-08 Slide
-
Lecture-09 Slide
-
Lecture-10 Slide
-
Lecture-11 slide
-
Lecture-12 Slide
-
Lecture-13 Slide
-
Lecture Slide
Question Solve
-
Linked List
55:48 -
Summer 25 Full Question Solve
01:50:25 -
Spring-24 Full Question Solve
01:36:11 -
Fall 23 Full Question Solve
01:04:34 -
Spring-25 Question Solve
01:12:58
Lab Lecture – Sadika Binti Noor
-
Lecture – 1: Intro to C++ and Bubble Sort
01:18:49 -
Lecture – 2: Insertion Sort
53:35 -
Lecture – 3: Selection Sort
52:07 -
Lecture – 4: Linear and Binary Search
01:15:17 -
Lecture – 5: Searching Related Problems
02:18:15 -
Lecture – 6: Sorting Related Problems
01:36:08 -
Lecture – 7: Singly Linked List
03:28:34 -
Lecture – 8: Doubly Linked List
01:04:34
Lab Code – Sadika Binti Noor
-
Topic – 1: Sorting (Base Codes)
-
Topic – 2: Searching (Base Case)
-
Topic – 3: Searching Related Problems
-
Topic – 4: Sorting Related Problems
-
Topic – 5: Linked List (Singly & Doubly)