
Understand the difference between a program and a process, the memory layout (text, data, heap, stack), and how the process control block stores state, registers, and scheduling information.
Explore how the operating system serves as interface, delivering services such as program execution, I/O, file systems, communication, error detection, resource allocation, protection, and security, with CLI, batch, and GUI.
Explore process scheduling in operating systems by managing job, ready, and device queues to maximize CPU utilization, and compare short-term, long-term, and medium-term schedulers with io and cpu bound processes.
Define a process as a program in execution with text, data, heap, and stack memory. Outline its states—new, ready, running, waiting, terminated—and the PCB fields.
Study inter process communication in operating systems, including shared memory and message passing. Examine direct and indirect communication, mailboxes, and blocking and buffering mechanisms.
Explore cpu scheduling concepts in operating systems, including preemptive and non-preemptive algorithms, the dispatcher, and criteria such as cpu utilization, throughput, turnaround time, waiting time, and response time.
Defines deadlock with two processes and two resources, outlines mutual exclusion, hold and wait, no preemption, circular wait, uses resource allocation graphs to show cycles, and covers prevention and avoidance.
Compare cpu scheduling algorithms: fcfs, shortest job first, shortest remaining time first, priority, and round robin. See how burst time and arrival time shape waiting times shown in Gantt chart.
Explains multithreading, contrasts single threaded and multi threaded processes, and describes user level and kernel level threads, with many-to-one, one-to-one, and many-to-many models.
Explore page replacement algorithms in operating systems, including FIFO, optimal, and LRU, and learn how to calculate page faults from a reference string with fixed frames.
Explore segmentation as a memory management scheme providing a user view, mapping a segment number and offset to memory via a segment table with base and limit registers.
Explore how cryptography protects data by applying encryption and decryption with secret keys, turning plain text into cipher text. Verify sender and receiver trust with key-based schemes.
Explore operating system security, identify threats like confidentiality breaches, integrity violations, and denial of service, and examine attacks such as masquerading, replay, and man-in-the-middle.
Operating system provides the interface between user and computer hardware. The course covers the process scheduling and Thread concepts of Operating System. The course starts with an introduction about process and covers the topics such as Process, Process Scheduling, CPU Scheduling, Various CPU Scheduling algorithms and Threads. Process is nothing bus an program in execution. Process scheduling there are three types of Queues like ready queue,job queue and device queue was elaborated in detail. There are two types of scheduling non preemptive and preemptive. CPU Scheduling algorithms link first come first serve, Shortest job first, priority and round robin algorithm was discussed in detail. In Lecture 5 diffrence between single threaded and multithreading and advantages of multithreading was discussed in detail. Multithreading models like one to one, many to one and many to many was discussed in detail. It will help you to understand the importance of the Operating System in the computer science field. And after completion of this course, you will be able to understand the Process scheduling concept in Operating System easily.
Career Prospects:
Learning the Operating System course will help you to make a career in different fields and positions such as:
System Engineer
Application Engineer
Operating Systems Engineer