Week 1

• Day 1 : ​Analysis Of Algorithm : Asymptotic

Analysis (Finding time and space complexities)
• Day 2, 3 : ​List in Python : Working, Slicing,
Comprehensions, Questions
• Day 4, 5 : ​String : String Comparison,
Formatted String, String Operation, Questions
• Day 6: ​Searching : Binary Search, Questions

Week 2

• Day 1, 2, 3 : ​Sorting : Bubble, Selection,

Insertion, Merge Sort, Quick Sort, Lomuto
Partition, Hoare's Partition ,Questions
• Day 4, 5, 6 : ​Hashing : Different Types of Hashing
Techniques, Collision resolution Techniques,
Hashing Questions

Week 3

• Day 1, 2: ​Recursion : Basic Recursion, Questions

• Day 3, 4 : ​Linked List :Simple linked list,
Implementation, Traverse, Search, Insert, Delete,
Reverse
• Day 5 : ​Circular Linked List : Traverse, Insert, Delete
• Day 6 : ​Doubly Linked List : Insert, Delete, Reverse
Week 4

• Day 1, 2 : ​Stack Operations,

Implementation, Questions
• Day 3 : ​Queues: Queue Operations, Implementation
• Day 4 : ​Deque : Deque Operations, Implementation
• Day 5, 6 : ​Trees : Tree Traversal, Binary
Tree, Questions

Week 5

• Day 1, 2: ​Binary Search Tree : Search, Insert, Delete

• Day 3, 4: ​Heap : Implementation, Insert ,Delete,
Binary Heap (Extract Min and Heapify), Heapq
• Day 5, 6: ​Graph : Representation, BFS, DFS and
its applications.