UNIT WISE QUESTION BANK (2MARK QUESTIONS – 20, 13/15-MARK QUESTIONS – 12)

UNIT - I

1 What is an Operating system? 2 CO-1 K-1

An operating system is a program that manages the computer hardware. It also
providesa basis for application programs and act as an intermediary between a
user of a computer and the computer hardware. It controls and coordinates the
use of the hardware among the various application programs for the various
users.
2 What are the five major categories of System Calls? 2 CO-1 K-1
Process Control
File-management
Device-management
Information maintenance
Communications
3 What are Operating Services? 2 CO-1 K-1
Normally, an operating system provides certain services to programs and to
the users of those programs. Some of them are:
Program Execution.
I/O operations
File-system
manipulation
Communications
Error Detection
5 What is System Programs? 2 CO-1 K-1
System programs provide a convenient environment for program development
and execution. Some of these programs are user interfaces to system calls and
others are more complex. Some of them are:
File Management
Status Information
File modification
Programming Language support Program loading,
Execution and communication.
6 What is meant by distributed systems? 2 CO-1 K-1
A distributed system is basically a collection of autonomous computer systems
which co-operate with one another through their h/w and s/w interconnections.
7 What is meant by the state of the process? 2 CO-1 K-1
The state of the process is defined in part by the current activity of that
process. Each process may be in one of the following states.
New: The process is being created.
Running: Instruction are being executed
Waiting: The process is waiting for some event to occur.
Ready: The process is waiting to be assigned to a processor
Terminated: The process has finished execution
8 Define boot starp program 2 CO-1 K-1
Typically stored in ROM or EPROM, generally known as firmware
o Initializes all aspects of system
o Loads operating system kernel and starts execution
9 what are the four distinct actions that machine instruction can specify? 2 CO-1 K-1
Processor – Memory
Processor –I/O
Data Processing
Control
10 How are multiple interrupt dealt with? 2 CO-1 K-1
Two approaches can be taken to dealing with interrupts  Disabled Interrupt –
Processor ignores any new interrupt request signal.  Define Priority for
interrupt – It allows an interrupt of higher priority.
11 What is the distinction b/w spatial locality & temporal locality? 2 CO-1 K-1
Temporal locality refers to the reuse of specific data and/or resources within
relatively small time durations. Spatial locality refers to the use of data
elements within relatively close storage locations. Sequential locality, a special
case of spatial locality, occurs when data elements are arranged and accessed
linearly, e.g., traversing the elements in a one-dimensional array.
12 Explain interrupt handling 2 CO-1 K-1
The OS preserves the state of the CPU by storing registers and the program
counter
 Determines which type of interrupt has occurred:
o polling
 The interrupt controller polls (send a signal out to) each device to
determine which one made the request
o vectored interrupt system
 Separate segments of code determine what action should be taken for each
type of
13 What are the 3 objective of an OS Design? 2 CO-1 K-1
Convenience – An OS makes a computer more convenient to use
Efficiency -- An OS allows the system resources to be used in efficient
manner
Ability to Evolve – An OS Constructed in such a way as to permit the
effective development, testing & introducing new function
14 Define cache memory 2 CO-1 K-1
Cache Memory is a special very high-speed memory. It is used to speed up
and synchronizing with high-speed CPU. ... Cache memory is used to reduce
the average time to access data from the Main memory. The cache is a smaller
and faster memory which stores copies of the data from frequently used main
memory locations.
15 What is bootstrap program? 2 CO-1 K-1
A bootstrap program is the first code that is executed when the computer
system is started.
16 Sate Direct memory access 2 CO-1 K-1
Typically used for I/O devices that generate data in blocks, or generate data
fast
Device controller transfers blocks of data from buffer storage directly to main
memory without CPU intervention
Only one interrupt is generated per block, rather than the one interrupt per
byte.
17 List the various state of process. 2 CO-1 K-1
New, wait, run, terminate
18 What is meant by Process -ID? 2 CO-1 K-1
Each process has a unique identifier. PID’s are used to specify processes to the
operating system when an application makes a system call to signal, modify or
wait for another process.
19 What are system services? 2 CO-1 K-1
For ensuring the efficient operation of the system itself via resource sharing
o Resource allocation - When multiple users or multiple jobs running
concurrently, resources must be allocated to each of them
 Many types of resources - CPU cycles, main memory, file storage, I/O
devices.
o Accounting - To keep track of which users use how much and what kinds of
computer resources
o Protection and security - The owners of information stored in a multiuser or
networked computer system may want to control use of that information,
concurrent processes should not interfere with each other
 Protection involves ensuring that all access to system resources

20 What is the kernel? 2 CO1 K!

A Kernel is the central part of an operating system. It manages the operations
of the computer and the hardware, most notably memory and CPU time. ... A
micro kernel, which only contains basic functionality; A monolithic kernel,
which contains many device drivers.

1 Explain virtualization in operating system CO1 K2

2 Explain the various types of System calls with an example for each. CO1 K2

3 Explain system calls in OS in detail CO1 K2

4 Difference between systemtric and asymmetric multi processing system CO1 K2
5 List out the functions and components of operating system CO1 K2
6 Difference between modular kernel approach similar to the layered approaches CO1 K2
7 Explain the various memory hierarchies with neat block diagram CO1 K2

8 Explain the evaluation of operating system in detail CO1 K2

9 Explain the types of system calls in detail CO1 K2
10 Explain the difference between multicore and multi processor system in detail CO1 K2
11 With neat diagrm ,explain DMA in detail CO1 K2
12 Explqin the objectives and functions of operating systems CO1 K2
13 Discuss in detail about various structure of operating systems CO1 K3
14 Discuss the brief history of the generation of Operating system CO1 K2
15 Discuss about the volatile memory and solid state memories CO1 K2
 UNIT – II

PART A – (10 x 2 = 20 marks) CO KL

1. Define preemptive and non-preemptive scheduling. CO2 K1
There are two types of scheduling: preemptive scheduling and non-preemptive
scheduling. Preemptive scheduling allows a running process to be interrupted by a
high priority process, whereas in non-preemptive scheduling, any new process has to
wait until the running process finishes its CPU cycle
2. What is process scheduling? CO2 K1

Process Scheduling is an OS task that schedules processes of different states like

ready, waiting, and running. Process scheduling allows OS to allocate a time interval
of CPU execution for each process. Another important reason for using a process
scheduling system is that it keeps the CPU busy all the time.
3. What are the 3 different types of scheduling queues? CO2 K1
Job Queue: As process enters the system they are put into job queue.
Ready Queue: The processes that are residing in the main memory and are ready and
waiting to execute are kept in the queue
Device Queue: The list of processes waiting for particular I/O device is called a
device queue
4. Define FCFS scheduling CO2 K1
First in, first out (FIFO), also known as first come, first served (FCFS), is the
simplest scheduling algorithm. FIFO simply queues processes in the order that they
arrive in the ready queue.
In this, the process that comes first will be executed first and next process starts only
after the previous gets fully executed.
Here we are considering that arrival time for all processes is 0.
5. Under What circumstances CPU scheduling decision takes place. CO2 K1
(1) When a process switches from running state to waiting state
(2) When a process switches from running state to ready state
. (3) When a process switches from running state to waiting state to ready state
(4) When a process terminates.
6. What are the various scheduling criteria for CPU scheduling? CO2 K1
The various scheduling criteria are
CPU utilization
Throughput
Turnaround time
Waiting time
Response time
7. Define deadlock. CO2 K1
A deadlock is a situation in which more than one process is blocked because it is
 holding a
resource and also requires some resource that is acquired by some other process.
8. Write the 3 ways to deal the deadlock problem. CO2 K1
Deadlock avoidance
Deadlock prevention
Recovery.
9. Define context switching and semaphore. CO2 K1
A context switch is the process of storing the state of a process or thread, so that it
can be restored
and resume execution at a later point, and then restoring a different, previously
saved, state.
10. Define semaphore. CO2 K1
A semaphore is a variable or abstract data type used to control access to a common
resource by
multiple threads and avoid critical section problems in a concurrent system such as a
multitasking
operating system.
11 What is the Critical-Section problem in operating systems? CO2 K1
The Critical-Section problem refers to the challenge of coordinating the access to
shared resources among multiple concurrent processes or threads, ensuring that only
one process can be in its critical section (portion of code accessing shared resources)
at a time to prevent race conditions and data inconsistency.
12 Explain the concept of mutual exclusion in the context of the Critical-Section CO2 K1
problem.
Mutual exclusion ensures that only one process can enter its critical section at a
time. It prevents concurrent processes from interfering with each other's operations
on shared resources, thus maintaining data integrity.
13 How does synchronization hardware help in solving the Critical-Section problem? CO2 K1
Synchronization hardware, such as hardware locks or atomic instructions, provides
low-level mechanisms that allow processes to coordinate their activities. Hardware
instructions like Test-and-Set and Compare-and-Swap enable atomic operations that
can be used to implement synchronization primitives like locks and semaphores,
aiding in solving the Critical-Section problem.
14 What are the three requirements that a solution to the Critical-Section problem must CO2 K1
satisfy?
A solution to the Critical-Section problem must satisfy the following requirements:
Mutual Exclusion:
Progress:
Bounded Waiting:
15 What is a process in the context of operating systems? CO2 K1
A process is a fundamental concept in operating systems. It is an instance of a
program in execution. It consists of the program code, program counter, registers,
and its own memory space. Processes are managed by the operating system and can
 execute concurrently, sharing resources such as CPU time, memory, and I/O
devices.

16 Define process scheduling in operating systems. CO2 K1

Process scheduling is the mechanism used by the operating system to manage the
execution of multiple processes in a multitasking environment. It involves selecting
a process from the ready queue to run on the CPU, considering factors like process
priority, time slice, and other scheduling policies.
17 What are the typical operations performed on processes by an operating CO2 K1
system?
Operating systems perform various operations on processes, including:
Creation: Creating a new process involves allocating resources such as memory,
assigning a unique process identifier, and initializing necessary data structures.
Termination: Terminating a process involves releasing its allocated resources,
memory, and associated data structures.
Scheduling: Deciding which process to execute next based on scheduling policies
and priorities.
Suspension/Resumption: Temporarily suspending and resuming the execution of a
process.
Blocking/Unblocking: Marking a process as blocked when waiting for a particular
event and unblocking it when the event occurs.
Context Switching: Saving the current context of a running process and loading the
context of another process for execution.
18 Explain the concept of inter-process communication (IPC). CO2 K1
Inter-process communication (IPC) refers to the mechanisms and techniques used by
processes to exchange information and coordinate their activities. IPC is essential
when processes need to collaborate, share data, or synchronize their actions.
Common IPC methods include message passing, shared memory, and
synchronization primitives like semaphores.
19 What is a race condition in the context of inter-process communication? CO2 K1
A race condition occurs when the behavior of a system depends on the relative
timing of events. In the context of inter-process communication, it refers to the
situation where the correct execution and behavior of processes depend on the order
in which they access shared resources or exchange messages. Race conditions can
lead to unpredictable or incorrect outcomes if not properly managed through
synchronization techniques.
20 Difference between priority and shortest job first algorithms any 2 points CO2 K1
1. Basis of Selection:
Priority Scheduling: This algorithm selects the next process to run based on the
priority assigned to each process. Processes with higher priority values are given
preference. The priority can be determined using various criteria such as process
importance, resource requirements, or user-defined factors.
Shortest Job First (SJF) Scheduling: SJF scheduling selects the process with the
 shortest burst time to execute next. The idea is to minimize the average waiting time
by executing the process that will complete its execution quickly. This approach
works well in scenarios where the actual burst times are known or can be estimated
accurately.
2. Response to Dynamic Situations:

Priority Scheduling: Priority scheduling allows for dynamic adjustments in process

priorities, which can lead to varying execution orders. Processes with higher priority
can preempt lower-priority processes, even if they are already executing, which is
known as priority preemption. This approach might lead to starvation of lower-
priority processes if not managed properly.
Shortest Job First (SJF) Scheduling: SJF scheduling requires knowledge of the
expected or estimated burst times in advance. It's more suitable for scenarios where
burst times are fairly predictable. In dynamic environments where burst times vary
significantly or are not known beforehand, SJF may not be practical, as it can lead to
unexpected delays for longer processes.

PART B – (05 x 13 = 65 marks) CO KL

11. Discuss in detail about several CPU scheduling algorithms CO2 K2

12. Explain the Banker algorithm for deadlock avoidance in detail with an example. C K
O2 2
13. Discuss the threading issues which are considered with multithreaded programs CO2 K2
14. Analysis the term bus waiting in operating system in detail CO2 K2
15. Write in detail the critical section problem and also write the algorithm for Readers CO2 K2
Writers Problem with semaphores .
Show how wait( ) and signal ( ) semaphore operations could be implemented in CO2 K3
16. multiprocessor environments using the test and set instruction. The solution should
17. Analysis under what conditions deadlocks will be arises. CO2 K4
Explain how storage structures are organized in operating system
Explain process control block. List out the data field associated with PC Band explain in
detail
18. Describe in detail abut the co- operating process and independent process CO2 K3
19. Explain the benefits of multithreaded programming in detail CO2 K2
20. Discuss about the issues to be considered in the multithreaded program CO2 K3
21 Discuss Bounded-buffer algorithm for synchronization CO2 K3
22 Analyze the page buffering algorithm in a detailed manner CO2 K4
23 Describe the life cycle of an I/O request in detail CO2 K2
 PART C – (01 x 15 = 15 marks) CO KL
21. Consider the following snapshot of a system and answer the following based on CO2 K4
banker’s algorithm
i)What is the content of need matrix and which processes may cause deadlock if the
system is not safe also show the safe state.

Allocation Max Available

A B C D A B C D A B C D
P1 0 0 1 2 0 0 1 2 1 5 2 0
P2 1 0 0 0 1 7 5 0
P3 1 3 5 4 2 3 5 6
P4 0 6 3 2 0 6 5 2
P5 0 0 1 4 0 6 5 6
22. Consider the following set of processes assigned with CPU burst time and arrived at the CO2 K5
time t=0; time slice = 3

Process Burst Time Priority

P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

Calculate the average waiting time and average turn-around time by using FCFS, SJF, RR
and Priority

UNIT - III

PART A – (10 x 2 = 20 marks) CO KL

1. Define swapping CO3 K1
Swapping. Swapping is a mechanism in which a process can be swapped temporarily
out of main memory (or move) to secondary storage (disk) and make that memory
available to other processes. At some later time, the system swaps back the process
from the secondary storage to main memory.
2. What is demand paging? CO3 K1
In computer operating systems, demand paging (as opposed to anticipatory paging) is a
method of virtual memory management. In a system that uses demand paging, the
operating system copies a disk page into physical memory only if an attempt is made to
access it and that page is not already in memory (i.e., if a page fault occurs). It follows
that a process begins execution with none of its pages in physical memory, and many
 page faults will occur until most of a process's working set of pages are located in
physical memory. This is an example of a lazy loading technique.
3. Define segmentation CO3 K1
In Operating Systems, Segmentation is a memory management technique in which, the
memory is divided into the variable size parts. Each part is known as segment which
can be allocated to a process.
4. Write a short note on process and thread CO3 K1
The process is an execution of a program whereas thread is an execution of a program
driven by the environment of a process. Another major point which differentiates
process and thread is that processes are isolated with each other whereas threads share
memory or resources with each other.
5. Specify the use log file in operating system? CO3 K1
In computing, a log file is a file that records either events that occur in an operating
system or other software runs, or messages between different users of a communication
software. Logging is the act of keeping a log. In the simplest case, messages are written
to a single log file.
6. Define free space management CO3 K1
Free Space Management. A file system is responsible to allocate the free blocks to the
file therefore it has to keep track of all the free blocks present in the disk. There are
mainly two approaches by using which, the free blocks in the disk are managed.
7. Write the Three different stages of binding: CO3 K1
1. Compile time: Must generate absolute code if memory location is known in
prior.
2. Load time: Must generate relocatable code if memory location is not
known at compile time
3. Execution time: Need hardware support for address maps (e.g., base and limit
registers).
8. Define Logical vs. Physical Address Space CO3 K1
Logical address – generated by the CPU; also referred to as “virtual address“
Physical address – address seen by the memory unit.
Logical and physical addresses are the same in compile-time and load-time address-
binding schemes"
Logical (virtual) and physical addresses differ in execution-time address- binding
scheme"
9. Explain Memory-Management Unit (MMU) CO3 K1

It is a hardware device that maps virtual / Logical address to physical address

 In this scheme, the relocation register‘s value is added to Logical address generated by a
user process.

The user program deals with logical addresses; it never sees the real physical addresses
Logical address range: 0 to max
Physical address range: R+0 to R+max, where R—value in relocation register.
10. Define swapping CO3 K1
Swapping

• A process can be swapped temporarily out of memory to a backing store

(SWAP OUT)and then brought back into memory for continued execution (SWAP IN).
• Backing store – fast disk large enough to accommodate copies of all
memory images for all users & it must provide direct access to these memory images
• Roll out, roll in – swapping variant used for priority-based scheduling
algorithms; lower-priority process is swapped out so higher-priority process can be
loaded and executed
• Transfer time: Major part of swap time is transfer time. Total transfer time is
directly proportional to the amount of memory swapped.
□ Example: Let us assume the user process is of size 1MB & the backing store is a
standard hard disk with a transfer rate of 5MBPS.
11 Sate Contiguous Allocation CO3 K1
• Each process is contained in a single contiguous section of memory.
• There are two methods namely:
□ Fixed – Partition Method
□ Variable – Partition Method
• Fixed – Partition Method :
o Divide memory into fixed size partitions, where each partition has exactly one
process.
o The drawback is memory space unused within a partition is wasted.([Link]
process size < partition size)
• Variable-partition method:
o Divide memory into variable size partitions, depending upon the size of the
incoming process.
o When a process terminates, the partition becomes available for another process.
o As processes complete and leave they create holes in the main memory.
12 Define Address Translation Scheme CO3 K1
o Address generated by CPU(logical address) is divided into:
□ Page number (p) – used as an index into a page table which contains base
address of each page in physical memory
□Page offset (d) – combined with base address to define the physical address i.e.,
Physical address = base address + offset
13 Define virtual memory CO3 K1
o It is a technique that allows the execution of processes that may not be
completely in main memory.
o Advantages:
□ Allows the program that can be larger than the physical memory.
□ Separation of user logical memory from physical memory
□ Allows processes to easily share files & address space
14 Explain Pure demand paging CO3 K1
Never bring a page into memory until it is required.
We could start a process with no pages in memory.
When the OS sets the instruction pointer to the 1st instruction of the process,
which is on the non-memory resident page, then the process immediately faults for the
page.
After this page is bought into the memory, the process continue to execute, faulting as
necessary until every page that it needs is in memory
15 State Counting-Based Page Replacement CO3 K1
Keep a counter of the number of references that have been made to each page
[Link] Frequently Used (LFU )Algorithm: replaces page with smallest count
[Link] Frequently Used (MFU )Algorithm: replaces page with largest count
□ It is based on the argument that the page with the smallest count was probably
just brought
in and has yet to be used
16 What do you mean by Best Fit? CO3 K1
Best fit allocates the smallest hole that is big enough. The entire list has to be searched,
unless it
is sorted by size. This strategy produces the smallest leftover hole.
17 Define Lazy Swapper. CO3 K1
Rather than swapping the entire process into main memory, a lazy swapper is used. A
lazy
swapper never swaps a page into memory unless that page will be needed.
18 Define: Belady’s anomaly? CO3 K1
Bélády’s anomaly is the name given to the phenomenon where increasing the
number of page frames results in an increase in the number of page faults for a
given memory access pattern.
19 What is the purpose of paging the page table? CO3 K1
The basic purpose of paging is to separate each procedure into pages. Additionally,
frames will be used to split the main memory.
20 Distinguish file from directory. CO3 K1
The file system is responsible for managing information on the disk. Information
is stored in files, which are stored in directories (folders). Directories can also
store other directories, which forms a directory tree. / on its own is the root
 directory of the whole filesystem.

PART B – (05 x 13 = 65 marks) CO KL

11. Explain in detail about free space management with neat diagram CO3 K4
12. Define paging. Describe the basic method, hardware support and protection of the CO3 K3
paging concept.
13. Define segmentation. Describe the basic method, hardware support and protection of CO3 K3
the segmentation.
14. Write short notes on contiguous memory allocation CO3 K3
15. Write short notes on address binding. CO3 K4

16. Discuss in detail about the various structures of page table. CO3 K3
17. What is lazy swapper? Explain the basic concept and performance of Demand paging. CO3 K4
18. Compare and contrast the strategies used to mitigate external fragmentation, such as CO3 K4
compaction and paging. Discuss the trade-offs associated with each approach.
19. In the context of dynamic partitioning, analyze the impact of memory compaction on CO3 K4
system performance. How does compaction address external fragmentation, and
what are its limitations?
20. Explain how the Best Fit, Worst Fit, and First Fit allocation strategies contribute to CO3 K4
memory fragmentation. Discuss scenarios where each strategy might be preferable.
21 Compare the benefits and challenges of using the Allocation technique for managing CO3 K4
memory blocks in a system with the benefits and challenges of other memory
allocation techniques.
22 You are developing an operating system for a real-time embedded system. Analyze the CO3 K4
memory management techniques that would be most suitable for ensuring
predictable and consistent performance.
23 Consider a scenario where a system needs to support multiple processes with varying CO3 K4
memory requirements. Discuss how a dynamic partitioning
PART C – (01 x 15 = 15 marks) CO KL
24. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, CO3 K4
2, 3, 6. Identify the [Link] page faults would occur for the following replacement
algorithms, assuming three. Remember all frames are initially empty, so your first
unique pages will all cost one fault each. [Link] replacement b. FIFO replacement
25. Compare and contrast the strategies used to mitigate external fragmentation, such as CO3 K4
compaction and paging. Discuss the trade-offs associated with each approach

UNIT - IV

PART A – (10 x 2 = 20 marks) CO KL

1. What is the purpose of a Mass Storage System in computer architecture? CO4 K1
A Mass Storage System is used to provide long-term, non-volatile storage for large
amounts of data. It allows data to be stored even when the computer is turned off and
provides a way to organize and retrieve data efficiently.
2. Explain the basic structure of a hard disk drive (HDD). CO4 K1
A hard disk drive consists of one or more rigid platters coated with a magnetic
material. These platters spin at high speeds, and read/write heads mounted on an
actuator arm move across the platter surfaces to access data. Data is stored in concentric
tracks, further divided into sectors. Each sector stores a fixed amount of data.
3. What is disk scheduling in the context of operating systems? CO4 K1
Disk scheduling refers to the process of determining the order in which pending I/O
requests are serviced on a disk. Since disk access involves mechanical movement,
selecting the optimal order of requests can significantly impact the overall system
performance by reducing seek and rotational delays.
4. Name two common disk scheduling algorithms and briefly explain one of them. CO4 K1
Two common disk scheduling algorithms are:
FCFS (First-Come-First-Served): This algorithm services I/O requests in the order they
arrive. It's a simple approach but can lead to poor performance due to the "convoy
effect," where a long I/O request holds up subsequent requests, even if they are short
and can be serviced quickly.

5. What is disk fragmentation, and how does it affect storage efficiency? CO4 K1
Disk fragmentation refers to the division of files into smaller, scattered fragments on a
storage device. There are two types: external fragmentation (free space is broken into
small chunks) and internal fragmentation (wasted space within a file's allocated block).
Fragmentation reduces storage efficiency, as it can lead to slower read/write operations,
increased seek times, and inefficient use of disk space. Defragmentation tools are used
to rearrange data and consolidate free space to mitigate fragmentation issues

6. What is a File? CO4 K1

A file is a named collection of related information that is recorded on secondary
storage. A file contains either programs or data. A file has certain “structure” based on
its type.
File attributes: Name, identifier, type, size, location, protection, time, date
File operations: creation, reading, writing, repositioning, deleting, truncating,
appending, renaming
 File types: executable, object, library, source code etc.
7. List the various File Attributes. CO4 K1
A file has certain other attributes, which vary from one operating system to another, but
typically
consist of these: Name, identifier, type, location, size, protection, time, date and user
identification.
8. What are the various File Operations? CO4 K1
The basic file operations are,
Creating a file Writing a file Reading a file Repositioning within a file Deleting a file
Truncating
a file
9. What is the information associated with an Open File? CO4 K1
Several pieces of information are associated with an open file which may be:
File pointer
File open count
Disk location of the file
Access rights
10 What are the different Accessing Methods of a File? CO4 K1
The different types of accessing a file are:
Sequential access: Information in the file is accessed sequentially
Direct access: Information in the file can be accessed without any particular order.
Other access methods: Creating index for the file, indexed sequential access method
11 What is the purpose of a directory structure in an operating system? CO4 K1
The directory structure organizes files and directories in a hierarchical manner,
providing a systematic way to store, manage, and access data. It helps in locating files
and maintaining order in the file system.
12 Explain the concept of a 'root directory'. CO4 K1
The root directory is the top-level directory in a file system hierarchy. It serves as the
starting point for all other directories and subdirectories. In UNIX-like systems, the root
directory is denoted by a forward slash (/).

13 How does file system mounting work? CO4 K1

File system mounting is the process of making a file system accessible at a specific
location within the directory structure. The operating system attaches the file system to
a mount point, allowing users and applications to interact with its contents as if they
were part of the local file system.

14 What is the purpose of symbolic links in directory organization? CO4 K1

 Symbolic links (symlinks) are shortcuts that point to another file or directory. They
provide a way to reference a file or directory by a different name or location without
creating a copy. This aids in organizing and accessing files efficiently.
15 Explain the difference between 'read' and 'execute' permissions on a file. CO4 K2
'Read' permission grants the ability to view the contents of a file, while 'execute'
permission allows the execution of a file (if it's a program or script). Execution
permission is relevant for executable files, not for regular text files.
16 How does file sharing work in a multi-user operating system? CO4 K1
In a multi-user operating system, file sharing allows multiple users to access and
collaborate on the same files or directories. This is achieved by setting appropriate file
permissions and access controls, enabling users to read, write, or execute files based on
their privileges.
17 What is the purpose of file ownership in terms of file protection? CO4 K1
File ownership determines which user or group has control over a file. It plays a crucial
role in file protection, as the owner can set permissions that dictate who can access,
modify, or execute the file. Only the owner (or superuser) can change ownership and
permissions.
18 Explain the concept of an 'inode' in a Unix-like file system. CO4 K2
An inode (index node) is a data structure that stores metadata about a file in a Unix-like
file system. It includes information such as file permissions, ownership, timestamps,
file size, and pointers to the actual data blocks. Inodes facilitate efficient file access and
management.
19 What is the role of the I/O hardware in a computer system? CO4 K1
I/O hardware manages communication between the computer and external devices. It
includes interfaces, controllers, and devices that enable data transfer between the CPU
and peripherals.
20 How does the FAT (File Allocation Table) system manage file allocation? CO4 K2
The FAT system uses a table that maps each file's blocks to their corresponding disk
addresses. The File Allocation Table contains entries indicating the status of each block,
whether it's free or allocated, and the next block's address in the file.

PART B – (05 x 13 = 65 marks) CO KL

Discuss in detail about file allocation methods. What are the possible structures for CO4 K3
11. directory? Discuss them in detail.
12. Explain about disk scheduling and any of its two algorithms with suitable example. C K
O4 3
13. Write a detailed note on various file access methods with neat sketch. CO4 K3
14. Write are the various Disk-Scheduling Algorithms CO4 K3
15. Describe the life cycle of an I/O request in detail. CO4 K3
Describe the two levels and tree type directory structures in detail CO4 K3
16.
17. Describe how the disk space from deleted files can be reused. CO4 K3
18. Explain the Allocation Methods of a Disk Space? CO4 K4
19. Explain the most common schemes for defining the Logical Structure of a Directory? CO4 K3
20. Explain the operations that can be performed on a Directory? CO4 K4
PART C – (01 x 15 = 15 marks) CO KL
21. What is the cause of Thrashing? How does the system detect thrashing? Once it detects CO4 K4
thrashing, what can the system do to eliminate this problem?
22. Explain in detail about free space management with neat diagram CO4 K4

UNIT - V

PART A – (10 x 2 = 20 marks) CO KL

1. What is a virtual machine? CO5 K1
A virtual machine (VM) is a software-based emulation of a physical computer system
that runs an operating system and applications independently within an isolated
environment.
2. Explain the history of virtual machines. CO5 K1
Virtual machines originated in the 1960s with IBM's CP-40 and CP-67 systems, which
provided time-sharing capabilities. Modern virtualization technologies were further
developed in the early 2000s by companies like VMware and Xen.
3. What are the benefits of using virtual machines? CO5 K1
Benefits of virtual machines include hardware abstraction, resource isolation, easier
migration, efficient resource utilization, and the ability to run multiple operating
systems on a single physical machine.
4. What are the key features of virtual machines? CO5 K1
Key features include isolation, encapsulation, hardware independence, snapshot
capabilities, and the ability to dynamically allocate and manage resources.
5. Name the building blocks of a virtual machine. CO5 K1
The building blocks of a virtual machine include the host machine (physical hardware),
the hypervisor (virtualization layer), and the guest operating system(s) running on
virtual instances.
6. What is a hypervisor? CO5 K1
A hypervisor is a software layer that creates and manages virtual machines on a
 physical host. It allocates resources and facilitates communication between the host and
guest operating systems.
7. How does server consolidation benefit from virtualization? CO5 K1
Server consolidation involves running multiple virtual machines on a single physical
server. This approach optimizes resource utilization, reduces hardware costs, and
simplifies management.
8. What is live migration in virtualization? CO5 K1
Live migration is the process of moving a running virtual machine from one physical
host to another without interrupting its operation. It ensures high availability and load
balancing.
9. Explain the two types of virtualization: full virtualization and para-virtualization. CO5 K1
Full virtualization emulates a complete hardware environment, allowing unmodified
guest operating systems to run. Para-virtualization involves modifying the guest OS to
be aware of the virtualization environment, improving performance but requiring guest
OS modifications.
10 Differentiate between virtual machines and containers. CO5 K1
Virtual machines emulate full hardware environments and run complete guest operating
systems, while containers share the host OS kernel and encapsulate applications and
their dependencies for portability.
11 Explain the concept of snapshot capabilities in virtual machines. CO5 K1
Snapshot capabilities in virtual machines allow users to capture the current state of a
VM at a specific point in time. This snapshot can be used as a backup or to revert to a
previous state if needed.
12 What is a Type 1 hypervisor? CO5 K1
A Type 1 hypervisor, also known as a bare-metal hypervisor, runs directly on the
physical hardware and manages multiple guest operating systems. It provides strong
isolation and performance.
13 What is a Type 2 hypervisor? CO5 K1
A Type 2 hypervisor, also known as a hosted hypervisor, runs on top of an existing
operating system and allows users to create and manage VMs. It is typically used for
development and testing purposes.
14 What is containerization? CO5 K1
Containerization is a lightweight form of virtualization that allows applications and
 their dependencies to be packaged as containers. Containers share the host OS kernel,
enabling efficient resource usage and quick deployment.
15 What are the security implications of virtualization? CO5 K1
Virtualization introduces potential security risks due to shared resources and the risk of
VM escape
attacks. Proper isolation, network segmentation, and security measures are essential to
mitigate
these risk.
16 What is iOS? CO5 K1
iOS is a mobile operating system developed by Apple Inc. It is specifically designed for
Apple's hardware devices, such as iPhones, iPads, and iPod Touch devices.
17 What is Android? CO5 K1
Android is a mobile operating system developed by Google. It is used in a wide range
of devices from various manufacturers and is known for its open-source nature and
customization options.

18 What is the App Store in iOS? CO5 K1

The App Store is a digital distribution platform developed by Apple for iOS devices. It
allows users to browse and download applications (apps) developed for iOS devices.

19 What is the Google Play Store in Android? CO5 K1

The Google Play Store is an official app store for Android
devices, developed and managed by Google. It provides a
wide range of apps, games, movies, and other digital content
for Android users.
20 How does iOS handle app permissions? CO5 K1
iOS uses a permission model where apps must request specific permissions (such as
access to the camera, microphone, location, etc.) from users before they can access
certain features or data. Users can grant or deny these permissions on a per-app basis.

PART B – (05 x 13 = 65 marks) CO KL

Examine the evolution of virtual machines throughout history. Trace their origins from CO5 K3
11. early mainframe systems to modern cloud computing environments. Analyze the
technological advancements that have fueled their development, leading to the
virtualization landscape we have today. Discuss the pivotal contributions of key players
and how virtual machines have reshaped computing paradigms.
12. Discuss the benefits and features of virtual machines in contemporary computing C K
environments. O5 3
13. Highlight how virtualization addresses challenges such as resource utilization, application CO5 K3
 compatibility, and system maintenance.
14. Explore the advantages of isolation, hardware abstraction, and portability. Describe the CO5 K3
significance of snapshot capabilities, dynamic resource allocation, and the efficient
management of virtualized infrastructures.
15. Explore the building blocks that constitute the foundation of virtual machines. Define the CO5 K3
roles and responsibilities of the host machine, hypervisor, and guest operating systems.
Delve into the interactions between these components, explaining how the hypervisor CO5 K4
16. manages hardware resources and facilitates communication between the host and guest
environments. Illustrate this architecture using real-world examples.
17. Discuss the key differences in design philosophy and user experience between iOS and CO5 K3
Android.
How do these differences impact user preferences and the overall ecosystem of mobile
applications?
18. Explain the concept of fragmentation in the Android ecosystem. What challenges does CO5 K4
fragmentation
pose for developers, users, and security? How do Android versions, device manufacturers,
and
customizations contribute to this issue?
19. Explore the security models of iOS and Android. Compare their approaches to app CO5 K4
sandboxing, permissions, and security updates.
20. How do these models address user privacy and protection against malware and CO5 K3
vulnerabilities?
PART C – (01 x 15 = 15 marks) CO KL
21. Explain in detail about setting up a LINUX multifunction server. CO5 K4
22. With frame work explain the working function of android operating system architecture. CO5 K5
Compare the feature of iOS and android.

COURSE OUTCOMES:

CO1: Understand the basics and functions of operating system.

CO2: Analyze the concepts of various scheduling algorithms, process synchronization and deadlock

CO3: Analyze the various memory management schemes.

CO4: Demonstrate the functionality of file systems and I/O management

CO5: Gain the knowledge on virtual machines and mobile OS like iOS and Android.

COURSE FACULTY HOD