All Modules
Chapter 03 • 01

Operating System Internals, Subprocesses & Signals

12 Lessons • Hands-on practice

01

Singly Linked Lists from Scratch

Start
02

Doubly Linked Lists & Bi-Directional Traversal

Start
03

Pure Python Stacks (LIFO) & Call Stack Mechanics

Start
04

Circular Buffers with collections.deque(maxlen)

Start
05

Priority Queues & Binary Heaps with heapq

Start
06

Finding Top-K Elements with nsmallest & nlargest

Start
07

Binary Search Trees & In-Order Traversal

Start
08

Binary Search with bisect.bisect_left & insort

Start
09

Graph Representations (Adjacency Lists)

Start
10

Breadth-First Search (BFS) for Shortest Path

Start
11

Depth-First Search (DFS) & Cycle Detection

Start
12

Trie (Prefix Tree) for Lightning Fast Search

Start