Scribd
Upload
33K views

Operating System Sample Paper 5th Semester MSBTE Diploma in Computer Engineering Group

This document is a sample question paper for the Operating System subject in the Fifth Semester of the Computer Engineering program. It contains 6 questions assessing various topics related to operating systems. Question 1 has 4 parts assessing operating system concepts, system calls, process states, and OS structures. Question 2 has 3 parts on OS services, sequential vs batch processing, and schedulers. Question 3 has 2 parts on booting and device management and OS structures. Question 4 has 2 parts on multithreading models and deadlocks. Question 5 has 3 parts comparing multitasking and multiprogramming, real-time systems, and process operations. Question 6 has 2 parts on scheduling algorithms and page replacement strategies. Students have 3 hours to answer all questions

Uploaded by

Sanjay Dudani
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
33K views

Operating System Sample Paper 5th Semester MSBTE Diploma in Computer Engineering Group

This document is a sample question paper for the Operating System subject in the Fifth Semester of the Computer Engineering program. It contains 6 questions assessing various topics related to operating systems. Question 1 has 4 parts assessing operating system concepts, system calls, process states, and OS structures. Question 2 has 3 parts on OS services, sequential vs batch processing, and schedulers. Question 3 has 2 parts on booting and device management and OS structures. Question 4 has 2 parts on multithreading models and deadlocks. Question 5 has 3 parts comparing multitasking and multiprogramming, real-time systems, and process operations. Question 6 has 2 parts on scheduling algorithms and page replacement strategies. Students have 3 hours to answer all questions

Uploaded by

Sanjay Dudani
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Sample Question Paper - I

Course Name : Computer Engineering Group


Course Code : CO/CM/CD/IF
Semester : Fifth
9115
Subject : Operating System
Max Marks : 80 Time: 3 Hours

Instructions:
1) All questions are compulsory.
2) Illustrate your answers with suitable sketches wherever necessary.
3) Figures to the right indicate full marks.
4) Assume suitable data if necessary.
5) Preferably, write the answers in sequential order.

Q.1 Attempt any FOUR of the following. 16 Marks


a) What is Operating System? Explain the concept of time sharing.
b) State uses of system calls.
c) State and explain different process states.
d) State the concept of mutual exclusion.
e) Explain with suitable diagram layered and monolithic operating system structures.
f) Explain concept of swapping with diagram.

Q.2 Attempt any THREE of the following. 12 Marks


a) State and explain different operating system services.
b) Differentiate between sequential and batch processing.
c) What do mean by scheduler? State types of scheduler.
d) Differentiate between Pre-emptive and Non-emptive scheduling.

Q.3 Attempt any TWO of the following. 12 Marks


a) What is booting? Explain the concept of device management.

1
b) Write different types of operating system structures. Explain any two with suitable
diagram.
c) What is process? Draw process state diagram and state its meaning.

Q.4 Attempt any TWO of the following. 16 Marks


a) Explain in detail multithreading models with suitable example.
b) What is Deadlock? Explain concept of critical region and Deadlock handling.
c) Differentiate between the following terms
i) Contiguous and Linked allocation.
ii) Linked and Indexed allocation.

Q.5 Attempt any THREE of the following. 12 Marks


a) Differentiate between multitasking and multiprogramming.
b) State real time and multiprocessor system.
c) State and explain operations on processes.
d) Explain CPU and I/O Burst cycle with suitable diagram.

Q.6 Attempt any TWO of the following. 12 Marks


a) Solve the following problem by using following scheduling algorithms
Processes Burst Time
1 27
2 6
3 3

i) FCFS.
ii) SJF.
iii) Round Robin.
b) Explain different free space management techniques.
c) Explain the FIFO, Optimal and LRU page replacement algorithm for the reference string,
7 0 1 2 0 3 0 4 2 3 1 0 3.

You might also like