.

Printed Page:-04 Subject Code:- ACSE0403B

Roll. No:

NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY, GREATER NOIDA

(An Autonomous Institute Affiliated to AKTU, Lucknow)
B.Tech
SEM: IV - THEORY EXAMINATION (20.....-
2022-202320.....)
Subject: Operating Systems
Time: 3 Hours Max. Marks: 100
General Instructions:
IMP: Verify that you have received the question paper with the correct course, code, branch etc.
1. This Question paper comprises of three Sections -A, B, & C. It consists of Multiple Choice
Questions (MCQ’s) & Subjective type questions.

3. Illustrate your answers with neat sketches wherever necessary.

n e
2. Maximum marks for each question are indicated on right -hand side of each question.

4. Assume suitable data if necessary.

5. Preferably, write the answers in sequential order.
Ju
evaluated/checked.
n _
6. No sheet should be left blank. Any written material after a blank sheet will not be

1. Attempt all parts:-

Ja
SECTION A 20

1-a.
3
Which of the following operating systems supports only real-time applications?

2
1
(CO1)

(a) Batch OS
2 -
0 2
(b) Distributed OS
(c) Real-time OS

1-b.
2
(d) Network OS

Which of the following can implement the message passing and control? (CO1) 1

(a) application software

(b) operating system
(c) software
(d) kernel

1-c. The portion of the process scheduler in an operating system that dispatches 1
processes is concerned with (CO2)

(a) assigning ready processes to CPU

.
Page 1 of 4
 .
(b) assigning ready processes to waiting queue
(c) assigning running processes to blocked queue
(d) all of the mentioned

1-d. Selects the statements which are true according to (i)starvation may be caused 1
by Shortest remaining time first scheduling (CO2)
ii. starvation may be caused by Preemptive scheduling
iii. in terms of response time, Round robin is better than FCFS

(a) i only
(b) ii and iii only
(c) i and iii only
(d) i and ii and iii

1-e. The following conditions must be satisfied to solve the critical section problem? 1
(CO3)

(a) Mutual Exclusion

n e
(b) Progress

Ju
(c) Bounded Waiting
(d) All Of The Mentioned

n _
1-f.

(a) mutex & counting

Ja
What are the two kinds of semaphores (CO3) 1

(b) binary & counting

2 3
2
(d) decimal & binary
-
(c) counting & decimal

1-g.

0 2
Which of the following is NOT an advantage of using shared, dynamically linked
libraries as opposed to using statically linked libraries ? (CO4)
1

2
(a) Smaller sizes of executable files
(b) Lesser overall page fault rate in the system
(c) Faster program start-up
(d) Existing programs need not be re-linked to take advantage of newer
versions of libraries

1-h. State true of false. I) With paging, each process is divided into relatively small, 1
fixed-size pages.ii) Segmentation provides for the use of pieces of varying size.
(CO4)

(a) True, False

(b) True, True

.
Page 2 of 4
 .
(c) False, True
(d) False, False

1-i. Storage devices like tertiary storage, magnetic disk comes under (CO5) 1

(a) Volatile storage

(b) Non-volatile storage
(c) Dynamic storage
(d) Stable storage

1-j. File management function of the operating system includes i) File creation and 1
deletion ii) Disk scheduling iii) Directory creation iv)Mapping file in secondary
storage (CO5)

(a) i, ii and iii only

(b) i, iii and iv only
(c) ii, iii and iv only
(d) All i, ii, iii and iv
n e
2. Attempt all parts:-

Ju
2.a.

2.b.
Explain simple batch system? (CO1)

n _
Give difference between Job-scheduling & CPU-scheduling. (CO2)
2

2.c.

2.d.
Define Multiprocessor Scheduling. (CO3)

What is Internal Fragmentation? (CO4) Ja 2

3
-2
2.e. Explain RAID. (CO5) 2

SECTION B 30

2 2
3. Answer any five of the following:-

3-a.

3-b.
(CO1)

2 0
What are system calls? Explain the difference categories of the system calls.

Define Process Transition Diagram with the help of a neat diagram. (CO2)
6

3-c. Explain Round Robin scheduling algorithm with example (CO2) 6

3-d. What do you understand by Deadlock? Write necessary conditions for occurring 6
the deadlock in a system. (CO3)

3.e. Elaborate the Bound Buffer problem in detail. (CO3) 6

3.f. State the benefits of Virtual Memory System? (CO4) 6

3.g. What do you understand by file management system? Define file system 6
protection and security. (CO5)

SECTION C 50

.
Page 3 of 4
 .
4. Answer any one of the following:-

4-a. Describe the goal, functions and characteristics of operating system in detail. 10
(CO1)

4-b. Write the importance of kernel in operating system. Differentiate between 10

Monolithic and Microkernel systems in detail. (CO1)

5. Answer any one of the following:-

5-a. Distinguish between i) Scheduler and Dispatcher ii) Multiprogramming and 10

multiprocessing iii) Job scheduling and CPU scheduling (CO2)

5-b. Differentiate between :- i) Preemptive and non preemptive scheduling ii) 10

Process and Thread iii) Lond Term Scheduler and Mid Term Scheduler (CO2)

6. Answer any one of the following:-

6-a. Describe the Bounded - buffer problem and give a solution for the same using 10

6-b.
semaphores. Write the structure of producer and consumer processes. (CO3)

n e
What is critical section? Explain three necessary conditions for critical section 10
problem in detail. (CO3)

Ju
7. Answer any one of the following:-

7-a.
n _
Discuss the advantages and disadvantages of paging and segmentation. (CO4) 10

7-b.

Ja
When do page faults occur? Consider the reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2,
1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults and page fault rate occur for
10

frames? (CO4)

2 3
the FIFO, LRU and optimal replacement algorithms, assuming three, four page

-
8. Answer any one of the following:-

2
8-a.

0 2
Consider a disk with 200 tracks and the queue has random requests from
different processes in the order:
10

2
55, 58, 39, 18, 90, 160, 150, 38, 184 initially arm is at 100. Find the average seek
time using scheduling algorithms given as (i) FIFO, (ii) SSTF, (iii) SCAN, (iv) C-
SCAN (CO5)

8-b. Explain the file allocation methods. (CO5) 10

.
Page 4 of 4