ST.

JOSEPH’S COLLEGE OF ENGINEERING & Format ACD-

TECHNOLOGY No. CF-QB
Elupatti, Thanjavur – 613 403 Issue No. 01
QUESTION BANK Rev. No. 00

Academic Year: 2022-2023 / EVEN Dept/Year&Sec/Semester: CSE/II&B/IV

Subject Code & Name: CS3451 & Introduction to Operating Systems

UNIT I – INTRODUCTION
Computer System - Elements and organization; Operating System Overview - Objectives and
Functions - Evolution of Operating System; Operating System Structures – Operating System
Services - User Operating System Interface - System Calls – System Programs - Design and
Implementation - Structuring methods.
PART - A
Q.No Questions Competence
Level
1. Differentiate between tightly coupled systems and loosely U Understanding
coupled systems.
2. List out the various operating system components. R Remembering
3. Define Operating System. R Remembering
4. What is the responsibility of kernel? R Remembering
5. Consider a memory system with a cache access time of 10ns and
a memory access time of 110ns – assume the memory access time
includes the time to check the cache. If the effective access time AZ Analyzing
is 10% greater than the cache access time, what is the hit ratio H?
6. List out some system calls required to control the communication AZ Analyzing
system.
7. Differentiate between symmetric and asymmetric multiprocessor. R Remembering
8. Is OS a resource Manager? If so justify your answer. AP Applying
9. What is meant by system call? R Remembering
10. What is SYSGEN and system boot? U Understanding
11. What is the purpose of system programs? R Remembering
12. Compare and contrast DMA and Cache memory. E Evaluating
13. Write the differences of batch systems and time sharing systems. U Understanding
14. Do timesharing differ from multiprogramming? If so, How? AP Applying
15. What are the objectives of operating systems? U Understanding
16. Why API's need to be used rather than system calls? E Evaluating
17. How would you build clustered systems? C Creating
18. What is dual mode operation and what is the need of it? AZ Analyzing
19. Illustrate the use of fork and exec system calls. AP Applying
20. What are the advantages of Peer –to- peer system over client - C Creating
server systems?
PART – B

1. (i) Explain the various types of system calls with an example for each.(8)
(ii) Discuss the functionality of system boot with respect to an Operating E Evaluating
System. (5)
2. Illustrate how the operating system has been evolved from serial
AP Applying
processing to multiprogramming system. (13)
3. (i) Explain the various structure of an operating system. (8)
(ii) Describe system calls and system programs in detail with neat sketch. R Remembering
(5)
4. Describe the evolution of operating system. (13) U Understanding
5. (i).Discuss the pros and cons of simple processor system and multi core
system and clustered system.(8)
(ii).Explain the steps involved to transfer the stored historical information U Understanding
in a magnetic tapes to the CPU for further processing through various
storage devices.(5)
6. State the operating system structure. Describe the operating system
operations in detail. Justify the reason why the lack of a hardware
C Creating
supported dual mode can cause serious shortcoming in an operating
system?(13)
7. Explain the different architecture of OS starting from simple
structure, layered structure, micro kernels, modules and hybrid
AP Applying
systems, with suitable examples OS structure, including Google’s
Android(13)
8. (i) Discuss about the evolution of virtual machines. Also explain how
virtualization could be implemented in Operating Systems. (7)
(ii) Discuss the different multiprocessor organizations with block
U Understanding
diagrams. (6)
9. (i) Explain the various memory hierarchies with neat block diagram. (7)
R Remembering
(ii) Explain interrupts in detail. (6)
10. How computer system handles interrupts? Discuss how interrupts can be
handled quickly. (13) AZ Analyzing
11. (i) Distinguish between the client server and peer to peer models of
distributed systems. (7)
R Remembering
(ii) Describe three general methods for passing parameters to the OS with
example. (6)
12. Discuss the essential properties of the following types of systems.
(i) Time sharing systems. (4)
R Remembering
(ii) Multi-processor systems. (4)
(iii) Distributed systems. (5)
13. Explain cache memory and its mapping. (13) AZ Analyzing
14. (i) How could a system be designed to allow a choice of operating systems
from which to boot?What would the bootstrap program need to do?(8)
(ii) Discuss about Direct memory access.(5) AZ Analyzing

PART – C
1. (i) With neat sketch discuss computer system overview.(8)
(ii) Enumerate the different operating system structure and explain with C Creating
neat sketch. (7)
2. (i) State the basic functions of OS and DMA.(5) Evaluating
E
(ii) Explain system calls system programs and OS generation.(10)
 UNIT II -PROCESS MANAGEMENT
Processes - Process Concept, Process Scheduling, Operations on Processes, Inter-process Communication;
CPU Scheduling - Scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real time
scheduling; Threads- Overview, Multithreading models, Threading issues; Process Synchronization - The
critical-section problem, Synchronization hardware, Mutex locks, Semaphores, Classic problems of
synchronization, Critical regions, Monitors; Deadlock - System model, Deadlock characterization,
Methods for handling deadlocks, Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery
from deadlock
PART – A
Q.No Questions Level Competence

1. Name and draw five different process states with proper R Remembering
definition.
2. Define the term 'Dispatch Latency'. R Remembering
3. Is the context switching an overhead? Justify your answer. AZ Analyzing
4. Distinguish between CPU bounded and I/O bounded processes. U Understanding
5. Why is IPC needed? Name the two fundamental models of IPC. R Remembering
6. Give an programming example in which multithreading does not AZ Analyzing
provide better performance than a single -threaded solutions.
7. What are the benefits of synchronous and asynchronous AP Applying
communication?
8. Differentiate single threaded and multi-threaded processes. AZ Analyzing
9. Differentiate preemptive and non-preemptive scheduling. U Understanding
10. List out the data fields associated with Process Control Blocks. C Creating
11. “Priority inversion is a condition that occurs in real time systems
E Evaluating
where a low priority process is starved because higher priority
processes have gained hold of the CPU” – Comment on this
statement.
12. What is meant by 'starvation' in operating system? U Understanding
13. What is the concept behind strong semaphore and spinlock? AP Applying
14. Give the queueing diagram representation of process scheduling U Understanding
15. What is the meaning of the term busy waiting? E Evaluating
16. Elucidate mutex locks with its procedure. R Remembering
17. Under what circumstances would a user be better off using a AP Applying
timesharing
system rather than a PC or single –user workstation?
18. What are the differences between user level threads and kernel E Evaluating
level threads? Under what circumstances is one type better than
the other?
19. “If there is a cycle in the resource allocation graph, it may or C Creating
may not be in deadlock state“. Comment on this statement.
20. List out the methods used to recover from the deadlock. R Remembering
 PART – B
1. (i) Explain why interrupts are not appropriate for implementing
synchronous primitives in multiprocessor systems. (8)
(ii) Compute the average waiting time for the processes using non- AZ Analyzing
preemptive SJF scheduling algorithm.(5)
2. Describe the differences among short- term, medium-term and long-
term scheduling with suitable example. (13) R Remembering
3. (i) What is a process? Discuss components of process and various
states of a process with the help of a process state transition diagram. U Understanding
(8)
(ii) Write the difference between user thread and kernel thread.(5)
4. Discuss how the following pairs of scheduling criteria conflict in
certain settings.
i. CPU utilization and response time. (4) R Remembering
ii. Average turnaround time and maximum waiting time. (5)
iii. I/O device utilization and CPU utilization. (4)
5. (i) Discuss the actions taken by a kernel to context-switch between
processes. (7)
(ii) Provide two programming examples in which multithreading does Ap Applying
not provide better performance than a single threaded solution. (6)

6. Consider the following set of processes with the length of the CPU-
burst time in given ms: 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.(13)
Ap Applying
7. Explain the differences in the degree to which the following
scheduling algorithms discriminate in favor of short processes: AZ Analyzing
(i) RR (7)
(ii) Multilevel feedback queues. (6)
8. Outline a solution using semaphores to solve dinning philosopher E Evaluating
problem. (13)
9. (i) Show how wait() and signal() semaphore operations could be
implemented in multiprocessor environments, using Test and Set
instructions. The solution should exhibit minimal busy waiting. C Creating
Develop pseudo code for implementing operations. (7)
(ii) Discuss about issues to be considered with multithreaded programs.
(6)
 Process Arrival Burst time
time Process Burst Time Arrival time
P1 0 7 P1 8 0
P2 2 4 P2 4 1
10. Explain
P3 Deadlock detection
4 with1suitable example.
P3 (13) 9 AZ 2 Analyzing
P4 5 4 P4 5 3
11. Consider
P5 the snapshot
3 of a system(13)
4 P5 3 4
Max Allocation Available
ABCD ABCD ABCD
P0 2001 42 12 33 21
P1 3121 52 52
P2 2103 23 16
P3 1312 14 24
P4 1432 36 65 U Understanding
Answer the following Using Banker’s algorithm,
(i) illustrate that the system is in safe state by demonstrating an order in
which the processees may complete?(5)
(ii)If a request from process P1 arrives for(1,1,0,0) can the request be
granted immediately? (4)
(iii)if the request from p4 arrives for(0,0,2,0) can the request be granted
immediately? (4)

12. (i) Explain thread and SMP management. (4)

(ii) Illustrate semaphores with neat example.(4)
(iii) The operating system contains 3 resources, the number of
instance of each resource type are 7,7,10. The current
resource allocation state is as shown below.
R Remembering
Is the current allocation in a safe state? (5)

13. (i) Explain the dining philosophers critical section problem solution using
monitor.(8)
(ii) Write the algorithm using test-and –set () instruction that satisfy all U Understanding
the critical section requirments(5)

14. (i) Is it possible to have concurrency but not parallelism? Explain.

(6)
(ii) Consider a system consisting of four resources of the same type AP Applying
that are shared by three processes, each of which needs at most two
resources. Show that the system is deadlock free. (7)
PART – C
1. Which of the following scheduling algorithms could result in starvation?
(i)First-come, first-served (5)
(ii) Shortest job first (5)
(iii) Round robin (5) C
Detail with Justification.
Creating
2. (i).Consider the following set of processes with the length of CPU
burst time given in milliseconds.

E Evaluating

Draw the Gantt chart for the execution of these processes using FCFS,
SJF, SRTS, pre-emptive and non pre-emptive priority and Round robin
with the time slice of 2ms, Find average waiting time and turnaround
time using each of the methods.(10).
(ii).Explain –multi level queue and multi level feedback queue
scheduling with suitable examples(5)

3. Consider a system consisting of ‘m’ resources of the same type, being

shared by ‘n’ processes. Resources can be requested and released by
processes only one at a time. Show that the system is deadlock free if the
following two conditions hold: (15)
AZ Analyzing
a) The maximum need of each process is between 1 and m resources
b) The sum of all maximum needs is less than m+n.
4. Consider the following system snapshot using data structures in the
Banker’s algorithm with resources A,B,C and D and process P0 to P4:
Max Allocation Available Need
ABCD ABCD ABCD ABCD
P0 6012 4001 3211
P1 1750 1100
P2 2356 1254
P3 1653 0633 E Evaluating
P4 1656 0212
Using Banker’s algorithm, answer the following questions:
(i)How many resources of type A,B,C and D are there? (3)
(ii)What are the contents of the need matrix? (3)
(iii) Is the system in a safe state? Why? (3)
(iv) If a request from process P4 arrives for additional resources of
(1,2,0,0) can the banker’s algorithm grant the request immediately? Show
the new system state and other criteria. (6)

Current Allocation Maximum need

Process

R1 R2 R3 R1 R2 R3

P1 Process
2 2 Burst3 Time 3 6priority8 Arrival
Time
P1 10 3 0
P2 2 0 3 4 3 3
P2 1 1 1
P3 2 3 2
P3 P41 2 41 3 4 4 4 1
P5 5 2 2
 UNIT III - MEMORY MANAGEMENT
Main Memory - Swapping - Contiguous Memory Allocation – Paging - Structure of the Page Table -
Segmentation, Segmentation with paging; Virtual Memory - Demand Paging – Copy on Write - Page
Replacement - Allocation of Frames –Thrashing

6. In memory
When domanagement
page consider occur?
faults the program named astheStack1
Consider which
reference
C Creating
size is 100 KB.This program is loaded inPART
string:1,2,3,4,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. – Amemory from 2100 to
the main
Q.No 2200KB.
How many Show
pagethe contents
faults of the
and page pagerate
fault
Questions mapoccur
table for
for the FIFO,
given scenario.
LRU and C
Level Creating
Competence
optimal replacement algorithms, assuming one, two, three, four page
1. frames?
Name any (13)
two differences between logical and physical addresses. U Understanding
7.
2. Given memory
Differentiate paging partitions of 500 KB, 100 KB, 300 KB, 200 KB and 600
and segmentation. U Understanding
KB in order, how would each of the first-fit, best-fit, and worst-fit
3. What is the place
algorithms purpose of paging
processes of the
sizepage
418tables?
KB, 202 KB, 506 KB,11 2 KB, AZ Analyzing
AZ Analyzing
4. and
What95is KB (in order)?
a working Which the algorithms make the most efficient use
set model? R Remembering
5. of memory? (7)
(ii)
What Differentiate
are the countingexternal fragmentation
based with internal
page replacement fragmentation.(6)
algorithm? R Remembering
6.
8. Compare paging with segmentation in terms of the amount of memory
7. Will optimal
required by thepage replacement
address translationalgorithm suffer
structures from to
in order Belady’s
convertanomaly?
virtual E
R Evaluating
Remembering
Justify your answer.
addresses to physical addresses. (13)
8.
9. State
a) the effect
Explain of Thrashing
in detail in an operating
about thrashing. (7) system. U Understanding
9. What is thrashing? and how to resolve thisproblem?
b) Explain in detail about allocation of kernel memory. (6)
R Remembering
10. What is meant by address binding? Mention the different types. R Remembering
10. Draw the diagram of segmentation memory management scheme and
11. Write about swapping. Let us assume the user process is of size 1MB and AP Applying
explain its principle. (13) E Evaluating
the backing store is a standard hard disk with a transfer rate of 5 MBPS.
11. (i) Under what circumstances do page faults occur? Describe the actions
Calculate the transfer rate.
taken by the operating system when a page fault occurs.(7)
12. How does the system detect thrashing?
(ii) Discuss situations in which the least frequently used (LFU) page
AZ Analyzing
AZ Analyzing
13. replacement algorithm generates fewer page fault than the least recently
Consider the following Segmentation table.
used (LRU) page replacement algorithm. Also Discuss under what
Segment Base Length
circumstances the opposite holds good.(6)
0 219 600
12. (i) Explain
1 the global2300and local frame14allocation algorithms and their pros E Evaluating
and 2cons. (3) 90 100
(ii) Consider
3 the
1327 following
580 page reference
String.1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.
4 1952 96 How many page faults
would occur physical
for the following AZ Analyzing
What arethe addresses replacement
for the logical algorithms
addresses,assuming 1 and 3
3400 and 0110?
14. free
What do you mean by compaction? In which situation is it applied? first
frames. Remember that all the frames are initially empty so that AP Applying
unique
Consider pagethe request
followingwillpage-reference
all cost one fault each. LRU replacement, FIFO,
string:
15.
Optimal 1,2,3,4,5,6,7,8,9,10,11,12.
replacement, LFU,MFU.(10) R Remembering
13. Discuss
How manythe page
givenfaults
memoryand management
page fault ratio
techniques
would occur
withfor
diagrams.
the FIFO page
replacementAllocation
(i)Partition algorithm?Methods
Assuming (7) there is four frames. U Understanding
16. (ii)Paging and Translation
What is meant by pre paging?Look-aside Buffer.(6)
Is it better than demand paging? C Creating
14.
17. (i) Consider a computer system
Define external fragmentation. with 16 bit logical address and 4KB page R Remembering
size.The system support upto 1 MB of
Define demand paging in memory management .Whatphysical memory.
are Assume
the stepsthat the
18. AZ Analyzing
actual addresssize is only 33KB,Page table base register contains
required tofree
1000.and handle
framea list
pagecontains
fault in13,11,9,7,5,3,1,2,4,6,8.
demand paging?
19. Mention thephysical
Construct significance
and of LDT and
logical GDT structures,
memory in segmentation.
page table of the AP Applying
20. Why are
correspondipage sizes always powers of 2? AP Applying
PART – B
1. What is demand paging? Describe the process of demand paging in OS.
U
R Understanding
Remembering
(13)
2. (i) With a neat sketch, explain how logical address is translated into
physical address using Paging mechanism. (7) R Remembering
(ii) Write short notes on memory-mapped files (6)
3. Explain
ng process. why sharing a reentrant module is easier when segmentation is
AP Applying
used than when pure
Find the physical paging
address of is13,256
used with example.(13)
and another logical address with page
4. number (i) 2 and Discuss
offset ofabout
128. free space management on I/O buffering and
Discuss about the possible valid-invaild blocking.
bit and(7)
possible protection bits in E Evaluating
(ii) Discuss
page table.(8)the concept of buddy system allocation with neat sketch. (6)
5. Discuss
(ii) situation under
Consider which system
a paging the mostwith
frequently used
page table pageinreplacement
stored memory
algorithm(1)generates
If a memory
fewer reference
page faults takes
than50ns how long
the least doesused
recently a paged
page
U Understanding
replacement memoryalgorithm.referenced take? under which circumstances the
Also discuss
opposite (2) If we add TLB and 75% of all page table reference are found
holds.(13)
in TLB, what is the effective memory reference time?
(Assume that find a page entry in TLB takes 2ns,if entry is
present) (5)
PART – C
 1. Consider the following page reference string: 1, 2, 3, 4, 5, 3,4,1,6,7,8,7, 8,
9, 7, 8, 9, 5, 4, 4, 5, 3 How many page faults would occur for the
following replacement algorithms, assuming four frames? Remembering
all frames are initially empty. (15) E Evaluating
i) LRU replacement
ii) FIFO replacement
iii) Optimal replacement.
2. (i) Explain in detail about paging in 32-bit and 64-bit architectures (5)
(ii) Consider a system that allocated pages of different sizes to its
C Creating
processes. What are the advantages of such a paging scheme? What are
modifications to the virtual memory system provide this functionality?
(10)
3. (i) Consider the following page reference string: 1,2, 3, 2, 5, 6, 3, 4, 6, 3,
7, 3, 1, 5, 3, 6, 3, 4, 2, 4, 3, 4, 5, 1 Indicate page faults and calculate total
number of page faults and successful ratio for FIFO, optimal and LRU E Evaluating
algorithms. Assume there are four frames and initially all the frames are
18. Analyze
empty. (12) the backup and restore of a file system. E Evaluating
(ii) Explain the effect of thrashing. (3)
19. Identify the two important function of virtual File System (VFS) layer in C Creating
4. the concept of file system implementation.
(i) Explain the difference between internal and external fragmentation. (7)
20. (ii)Discuss
Compare contiguous
situations in allocation
which the with
mostlinked allocation
frequently usedmethod.
(MFU) page U Understanding
replacement algorithm generates fewer page PARTfaults- than
B the least recently Az Analyzing
1. used (LRU)
Describe page-replacement
in detail about file sharing algorithm. Also discuss under what
and protection.(13) R Remembering
circumstances the opposite holds. (8)
2. Analyze the various file system mounting methods in detail.(13) C Creating
UNIT IV – STORAGE MANAGEMENT
3. Explain in detail about tree structured and acyclic graph directories.(13) E Evaluating
Mass
4. Storage system
(i)Describe with–a neat
Disksketch
Structureabout- the
Disk Scheduling
various directory and Management;
structure. (7) File-System Interface - File
concept(ii)Describe
- Access methods - Directory Structure - Directory organization R Remembering
in detail about free space management with neat examples.(6)- File system mounting - File
Sharing
5. and Protection; (i) File System Implementation Discuss - File System Structure - Directory implementation
about the various file access methods.
- Allocation Methods - Free Space Management; I/O Systems – I/O Hardware, Application U Understanding
I/O interface,
(7) (ii)With neat sketch explain about
Kernel I/O subsystem. the: (6)
a) Directory structure PART – A sharing
b) File
6.Q.No Explain in detail about file attributes and
Questions file operation.(13) ULevel Understanding
Competence
7. Illustrate an application that could benefit from operating system support AP E Applying
1. for Compare
random access the various file access
to indexed methods.
files. (13) Evaluating
8. 2. Consider
How does a fileDMAsystem where system
increase a file can be deleted and its disk space
concurrency? AZ Analyzing
Reclaimed while links to UNIT
that V
file –
stillVIRTUAL
exist. What MACHINES
problems may AND
occur if
3. Enlist different types of directory structure. AP AP Applying
Applying
a new file is created in the same storage MOBILE area or withOS the same absolute
4. pathMention
name?–How the common
can these file types be avoided? (13)
problems AZ Analyzing
Virtual Machines History, Benefits and Features, Building Blocks, Types of Virtual Machines and
9. 5. ExamineList out in the major
detail attributes
about and operations
the protection of a file system.
of file system.(13) AZ R Remembering
Analyzing
their Implementations,
6. What is Virtualization
relative block number? and Operating-System Components; Mobile OS AP- iOS andApplying
10. (i) Why is it important to balance file system I/O among the disks and
7.controllers
Android. Do FATonfile system advantageous? Justify
a system in a multitasking environment? (6) your answer? AZ Analyzing
8. (ii) How the information
Discuss the advantages in the
andfile can be accessed?
disadvantages of supporting links to U AP Understanding
Applying
9.filesList
thatout
crossthe mount
drawbackspoints. in (7)
indexed allocation
PART – A R Remembering
Q.No10.(i) Explain
Define UFD and MFD. Questions
in detail the various allocation methods with their pros and Level R Competence
Remembering
11.
11.consGive (8) the disadvantages of Contiguous allocation. U Understanding
1. 12.Compare the various file access methods. RE Remembering
Evaluating
Analyze
(ii) Brief the the advantages
various procedures of bit
need vector
to befree space management
followed in disk C Creating
2. 13.How does DMAbetween
management(5)
Differentiate increase filesystem
and concurrency?
directory. AZ R Analyzing
Remembering
12. (i) Explain
What is why logging
consistency metadata
checking?
3. 14.Enlist different types of directory structure. updates ensures recovery of a file AP U Understanding
Applying
system after a file-system crash. (7) AZ Analyzing
15.
4. (ii) Write
Mention
Explain Short
thethe notes
common
issues inon file system
filedesigning mounting.
types a file system. (6) AZ U Understanding
Analyzing
16.
5. Examine What
List out the is the
in major
advantage
attributes of bit vector
and operations approach
and disk of
in free space
a file system. management? R R Remembering
Remembering
13. detail about Directory structure. (13) AZ Analyzing
6. 17.(i)
14. What Whatrelative
is boot block
In aisvariable
controlnumber?
partition
block?
scheme, the operating system has to keep track of AP R Remembering
Applying
7. Do FAT file system advantageous? Justify your answer?
allocated and free space. Suggest a means of achieving this. Describe the AZ Analyzing
8. effects
How theofinformation
new allocationsin the fileandcan be accessed?
process terminations in your suggested AP Applying
Remembering
R
9. Listscheme. (5) drawbacks in indexed allocation
out the R Remembering
10. (ii)DefineExplain
UFD in andbrief
MFD. about different allocation methods with neat sketch. R Remembering
11. Give(8) the disadvantages of Contiguous allocation. U Understanding
12. Analyze the advantages of bit vector free PART space–C management C Creating
13.
1. Give an example
Differentiate between of file
an application
and directory. in which data in a file should be R Remembering
What is consistency
14. accessed checking?
in the following order U Understanding
C Creating
15. Write (i)Short Sequential
notes on file(8) system mounting. U Understanding
16. What(ii) Random of (7)
is the advantage bit vector approach in free space management? R Remembering
17. What is boot control block? R Remembering
 18. Analyze the backup and restore of a file system. E Evaluating
19. Identify the two important function of virtual File System (VFS) layer in C Creating
the concept of file system implementation.
20. Compare contiguous allocation with linked allocation method. U Understanding
PART - B
1. Describe in detail about file sharing and protection.(13) R Remembering
2. Analyze the various file system mounting methods in detail.(13) C Creating
3. Explain in detail about tree structured and acyclic graph directories.(13) E Evaluating
4. (i)Describe with a neat sketch about the various directory structure. (7)
(ii)Describe in detail about free space management with neat examples.(6) R Remembering
5. (i) Discuss
about the various file access methods.(7) U Understanding
(ii)With neat sketch explain about the:
(6)
a) Directory structure b) File sharing
6. Explain in detail about file attributes and file operation.(13) U Understanding
7. Illustrate an application that could benefit from operating system support
AP Applying
for random access to indexed files. (13)
8. Consider a file system where a file can be deleted and its disk space
Reclaimed while links to that file still exist. What problems may occur if
AP Applying
a new file is created in the same storage area or with the same absolute path
name? How can these problems be avoided? (13)
9. Examine in detail about the protection of file system.(13) AZ Analyzing
10. (i) Why is it important to balance file system I/O among the disks and
controllers on a system in a multitasking environment? (6)
(ii) Discuss the advantages and disadvantages of supporting links to U Understanding
files that cross mount points. (7)
11. (i) Explain in detail the various allocation methods with their pros and
cons (8)
R Remembering
(ii) Brief the various procedures need to be followed in disk
management(5)
12. (i) Explain why logging metadata updates ensures recovery of a file
system after a file-system crash. (7) AZ Analyzing
(ii) Explain the issues in designing a file system. (6)
13. Examine in detail about Directory and disk structure. (13) AZ Analyzing
PART – C
1 Give an example of an application in which data in a file should be
accessed in the following order
C Creating
(i) Sequential (8)
(ii) Random (7)

2 Under what circumstances would an user process request an operation that E Evaluate
results in the allocation of a demand-zero memory region.(13)

3 Explain in detail the design principles, kernel modules, process management, U Understanding
scheduling in LINUX system.
COURSE INSTRUCTOR HOD