Scribd
Upload
43 views2 pages

Sougata Jana - CSC407 - OS - 2nd - Year - CSE - SET3

Uploaded by

prabhat0022kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
43 views2 pages

Sougata Jana - CSC407 - OS - 2nd - Year - CSE - SET3

Uploaded by

prabhat0022kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

University of Engineering & Management, Jaipur

(Established by Act of State Govt. & u/s 22 of UGC Act, Ministry of HRD, Govt. of India)

University Examination
B.Tech, 2rd year, 4th Semester
Subject Code- CSC407 Total Marks-100
Subject Name- Operating System Time Duration -3hrs.
All the answers should be in brief and to the point.
Strike off all the blank pages of copy, after completing your work.
The students are advised not to write anything on the question paper other than Enrolment No.

Answer the following Questions: (Give 30 Questions) [10 marks each]

1. a) Under what conditions the following state transition occurs with respect to a process?
I. Run to Ready.
II. Blocked (or wait) to Ready.
b) State the relative advantages and disadvantages of user level thread and kernel level thread [5+5]

2. a) A file system with 300 GByte uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly
indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The
maximum possible file size in this file system is?
b) An application loads 100 libraries at startup. Loading each library requires exactly one disk access. The seek time of
the disk to a random location is given as 10ms. Rotational speed of disk is 6000rpm. If all 100 libraries are loaded from
random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block
once the head has been positioned at the start of the block may be neglected). [5+5]

3. Consider the following snapshot of a system:


Process Allocation Max Available
A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3
Answer the following questions using banker's algorithm
I. What is the content of need matrix?
II. Is the system in safe state? If yes then find the safe states.
III. If the request for P1 arrives for (1,0,2) can the request be granted immediately? [3+3+4]

4. Consider the following snapshot of a system where r i (i=1...4) denote resource types and P1 to P5 denote processes.
The vector 'Available' has the usual meaning.
Process Current allocation maximum demand Available
r1 r2 r3 r4 r1 r2 r3 r4 r1 r2 r3 r4
P1 0 0 1 2 0 0 1 2 2 1 0 0
P2 2 0 0 0 2 7 5 0
P3 0 0 3 4 6 6 5 6
P4 2 3 5 4 4 3 5 6
P5 0 3 3 2 0 6 5 2
Answer the following questions using banker's algorithm
I. What is the content of need matrix?
II. Is the system currently in a safe state? If yes then find the safe states.
III. If the request for P3 arrives for (0,1,0,0) can the request be granted immediately? [3+3+4]

5. Suppose a disk drive has 300 cylinders, numbered 0 to 299. The current position of the desk arm is 90. The queue of
pending requests, in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the average movements for the following
algorithms:
I. LOOK
II. C-SCAN
III. SCAN
IV. C-LOOK [4*2.5]

6. a) Explain the Dining philosopher problem with semaphore (pseudo code expected).
b) Differentiate between multiprogramming and multitasking OS. [8+2]

7. a) How busy-wait implementation of semaphore problem can be solved?


b) Write down a message-based solution for the producer-consumer problem. [5+5]

8. a) Explain the purpose of system calls in operating system.


b) On a simple paged system, if references satisfied by the associative registers take 100 ns and references through the
main memory page table take 180 ns, what must the hit ratio be to achieve an effective access time of 125 ns? [5+5]

9. a) Write the difference between segmentation and paging.


b) How is paging implemented in hardware? [5+5]

10. a) Explain CPU scheduling criteria.


b) Write the advantages and disadvantages of SJF scheduling.
c) State the advantages and disadvantages of single contiguous memory allocation. [4+3+3]

11. a) Write down the merits and demerits of a virtual memory system.
b) Consider a virtual memory system with combined implementation, segmentation and paging. Describe the address
translation scheme along with necessary data structures. [4+6]

12. Consider the following set of processes, with the length of the CPU-burst time given in millisecond:

Process Burst Time Arrival Time Priority


P1 10 0 3
P2 1 1 1
P3 2 2 3
P4 1 2 4
P5 5 3 2
I. Draw 2 Gantt charts. Illustrate the execution of these processes a non-pre-emptive priority (a highest priority number
implies a higher priority) and a Shortest Remaining Time First (SRTF) scheduling.
II. Find the turnaround time of each process for each of the scheduling algorithms. Also find the average turnaround
time of the system.
III. Find the average waiting time for two algorithms. [6+2+2]

--------------------------------------------------------------------The End-----------------------------------------------------------------

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy