Operating Systems & Concurrency
Kernel abstractions, multi-threaded concurrency, semaphores, deadlock avoidance (Banker’s), virtual memory paging, and file systems.
Course Learning Outcomes
Virtual Memory Paging
Theoretical foundation and algorithmic problem solving with faculty evaluation.
Coffman Deadlock Conditions
Theoretical foundation and algorithmic problem solving with faculty evaluation.
Multi-Level Feedback Queues
Theoretical foundation and algorithmic problem solving with faculty evaluation.
Strict 2PL
Theoretical foundation and algorithmic problem solving with faculty evaluation.
Curriculum Chapter Syllabus
Foundational Theory & Invariants
Asymptotic notation, amortized complexity, and invariant proofs.
Linear & Hierarchical Data Structures
Dynamic arrays, linked allocation, stacks, queues, and priority heaps.
Self-Balancing Binary Search Trees
AVL height balances, single/double rotations, and Red-Black tree coloring rules.
Graph Traversals & Optimal Pathing
Breadth/depth traversals, topological sorting, shortest paths, and minimum spanning trees.