CS604 Operating Systems is a foundational core course in the computer science and information technology curricula at the Virtual University of Pakistan, engineered to provide a comprehensive exploration of system software architecture, hardware resource management, and concurrent computing environments. Grounded in authoritative computer science principles and classic operating system texts by Silberschatz, Galvin, Gagne, and Tanenbaum, the course explores the critical software layers that bridge physical hardware devices with end-user applications. Students trace the functional evolution of operating systems from simple batch and multiprogrammed systems to contemporary symmetric multiprocessing, distributed computing, and real-time operating kernels. The curriculum begins with deep investigations into operating system structures, dual-mode hardware operations, system call traps, and low-level Unix shell environments. Learners delve into process concepts, examining process control blocks, execution state transitions, context switching latency, CPU scheduling queues, and the mechanics of process creation and control via fork, exec, and wait system calls. Inter-process communication is thoroughly analyzed through shared memory models, message passing primitives, anonymous Unix pipes, and named FIFOs. Threading architectures receive rigorous coverage, contrasting user-level and kernel-level threads across many-to-one, one-to-one, and many-to-many models with POSIX Pthreads implementations. CPU scheduling modules explore preemptive and non-preemptive algorithms including FCFS, SJF, SRTF, Priority scheduling with aging, Round Robin, and Unix System V dynamic multilevel feedback queues. Process synchronization is examined in depth, tackling race conditions, the critical section problem, software solutions including Peterson and Bakery algorithms, and hardware instructions like TestAndSet and Swap. Students investigate deadlocks through Coffman conditions, Resource Allocation Graphs, Banker's algorithm for avoidance, and detection techniques. Advanced topics encompass main memory contiguous allocation, non-contiguous paging architectures, TLBs, multi-level and inverted page tables, segmentation, virtual memory demand paging, page fault handling, page replacement policies like FIFO, LRU, and Clock, thrashing, and the working set model. The course concludes with secondary storage management, file system organization, Unix inodes, allocation methods, and disk scheduling algorithms like SSTF, SCAN, and C-LOOK. Supported by solved past papers and chapter MCQs on VU SIGMA, CS604 equips scholars for technical excellence.