Date o3/224 Time lo: o0 To llooAM

Please write your Ro No. immediately Roll N0.........

First-fern,Examination -March 2020

B.Tech -6th sem
Paper code: ETCS 304 Subject: Opere cing Systems
Time:1 hour 30 min Max Marks:30 Note :

from remaining questions

Q no 1 is compulsory and attempt any two more question
(2*5-10)
Q. no1

(a) Differentiate between multiprogramming and multi tasking.

degrades due to Frequent Context Switching"
(b) Justify the statement"The performance
not satisfy "Bounded Waiting" condition what will
(c) Ifa solution to critical section problem does
be the consequences?
en
memory allocation leads to evtornal
(d) Show how contiguous
(e) Compare various types of page tables.
Q no 2
and 20 bit logical address space. The page size
(a) Let us assume a 24 bit physical address space
number of frames (iii) number of bits to denote page
is of 1 KB. Calculate ( i) number of pages (ii)
maximum amount of internal fragmentation.
number (iv) Number of bits to represent offset. (v) (5)
mutual exclusion. Explain it
algorithm to solven process
(b) Write the pseudo code for Bakery
also (5)

Q no 3
architecture for a real time system. Out of Monolithic
(a) You need to select operating system
Layered Architecture which one will you
kernel architecture, Micro kernel Architecture and
(5)
select and why?
Scheduling algorithm witha quantum of 2
(b) Consider a scenario where OS is using Round Robin
4 processes is given below:
milisecond. The CPUburst time and arrival time of
Arrival time in mili CPU burst time in miliseconds
S.No Process
seconds
3
PO
2 P1 3
5 2
3 P2
P3
Average waiting time ii Average Response time iii
Show Gantt chart and calculate following i. (2+1+1+1=5)
Average turn around tine
Q. no 4
of another
of fragmentation but creates the problem
(a) "Paging solves the problem of one type not? (5)
statement? If yes why, if not why
type of fragmentation" Doyou agree with this
explain its significance. Willthere be a separate
(b) List the contents of Process Control Block and
PCB for each thread?
(5)
 RollNo. ....
(Please write your Roll No. immediately)
Mid-Term Examination
B.TECH. PROGRAMMES (UNDER THE AEGIS OF USICT)
Sixth Semester, May, 2023
Paper Code: ETCS-304
Subject: Operating Systems

Maximum Marks: 30
Time: 1:30 Hrs.

Note: Attempt Q. No. 1 which is compulsorv and any twomore questionsfrom the remaining.

Question 1

1. Compare Parallel systems and Distributed systems.

2. Why page size is always power of 2?
3. Explain the difference between process and thread.
4. What is context switching? (5*2=10)
5. What do you mean by Belady's Anomaly? Explain with example.
Question 2

1. What are schedulers? Explain the role of different types of schedulers. milliseconds.
in
2. Consider the table with 5 processes with their burst and arrival times
Arrival Time
Process Burst Time
P1 6
P2
1
P3
P4 3
4 4
PS
turnaround time for FCFS, SRTF
Draw the Gantt chart and find the average waiting time and average
(4, 6)
and Round Robin(time quantum=2 ms) scheduling algorithms.
Question 3

1. What is external fragmentation? frames with no pages loaded to begin

2. A system uses FIFO policy for page replacement. It has 4 page and then
order accesses the same 100 pages
with. The system first accesses 100 distinct page in some
occur?
but now in reverse order. How many page faults will
resources. Suppose that a newly
3. In demand paging, a page replacement policy is used to manage system
created process has 3 page frames allocated to it, and then generates the page references indicated
below:
ABCBADABCDABACBD
How many page faults would occur with FIFO, LRUand OPTIMAL page replacement? (2,2, 6)

Question 4

1. On a simple paged system, associative registers hold the most active page entries and full page table is
stored in the main memory. If the references satisfied by the associative registers take 100ns and
references through the main memory page table take 180 ns. What must be the hit ratio to be achieved
125 ns?
on effective access time of
2. Write short notes on: (a) PCB (b) Segmentation (c)IPC (4,6)
 Exam Roll No.
(Please write your Exam Roll No.)
END TERM EXAMINATION
SIxTH SEMESTER B.TECH JULY-2023
Subject: Operating Systems
Paper Code: ETCS-304
Maximum Marks:75
Time: 3 Hours
Note: Attempt ive questions in all including. Qno. 1 which is
each untt.
compulsory. Select one question from
(5x5-25]
Q1 Attempt any Five
other
term busy wwaiting? What
(a) What is the meaning of the operating systemn? Can busy
kinds of waiting are there in an
Explain your answer.
waiting be avoided altogether? system? How it is
operating
(b) What is multiprogramming
different from Multiprocessing. Explain.
with the help of suitable
(c) Explain Process Control Block
diagram in detail.
example?
(d) Explain race condition with suitable must be present for a
that
(e) What are the four conditions
deadlock to be possible?
() What are various file attributes?
UNIT-I
Operating Systemn? What are
Q2 (a) Explain the layered approach of [6]
main task of OS?
100K,500K, 200K,300K and 600K (in
(b) Given Memnory Partitions of the first fit, best fit, and worst fit
order), how would each of
212K,417K,112K and 426K (in
algorithms place processes of efficient use of memory?
order)? Which algorithms makethe most [6.5]

physical addresses. (3]

Q3 (a) Explain the difference between logical and [3]
(b) Why are pages sizes always power of 2?
(c) Consider there are 4 frames allocated to a process and the page
reference string is:
7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0, 1,7,0, 1
FIFO and LRU page
Calculate the number of page faults for the
replacement algorithms. [6.5]
UNIT-II

with the CPU burst &

Q4 (a) Consider the following set of processes
arrival time in milliseconds. [6.5]
Arrival Time Burst Time
Process
A 12
B 1 7
9
3 4
4 11
Draw the Gantt chart & find:
P.T.O.

ETCS-304
 [2-]
i Average waiting time for these processes with the Shortest
Remaining Time First, Round Robin (Time quantum 3ms) &
FCFS scheduling algorithm.
Average turnaround time for these processes with the SRTF,
Round Robin & FCFS Algo.
(b) Explain the Dining Philosophers classical IPC problem and its
solution. [6]
Q5 (a) What is thread? What are the differences between user-level
threads and kernel-level threads? Under what circumstances is
one type better than the other? [6]
(b) Explain bakery algorithm. Prove that it satisfy all the three
requirements for critical section problem. (6.5]
UNIT-III
Q6 (a) A disk with 1000 cylinders, numbered 0 to 999, compute the
number of tracks the disk arms must move to satisfy the entire
request in the disk queue. Assume the current request serviced
is at track 345 and head is moving towards track 0.The queue in
FIFO order contains request for the following tracks:
123,874,692,400,475,105,376. Perform the computation for the
following scheduling algorithm [6.5]
(1) FIFO (2) sSTF (3) SCAN (4) C-SCAN (5) LOOK
(b) Explain resource allocation graph. [3]
(c) What is Safe state? Explain with the help of suitable example.[3]
Q7 (a) Explain Bankar's Algorithm including safety algorithm &
resource request algorithm? [6]
(b) Consider the following snapshot of a system [6.5]
Allocation Maximum
Process A B C D A B C D
P1 1 2 0 1 2
P2 1 0 1 7 5
P3 1 3 5 4 2 3 5 6
P4 06 3 2 6 5 2
P5 1 4 6 5 6
Let the available number of resources be given by avail vector as (1,
5, 2, 0). Use banker'salgorithm and answer.
1.Find the contents of the matrix NEED".
2. Is the system in a safe state?
3.If a request from process P1 for (0, 4, 2, 0) arrives, can it be
granted immediately?
UNIT-IV
Q8 (a) Explain various types of file and file access methods? [6.5]
(b) What do you mean by directory structure? Explain various
directory structures with suitable diagram? [6]
Q9 Write short notes on any two: - [6.25x2=12.5]
(a) Logical file system v/s Physical file system
(b) FAT v/s NTFS
(c) Explain various file allocation strategies