Printed Pages:2 Sub Code: RCS401

Paper Id: 110255 Roll No.

B.TECH
(SEM IV) THEORY EXAMINATION 2018-19
Operating System
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
2. Any special paper specific instruction.

SECTION A

1. Attempt all questions in brief. 2 x 7 = 14

a. Describe the typical elements of the process control block
b. What are the various scheduling criteria for CPU scheduling?
c. What is the main function of the memory-management unit?
d. Define seek time and latency time.
e. Define SCAN and C-SCAN scheduling algorithms.
1. What is a safe state and an unsafe state?
f. Explain the logical address space and physical address space
diagrammatically.
www.aktuonline.com

SECTION B

2. Attempt any three of the following: 7 x 3 = 21

a. Define Process. Explain various steps involved in change of a process state
with neat transition diagram.
b. Explain Batch operating system with example.
c. What is a Critical Section problem? Give the conditions that a solution to the
critical section problem must satisfy.
d. Illustrate the page-replacement algorithms
(i) FIFO
(ii) Optimal Page Replacement
use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1 for a
memory with three frames.
e. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is
currently serving the request at cylinder 143,and the previous request was at
cylinder 125.The status of the queue is as follows
86, 1470, 913, 1774,948,1509,1022,1750,130
What is the total distance (in cylinders) that the disk arm moves to satisfy the
entire pending request for each of the following disk-scheduling algorithms?
(i) SSTF
(ii) FCFS

SECTION C
3. Attempt any one part of the following: 7x1=7
(a) What is an Operating system? Describe the Operating-System Functions
(b) Write about monolithic kernel, layered, and microkernel structures of
operating systems.

http://www.aktuonline.com
 Printed Pages:2 Sub Code: RCS401
4. Attempt any one part of the following: 7x1=7
(a) Explain what semaphores are, their usage, implementation given to avoid
busy waiting and binary semaphores.
(b) What is Producer Consumer problem? How it can illustrate the classical
problem of synchronization? Explain.
5. Attempt any one part of the following: 7x1=7
(a) Consider the following process:

Process Arrival Burst

Time Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
What is the average waiting and turn around time for these process with
(i) FCFS Scheduling
(ii) Preemptive SJF Scheduling

(b) Consider the following snapshot of a system:

Allocated Maximum Available
Process R1 R2 R3 R1 R2 R3 R1 R2 R3
www.aktuonline.com

P1 2 2 3 3 6 8 7 7 10
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4
Answer the following questions using the banker’s algorithm:
1) What is the content of the matrix need?
2) Is the system in a safe state?

6. Attempt any one part of the following: 7x1=7

(a) Explain Paging with example. Differentiate Paging and Segmentation.
(b) Explain the difference between External fragmentation and Internal
fragmentation. How to solve the fragmentation problem using paging.
7. Attempt any one part of the following: 7x1=7
(a) What are files and explain the access methods for files.
(b) Write short notes on :
i) File system protection and security and
ii) Linked File allocation methods

http://www.aktuonline.com
 Printed Page: 1 of 2
Subject Code: KCS401
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM IV) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS

Time: 3 Hours Total Marks: 100

Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A

1. Attempt all questions in brief. 2*10 = 20

Q.no Questions Marks CO
(a) Define Operating system and mention its major functions. 2 2
(b) Briefly define the term Real Time Operating System. 2 1
(c) What do you mean by Concurrent Processes? 2 2
(d) Define Seek time and Latency time. 2 1
(e) What do we need Scheduling? 2 3
(f) What are the Performance Criteria in CPU Scheduling? 2 3
(g) Explain the Logical address space and Physical address 2 space 4
diagrammatically.
(h) Explain in brief about the Multiprogramming with fixed partitions. 2 4
(i) What do you mean by the safe state and an unsafe state? 2 5
(j) What do you mean by the I/O Buffering? 2 5

SECTION B

2. Attempt any three of the following: 10*3 = 30

Q.no Questions Marks CO
(a) Explain in detail about the File system protection and security. 10 5
(b) Explain in detail about the Mutual Exclusion and Critical 10 Section2
Problem.
(c) Explain in detail about the Process Control Block (PCB) 10 in CPU3
Scheduling.
(d) Explain in detail about the Disk storage and Disk scheduling. 10 4
(e) Explain in detail about the Multiuser Systems and Multithreaded 10 1
Systems.

SECTION C
3. Attempt any one part of the following: 10*1 = 10
Q.no Questions Marks CO
(a) Write short notes on following. 10 5
i) File system protection and security and
ii) Linked File allocation methods
(b) Explain in detail about the Dining Philosopher Problem. 10 2
 Printed Page: 2 of 2
Subject Code: KCS401
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM IV) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS

4. Attempt any one part of the following: 10 *1 = 10

Q.no Questions Marks CO
(a) Explain in detail about the Operating System services. 10 1
(b) Explain in detail about the Threads and their management. 10 3

5. Attempt any one part of the following: 10*1 = 10

Q.no Questions Marks CO
(a) Explain about the concept of File concept. Define in detail about the 10 4
File organization and access mechanism.
(b) A hard disk having 2000 cylinders, numbered from 0 to 1999. the 10 5
drive is currently serving the request at cylinder 143,and the previous
request was at cylinder 125.The status of the queue is as follows
86, 1470, 913, 1774,948,1509,1022,1750,130
What is the total distance (in cylinders) that the disk arm moves to
satisfy the entire pending request for each of the following disk-
scheduling algorithms?
(i) SSTF
(ii) FCFS

6. Attempt any one part of the following: 10*1 = 10

Q.no Questions Marks CO
(a) Explain in detail about the Inter Process Communication models and 10 2
Schemes.
(b) Explain in detail about the Monolithic and Microkernel Systems. 10 1

7. Attempt any one part of the following: 10*1 = 10

Q.no Questions Marks CO
(a) Explain in detail about the Deadlock System model and Deadlock 10 3
characterization.
(b) Illustrate the following page-replacement algorithms. 10 4
i) FIFO
ii) Optimal Page Replacement
Use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1
for a memory with three frames.
 Printed Page: 1 of 2
Subject Code: KCS401
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM IV) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS

Time: 3 Hours Total Marks: 100

Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A

1. Attempt all questions in brief. 2*10 = 20

Q.no Questions Marks CO
(a) Define Operating system and mention its major functions. 2 2
(b) Briefly define the term Real Time Operating System. 2 1
(c) What do you mean by Concurrent Processes? 2 2
(d) Define Seek time and Latency time. 2 1
(e) What do we need Scheduling? 2 3
(f) What are the Performance Criteria in CPU Scheduling? 2 3
(g) Explain the Logical address space and Physical address 2 space 4
diagrammatically.
(h) Explain in brief about the Multiprogramming with fixed partitions. 2 4
(i) What do you mean by the safe state and an unsafe state? 2 5
(j) What do you mean by the I/O Buffering? 2 5

SECTION B

2. Attempt any three of the following: 10*3 = 30

Q.no Questions Marks CO
(a) Explain in detail about the File system protection and security. 10 5
(b) Explain in detail about the Mutual Exclusion and Critical 10 Section2
Problem.
(c) Explain in detail about the Process Control Block (PCB) 10 in CPU3
Scheduling.
(d) Explain in detail about the Disk storage and Disk scheduling. 10 4
(e) Explain in detail about the Multiuser Systems and Multithreaded 10 1
Systems.

SECTION C
3. Attempt any one part of the following: 10*1 = 10
Q.no Questions Marks CO
(a) Write short notes on following. 10 5
i) File system protection and security and
ii) Linked File allocation methods
(b) Explain in detail about the Dining Philosopher Problem. 10 2
 Printed Page: 2 of 2
Subject Code: KCS401
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM IV) THEORY EXAMINATION 2021-22
OPERATING SYSTEMS

4. Attempt any one part of the following: 10 *1 = 10

Q.no Questions Marks CO
(a) Explain in detail about the Operating System services. 10 1
(b) Explain in detail about the Threads and their management. 10 3

5. Attempt any one part of the following: 10*1 = 10

Q.no Questions Marks CO
(a) Explain about the concept of File concept. Define in detail about the 10 4
File organization and access mechanism.
(b) A hard disk having 2000 cylinders, numbered from 0 to 1999. the 10 5
drive is currently serving the request at cylinder 143,and the previous
request was at cylinder 125.The status of the queue is as follows
86, 1470, 913, 1774,948,1509,1022,1750,130
What is the total distance (in cylinders) that the disk arm moves to
satisfy the entire pending request for each of the following disk-
scheduling algorithms?
(i) SSTF
(ii) FCFS

6. Attempt any one part of the following: 10*1 = 10

Q.no Questions Marks CO
(a) Explain in detail about the Inter Process Communication models and 10 2
Schemes.
(b) Explain in detail about the Monolithic and Microkernel Systems. 10 1

7. Attempt any one part of the following: 10*1 = 10

Q.no Questions Marks CO
(a) Explain in detail about the Deadlock System model and Deadlock 10 3
characterization.
(b) Illustrate the following page-replacement algorithms. 10 4
i) FIFO
ii) Optimal Page Replacement
Use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1
for a memory with three frames.
Printed Pages:03 Sub Code:KCS-401
Paper Id: 238341 Roll No.

B.TECH.
(SEM IV) THEORY EXAMINATION 2022-23
OPERATING SYSTEMS
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
(a) Define two main functions of an operating system.
(b) Explain the principal advantages of multiprogramming.
(c) Define the term busy waiting.
(d) Define semaphore and its types.
(e) Explain starvation problem and its solution.
(f) Explain internal and external fragmentation.
(g) Explain thrashing and locality of reference.
(h) Distinguish between physical and logical address space of a process.
(i) Explain various operations associated with a file.
90

2
(j) Explain tree level directory structure.

13
_2
SECTION B

2.
P2

2. Attempt any three of the following: 10x3=30

24
(a) Explain the following terms in detail:
3E

5.
(i) Multiprocessor operating system

.5
(ii) Real time system
P2

(iii) Time sharing system

17
Q

(b) For the following processes, draw Gantt chart to illustrate the execution using,
|1
(i) Preemptive priority scheduling
(ii) Non-Preemptive priority scheduling.
6

Also, Calculate average waiting time and average turnaround time.

:2

(Assumption: A larger priority number has higher priority.)

26

Process Arrival Time Burst Time Priority

:
13

A 0 5 4
B 2 4 2
3

C 2 2 6
02

D 4 4 3
-2

(c) Consider the given snapshot of a system with five processes (P0,P1,P2,P3,P4) and three
08

resources (A,B,C).
Allocation MAX Available
0-

Process/Resource A B C A B C A B C
|1

P0 1 1 2 4 3 3 2 1 0
P1 2 1 2 3 2 2
P2 4 0 1 9 0 2
P3 0 2 0 7 5 3
P4 1 1 2 11 2 3

(i) Calculate the content of Need Matrix.

(ii) Apply safety algorithm and check the current system is in safe state or not.
(iii) If the request from process P1 arrives for (1,1,0), can the request be granted
immediately?

QP23EP2_290 | 10-08-2023 13:26:26 | 117.55.242.132

 (d) Define process and process control block. Also, describe process state transition
diagram in detail.
(e) Explain the concept of paging. Also, explain paging hardware support using TLB with
suitable diagram

SECTION C
3. Attempt any one part of the following: 10x1=10
(a) Explain the term RAID and its characteristics. Also, explain various RAID levels with
their advantages and disadvantages.
(b) Explain the concept of file system management. Also, explain various file allocation and
file access mechanisms in details.

4. Attempt any one part of the following: 10x1=10

(a) Explain producer consumer problem and its solution using semaphore.
(b) Explain dinning philosopher problem and its solution using semaphore.

5. Attempt any one part of the following: 10x1=10

(a) Explain the concept of demand paging. Consider the given references to the following
pages by a program:
0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3
90
How many pages faults will occur if the program has three-page frames available to it

2
13
and uses:
_2
(i) FIFO replacement

2.
(ii) LRU replacement
P2

24
(iii) Optimal replacement
(b) Explain the terms hit ratio and miss ratio. On a simple paged system, associative registers
3E

5.
hold the most active page entries and the full-page table is stored in main memory. If

.5
P2

references satisfied by associative registers take 100ns, and references through main

17
memory page table takes 180 ns, what must the hit ratio be to achieve an effective access
Q

time of 125 ns?

|1
6. Attempt any one part of the following: 10x1=10
6
:2

(a) Explain the following terms:

26

(i) Multilevel feedback Queue Scheduling

(ii) Fixed portioning vs. variable partitioning
:
13

(b) Suppose the following disk request sequence (track numbers) for a disk with 100 tracks
is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W
3

head is on track 49. Calculate the net head movement using:

02

(i) SSTF
(ii) SCAN
-2

(iii) CSCAN
08

(iv) LOOK
0-

7. Attempt any one part of the following: 10x1=10

|1

(a) Explain Deadlock and necessary conditions for deadlock. Also, Explain resource
allocation graph with suitable diagram.
(b) Explain the followings:
(i) Buffering
(ii) Polling
(iii) Direct Memory Access (DMA)

QP23EP2_290 | 10-08-2023 13:26:26 | 117.55.242.132

 Printed Pages: 02 Sub Code: NCS401

Paper Id: 110247 Roll No.

B. TECH.
(SEM IV) THEORY EXAMINATION 2018-19
OPERATING SYSTEM
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

a. What do you mean by multitasking?
b. Define kernel and names of type of kernel.
c. Explain critical region?
d. Write a short note on interprocess communication.
e. What is process control block?
f. Define scheduling with example.
g. What do you mean by memory management?
h. Define Paging?
i. Explain RAID?
www.aktuonline.com

j. Describe in term Directory system.

SECTION B

2. Attempt any three of the following: 10x3=30

a. Explain OS? Define the services provided by the operating system.

b. Describe the Producer-Consumer problem with its suitable solution.
c. Differentiate between user thread and kernel thread. What is thread cancellation?
d. What are the necessary conditions to hold a deadlock in a system?
e. Explain the difference between internal and external fragmentation.

SECTION C
3. Attempt any one part of the following: 10x1= 10
a. Discuss the difference between a time-sharing system and real time system.
b. What do you understand by system call? List and explain four system calls used for
process management.

4. Attempt any one part of the following: 10x1= 10

a. Define semaphore. Give a scheme for implementation of semaphore primitives.
b. Explain Dining Philosopher problem with its suitable solution.

5. Attempt any one part of the following: 10x1=10

a. Consider the set of processes given in the table and the following scheduling
algorithms:
i. Round Robin (Quantum=2)
ii. SJF
Page 1 of 2
http://www.aktuonline.com
 Printed Pages: 02 Sub Code: NCS401

Draw the Gantt chart and find the average waiting time and turn-around time for the
algorithms.
Process ID Arrival Time Execution Time
A 0 4
B 2 7
C 3 3
D 3.5 3
E 4 5
b. Explain the various CPU scheduling techniques with Gantt charts clearly as
indicated by (process name, arrival time, process time) for the following (A,0,4),
(B,2,7), (C,3,2) and (D,2,2) for FCFS and SRTF.

6. Attempt any one part of the following: 10x1=10

a. Write and explain Banker’s algorithm for avoidance of deadlock.
b. Differentiate between Deadlock and Starvation in detail.

7. Attempt any one part of the following: 10x1=10

a. Given memory partition of 100 K, 500 K, 200 K, 300 K, and 600 K (in order) how
would each of the first-fit, best-fit and worst-fit algorithms place processes of 212
K, 417 K, 112 K, and 426 K (in order)? Which algorithm makes the most efficient
www.aktuonline.com

use of memory?
b. Define virtual memory concepts and also discuss replacement algorithms in brief.

Page 2 of 2
http://www.aktuonline.com