Coimbatore Institute of Technology

Department of Artificial Intelligence and Data Science

21AD44- Principles of Computer Systems
MID SEMESTER EXAMINATION – I_RETEST
Name of the Instructor: KR Shanmugapriyaa Course : B.TECH (AI & DS)
A/Y : 2023-2024 SEM : IV
Marks : 60 Marks Date & Time : 02.05.2024 & 2.00 pm - 4.30 pm
Outline the basic functionalities of operating systems, operating system components, various
CO1
types of operating system and system software.
CO2 Understanding of various process synchronization techniques.
CO3 Knowledge in various memory management schemes.
CO4 Understand I/O management and File systems.
CO5 Understand the difference between microprocessor and micro controller.

PART:A (10 X 2 = 20 Marks) CO

Level
Answer all the questions Mapping
A1 A distributed system consists of multiple servers communicating over a CO1 L1
network. State how the distributed system achieves fault tolerance.
A2 List out the various operating system components. CO1 L1
A3 Based on your understanding, summarize the functions of an operating system. CO1 L2
Does the time sharing OS differs from multi programming OS? If answer is
A4 CO1 L4
yes/no, specify the reasons.
In a multi-threaded application, two threads need to access a shared resource
A5 simultaneously. One thread reads from the resource while the other thread CO2 L4
writes to it. Relate the above scenario and define this condition.
A6 Draw the five-state process model in operating systems. CO2 L1
A7 With an example define the term “MUTEX” in operating systems. CO2 L2
A8 Point out the necessary conditions for deadlock. CO2 L2
A9 Illustrate the concept of Swapping in memory management. CO3 L2
A10 Infer the concept of Dynamic Loading CO3 L2
PART:B (4 X 10 = 40 Marks) CO
Level
Answer Any 4 Questions Mapping
B1 Explain in detail about the Evolution of an Operating System. CO1 L2
(OR)
B2 i) Differentiate between user level thread and kernel level thread in operating
systems. (5m) CO1 L2
ii) How could a system be designed to allow a choice of operating systems from
which to boot? What would the bootstrap program need to do? (5m)
B3 Consider the set of processes with arrival time (in milliseconds), CPU burst
time (in milliseconds), and priority (0 is the highest priority) shown below.
None of the processes have I/O burst time.
Processes Arrival Time Burst Time Priority
P1 0 11 2 CO2 L3
P2 5 28 0
P3 12 2 3
P4 2 10 1
P5 9 16 4

Bloom’s Taxonomy: (L1 - Remembering, L2 - Understanding, L3 - Applying, L4 - Analyzing, L5 - Evaluating, L6- Creating)
 Coimbatore Institute of Technology
Department of Artificial Intelligence and Data Science
21AD44- Principles of Computer Systems
MID SEMESTER EXAMINATION – I_RETEST
Draw the Gantt chart and calculate the average waiting time, average
turnaround time for any of the 3 scheduling algorithm.
(OR)
B4 Consider the following set of processes.
Processes Arrival Time Burst Time Priority
P1 0 12 3
P2 5 19 3
P3 8 21 5
P4 11 13 2 CO2 L3
P5 15 15 3
Draw the Gantt chart and calculate the average waiting time and average
turnaround time for each of the scheduling algorithm.
i. FCFS (3m)
ii. Shortest Remaining Time First (3m)
iii. Round robin scheduling (Time quantum = 4 ms) (4m)
B5 i) Apply the same system call interface for both files and devices and give their CO1
advantages and disadvantages of using? (5m) L5
ii) Compare the Multi-Level Queue and Multi-level Feedback (5m) CO2
(OR)
B6 i) Evaluate the various types of system calls with an example for each. (5m) CO1
L5
ii) Explain in detail about Producer-Consumer problem using Semaphore.(5m) CO2
B7 Distinguish Fixed partitioning and Dynamic Partitioning techniques in CO3 L2
memory Management.
(OR)
B8 Explain the basic five requirements of Memory management. CO3 L2

Bloom’s Taxonomy: (L1 - Remembering, L2 - Understanding, L3 - Applying, L4 - Analyzing, L5 - Evaluating, L6- Creating)