SRI KALISWARI COLLEGE (AUTONOMOUS), SIVAKASI

Information Technology
CORE COURSE IX: Operating System – 21UITC51
(From 2021-2022 Batch onwards)
Question Bank for PART – A
Outcome UNIT – I
Bloom’s
K-level
Course

Qn.
Questions
No

Choose the Correct Answer:

Which one manages the Execution of user program s to prevent errors and
improper use of the computer?
1. CO1 K1 Answer: Control Program
a) Application b) Control c) Bootstrap d) Common
Program program program program
Which computer systems were the first computers used to tackle many
commercial and scientific applications?
Answer: Mainframe
2. CO1 K1
a) Mainframe b) Time-Sharing c) Desktop d) Distributed
Systems Systems Systems

Choose which of the operating system used to allows many users to share the
computer simultaneously
3. CO1 K1 Answer: Time-Sharing
a) Mainframe b) Time-Sharing c) Desktop d) Distributed

Tell the name of the table that an operating system uses for an entry for each
I/O device. Answer: device-status table
4. CO1 K1
a) Page table b) Device status c) symbol table d) Process table
table
How the time is called for to move the disk arm to the desired cylinder?
Answer: Seek time
5. CO1 K1
a) sector b) Track c) Seek time d) rotational
latency
Answer in a Word or a Sentence:
6. What is an Operating system?
Answer: Operating system is a program that manages the computer
CO1 K1 Hardware. It also provides a basic for application programs and acts as
an intermediary between a user of a computer and the computer
Hardware
7. State the Four components of Computer System.
Answer: A computer System can be divided roughly into four
CO1 K1
components: the Hardware, the operating system, the application
program, and the user
8. Tell what is called cylinder? Answer: The set of tracks that are at one arm
CO1 K1
position forms a cylinder.
9. Define Transfer rate. Answer: The transfer rate is the rate at which data
CO1 K1
flow between the drive and the computer.
10. What is programmed I/0? Answer: the CPU uses polling to watch the
CO1 K1 control bit, constantly looping to see whether the device is ready, this
method of operation is called programmed I/0 (PIO)
Choose the Correct Answer:
Find the systems which one has more than one processor in close
communication, sharing the computer bus, the clock, and sometimes memory
11. CO2 K2 and peripheral devices. Answer: Multiprocessor
a) Mainframe b) Time-Sharing c) Desktop d) Multiprocessor
 Identify which system gathers together multiple CPUs to accomplish
computational work. Answer: Clustered
12. CO2 K2
a) Clustered b) Time sharing c) Multiprocessor d) realtime
Identify which system has well-defined, fixed time constraints. Processing
Must be done within the defined constraints, or the system will fail.
13. CO2 K2 Answer: realtime

a) Clustered b) Time sharing c) Multiprocessor d) realtime

Indicate that which one provides the interface between a process and the
operating System. Answer : System Calls
14. CO2 K2
a) System Calls b) Components c) System d) stream value
Container
What type of mechanism will allow more convenient access to I/O devices?
Answer: memory-mapped I/0
15. CO2 K2
a) Programmed b)Port c)Interrupt d) memory
I/O driven mapped I/O
Answer in a Word or a Sentence:
16. What is System call? Answer: System calls provide the interface between a
CO2 K2
process and the operating system.
17. What is Microkernel approach? Answer: This method structures the
CO2 K2 operating system by removing all nonessential components from the
kernel, and implementing them as system- and user-level programs.
18. What is called rotational latency? Answer : The time for the desired sector
CO2 K2
to rotate to the disk head, called the rotational latency
19. Find the use of Fork system call. Answer: A new process is created by the
CO2 K2
fork system call
20. State the use of hot standby host. Answer: The hot standby host (machine)
CO2 K2 does nothing but monitor the active server. If that server fails, the hot
standby host becomes the active server.
Choose the Correct Answer:
Identify which one is used to allow more convenient access to I/O devices?
Answer: Memory mapped I/O
21. CO3 K3
a) Port b) Programmed c) Memory d) interrupt
I/O mapped I/O driven
Find out which system provides a file-system interface where clients can
22. CO3 K3 create, update, read, and delete files Answer: File-Server
a) File server b)Compute server c)Symmetric d)Asymmetric

Select which instructions move a word from main memory to an internal

register with in the CPU. Answer: Load
23. CO3 K3
a) Store b) Random- c) restore d) Load
Access
“
Answer in a Word or a Sentence:
State what is The transfer rate? Answer the transfer rate is the rate at which
24. CO3 K3
data flow between the drive and the computer
Write what is Context switch? Answer: Switching the CPU to another
25. CO3 K3 process requires saving the state of the old process and loading the saved
state for the new process. This task is known as a context switch

UNIT – II
Outcome
Bloom’s
K-level
Course

Qn.
Questions
No

Choose the Correct Answer:

 Which state of process is defined “the process is being created”? Answer: New
1. CO1 K1
a) New b) Ready c) Running d) Waiting

Which state of process is defined “the process is being executed”? Answer:

Running
2. CO1 K1
a) New b) Ready c) Running d) Waiting

Tell the states of the process waiting to be assigned to a processor.

3. CO1 K1 Answer: Ready
a) New b) Ready c) Running d) Waiting

When the process issues on I/O request? Answer: It is placed in an I/O

queue
4. CO1 K1
a) It is placed in b) It is placed in c) it is placed in d) it is placed in
an I/O queue waiting queue ready queue job queue
Which system call returns the process identifier of a terminated child?
5. CO1 K1 Answer: Wait
a) Wait b) Exit c) Fork d) get

Answer in a Word or a Sentence:

6. What is Hard real-time? Answer: The Hard real time systems are required
CO1 K1
to complete a critical task within a guaranteed amount of time
7. Tell the disadvantage of FCFS. Answer: First-come, first-served (FCFS)
CO1 K1 scheduling is the simplest scheduling algorithm, but it can cause short
processes to wait for very long processes
8. Which one is the optimal scheduling algorithm? Answer: Shortest job-
CO1 K1 first (SJF) scheduling is provably optimal, providing the shortest average
Waiting time.
9. Which algorithm is used for various classes of process? Answer: Multilevel
CO1 K1 queue algorithms allow different algorithms to be used for various
classes of processes
10. What is ready queue? Answer: The processes that are residing in main
CO1 K1 memory and are ready and waiting to execute are kept on a list called
ready queue
Choose the Correct Answer:
Identify which one contains the current activity, as represented by the value of
the program counter and the contents of the processor's registers. Answer
11. CO2 K2 Text section
a) Text section b) data section c) Stack d) tasks

What is Interprocess communication? Answer: Communication between two

process
a) b) c) d)Communication
12. CO2 K2 Communication Communication Communication between two
within the between two between two thread of
process process thread of same different process
process
State the type of process that it can affect or be affected by the other processes
executing in the system. Answer: Cooperating process
13. CO2 K2
a) Dependent b) Cooperating c) Independent d) Inter process
Process process Process
State which process to allow processes to communicate and to synchronize
their actions without sharing the same address space. Answer: Inter process
14. CO2 K2
a) Dependent b) Cooperating c) Independent d) Inter process
Process process Process
Select Which system call creates the new process in Unix? Answer: a)fork
15. CO2 K2
a) fork b) create c) new d) exec

Answer in a Word or a Sentence:

16. CO2 K2 Define Context Switch. Answer: Switching the CPU to another process
requires saving the state of the old process and loading the saved state
 for the new process. This task is known as a
Context switch.
17. What is waiting time? Answer: the sum of the periods spent waiting in the
CO2 K2
ready queue
18. State Response time. Answer: the time from the submission of a request
CO2 K2
until the first response is produced. This measure, called response time,
19. What is priority inversion? Answer: The high-priority process would be
CO2 K2 waiting for a lower-priority one to finish. This situation is known as
priority inversion.
20. State the task of CPU scheduling. Answer: CPU scheduling is the task of
CO2 K2 selecting a waiting process from the ready queue and allocating the CPU
to it.
Choose the Correct Answer:
State which one provides the address of the next instruction to be executed by
the current process. Answer: Program Counter
21. CO3 K3
a) CPU register b) Program c) Process Stack d) Pipe
Counter
Find out the type of a process is independent if it cannot affect or be affected by
the other processes executing in the system. Answer: Independent Process
22. CO3 K3
a) Dependent b) Cooperating c) Independent d) Inter process
Process process Process
Find out Which algorithm is defined in Time quantum? Answer: round robin
scheduling
23. CO3 K3
a) shortest job b) round robin c) priority d) multilevel
scheduling scheduling scheduling queue scheduling
Answer in a Word or a Sentence:
State about Cascading termination. Answer: if a process terminates
24. CO3 K3 (Either normally or abnormally), then all its children must also be
terminated. This phenomenon, referred to as cascading termination
Find out the Turnaround time. Answer: The interval from the time of
25. CO3 K3
submission of a process to the time of completion is the turnaround time

UNIT – III
Outcome
Bloom’s
K-level
Course

Qn.
Questions
No

Choose the Correct Answer:

Chose the correct solution to guard against the race condition in terms of
manipulating variable counter. Answer: one process at a time
1. CO1 K1
a) one process at b) Cooperating c) independent d) many process
a time process process at a time
Which objects is to be shared among several concurrent processes? Answer: Data
2. CO1 K1
a) reader b) writer c) Data d) state

How many processors are presented in the reader writer’s problems? Answer: 2
3. CO1 K1
a) 2 b) 3 c) 4 d) 5

Choose the situation when the requesting process must be delayed until
the resource has been released. Answer: Mutual Exclusion
4. CO1 K1
a)Mutual b) Hold and wait c) No preemption d) circular wait
Exclusion
Identify the situation when resource can be released only voluntarily by the
process holding it, after that process has completed its task. Answer: No
5. CO1 K1 preemption
a)Mutual b) Hold and wait c) No preemption d) circular wait
Exclusion
Answer in a Word or a Sentence:
6. What is resource allocation graph? Answer: The deadlock can be described in
CO1 K1
terms of directed graph called a resource allocation graph
7. State Deadlock Prevention. Answer: Deadlock prevention is a set of methods
CO1 K1
for ensuring that at least one of the necessary conditions cannot hold
8. What is the use of Semaphores? Answer: Semaphore can be used
CO1 K1 to solve various synchronization problems and can be implemented
efficiently
9. Name the solutions to the critical section problem. Answer: The solutions to
CO1 K1 the critical section problem are mutual exclusion, progress and bounded
waiting.
10. What is monitor? Answer: A monitor is an object with synchronized
CO1 K1
methods that can only be accessed by one thread at a time.
Choose the Correct Answer:
Find what condition must hold for non-sharable resource? Answer: mutual
exclusion
11. CO2 K2 a) No preemption b) Mutual c) Circular wait d) safe state
Exclusion

Find the status that a process must be holding at least one resource and
waiting to acquire additional resources that are currently being held by
12. CO2 K2 Other processes. Answer : Hold and wait
a)Mutual b) Hold and wait c) No preemption d) circular wait
Exclusion
Find which one of the following is a synchronization tool? Answer:
13. CO2 K2 semaphore
a) thread b) Semaphore c) pipe d) socket

Identify how circular wait can be prevented. Answer : defining a linear

ordering of resource types
14. CO2 K2 a) defining a b) using thread c) using pipes d) using non
linear ordering of linear order of
resource types resource types
State Which one of the following is a visual (mathematical) way to determine
the deadlock occurrence? Answer: resource allocation graph
15. CO2 K2
a) resource b) starvation c) inversion d) resource
allocation graph graph graph assignment graph
Answer in a Word or a Sentence:
16. Define race condition. Where several processes access and manipulate the
CO2 K2 same data concurrently and the outcome of the execution depends on the
particular order in which the access takes place, is called a race condition
17. What is spinlock? Answer: Busy waiting wastes CPU cycles that some other
CO2 K2 Process might be able to use productively. This process spins is called
spin lock
18. Find the solution for the Dining Philosophers Problem. Answer: The solution
CO2 K2 for the Dining philosopher problem is to use a semaphore to represent a
chopstick.
19. What is transaction? Answer: A collection of instructions (or operations)
CO2 K2
that performs a single logical function is called a transaction
20. State what is the situation for Starvation? Answer: In a system, it may
happen that the same process is always picked as a victim. As a result,
CO2 K2
that process will never complete its designated task. This situation is
called Starvation
Choose the Correct Answer:
Find out which one specified by applying functions and relations to the named
21. CO3 K3 attributes. Answer: attributes
a) Entities b) objects c) state d) attributes
 Identify which operating system was designed to provide real time computing.
22. CO3 K3 Answer: Solaris 2
a) Solaris 2 b) Macthosh c) Windows d) android

Identify the situation when Waiting processes may never again change state,
because the resources they have requested are held by other waiting processes
23. CO3 K3 Answer: deadlock
a) Spinlock b) waiting c) deadlock d) request

Answer in a Word or a Sentence:

Write about Deadlock avoidance. Answer: Deadlock avoidance requires that
the operating system be given in advance additional information
24. CO3 K3
concerning which resources a process will request and use during its
lifetime
Find out that the readers-writers problem relates to which one? Answer: the
25. CO3 K3 readers – writers problem relates to an object such as a file that is
shared between multiple processes

UNIT – IV
Outcome
Bloom’s
K-level
Course

Qn.
Questions
No

Choose the Correct Answer:

Which value is used to CPU fetches the instruction from memory? Answer:
program counter
1. CO1 K1
a) program b) status register c) instruction d) program status
counter register word
Which one of the following is the address generated by CPU? Answer: logical
address
2. CO1 K1
a) physical b) absolute c) logical address d) Physical and
address address logical address
Which one is used as an index for the page table? Answer: page number
3. CO1 K1 a) Frame bit b) page number c) page offset d) frame offset

How the Smaller page tables are implemented? Answer: registers

4. CO1 K1
a) queue b) stack c) counter d) registers

What is the aim of creating page replacement algorithms? Answer: decrease

the page fault rate
a) increase the b) replace pages c) decrease the d) to allocate
5. CO1 K1 page fault rate faster page fault rate multiple pages to
processes

Answer in a Word or a Sentence:

6. What is frame? Answer: Physical memory is broken into fixed-sized blocks
CO1 K1
called frame
7. What is Main Memory? Answer: The main memory is central to the
CO1 K1 operation of a Modern Computer. Main Memory is a large array of words
or bytes, ranging in size from hundreds of thousands to billions.
8. Why Memory Management is Required ?Answer: Allocate and de-allocate
CO1 K1
memory before and after process execution
9. CO1 K1 What is worst fir? Answer: Allocate the largest hole is the worst fit

10. What is hit ratio? Answer: The percentage of times that a particular page
CO1 K1
number is found in the TLB is called the hit ratio
Choose the Correct Answer:
11. CO2 K2 Find which of the following pattern allocate the first hole that is big enough.
Answer: First fit
 a) Best fit b) First fit c) Worst fit d) optimum fit

Find which of the following pattern allocate the smallest hole that is big
12. CO2 K2 enough. Answer: Best fit
a) Best fit b) First fit c) Worst fit d) optimum fit

Find which technique is allowed the execution of processes that may not be
completely in memory. Answer: Virtual memory
13. CO2 K2
a) Main memory b) cache memory c) virtual memory d) Secondary
memory
What happens if the process tries to access a page that was not brought
Into memory? Answer: causes page-fault trap
14. CO2 K2
a) shows invalid b) causes Page c) invalid page d) invalid address
fault trap
Find the approach that replaces the page that has not been used for the longest
period of time. Answer: least-recently-used (LRU)
15. CO2 K2
a) least-recently- b) Optimal Page c) FIFO Page d) Page-Buffering
used (LRU) Replacement Replacement Algorithm
Answer in a Word or a Sentence:
16. What is paging? Answer: Logical memory is broken into blocks of the same
CO2 K2
size called paging
17. Define Physical address. Answer: an address seen by the memory unit-that
CO2 K2 is, the one loaded into the memory-address register of the memory-is
commonly referred to as a physical address.
18. State about roll out, roll in. Answer: When the higher-priority process
CO2 K2 finishes, the lower-priority process can be swapped back in and
continued. This variant of swapping is sometimes called roll out, roll in.
19. What is the solution to the problem of external fragmentation? Answer:
solution to the problem of external fragmentation is compaction. The
CO2 K2
goal is to shuffle the memory contents to place all free memory together
in one large block
20. What is mean lazy swapper in Demand Paging? Answer: A lazy swapper
CO2 K2
never swaps a page into memory unless that page will be needed.
Choose the Correct Answer:
Find out which one provides the run-time mapping from virtual to physical
addresses. Answer: memory-management unit (MMU)
21. CO3 K3 a) relocation b) memory- c) dynamic d) static linking
register management unit loading
(MMU)
Identify the memory buffer register with reference to computer memory.
Answer: memory data register
22. CO3 K3
a) main address b) memory data c) memory d) primary data
register register address register register
Find out the scheme of allocation that the leftover three frames could be used
as a free-frame buffer pool. Answer: equal allocation
23. CO3 K3
a) proportional b) equal c) global d) local allocation
allocation allocation allocation
Answer in a Word or a Sentence:
Write about Clustered page tables. Answer: the clustered page table are
24. CO3 K3 similar to hashed page tables except that each entry in the hash table
refers to several pages rather than a single page
State optimal page replacement algorithm. Answer: an optimal page-
25. CO3 K3 replacement algorithm has the lowest page-fault rate of all algorithms,
and will never suffer from Belady's anomaly.c

UNIT – V
 Outcome
Bloom’s
K-level
Course
Qn.
Questions
No

Choose the Correct Answer:

Which file is a sequence of bytes organized into blocks understandable by the
system’s linker? Answer: Object file
1. CO1 K1
a) Object file b) source file c) executable file d) text file

What is the mounting of file system? Answer: attaching portion of the file
system into a directory structure
a) Crating of a b) deleting a file c) attaching d) removing
file system system portion of the portion of the
2. CO1 K1
file system file system
into a into a
directory directory
structure structure
Which one is managed the mapping of file? Answer: file metadata
3. CO1 K1 a) file metadata b) page table c) virtual memory d) file system

Choose the sequential file access method from given options. Answer: read
bytes one at a time, in order
a)Random access b) read bytes one c) read/write d) read/write
4. CO1 K1
according to the at a time, in order sequentially by randomly by
given byte record record
number
When the File system fragmentation occurs? Answer: unused space or single
files are not contiguous
5. CO1 K1 a) unused space b) used space is c) unused space is d) multiple files
or single file are not contiguous non-contiguous are non-
not contiguous contiguous
Answer in a Word or a Sentence:
6. What is a text file? Answer: A text file is a sequence of characters organized
CO1 K1
into lines (and possibly pages)
7. What are the basic file operations provided by system call? Answer: The
CO1 K1 operating system can provide system calls to create, write, read,
reposition, delete, and truncate files
8. What is the use of Disk –scheduling algorithm? Answer: Disk-scheduling
CO1 K1 algorithms can improve the effective bandwidth, the average response
time, and the variance in response time
9. Identify the use of robotic jukebox. Answer: A robotic jukebox enables the
CO1 K1 computer to change the removable cartridge in a tape or disk drive
without human assistance.
10. How SSTF works? Answer: The SSTF algorithm selects the request with the
CO1 K1
minimum seek time from the current head position
Choose the Correct Answer:
Find the data type of File. Answer: Abstract
11. CO2 K2
a) Abstract b) primitive c) public d) private

What is the beginning of absolute path name? Answer: root

12. CO2 K2 a) leaf b) stem c) current d) root
directory
What is the beginning of relative path name? Answer: current directory
13. CO2 K2 a) leaf b) stem c) current d) root
directory
Find the access method of Information in the file is processed in order, one
14. CO2 K2 record after the other. Answer: sequential access
a) Direst access b) relative access c) sequential d) Indirect access
 access
State which file is a series of code sections that the loader can bring into
memory and execute. Answer: executable file
15. CO2 K2
a) Object file b) source file c) executable file d) text file

Answer in a Word or a Sentence:

16. What is source file? Answer: A source file is a sequence of subroutines and
CO2 K2 functions, each of which is further organized as declarations followed by
executable statements
17. State about Direct files access. Answer: A file is made up of fixed- length
CO2 K2 logical records that allow programs to read and write records rapidly in
no particular order
18. Define the sustained bandwidth. Answer: The sustained bandwidth is the
CO2 K2 average data rate during a large transfer, that is, the number of bytes
divided by the transfer time
19. What is constant angular velocity? Answer: the disk rotation speed can stay
constant, and the density of bits decreases from inner tracks to outer
CO2 K2
tracks to keep the data rate constant. This method is used in hard disks
and is known as constant angular velocity (CAV).
20. What is the disk bandwidth? Answer: The disk bandwidth is the total
CO2 K2 number of bytes transferred, divided by the total time between the first
request for service and the completion of the last transfer
Choose the Correct Answer:
Find out which one is the named collection of related information that is
21. CO3 K3 recorded on secondary storage. Answer: File
a) register b) File c) data d) record

Identify the time taken to move the disk arm to the desired cylinder. Answer: seek
time
22. CO3 K3
a) seek time b) rotational c) bandwidth d) transfer time
latency
Identify the additional time waiting for the disk to rotate the desired sector to
the disk head. Answer: rotational latency
23. CO3 K3
a) seek time b) rotational c) bandwidth d) transfer time
latency
Answer in a Word or a Sentence:
Find out the uses of Disk scheduling algorithms. Answer: Disk-scheduling
24. CO3 K3 algorithms can improve the effective bandwidth, the average response
time, and the variance in response time
State about phase-change disk. Answer: The Phase-change disk is coated
25. CO3 K3 with a material that can freeze into either a crystalline or an amorphous
state