SET 03

Reg. No. :

IFET COLLEGE OF ENGINEERING

(An Autonomous Institution)
MODEL EXAMINATION
DEPARTMENT OF AI&DS/AI&ML

SUB CODE: 19UCSPC402 MAX MARKS: 100

SUB NAME: OPERATING SYSTEM DURATION: 180Min
YEAR/
DATE: II/III
SEMESTER:
TIME MANAGEMENT CHART
Part Question No.’s Time allotted
A 1-10 1.15 pm-1.45 pm
11 1.45 pm-2.15 pm
12 2.15 pm-2.45 pm
B 13 2.45 pm-3.15 pm
14 3.15 pm-3.45 pm
15 3.45 pm-4.15 pm

PART-A (10¿ 2=20)

Answer All Questions
(Each answer should have minimum 7 lines)
1. Can you assess the effectiveness and efficiency of separating the fork() and exec() S CO1
calls in operating system programming, highlighting the advantages and potential
drawbacks of this approach?"
2. Compare tightly coupled systems and loosely coupled systems U CO1
3. Define the term dispatch latency R CO2
4. Provide two programming examples of multithreading giving improved performance A CO2
over a single-threaded solution.
5. Analyze why paging used and what is the purpose of paging the page tables. U CO3
6. Define thrashing. Identify the techniques used to limit the effects of thrashing R CO3
7. Why it is important to scale up system bus and device speed as CPU speed increases? S CO4
8. Identify various security problems in the situation of multiprogramming and time- A CO4
sharing environment where several users share the system simultaneously?
9. Write a brief note on system utilities. U CO5
10. Construct the steps to installation and uninstallation of applications using RPM A CO5
command.

PART-B (5¿ 16=80)

Answer All Questions
(Each answer should be written for minimum 6 pages with minimum 25 lines
per page)
11. A Describe in detail about overview, Operating System Objectives and R (16) CO1
Functions and also sketch the structure of Operating system in detail.
(OR)
11. B Explain about process creation, process termination and inter process U (16) CO1
communication.

12. A Consider the following set of processes, with the length of the CPU burst A (16) CO2
time given in milliseconds:
Process Burst Priority Arrival
Time time
P1 5 2 0
P2 1 1 2
P3 8 3 4
P4 4 4 6
P5 5 2 8

a. Draw four Gantt charts that illustrate the execution of these processes
using the following scheduling algorithms: FCFS, SJF, non-
preemptive priority (a smaller priority number implies a higher
priority), and RR (quantum = 1).
b. What is the turnaround time of each process for each of the
scheduling algorithms in part a?
c. What is the waiting time of each process for each of these scheduling
algorithms?
d. Which of the algorithms results in the minimum average waiting time
(over all processes)
(OR)
12. Bii) Illustrate with examples of deadlock-prone situations in real-world A (08) CO2
applications?
12. B i) Explain in detail about deadlock? What are the schemes available to R (08) CO2
handle deadlock?
13. A Write a detailed note on memory management, which makes the computer U (16) CO3
system convenient for user. With a neat sketch, explain how logical
address is translated into physical address using paging mechanism.
(OR)
13. B I. Explain the causes, effects and recovery of Thrashing. R (6) CO3
II. Write short note on memory mapped files. R (5) CO3
III. Explain about Allocating Kernel Memory in detail. U (5) CO3
14. A Explain the security mechanism and discuss briefly on how buffer- S (16) CO4
overflow attacks can be avoided by adopting a better programming
methodology or by using special hardware support.
(OR)
14. B i) Consider the following I/O scenarios on a single-user PC: A (08) CO4
a. A mouse used with a graphical user interface
b. A tape drive on a multitasking operating system (with no device pre
allocation available)
c. A disk drive containing user files
d. A graphics card with direct bus connection, accessible through
e. memory-mapped I/O
f. For each of these scenarios, would you design the operating system
to use buffering, spooling, caching, or a combination? Would you
use polled I/O or interrupt-driven I/O? Give reasons for your
 choices.
14. B ii) Write in detail about streams and its performance. R (08) CO4
15. A Explain why Linux runs on a variety of hardware platforms. What steps U (16) CO5
must the Linux developers take to ensure that the system is portable to
different processors and memory management architectures, and to
minimize the amount of architecture-specific kernel code?
(OR)
15. B Demonstrate the procedure for Installation of Linux operating system. A (16) CO5

Mapping of Course Outcomes (CO) to Programme Outcomes (PO)

Mapping with Programme outcomes

Course
Outcom
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO 11 PO 12
es

C204.1 3 3 1 - - - - - - - - -
C204.2 3 2 - - - - - - - - - -
C204.3 2 3 2 - - - - - - - - -
C204.4 2 3 2 - - - - - - - - -
C204.5 2 3 - - - - - - - - - -
C204:
OS 2 3 2 - - - - - - - - -

3- Strong Correlation, 2 – Medium Correlation, 1- Weak Correlation

------All the Best-----

Subject Handler Course Coordinator HoD