SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

RAMAPURAM CAMPUS, BHARATHISALAI, RAMAPURAM, CHENNAI - 600089

FACULTY OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK

DEGREE / BRANCH: B.TECH-CSE

IV SEMESTER

18CSC205J / OPERATING SYSTEMS

2018 Regulation

Academic Year 2021-2022 EVEN SEMESTER

 SRM INSTITUTE OF SCIENCE AND TECHNOLOGY
RAMAPURAM CAMPUS, BHARATHI SALAI, RAMAPURAM, CHENNAI-600089

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

QUESTIONBANK

SUBJECT : 18CSC205J/Operating Systems

SEM/YEAR: II/IV
Course Outcomes
CLO-1 : Identify the need of an Operating system
CLO-2 : Know the Process management functions of an Operating system
CLO-3 : Understand the need of Memory Management functions of an Operating system
CLO-4 : Find the significance of Device management role of an Operating system
CLO-5 : Recognize the essentials of File Management part of an Operating system
CLO-6 :Gain an insight of Importance of an Operating system through practical

UNIT I
Operating System Objectives and functions - Gaining the role of Operating systems - The evolution of
operating system, Major Achievements - Understanding the evolution of Operating systems from early
batch processing systems to modern complex systems - Process Concept– Processes, PCB -
Understanding the Process concept and Maintenance of PCB by OS -Threads – Overview and its Benefits
- Understanding the importance of threads - Process Scheduling : Scheduling Queues, Schedulers,
Context switch - Understanding basics of Process Scheduling - Operations on Process – Process creation,
Process termination - Understanding the system calls – fork(),wait(),exit() - Inter Process
communication : Shared Memory, Message Passing ,Pipe() -Understanding the need for IPC - Process
synchronization: Background, Critical section Problem - Understanding the race conditions and the need
for the Process synchronization
PART-A (Multiple Choice Questions)
Q. Course Competence
Questions Outcome BT Level
No
1 A process is selected from the ______ queue by the ________ scheduler,
to be executed.
a) blocked, short term b) wait, long term c) ready, short CO1 BT1
term d) ready, long term

2 The switching of the CPU from one process or thread to another is called CO1 BT1
:
a) process switch b) task switch c) context switch
 d) All of these

3 Dispatch latency is :
a) the speed of dispatching a process from running to the ready state
b) the time of dispatching a process from running to ready state and
keeping the CPU idle CO1 BT1
c) the time to stop one process and start running another one
d) None of these

4 In Unix, Which system call creates the new process?

a) fork
b) create CO1 BT1
c) new
d) none of the mentioned

5 The processes that are residing in main memory and are ready and
waiting to execute are kept on a list called
a) job queue b) ready queue c) execution queue d) process CO1 BT1
queue

6 The interval from the time of submission of a process to the time of

completion is termed as
a) waiting time b) turnaround time c) response time d) CO1 BT1
throughput

7 To access the services of the operating system, the interface is provided

by the ___________
a) Library
b) System calls CO1 BT1
c) Assembly instructions
d) API

8 In priority scheduling algorithm

a) CPU is allocated to the process with highest priority b) CPU is
allocated to the process with lowest priority CO1 BT1
c) equal priority processes can not be scheduled d) none of the
mentioned

9 If a process fails, most operating system write the error information to a

______
a) new file
b) another running process CO1 BT1
c) log file
d) none of the mentioned

10 CPU scheduling is the basis of ____________. CO1 BT1

a) multiprocessor systems b) multiprogramming operating systems
c) larger memory sized systems d) None of these
11 With multiprogramming, ______ is used productively.
a) timeb) space c) money d) All of these CO1 BT1

12 The two steps of a process execution are : (choose two)

a) I/O Burst b) CPU Burst c) Memory Burst d) OS Burst CO1 BT1

13 In the following cases non – preemptive scheduling occurs : (Choose

two)
a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state CO1 BT1
c) When a process switches from the waiting state to the ready state
d) When a process terminates

14 In a memory mapped input/output :

a) the CPU uses polling to watch the control bit constantly, looping to
see if device is ready
b) the CPU writes one data byte to the data register and sets a bit in
control register to show that a byte is available CO1 BT1
c) the CPU receives an interrupt when the device is ready for the next
byte
d) the CPU runs a user written code and does accordingly

15 In a programmed input/output(PIO) :
a) the CPU uses polling to watch the control bit constantly, looping
to see if device is ready
b) the CPU writes one data byte to the data register and sets a bit in
control register to show that a byte is available CO1 BT1
c) the CPU receives an interrupt when the device is ready for the next
byte
d) the CPU runs a user written code and does accordingly

16 In an interrupt driven input/output :

a) the CPU uses polling to watch the control bit constantly, looping to
see if device is ready
b) the CPU writes one data byte to the data register and sets a bit in
control register to show that a byte is available CO1 BT1
c) the CPU receives an interrupt when the device is ready for the
next byte
d) the CPU runs a user written code and does accordingly

17 Which one of the following cannot be scheduled by the kernel?

a) kernel level thread
b) user level thread CO1 BT1
c) process
d) none of the mentioned

18 The objective of multi-programming is to : (choose two) CO1 BT1

a) Have some process running at all times
 b) Have multiple programs waiting in a queue ready to run
c) To minimize CPU utilization
d) To maximize CPU utilization

19 Which of the following do not belong to queues for processes?

a) Job Queue b) PCB queuec) Device Queue d) Ready Queue CO1 BT1

20 When the process issues an I/O request :

a) It is placed in an I/O queue
b) It is placed in a waiting queue CO1 BT1
c) It is placed in the ready queue
d) It is placed in the Job queue

21 What is a trap/exception ?
a) hardware generated interrupt caused by an error
b) software generated interrupt caused by an error CO1 BT1
c) user generated interrupt caused by an error
d) None of these

22 What is an ISR ?
a) Information Service Request
b) Interrupt Service Request CO1 BT1
c) Interrupt Service Routine
d) Information Service Routine

23 Which facility dynamically adds probes to a running system, both in user

processes and in the kernel? CO1 BT1
a) Dtrace b) Dlocate c) Dmap d) Dadd

24 Which one of the following is not a real time operating system?

a) VxWorks b) Windows CE c) RTLinux d) Palm OS CO1 BT1

25 The OS X has
a) monolithic kernel
b) hybrid kernel CO1 BT1
c) microkernel
d) monolithic kernel with modules

PART B (4 Marks)
1 Illustrate the factors that usually determine the degree of Multi
Programming
i. The number of Programs residing in Primary memory.
ii. Passing of the control of the CPU rapidly between these CO1 BT2
programs.
iii. Protection of user process from one another.

2 What are the Benefits of Multi Programming? CO1 BT1

 i. Improves the System Performance.
ii. Allows Time Sharing.
iii. Supports multiple simultaneous interactive users
3 What are the types of memory?
i) Internal Processor Memory CO1 BT1
ii) Primary or Main Memory
iii) Secondary/Auxiliary/Backing Store are the types of memory.
4 What is Memory?
A Memory is the place for storage of data & information (or) it can be CO1 BT1
Defined as the work area of the computer where the microprocessor finds
its data & instructions while the computer is working.
5 Explain Off-Line Processing and On-Line Processing?
Rather than the CPU reading directly from the input, copying the
content into CPU AND PROCESS. CO1 BT2
Transferring the contents from the input directly on to the CPU
and transferring the Processed contents onto the printer is On-Line
6 Give examples of Real Time Application
Ex’s are
i. Flight Control
ii. Real Time Simulation CO1 BT1
iii. Military Application
iv. Petroleum Refinery
v. Process Control etc.
7 Define Real Time Systems .
It is another form of OS which are used in environments where a CO1 BT1
large number of events mostly external to the computer system must be
accepted and processed in a short time or within certain deadlines.
8 What is Time Sharing?
Time Sharing ( or Multi tasking) is a logical extension of Multi CO1 BT1
Programming. It is a form of Multi Programmed OS which operates in
an interactive mode with Quick response time
9 What is Asymmetric Multi Processing?
It is one in which each processor is assigned a specific task. A
Master Processor controls the system and the other Processors are CO1 BT1
allocated work by the Master Processor.

10 What is the advantage of Multi Processing Systems?

A Multi Processing System is one in which there are more than
one CPU, interleaved with each other. So it helps in improving the CO1 BT1
amount of work done.

11 How does a process differ from a job?

A process is an active entity with a program counter specifying the next CO1 BT1
instructions to execute and a set to associated resources, whereas a
batchSystem executes jobs.(which is a collection of processes).
12 What are the information contained in a PCB? CO1 BT1
A PCB contains pieces of information associated with a
 specific process,
Namely
i. Identifier
ii. process state
iii. program counter
iv. Context data
v. CPU scheduling information
vi. Memory management information
vii. Accounting information
viii. I/O status information
13 What are the operations on process?
a.create a process
b.destroy a process
c.suspend a process
d.resume a process CO1 BT1
e.change the priority of a process
f.block a process
g.wakeup a process
h.dispatch a process
i.enable a process to communicate with another
14 Elaborate the function of the ready queue?
The ready queue stores threads that aren't currently running, that are
capable of resuming execution. There may be several ready queues for
each priority level, depending on the scheduling algorithm. The CO1 BT1
scheduler consults the ready queue to determine which process/thread to
run next. As the name suggests, the ready queue is a queue, in order to
schedule fairly.
15 What is the relationship between threads and processes?
A processes is a container for threads, which has it's own
memory space. A process may contain one or more threads, which share
that memory space, all of the file descriptors and other attributes. The CO1 BT1
threads are the units of execution within the process, they posess a
register set, stack, program counter, and scheduling attributes - per
thread.
16 What is the function of a process control block?.
A (PCB) contains many pieces of information associated with
a specific CO1 BT1
Process. It serves as the repository for any information that
may vary
From process to process.
17 What are the various process states?
The various process states are
a. New
b. Ready CO1 BT1
c. Running
d. Blocked
e. Exit.
18 How does a process differ from a job?
A process is an active entity with a program counter specifying the next CO1 BT1
instructions to execute and a set to associated resources, whereas a
batchSystem executes jobs.(which is a collection of processes
19 What are the main functions of the kernel?
To provide mechanism for
i. creation and deletion of processes CO1 BT1
ii. inter process communication
iii. synchronization of processes.

20 Write the functions of an OS .

(i) Memory Management.
(ii) Processor management.
(iii) Interrupt Handling. CO1 BT1
(iv) Accounting.
(v) Automatic job sequencing.
(vi) Management and control of I/O devices

PART C (12 Marks)

1 Explain the following
i) The basic elements of a computer system CO1 BT2
ii)Processor register
2 Explain the essential properties of the following operating systems.
a)Batch b)Interactive
c)Time sharing d)Real Time CO1 BT2
e)Network f)parallel
g)Distributed h)clustered
3 Explain the following
i) OS control structures CO1 BT2
ii)Process control structures
4 i)Explain in detail the various reasons involved in process creation and
termination. CO1 BT2
ii)Compare mode switching and process switching.
5 Explain in detail the single thread and multithread process model with CO1 BT2
diagrams
6 Compare user level and kernel level threads with necessary diagrams. CO1 BT1
7 Explain how micro kernel architecture differs from layered kernel CO1 BT2
architecture.
8 With neat diagram explain the five states involved in process model. CO1 BT1
9 Explain in detail
i)how interrupts are processed. CO1 BT2
ii)how multiple interrupts are handled.
10 Explain the different I/O communication techniques CO1 BT2

UNIT II
PROCESS SYNCHRONIZATION : Peterson’s solution, Synchronization Hardware, Understanding the
two-process solution and the benefits of the synchronization hardware, Process synchronization:
Semaphores, usage, implementation, Gaining the knowledge of the usage of the semaphores for the
Mutual exclusion mechanisms, Classical Problems of synchronization – Readers writers problem,
Bounded Buffer problem, Good understanding of synchronization mechanisms, Classical Problems of
synchronization – Dining Philosophers problem (Monitor ), Understanding the synchronization of limited
resources among multiple processes, CPU SCHEDULING : FCFS,SJF,Priority, Understanding the
scheduling techniques, CPU Scheduling: Round robin, Multilevel queue Scheduling, Multilevel feedback
Scheduling, Understanding the scheduling techniques, Real Time scheduling: Rate Monotonic
Scheduling and Deadline Scheduling, Understanding the real time scheduling, DEADLOCKS: Necessary
conditions, Resource allocation graph, Deadlock prevention methods, Understanding the deadlock
scenario, Deadlocks :Deadlock Avoidance, Detection and Recovery, Understanding the deadlock
avoidance, detection and recovery mechanisms
PART-A (Multiple Choice Questions)
Q. Course Competenc
e
Questions Outcome BT Level
No
1 1. Which process can be affected by other processes executing in the
system?
a) cooperating process CO2 BT1
b) child process
c) parent process
d) init process
2 If a process is executing in its critical section, then no other processes
can be executing in their critical section. What is this condition called?
a) mutual exclusion BT1
CO2
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
3 Which one of the following is a synchronization tool?
a) thread
b) pipe CO2 BT1
c) semaphore
d) socket
4 A semaphore is a shared integer variable __________
a) that can not drop below zero
b) that can not be more than zero CO2 BT2
c) that can not drop below one
d) that can not be more than one
5 Mutual exclusion can be provided by the __________
a) mutex locks
b) binary semaphores CO2 BT1
c) both mutex locks and binary semaphores
d) none of the mentioned
6 When high priority task is indirectly preempted by medium priority task CO2 BT1
effectively inverting the relative priority of the two tasks, the scenario is
called __________
 a) priority inversion
b) priority removal
c) priority exchange
d) priority modification
7 Process synchronization can be done on __________
a) hardware level
b) software level CO2 BT1
c) both hardware and software level
d) none of the mentioned
8 Peterson solution is restricted to ----------- process that alternate
execution between their critical section and remainder sections.
a)one
b) two CO2 BT2
c) three
d) four

9 The wait operation of the semaphore basically works on the basic

_______ system call.
a) stop()
b) block() CO2 BT1
c) hold()
d) wait()

10 The signal operation of the semaphore basically works on the basic

_______ system call.
a) continue()
b) wakeup() CO2 BT2
c) getup()
d) start()

11 What are the two kinds of semaphores?

a) mutex & counting
b) binary & counting CO2 BT2
c) counting & decimal
d) decimal & binary
12 The bounded buffer problem is also known as ____________
a) Readers – Writers problem
b) Dining – Philosophers problem BT2
CO2
c) Producer – Consumer problem
d) Critical Section Problem

13 The dining – philosophers problem will occur in case of ____________

a) 5 philosophers and 5 chopsticks
b) 4 philosophers and 5 chopsticks BT2
CO2
c) 3 philosophers and 5 chopsticks
d) 6 philosophers and 5 chopsticks

14 In the bounded buffer problem, there are the empty and full semaphores CO2 BT1
 that ____________
a) count the number of empty and full buffers
b) count the number of empty and full memory spaces
c) count the number of empty and full queues
d) count the number of empty and full process

15 To ensure difficulties do not arise in the readers – writers problem

_______ are given exclusive access to the shared object.
a) readers
b) writers CO2 BT2
c) readers and writers
d) either reader or writers

16 Which module gives control of the CPU to the process selected by the
short-term scheduler?
a) dispatcher BT1
b) interrupt CO2
c) scheduler
d) none of the mentioned
17 The processes that are residing in main memory and are ready and
waiting to execute are kept on a list called _____________
a) job queue BL1
CO2
b) ready queue
c) execution queue
d) process queue
18 The interval from the time of submission of a process to the time of
completion is termed as ____________
a) waiting time BT1
CO2
b) turnaround time
c) response time
d) throughput
19 Which scheduling algorithm allocates the CPU first to the process that
requests the CPU first?
a) first-come, first-served scheduling BT1
CO2
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
20 In priority scheduling algorithm ____________
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority CO2 BT2
c) Equal priority processes can not be scheduled
d) None of the mentioned
21 In priority scheduling algorithm, when a process arrives at the ready
queue, its priority is compared with the priority of ____________
a) all process BT2
b) currently running process CO2
c) parent process
d) init process
22 Process are classified into different groups in ____________
a) shortest job scheduling algorithm
b) round robin scheduling algorithm CO2 BT1
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
23 What is a reusable resource?
a) that can be used by one process at a time and is not depleted by
that use BT2
CO2
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned
24 Which one of the following is the deadlock avoidance algorithm?
a) banker’s algorithm
b) round-robin algorithm CO2 BT1
c) elevator algorithm
d) karn’s algorithm
25 What is the drawback of banker’s algorithm?
a) in advance processes rarely know how much resource they will need
b) the number of processes changes as time progresses CO2 BT1
c) resource once available can disappear
d) all of the mentioned
26 A problem encountered in multitasking when a process is perpetually
denied necessary resources is called ____________
a) deadlock BT1
CO2
b) starvation
c) inversion
d) aging
27 To avoid deadlock ____________
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once CO2 BT2
c) all deadlocked processes must be aborted
d) inversion technique can be used
28ThThe request and release of resources are ___________
a) command line statements
b) interrupts
c) system calls CO2 BT1
d) special programs

29 Which among the following is helpful in CPU scheduling decisions?

a. When a process switches from thewaiting state to the running state
b. When a process switches from the ready state to the running state
c.When a process switches from the waiting state to the ready CO2 BT1
state
d.When a process begins

30 The circular wait condition can be prevented by ____________ CO2 BT1

 a) defining a linear ordering of resource types
b) using thread
c) using pipes
d) using both thread and pipes.

PART B (4 Marks)
1 What is busy waiting? CO2 BT2
2 Write short notes on turn around time, waiting time and response time CO2 BT1
3 What is a binary semaphore? CO2 BT1
4 What is the difference between synchronization and mutual exclusion? CO2 BT2
5 List the Coffman’s conditions that lead to a deadlock. CO2 BT2
6 List the three requirements that must be satisfied by critical section problem. CO2 BT1
7 Write short notes on semaphore CO2 BT1
8 Illustrate about Petersons solution CO2 BT2
9 Examine about mutex locks CO2 BT1
10 Discuss about priority inversion with an example CO2 BT2
11 Define CPU Scheduling. CO2 BT1
12 What is Preemptive and Non - Preemptive scheduling? CO2 BT1
13 What are the various scheduling criteria for CPU Scheduling? CO2 BT1
14 Define Entry Section and Exit Section. CO2 BT1
15 Give two hardware instructions and their definitions which can be used CO2
for implementing Mutual Exclusion. BT2

16 How can we say the First Come First Served scheduling algorithm is CO2 BT2
Non Preemptive?
17 Differentiate Long Term Scheduler and Short Term Scheduler CO2 BT1
18 What are a Safe State and an Unsafe State? CO2 BT1
19 What is a Gantt Chart? CO2 BT1
20 Define Request Edge and Assignment Edge. CO2 BT1
PART C (12 Marks)
1 Outline a solution using semaphores to solve dinning philosopher problem. CO2 BT2
2 Compute non-preemptive SJF scheduling algorithm CO2

Process Arrival Burst

time time
P1 0 7
P2 2 4 BT3
P3 4 1
P4 5 4
P5 3 4

3 Consider the following set of processes with the length of the CPU-burst CO2
time in given
ms:

Process Arrival time Burst time

P1 8 0
P2 4 1
P3 9 2 BT3
P4 5 3
P5 3 4
Draw four Gantt charts illustrating the execution of these
processes using FCFS, SJF, priority and RR (quantum=2)
scheduling. Also calculate waiting time and turnaround time for
each scheduling algorithms.

4 Show how wait () and signal() semaphore operations could be implemented in CO2
multiprocessor environments, using Test and Set instructions. The solution BT2
should exhibit minimal busy waiting. Develop pseudo code for implementing
operations.
5 Explain in detail about multilevel queue scheduling CO2 BT1
6 Describe about multilevel feedback scheduling CO2 BT1
7 With an example explain about resource allocation graph CO2 BT1
8 Illustrate Bankers algorithm with an example CO2 BT2
9 Describe Deadlock prevention in detail. CO2 BT2
10 Explain the methods for handling deadlocks. CO2 BT2
 UNIT III
MEMORY MANAGEMENT: Memory Management: Logical Vs Physical address space, Swapping and
understanding the basics of Memory management Contiguous Memory allocation – Fixed and Dynamic
partition Getting to know about Partition memory management and issues: Internal fragmentation and
external fragmentation problems Strategies for selecting free holes in Dynamic partition Understanding the
allocation strategies with examples Paged memory management Understanding the Paging technique.PMT
hardware mechanism Structure of Page Map Table Understanding the components of PMT Example : Intel
32 bit and 64 –bit Architectures Understanding the Paging in the Intel architectures Example : ARM
Architectures Understanding the Paging with respect to ARM Segmented memory management
Understanding the users view of memory with respect to the primary memory Paged segmentation
Technique Understanding the combined scheme for efficient management

PART-A (Multiple Choice Questions)

Q. Questions Course Competence
No Outcome BT Level
1 1. CPU fetches the instruction from memory according to the value of
____________
a) program counter BT1
CO3
b) status register
c) instruction register
d) program status word
2
A memory buffer used to accommodate a speed differential is called
____________
a) stack pointer CO3 BT1
b) cache
c) accumulator
d) disk buffer
3 Which one of the following is the address generated by CPU?
a) physical address
b) absolute address CO3 BT2
c) logical address
d) none of the mentioned
4 What is Address Binding?
a) going to an address in memory
b) locating an address with the help of another address BT1
CO3
c) binding two addresses together to form a new address in a different
memory space
d) a mapping from one address space to another
5 Binding of instructions and data to memory addresses can be done at
____________
a) Compile time BT1
b) Load time CO3
c) Execution time
d) All of the mentioned
6 If the process can be moved during its execution from one memory CO3 BT2
segment to another, then binding must be ____________
a) delayed until run time
 b) preponed to compile time
c) preponed to load time
d) none of the mentioned
7 The main memory accommodates ____________
a) operating system
b) cpu CO3 BT1
c) user processes
d) all of the mentioned
8
In contiguous memory allocation ____________
a) each process is contained in a single contiguous section of
memory CO3 BT1
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
9 A solution to the problem of external fragmentation is ____________
a) compaction
b) larger memory space CO3 BT1
c) smaller memory space
d) none of the mentioned
10 Another solution to the problem of external fragmentation problem is to
____________
a) permit the logical address space of a process to be noncontiguous BT1
CO3
b) permit smaller processes to be allocated memory at last
c) permit larger processes to be allocated memory at last
d) all of the mentioned
11 Physical memory is broken into fixed-sized blocks called ________
a) frames
b) pages CO3 BT1
c) backing store
d) none of the mentioned
12 Every address generated by the CPU is divided into two parts. They are
____________
a) frame bit & page number BT2
b) page number & page offset CO3
c) page offset & frame bit
d) frame offset & page offset
13 If a page number is not found in the TLB, then it is known as a
____________
a) TLB miss BT1
b) Buffer miss CO3
c) TLB hit
d) All of the mentioned
14 An ______ uniquely identifies processes and is used to provide address
space protection for that process.
a) address space locator BT2
CO3
b) address space identifier
c) address process identifier
d) none of the mentioned
15 Each entry in a translation lookaside buffer (TLB) consists of
____________
a) key BT1
b) value CO3
c) bit value
d) constant
16 In segmentation, each address is specified by ____________
a) a segment number & offset
b) an offset & value CO3 BT2
c) a value & segment number
d) a key & value
17 In paging the user provides only ________ which is partitioned by the
hardware into ________ and ______
a) one offset, page number, address BT1
b) page number, offset, address CO3
c) one address, page number, offset
d) none of the mentioned
18 Each entry in a segment table has a ____________
a) segment base
b) segment peak CO3 BT1
c) segment value
d) none of the mentioned
19 Which of the following is/are the requirements of memory management.
i) Relocation ii) Protection iii) Sharing iv) Memory organization
A) i, ii and iii only BT1
B) ii, iii and iv only CO3
C) i, iii and iv only
D) All i, ii, iii and iv
20 The ……………… requirement must be satisfied by the processor
rather than the operating system because the operating system cannot
anticipate all of the memory references that the program will make.
A) memory relocation CO3 BT1
B) memory protection
C) memory sharing
D) memory organization
21 The memory management system must, therefore, allow controlled
access to …………… areas of memory without compromising essential
protection.
A) relocated CO3 BT1
B) protected
C) shared
D) organized
22 Main memory in a computer system is ………………. as a linear or one
dimensional, address space, consisting of a sequence of bytes or words.
A) relocated BT2
B) protected CO3
C) shared
D) organized
23 In …………… there is no internal fragmentation and is a more efficient CO3 BT1
use of main memory.
A) Fixed partitioning
 B) Dynamic partitioning
C) Virtual memory paging
D) Simple segmentation
24 Among all memory management techniques …………….. is simple to
implement little operating system overhead.
A) Fixed partitioning BT2
B) Simple Paging CO3
C) Virtual memory paging
D) Simple segmentation
25 In ………….. there is not necessary to load all of the segments of a
process and non-resident segments that are needed are brought in later
automatically.
A) Fixed partitioning CO3 BT1
B) Simple Paging
C) Virtual memory segmentation
D) Simple segmentation
26 A process may be loaded into a partition of equal or greater size in
………………. of memory.
A) Fixed partitioning BT2
B) Simple Paging CO3
C) Virtual memory paging
D) Simple segmentation
27 In ……………….., there is an inefficient use of processor due to the
need for compaction to counter external fragmentation.
A) Fixed partitioning BT2
B) Dynamic partitioning CO3
C) Virtual memory paging
D) Simple segmentation
28 Which of the following is/are the strengths of virtual memory
segmentation techniques used in memory management.
i) No internal fragmentation
ii) A higher degree of multiprogramming
iii) More efficient to use of main memory
iv) Large virtual address space CO3 BT1
v) Protection and sharing support
A) i, ii, iii and iv only
B) i, ii, iii and v only
C) i, ii, iv and v only
D) ii, iii, iv and v only
29 Consider a computer with 8 Mbytes of main memory and a 128K cache.
The cache block size is 4 K. It uses a direct mapping scheme for cache
management. How many different main memory blocks can map onto a
given physical cache block?
A.) 2048 CO3 BT1
B.) 256
C.) 64
D.) 8

30 The segment base contains the ____________ CO3 BT1

a) starting logical address of the process
 b) starting physical address of the segment in memory
c) segment length
d) none of the mentioned

PART B (4 Marks)
1 How is memory protected in a paged environment? CO3 BT1
2 What is External Fragmentation? CO3 BT1
3 What is the use of Valid-Invalid Bits in Paging? CO3 BT2
4 Explain memory management without swapping or paging CO3 BT1
5 Explain page replacement algorithms CO3 BT2
6 Why page sizes are always power of 2? CO3 BT1
7 List two differences between logical and physical addresses. CO3 BT4
8 Define demand paging in memory management. CO3 BT1
9 What are the steps required to handle a page fault in demand paging? CO3 BT1
10 Tell the significance of LDT and GDT in segmentation. CO3 BT1
11 Explain dynamic loading. CO3 BT2
12 What is Demand Paging? CO3 BT1
13 How the problem of external fragmentation can be solved CO3 BT1
14 Formulate how long a paged memory reference takes if memory CO3
reference takes 200 nanoseconds.Assume a paging system with page BT6
table stored in memory
15 Define Address binding. CO3 BT1
16 What is Internal Fragmentation? CO3 BT1
17 What do you mean by Compaction? CO3 BT1
18 What is the difference between user-level instructions and privileged CO3
BT1
instructions?
19 What is memory stall? CO3 BT1
20 Define logical address space CO3 BT1
PART C (12 Marks)
1 Elaborate about the free space management on I/O buffering and CO3 BT6
blocking.
2 Explain about given memory management techniques. (i) CO3 BT5
Partitioned allocation (ii) Paging and translation look-aside buffer.
3 When page faults will occur? Describe the actions taken by CO3 BT1
operating system during page fault.
4 Explain about the difference between internal fragmentation and CO3 BT5
external fragmentation
5 Why are segmentation and paging sometimes combined into one CO3 BT1
scheme?
6 Compare paging with segmentation in terms of the amount of CO3
memory required by the address translation structures in order to BT2
convert virtual addresses to physical addresses.
7 Most systems allow programs to allocate more memory to its CO3
address space during execution. Data allocated in the heap
segments of programs is an example of such allocated memory. BT1
What is required to support dynamic memory allocation in the
following schemes?
8 Explain the difference between logical address and physical CO3 BT1
address.
9 Define Compaction and explain why it is used. CO3 BT1
10 Define Contiguous Allocation. CO3 BT5
 UNIT IV
VIRTUAL MEMORY– Background-Understanding the need of demand paging-VIRTUAL
MEMORY – Basic concepts – page fault handling -Understanding , how an OS handles the page
faults-Performance of Demand paging-Understanding the relationship of effective access time and the
page fault rate-Copy-on write-Understanding the need for Copy-on write -Page replacement
Mechanisms: FIFO, Optimal, LRU and LRU approximation Techniques-Understanding the Pros and
cons of the page replacement techniques-Counting based page replacement and Page Buffering
Algorithms -To know on additional Techniques available for page replacement strategies-Allocation
of Frames - Global Vs Local Allocation -Understanding the root cause of the Thrashing-Thrashing,
Causes of Thrashing -Understanding the Thrashing -Working set Model-Understanding the working set
model for controlling the Working set Model

PART-A (Multiple Choice Questions)

Q. Questions Course Competence
No Outcom BT Level
e
1 Virtual memory allows ____________
a) execution of a process that may not be completely in
memory
b) a program to be smaller than the physical memory CO4 BT 1
c) a program to be larger than the secondary storage
d) execution of a process without being in physical memory

2 The instruction being executed, must be in ____________

a) physical memory
b) logical memory CO4 BT 1
c) physical & logical memory
d) secondary storage

3 Virtual memory is normally implemented by ________

a) demand paging
b) buses CO4 BT 1
c) virtualization
d) queues

4 A page fault occurs when?

a) a page gives inconsistent data
b) a page cannot be accessed due to its absence from memory CO4 BT 1
c) a page is invisible
d) a page is deleted

5 MMU stands for?

a) memory mapping unit
b) memory management unit
c) main memory unit CO4 BT 1
d) memory management unit

6 Which algorithm is based on the argument that the page with the
smallest count?
a) Least frequently Used
 UNIT V
STORAGE MANAGEMENT: Mass storage structure – Overview of Mass storage – Magnetic Disks –
Understanding the Basics in storage management – Disk Scheduling – Understanding the various
scheduling with respect to the disk – FILE SYSTEM INTERFACE: File concept, File access methods –
Understanding the file basics – File sharing and Protection – FILE SYSTEM IMPLEMENTATION: File
system structure – Directory Implementation – Understanding the various levels of directory structure-
Free space Management – Swap space Management

PART-A (Multiple Choice Questions)

Q. Questions Course Competence
No Outcom BT Level
e
1 The heads of the magnetic disk are attached to a _____ that moves
all the heads as a unit.
a) spindle BT1
CO5
b) disk arm
c) track
d) none of the mentioned
2
The time taken to move the disk arm to the desired cylinder is
called the ____________
a) positioning time CO5 BT1
b) random access time
c) seek time
d) rotational latency
3 SSTF algorithm, like SJF __________ of some requests.
a) may cause starvation
b) will cause starvation CO5 BT2
c) does not cause starvation
d) causes aging
4 In the ______ algorithm, the disk arm starts at one end of the disk
and moves toward the other end, servicing requests till the other
end of the disk. At the other end, the direction is reversed and
servicing continues. BT1
CO5
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
5 Virtual memory uses disk space as an extension of _________
a) secondary storage
b) main memory CO5 BT1
c) tertiary storage
d) none of the mentioned
6 Using swap space significantly _________ system performance.
a) increases
b) decreases CO5 BT2
c) maintains
d) does not affect
7 To create a file ____________ CO5 BT1
 a) allocate the space in file system
b) make an entry for new file in directory
c) allocate the space in file system & make an entry for new file
in directory
d) none of the mentioned
8
Which one of the following explains the sequential file access
method?
a) random access according to the given byte number CO5 BT1
b) read bytes one at a time, in order
c) read/write sequentially by record
d) read/write randomly by record
9 Management of metadata information is done by ____________
a) file-organisation module
b) logical file system CO5 BT1
c) basic file system
d) application programs
10 The data structure used for file directory is called ____________
a) mount table
b) hash table CO5 BT1
c) file table
d) process table
11 The open file table has a/an _______ associated with each file.
a) file content
b) file permission CO5 BT1
c) open count
d) close count
12 The larger the block size, the ______ the internal fragmentation.
a) greater
b) lesser CO5 BT2
c) same
d) none of the mentioned
13 For a direct access file ____________
a) there are restrictions on the order of reading and writing
b) there are no restrictions on the order of reading and writing CO5 BT1
c) access is restricted permission wise
d) access is not restricted permission wise
14 For large files, when the index itself becomes too large to be kept in
memory?
a) index is called BT2
CO5
b) an index is created for the index file
c) secondary index files are created
d) all of the mentioned
15 The directory can be viewed as a _________ that translates file
names into their directory entries.
a) symbol table BT1
b) partition CO5
c) swap space
d) cache
16 In a tree structure, when deleting a directory that is not empty?
a) The contents of the directory are safe
b) The contents of the directory are also deleted CO5 BT2
c) contents of the directory are not deleted
d) none of the mentioned
17 An absolute path name begins at the _____________
a) leaf
b) stem CO5 BT1
c) current directory
d) root
18 What is the mount point?
a) an empty directory at which the mounted file system will be
attached BT1
b) a location where every time file systems are mounted CO5
c) is the time when the mounting is done
d) none of the mentioned
19 The machine containing the files is the _______ and the machine
wanting to access the files is the ______
a) master, slave BT1
b) memory, user CO5
c) server, client
d) none of the mentioned
20 In contiguous allocation _____________
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks BT1
c) all the pointers to scattered blocks are placed together in one CO5
location
d) none of the mentioned
21 In indexed allocation _____________
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks BT1
c) all the pointers to scattered blocks are placed together in one CO5
location
d) none of the mentioned
22 One difficulty of contiguous allocation is _____________
a) finding space for a new file
b) inefficient CO5 BT2
c) costly
d) time taking
23 For each file there exists a ___________ that contains information
about the file, including ownership, permissions and location of the
file contents.
a) metadata CO5 BT1
b) file control block
c) process control block
d) all of the mentioned
24 When in contiguous allocation the space cannot be extended easily? CO5 BT2
a) the contents of the file have to be copied to a new space, a
larger hole
b) the file gets destroyed
c) the file will get formatted and lost all its data
 d) none of the mentioned
25 In the linked allocation, the directory contains a pointer to which
block?
I. first block
II. last block BT1
a) I only CO5
b) II only
c) Both I and II
d) Neither I nor II
26 What is the major disadvantage with a linked allocation?
a) internal fragmentation
b) external fragmentation CO5 BT2
c) there is no sequential access
d) there is only sequential access
27 What if a pointer is lost or damaged in a linked allocation?
a) the entire file could get damaged
b) only a part of the file would be affected CO5 BT2
c) there would not be any problems
d) none of the mentioned
28 Some directory information is kept in main memory or cache to
___________
a) fill up the cache BT1
b) increase free space in secondary storage CO5
c) decrease free space in secondary storage
d) speed up access
29 When a fixed amount of swap space is created during disk
partitioning, more swap space can be added only by?
I) repartitioning of the disk
II) adding another swap space elsewhere BT1
a) only I CO5
b) only II
c) both I and II
d) neither I nor II
30 Indexed allocation _________ direct access.
a) supports
b) does not support CO5 BT1
c) is not related to
d) none of the mentioned
PART B (4 Marks)
1 Discuss the criteria for choosing a file organization? CO5 BT1
2 List the common file types along with their extensions and describe BT1
each file type? CO5
3 Differentiate among the following disk scheduling algorithms? BT2
a) FCFS b) SSTF CO5
4 Explain the following in detail with respect to disk? a) Seek time BT1
b) Latency c) Access time d) Transfer time CO5
5 Give an example of an application in which data in a file should be BT2
accessed in the following order: i. sequential ii. Random CO5
6 Define the terms – file, file path, directory? CO5 BT1
7 Explain any four common file attributes? CO5 BT1
8 Explain any four file operations? CO5 BT1
9 What are the advantages and disadvantages of contiguous
CO5 BT2
and non-contiguous memory allocation?
10 Discuss in detail about various allocation methods CO5 BT1
11 Prepare a general graph directory in file system CO5 BT1
12 Express the views on –disk structure in file system
CO5 BT2
implementation
13 Give the importance of swap space management CO5 BT2
14 Conclude which disk scheduling algorithm would be the best to
CO5 BT2
Optimize the performance of a RAM disk.
15 Summarize the characteristics that determine the disk
CO5 BT2
access speed.
16 Discuss about a Disk space management CO5 BT1
17 Discuss about Swap -space management CO5 BT1
18 Define log structured file. What are the disadvantages of log
CO5 BT2
Structured file systems?
19 Discuss the advantage and disadvantages of supporting
CO5 BT2
links to files that cross mount points
20 Discuss the objectives of file management system. CO5 BT2
PART C (12 Marks)
1 Describe indexed file and indexed sequential file organization? CO5 BT1
2 Describe the file system of UNIX? CO5 BT1
3 Differentiate among the following disk scheduling algorithms? a) BT2
SCAN b) C-SCAN c) LOOK d) C-LOOK CO5
4 Explain the following file concepts: a) File attributes b) File BT1
operations c) File types d) Internal file structure CO5
5 Discuss the following a) File system mounting b) Thrashing CO5 BT1
6 Explain the concept of file sharing? What are the criteria to be BT1
followed in systems which implement file sharing? CO5
7 Describe the following Directory Implementation methods? BT1
a) Linear List b) Hash Table CO5
8 Explain the concept and techniques of free space management? CO5 BT1
9 Discuss in detail the performance issues of secondary storage BT2
management? CO5
10 Consider that a disk drive has 5,000 cylinders, numbered 0 to CO5 BT5
4,999. The drive is currently serving request at cylinder 143, and
the previous request was at cylinder 125. The queue of pending
requests, in FIFO order, is: 86, 1470, 913, 1774, 948, 1509, 1022,
1750, 130 Starting from the current head position, what is the total
 distance (in cylinders) that the disk arm moves to satisfy all
pending requests for each of the following disk scheduling
algorithms? A. FCFS B. SSTF C. SCAN D. C-SCAN E. LOOK F.
C-LOOK

Note:

1. BT Level – Blooms Taxonomy Level

2. CO – Course Outcomes

BTL1 –Remember BTL2 – Understand BTL3 – Apply BTL4 – Analyze BTL5 – Evaluate
BTL6 – Create