ACHARIYA

COLLEGE OF ENGINEERING TECHNOLOGY

(Approved by AICTE New Delhi & Affiliated to Pondicherry University)
An ISO 9001 : 2008 Certified Institution
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

CONTINUOUS ASSESSMENT TEST-II

ACADEMIC YEAR 2023-24
Subject Name: OS Time : 2 Hrs
Subject Code: ADPC406 Max. Marks : 50
Date of Exam:..2024 YEAR / SEM : II/IV

Course Outcomes:
CO3 To understand process management, concurrency and thread introduction.

To understand problems arising due to concurrency and related synchronization based

CO4
solutions.
Knowledge Level: K1-Knowledge, K2-Understand, K3-Apply, K4-Analyze, K5-Synthesis K6 - Evaluate

Q.No Ms CO’s B.L

PART A (10 × 2 = 20 Marks)
Answer all the Questions
1. Define Interrupt. 2 CO3 K1
2. List Goals of Scheduling 2 CO3 K1
3. Application of OS. 2 CO3 K1
4. What is concurrency 2 CO3 K2
5. What is direct execution recap. 2 CO3 K1
6. Define Synchronization 2 CO4 K1
7. List Limitation of software solution 2 CO4 K1
8. Define Atomic Instruction 2 CO4 K1
9. Define Mutexes 2 CO4 K1
10. Define Spinlock 2 CO4 K1

PART B (3× 10 = 30 Marks)

Answer ANY THREE Questions

11. Explain in detail about Process Life cycle. 10 CO3 K1, K2

12. Discuss in detail about Scheduling Algorithms 10 CO3 K2

13. Write about Semaphore 10 CO4 K1

14. Explain in detail about Deadlock 10 CO4 K1

CONTINUOUS ASSESSMENT TEST-II

ACADEMIC YEAR 2023-24
Subject Name: OS Time : 2 Hrs
Subject Code: ADPC406 Max. Marks : 50
 ACHARIYA
COLLEGE OF ENGINEERING TECHNOLOGY
(Approved by AICTE New Delhi & Affiliated to Pondicherry University)
An ISO 9001 : 2008 Certified Institution
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Date of Exam: ..2024 YEAR / SEM : II/IV

Course Outcomes:
CO1 To understand the role, functionality of the layering systems software components

CO2 To understand the design and usage of the OS API and OS services.
Knowledge Level: K1-Knowledge, K2-Understand, K3-Apply, K4-Analyze, K5-Synthesis K6 - Evaluate

Q.No Ms CO’s B.L

PART A (10 × 2 = 20 Marks)
Answer all the Questions
1. Define Interrupt. 2 CO3 K1
2. List Goals of Scheduling 2 CO3 K1
3. Application of OS. 2 CO3 K1
4. What is concurrency 2 CO3 K2
5. What is direct execution recap. 2 CO3 K1
6. Define Synchronization 2 CO4 K1
7. List Limitation of software solution 2 CO4 K1
8. Define Atomic Instruction 2 CO4 K1
9. Define Mutexes 2 CO4 K1
10. Define Spinlock 2 CO4 K1

PART B (3× 10 = 30 Marks)

Answer ANY THREE Questions

11. Explain in detail about Process Life cycle. 10 CO3 K1, K2

12. Discuss in detail about Scheduling Algorithms 10 CO3 K2

13. Write about Semaphore 10 CO4 K1

14. Explain in detail about Deadlock 10 CO4 K1

ANSWER KEY
PART A

1. An interrupt is a signal emitted by a device attached to a computer or from a program within the
computer. It requires the operating system (OS) to stop and figure out what to do next. An interrupt
temporarily stops or terminates a service or a current process.
2. To minimize resource starvation and to ensure fairness amongst the parties utilizing the resources
 ACHARIYA
COLLEGE OF ENGINEERING TECHNOLOGY
(Approved by AICTE New Delhi & Affiliated to Pondicherry University)
An ISO 9001 : 2008 Certified Institution
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE
3. Managing Input-Output unit
Consistent user interface
Multitasking
Platform for Application programs
Security
Error detecting
Control over system performance
4. Concurrency is the ability of an operating system to execute multiple tasks simultaneously or in an
overlapping manner.
5. To make a program run as fast as one might expect, not surprisingly OS developers came up with a
technique, which we call limited direct execution. The “direct execution” part of the idea is
simple: just run the program directly on the CPU
6. When two or more process cooperates with each other, their order of execution must be preserved
otherwise there can be conflicts in their execution and inappropriate outputs can be produced.
A cooperative process is the one which can affect the execution of other process or can be affected
by the execution of other process. Such processes need to be synchronized so that their order of
execution can be guaranteed.

7. i. Any function that a customer desires to have that is not currently in platform specification
ii. It is not a bug, but a feature or function that seems desirable , but is not available for use.
8. It is the operations, which execute without interruption of any other process inbetween their
execution.
9. A mutex is an acronym for mutual exclusion, which is a technique to ensure that only one thread or
process can access a shared resource at a time. A mutex is a type of lock that can be acquired or
released by a thread or process to control the access to the resource.
10. Low level synchronization mechanism suitable primarily for use on shared memory multiprocessor.
PART B
11. Process Life Cycle in Os is one of the five states in which a process can be starting from the time it
has been submitted for execution , till the time ehen it has been executed by the system. Here we will
learn detailed explanation about each states.

12. Preemptive Scheduling: Preemptive scheduling is used when a process switches from running
state to ready state or from the waiting state to the ready state.
Non-Preemptive Scheduling: Non-Preemptive scheduling is used when a process terminates , or
when a process switches from running state to waiting state.
 ACHARIYA
COLLEGE OF ENGINEERING TECHNOLOGY
(Approved by AICTE New Delhi & Affiliated to Pondicherry University)
An ISO 9001 : 2008 Certified Institution
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

First Come First Serve

FCFS considered to be the simplest of all operating system scheduling algorithms. First come first serve
scheduling algorithm states that the process that requests the CPU first is allocated the CPU first and is
implemented by using FIFO queue.
Shortest Job First(SJF)
Shortest job first (SJF) is a scheduling process that selects the waiting process with the smallest
execution time to execute next.
 ACHARIYA
COLLEGE OF ENGINEERING TECHNOLOGY
(Approved by AICTE New Delhi & Affiliated to Pondicherry University)
An ISO 9001 : 2008 Certified Institution
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Longest Job First(LJF)

Longest Job First(LJF) scheduling process is just opposite of shortest job first (SJF), as the name
suggests this algorithm is based upon the fact that the process with the largest burst time is processed first.
Priority Scheduling
Preemptive Priority CPU Scheduling Algorithm is a pre-emptive method of CPU scheduling
algorithm that works based on the priority of a process.
Round Robin
Round Robin is a CPU scheduling algorithm where each process is cyclically assigned a fixed time slot. It
is the preemptive version of First come First Serve CPU Scheduling algorithm . Round Robin CPU
Algorithm generally focuses on Time Sharing technique.
13. Semaphores are integer variables that are used to solve the critical section problem by using two atomic
operations, wait and signal that are used for process synchronization.
Types of Semaphore in OS
There are mainly two types of Semaphores, or two types of signaling integer variables:
1. Binary Semaphores
2. Counting Semaphores

14. The process requests for some resource. OS grant the resource if it is available otherwise let the process
waits. The process uses it and release on the completion. The process requests for some resource. OS
grant the resource if it is available otherwise let the process waits. The process uses it and release on the
completion.
1. Mutual Exclusion
A resource can only be shared in mutually exclusive manner. It implies, if two process cannot use the
same resource at the same time.
2. Hold and Wait
A process waits for some resources while holding another resource at the same time.
3. No preemption
The process which once scheduled will be executed till the completion. No other process can be
scheduled by the scheduler meanwhile.
4. Circular Wait
All the processes must be waiting for the resources in a cyclic manner so that the last process is
waiting for the resource which is being held by the first process.