What are System Calls in Operating System | DevOps/SRE Interview Questions

[@Aditya-us5gj]

Do you follow the book Operating System by Abraham Silberschatz ?

[@practicalcsjourney]

Yes + Linux kernel development by Robert Love

[@bhavyagupta1389]

great explanation!!

[@practicalcsjourney]

Glad you liked it!

[@dreambig1564]

thank you for the explanation, just for the second slide there is a slight mistake ''So, system calls also 'are' an API''

[@practicalcsjourney]

If you or your friends are interested for live classes on youtube for operating system topics which can help you either in interviews, competitive exams like GATE or your college exams, do fill the form and mention your reason. Do share this with your friends :) Form link: bit.ly/2LVLWWy

[@practicalcsjourney]

Do join this telegram channel for getting updates about my operating system live classes and for any clarification of your doubts: t.me/joinchat/OcDlRxsp56Z1yiqQJu9unw

[@noelchrisley9212]

Thank you so much! It helps a lot!

[@varshagaikwad7998]

Simple explanation.👍

[@amnakhan5377]

sir please ye question solve kr den i will be very thankfull to u ......,mery online exams ho rhy 03/12/2020 hy aj kal 10 o clok submit krana hy please solve kr den abi ..... Q.No.1. (06) Consider the following set of processes with their CPU burst times/Processing time (milliseconds), arrival times (milliseconds) and priorities. For example, process P1 arrives 10 milliseconds after the start of the system; process has priority (3, 6, 2, 5, 1). Process Arrival Time (ms) Processing Time (ms) Priority P1 10 17 3 P2 6 6 6 P3 7 9 2 P4 4 1 5 P5 5 1 1 Find the average turnaround time, completion time, Response time and the average waiting time in the scheduler queue in milliseconds for this set of processes running on a system using each of the scheduling algorithms listed below? Show your work to get any or full points. Draw the Gant Chart and also write down the process execution state. 2. Shortest Job First (non-preemptive). 3. Priority Algorithm (Preemptive) Note: each algorithm explain separately and Priority Colum just for Priority Scheduling Algorithm Answer: Q.No.3. (03) Consider the following set of processes with their CPU burst times/Processing time (milliseconds), arrival times (milliseconds). For example, process P1 arrives 8 milliseconds after the start of the system; Process Arrival Time (ms) Processing Time (ms) P1 8 17 P2 1 5 P3 6 9 P4 4 8 P5 5 1 Find the average turnaround time, completion time, Response time and the average waiting time in the scheduler queue in milliseconds for this set of processes running on a system using each of the scheduling algorithms listed below? Show your work to get any or full points. Draw the Gant Chart and also write down the process execution state. 1. Round Robin scheduling algorithm (quantum = 1 millisecond). Answer:_______________

[@joyaljose2930]

Sixtom? 😂