

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
A question bank for the first midterm exam on operating systems. It covers topics such as operating system structure, functions, services, computing environments, process management, synchronization, scheduling, and memory management. The questions are designed to test the students' understanding of fundamental operating system concepts at different levels of bloom's taxonomy, ranging from knowledge and comprehension to analysis and evaluation. By studying this document, students can prepare for the midterm exam and gain a deeper understanding of the core principles and mechanisms of operating systems.
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Q.NO (^) Question Marks BT-level
Explain the process of invoking system call with an example. Also write various system calls.
Q.NO (^) Question Marks BT-level
a) Present Readers and Writers Problem of Synchronization. Explain how to solve it. b) What is Dining Philosophers problem? Discuss the solution to Dining philosopher’s problem using monitors.
a) Explain the steps involved in process creation and process termination. [3] b) Demonstrate FIFO and Round Robin CPU scheduling algorithms with suitable example [7]
a)Explain about process scheduling [4M] b)Assume the following workload in a system. All jobs arrive at time 0 in the order given.[6M] Process Burst Time Priority P1 30 High P2 28 High P3 04 Low P4 16 Medium Draw a Gantt chart illustrating the execution of these jobs using Priority CPU scheduling algorithm and also Calculate the average waiting time and average turnaround time.
a)Explain communication in client-server systems[5M] b)Explain the following with examples[5M] i) CPU utilization and response time, ii) Average turnaround time and maximum waiting time, and iii) I/O device utilization and CPU utilization
For the processes listed below, evaluate Average Waiting Time and Average Turnaround Time for: i) FCFS ii) SJF iii) SRT with Gantt chart 10
For the processes listed below, evaluate Average Waiting Time and Average Turnaround Time for: i) Non-Preemptive Priority ii) SJF iii) RR(TQ=2). with Gantt chart
a) Compare and contrast thread and process. [3M] b) Explain Process concept. Explain various steps involved in change of a process states with neat transition diagram. [7M]
a)Discuss Multithreading Models with neat diagrams.[5M] b) Describe about threading issues[5M]
b)Explain about Mutex Locks