Scribd
Upload
17 views2 pages

Os 23

The document is an examination paper for B.Tech students at UKA Tarsadia University, covering Operating Systems for Semester 4. It includes various sections with detailed questions on system calls, microkernel structure, process states, multithreading, deadlock prevention, directory structures, disk scheduling algorithms, and memory partitioning. Students are instructed to attempt all questions, make assumptions, and include diagrams where necessary.

Uploaded by

Nik Patil
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
17 views2 pages

Os 23

The document is an examination paper for B.Tech students at UKA Tarsadia University, covering Operating Systems for Semester 4. It includes various sections with detailed questions on system calls, microkernel structure, process states, multithreading, deadlock prevention, directory structures, disk scheduling algorithms, and memory partitioning. Students are instructed to attempt all questions, make assumptions, and include diagrams where necessary.

Uploaded by

Nik Patil
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

UKA TARSADIA UNIVERSITY

B.Tech CE (Software Engineering)/B.Tech CSE/B.Tech CSE (Cloud Computing) ( Semester 4 )


CE4016(2022-23)
Operating Systems
Date :19/04/2023 Time :9:30AM- 12:30PM
Max. Marks:60
Instructions :
1. Attempt all questions.
2. Write each section in a separate answer book.
3. Make suitable assumptions wherever necessary.
4. Draw diagrams/figures whenever necessary.
5. Figures to the right indicate full marks allocated to that question.
6. Follow usual meaning of notations/abbreviations.
SECTION - 1
Q 1 Answer the following in Detail (Any 2) [6]
I) Explain System call. Describe any two system calls in detail.

II) Describe Microkernel Operating System structure.

III) What is operating system? Explain various functions and objectives.

Q 2 Answer the following in detail. (Any 2) [12]


I) Explain various state process with diagram.

II) What is the need of thread? Describe any four advantages of multithreading model.

III) Consider the following set of processes,

Calculate the average waiting time and turnaround time for the following algorithm.
i)SJF with pre-emptive algorithm ii)RR with time slice 2.

Q 3 Answer the following (Any 3) [12]


I) Explain how deadlock can be prevented.

II) Consider the following situation of system


Answer the following questions using Banker's algorithm.
i) What is the content of need matrix.
ii) Is the system in safe state? Give the safe sequence.
iii) If the request from process P1 arrives for (0, 4, 2, 0) can it be granted immediately?

III) What is mutual exclusion? How the semaphore is used to solve the critical section problem.

IV) Write short note on message passing.

SECTION - 2
Q 4 Answer the following in Detail (Any 2) [6]
I) Explain various directory structure in detail.

II) Explain contiguous allocation and non-contiguous allocation method.

III) Describe file system in OS.

Q 5 Answer the following in detail. (Any 2) [12]


I) Consider a typical disk that rotates at 15000 rotations per minute (RPM) and has a transfer rate of 50 ×
106 bytes/sec. If the average seek time of the disk is twice the average rotational delay and the
controller’s transfer time is 10 times the disk transfer time,What the average time (in milliseconds) to
read or write a 512-byte sector of the disk ?

II) Explain in detail about DMA..

III) Suppose a disk drive has 200 cylinders. The drive is currently serving request at 50, the queue of
pending request is 82,170,43,140,24,16,190 Starting from the current head position what is the total
distance that the disk arm moves to satisfy the entire pending request for each of the following disk
scheduling algorithm SCAN, C-SCAN, LOOK, C-LOOK

Q 6 Answer the following in detail. (Any 2) [12]


I) Given six Partition of 300KB, 600KB, 350KB, 200KB, 750KB and 125KB(in order), how would the first-fit,
best-fit and worst-fit algorithms places processes of size 115 KB, 500KB, 358KB, 200KB and 375KB(in
order)? Which algorithm is efficient for the use of memory?

II) Write in detail about memory partitioning with fixed and dynamic partitioning with example.

III) Consider the Pages referenced by the CPU in the order are 6, 7, 8, 9, 6, 7, 1, 6, 7, 8, 9, 1. Find out the
page faults occur in following algorithm.
i) Optical Page replacement
ii) FIFO
iii) LRU

You might also like