अभ्यास • Week 05

Weekly MUST Budget Reduced - Practicals

9.5h / 10.0h cap

Hour Calibration

actual hours logged

Rule: slippage > 1.25x triggers Scope-Cut Rung 2

Week Execution 0%

0/ 9 tasks 0.0h

target

Week Objective & Target Output

Target Output

REDUCED CAPACITY (Practicals Continues) — November 2 – November 8, 2026. Practicals (Oct 26–Nov 6) — capacity 10h MUST. Focus: Recursion Basics & Sorting I; Relational Normalization; MIT Missing Semester: Data Wrangling & Scripting; LinkedIn + GitHub Presence Pass.

Weeks: W01 W02 W03 W04 W05 Active

MUST — Critical Path

5 Tasks • ~9.5h

Non-negotiable core curriculum

DSA (Java) 2 tasks

DSA Recursion Basics & Sorting I 6 problems

Parameterized recursion, Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, and Quick Sort from scratch in Java. Analyze space complexities (O(N) vs O(\log N) stack). TUF+ A2Z Step 2.1-2.2

3.5h

DSA DSA Transfer: No-Hint Timed Recursion Set (Subsets & Sorting) 2 problems LC #

Sit 2 unseen Recursion problems you have never attempted (pick from the LeetCode topic tag, NeetCode “similar questions” or a company list; never a problem named in any learning task), at least 72 h after the learning task — move the set to the first half of next week if needed. Format: 25 min per problem (35 min for a Hard), including 5 min for edge cases and a dry run; no hints, no AI. Pass bar: ≥ 1/2 solved inside the time box; on a miss, log the miss reason in the Journal and re-sit a fresh pair within 7 days.

1.5h

Core CS (DBMS) 1 tasks

DBMS Relational Normalization

Functional dependencies, candidate keys, 1NF, 2NF, 3NF, BCNF decomposition rules. TUF+ DBMS

1.5h

Core CS (Linux & Git) 1 tasks

GIT MIT Missing Semester: Data Wrangling & Scripting

Command line text wrangling with grep, sed, awk, find, and shell script pipelines. Architecture §6.4

1.5h

Recruiting Pipeline 1 tasks

PIPELINE LinkedIn + GitHub Presence Pass

Pin 3–4 repos, write the README standard (problem, stack, run steps, evidence), apply the commit-hygiene rule from Architecture §6.1 (logical commits, descriptive messages), and finish the LinkedIn headline/about. Why: recruiters check both within a minute.

1.5h

SHOULD — Depth & Mastery

(3 Tasks)

Execute when MUST pace is on track

CORE 3Blue1Brown Calculus Eps 1–5

Essence of Calculus, derivatives as slopes, chain rule intuition for backprop.

2.0h

CORE ACID Properties & Transactions

Atomicity, Consistency, Isolation, Durability, serializability.

1.5h

APT Quant M5

Profit & Loss (Basic + Advanced).

1.5h

STRETCH — If Ahead

(1 Tasks)

Bonus reps & competitive advantage

DSA Count Inversions

Implement inversion count using modified merge sort.

2.0h

verified_user

Weekly Clearance Gate

0 / 8 Cleared

[T: Recursion Basics & Sorting I] DSA: Have you completed “Recursion Basics & Sorting I” (Parameterized recursion, Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, and…)?

Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.

[T: Relational Normalization] DBMS: Have you completed “Relational Normalization” (Functional dependencies, candidate keys, 1NF, 2NF, 3NF, BCNF decomposition rules)?

Evidence: written answers in your notes repo.

[T: MIT Missing Semester: Data Wrangling & Scripting] Have you completed “MIT Missing Semester: Data Wrangling & Scripting” (Command line text wrangling with grep, sed, awk, find, and shell script pipelines)?

Evidence: terminal transcript or repo link.

[T: LinkedIn + GitHub Presence Pass] Have you completed “LinkedIn + GitHub Presence Pass” (Pin 3–4 repos, write the README standard (problem, stack, run steps, evidence), apply the…)?

Evidence: Tracker rows with dates and links.

[T: Arrays Medium II] DSA: Have you completed “Arrays Medium II” (Next Permutation, Leaders in an Array, Longest Consecutive Sequence)?

Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.

[T: Resume v1 Finalize] Have you completed “Resume v1 Finalize” (Polish Resume v1 (1 page, quantified bullets, education + GitHub profile) and have 2…)?

Evidence: document link and peer-review comments.

[T: DSA Transfer: No-Hint Timed Recursion Set (Subsets & Sorting)] DSA: Did you pass “DSA Transfer: No-Hint Timed Recursion Set (Subsets & Sorting)” — 2 unseen Recursion problems, 25 min per problem, no hints, pass bar ≥ 1/2 solved?

Evidence: timed result and miss reasons logged in the Journal.

Health & Guardrails: 1 full rest day taken every 2 weeks?

tune

If Behind / Life Interruption Protocol

Triage Rule

When academic exams spike or weekly time slips, execute this contingency plan:

shield Protect (Non-Negotiable)

Recursion Basics & Sorting I

schedule Defer (Safe to Shift)

3Blue1Brown Calculus Eps 1–5 → weekend; Core CS: ACID Properties & Transactions → Week 6

edit_note

Week 05 Technical Notes & Journal

#LeetCode #Java #DSA #Week05