Shikshan Prasarak Mandal’s
S P M POLYTECHNIC, KUMATHE
Preliminary Exam
Program Name: Computer Engineering Program Code: CO 22516
Semester: FIFTH Course Name: OSY
Date: 10 /11/2023 Time: 3 Hour Marks: 70
Instructions:
1. All questions are compulsory.
2. Illustrate the answer with neat sketches whether whenever necessary.
3. Figures to the right indicate full marks.
4. Assume suitable data if necessary.
Q.1 Attempt any FIVE of the following. (5 x 2 = 10 Marks)
1. Define real time operating system. List any four application of it.
2. Explain any four services provided by os.
3. What is process management? State two functions to be performed by OS for process management.
4. Write syntax of Ps command and Draw and explain process state diagram.
5. Explain scheduling criteria.
6.write syntax for following command 1 sleep 2 kill 3.PS 4.exit
7. Define following term a. page fault and paging b. segmentation
Q.2 Attempt any THREE of the following. (4 x 3 = 12 Marks)
1.state what is inter process communication and explain its advantages
2.Define PCB list information contain in PCB and explain.
3.Explain partitioning and its types.
4.Enlist types of operating system .explain multiprogramming operating system
5.With neat diagram, explain file access methods.
6.Structures of Directory in Operating System
Q.3 Attempt any THREE of the following: (4 x 3 = 12 Marks)
a. Write unix command for following:
i) create a folder OSY
ii) create a file FIRST in OSY folder
iii) List/display all files and directories
iv) write command to clear the screen.
b. Describe activities of I/O system and secondary storage Management.
c. Describe IO Burst and cpu burst cycle with neat daigram.
d. Explain FIFO, LRU, Optimal page replacement algorithm for following reference string.7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1
Calculate the ratio of page fault and page hit
e. Explain Internal Fragmentation and external fragmentation
f. Explain static and dynamic memory partitioning method.
Q.4 Attempt any THREE of the following: (6 x 2 = 12 Marks)
1. Explain following terms with respect to memory management. I ) context switching ii) swapping
2. Define deadlock and state the necessary condition for deadlock.
3. Enlist different file allocation methods and explain any two.
4. Differentiate between Long term scheduler short term and medium term scheduler.
5. What is system call? state type of system calls with example.
6. Differentiate between pre-emptive and non-pre-emptive scheduling
Q.5 Attempt any TWO of the following: (6 x 2 = 12 Marks)
1.List free space management techniques? Describe in detail
2.the jobs are scheduled for execution as follows
process Arrival Brust time
time
P1 0 7
P2 1 4
P3 2 10
P4 3 6
P5 4 8
Solve the problem using i)SJF ii)FCFS
3.How optimal page replacement algorithm ? with example
4.Explain Multilevel Queue Scheduling
Q.6 Attempt any TWO of the following: (6 x 2 = 12 Marks)
1.Explain Round Robbin algorithm with example
( quantum=3) calculate average waiting time and average turnaround time
Process Brust Arrival
TIme Time
P1 10 1
P2 4 2
P3 5 3
P4 3 4
2.Describe critical section problem with solution and semaphore
3.consider the snap of the system
Process Allocation Max Available
ABCD ABC
D
P0 112 433 210
P1 212 322
P2 401 902
P3 020 753
P4 112 112
i) What is the content of Matrix need?
ii) is the system in safe state?
