CST334 - Week 2

I learned about processes and how the operating system manages them. A process is a running program, and each process has its own memory, registers, and unique process ID (PID). The operating system creates processes using system calls like fork(), which makes a copy of a running process, and exec(), which replaces a process with a new program. Processes go through different states such as new, ready, running, blocked, and terminated depending on what they are doing.

I also learned about process scheduling, where the operating system decides which process gets to use the CPU. Scheduling can be preemptive, where a process can be interrupted, or non-preemptive, where a process runs until it finishes or waits for an input. Different scheduling algorithms exist, like First Come, First Served (FCFS), Shortest Job First (SJF), Round Robin (RR), and Multi-Level Feedback Queue (MLFQ). MLFQ is interesting because it adjusts a process's priority based on how it behaves, making it efficient for different types of workloads. After going through these topics, I now have a better understanding of how the operating system handles multiple processes and ensures efficient CPU usage.