Operating system concepts-1

Master the basics of Operating Systems, system calls, processes, CPU scheduling from scratch.

Ace operating systems (OS) principles, system calls, OS protection, processes, CPU scheduling, CPU scheduling algorithms, interprocess communication questions in competitive exams, job interviews, and OS course exams.

What you’ll learn

• What is an operating system (OS)?.
• Modern OS functionalities..
• Layered design of computing systems..
• OS user interface..
• What is Protection in OS?.
• What are kernel and user modes? Why are they needed?.
• What are system calls? Why are they needed?.
• What are traps?.
• What is an application programming interface (API)?.
• How APIs invoke system calls?.
• How are system calls implemented?.
• How are parameters passed to system calls?.
• Life cycle of program creation.
• Memory footprint of a program..
• What is a process?.
• What is multiprogramming and multitasking?.
• CPU Scheduler and process scheduling..
• What are the various states that a process goes through?.
• What is a process control block (PCB)?.
• When do processes relinquish CPU?.
• What is a context switch?.
• CPU scheduling basics and performance metrics..
• What are CPU-bound and IO-bound processes?.
• When would CPU scheduler run?.
• What is turnaround time and waiting time?.
• FCFS scheduling..
• Shortest job first (SJF) scheduling..
• Nonpreemptive priority scheduling..
• What is starvation?.
• Shortest remaining time first (SRTF) scheduling..
• Preemptive priority scheduling..
• Round robin (RR) scheduling..
• Combining scheduling algorithms..
• Linux CPU scheduling algorithm..
• Programs with multiple processes..
• Creating multiple processes in Linux..
• Fork system call with illustrative examples..
• Interprocess communication (IPC)..
• Shared memory for IPC..
• Message passing for IPC..

Course Content

• Introduction –> 11 lectures • 47min.
• System calls and Protection –> 10 lectures • 41min.
• Processes –> 8 lectures • 25min.
• CPU scheduling –> 9 lectures • 33min.
• CPU scheduling algorithms –> 15 lectures • 1hr 4min.
• Combining CPU scheduling algorithms –> 3 lectures • 13min.
• Programs with multiple processes –> 9 lectures • 30min.
• Interprocess communication (IPC) –> 4 lectures • 13min.

Requirements

Ace operating systems (OS) principles, system calls, OS protection, processes, CPU scheduling, CPU scheduling algorithms, interprocess communication questions in competitive exams, job interviews, and OS course exams.

Do you know: How OS protects itself from the user programs? How does OS protect user programs from each other? Why can user programs not directly access I/O devices? Why do programmers prefer to use APIs over system calls in programs? How is the CPU shared between so many active processes? How does executing processes create new child processes? How do cooperating processes communicate? Learn the explanations to these and many more intriguing questions in this course!

 

Specifically, the course will cover the following in detail.

 

1. What is an operating system (OS)?
2. Modern OS functionalities.
3. Layered design of computing systems.
4. OS user interface.
5. Protection in OS.
6. Kernel mode and user mode.
7. System calls.
8. Traps.
9. Application programming interface (API).
10. How APIs invoke system calls?
11. System call implementation.
12. Parameter passing to system calls.
13. Life cycle of program creation
14. Memory footprint of a program.
15. What is a process?
16. Multiprogramming and multitasking.
17. CPU Scheduler and process scheduling.
18. Process states.
19. Process control block (PCB).
20. When do processes relinquish CPU?
21. Context switching.
22. CPU scheduling basics and performance metrics.
23. CPU-bound and IO-bound processes.
24. When would CPU scheduler run?
25. Turnaround time and waiting time.
26. FCFS scheduling.
27. Shortest job first (SJF) scheduling.
28. Nonpreemptive priority scheduling.
29. Starvation.
30. Shortest remaining time first (SRTF) scheduling.
31. Preemptive priority scheduling.
32. Round robin (RR) scheduling.
33. Combining scheduling algorithms.
34. Linux CPU scheduling algorithm.
35. Programs with multiple processes.
36. Creating multiple processes in Linux.
37. Fork system call with illustrative examples.
38. Interprocess communication (IPC).
39. Shared memory for IPC.
40. Message passing for IPC.

30 day money back guaranteed by Udemy.

 

Wisdom scholarships. If you are interested in taking one of our courses but cannot purchase it, you can apply for a scholarship to enroll. Learn more about the application process at my website.