-
P1 (Topic Learning)
Learn: -
Why Binary Search exists
-
Linear Search vs Binary Search
-
Requirement: sorted array
-
Mid calculation
-
Pattern triggers
Binary Search Triggers
- Sorted array
- Search element
- “Find minimum/maximum possible”
- O(log n) optimization
P2 (Question 1)
Binary Search
P3 (Question 2)
Search Insert Position
P4 (Question 3)
Guess Number Higher or Lower
Task 2 — Operating Systems (2 Pomodoros — 45/10)
Chapter 3: Process Management — Part 2
Topics:
Threads Multithreading User-level Threads Kernel-level Threads Benefits of Threads Multicore Programming basics Task 3 — DBMS (2 Pomodoros — 45/10)
Chapter 4: Relational Algebra
Topics:
Select Operation Project Operation Union Set Difference Cartesian Product Rename Operation Join basics
Practice: Solve 4–5 relational algebra expressions manually.
Task 4 — Java (2 Pomodoros — 50/10)
Chapter 4: Abstraction
Topics:
Abstraction Abstract Class Interface Abstract class vs Interface Multiple inheritance through interface
-
Key insight 1
-
Key insight 2
-
Mistakes made
- Most important thing to continue tomorrow