0% found this document useful (0 votes)
48 views13 pages

1904304-Operating Systems

This document contains a question bank for the subject Operating Systems for the third semester students of Computer Science and Engineering at SRM Valliammai Engineering College. It is prepared by three faculty members - Dr. D. Kavitha, Ms. R. Anitha and Mr. N. Leo Bright Tennisson. The question bank contains questions in three parts - Part A with short answer questions, Part B with longer descriptive questions and Part C with application-based questions requiring explanations with diagrams. The questions cover two units of the subject - Processes and Process Scheduling and Synchronization. The questions test different cognitive levels ranging from remembering to creating, as per Bloom's taxonomy.

Uploaded by

nathansel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views13 pages

1904304-Operating Systems

This document contains a question bank for the subject Operating Systems for the third semester students of Computer Science and Engineering at SRM Valliammai Engineering College. It is prepared by three faculty members - Dr. D. Kavitha, Ms. R. Anitha and Mr. N. Leo Bright Tennisson. The question bank contains questions in three parts - Part A with short answer questions, Part B with longer descriptive questions and Part C with application-based questions requiring explanations with diagrams. The questions cover two units of the subject - Processes and Process Scheduling and Synchronization. The questions test different cognitive levels ranging from remembering to creating, as per Bloom's taxonomy.

Uploaded by

nathansel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

 

SRM VALLIAMMAI ENGINEERING COLLEGE


SRM Nagar, Kattankulathur – 603 203

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


QUESTION BANK

III SEMESTER

1904304-Operating Systems

Regulation – 2019

CHOICE BASED CREDIT SYSTEM

Academic Year 2021 – 22 (Odd Semester)

Prepared by

Dr. D.Kavitha, Assistant Professor /CSE

Ms. R.Anitha, Assistant Professor/CSE

Mr. N. Leo Bright Tennisson, Assistant Professor/CSE

 
 
SRM VALLIAMMAI ENGINEERING COLLEGE
SRM Nagar, Kattankulathur – 603 203.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK
SUBJECT : Operating Systems
SEM / YEAR: IIISem/IIYear

UNIT I -PROCESSES
Introduction to operating systems - Evolution of Operating System - Operating System-structures –
System calls – System programs –Processes: Process concept – Process scheduling – Operations on
processes –Inter process communication – Communication in client-server systems.

PART - A
Q.No Questions BT Competence
Level
1. Differentiate between tightly coupled systems and loosely coupled BTL-2 Understanding
systems.
2. List out the various operating system components. BTL-1 Remembering
3. Define Operating System. BTL-1 Remembering
4. What is the responsibility of kernel? BTL-1 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 is 10% greater BTL-4 Analyzing
than the cache access time, what is the hit ratio H?
6. List out some system calls required to control the communication system. BTL-4 Analyzing
7. Differentiate between symmetric and asymmetric multiprocessor. BTL-1 Remembering
8. Is OS a resource Manager? If so justify your answer. BTL-3 Applying
9. What is meant by system call? BTL-1 Remembering
10. What is SYSGEN and system boot? BTL-2 Understanding
11. What is the purpose of system programs? BTL-1 Remembering
12. Compare and contrast DMA and Cache memory. BTL-5 Evaluating
13. Write the differences of batch systems and time sharing systems. BTL-2 Understanding
14. Do timesharing differ from multiprogramming? If so, How? BTL-3 Applying
15. What are the objectives of operating systems? BTL-2 Understanding
16. Why API's need to be used rather than system calls? BTL-5 Evaluating
17. How would you build clustered systems? BTL-6 Creating
18. What is dual mode operation and what is the need of it? BTL-4 Analyzing
19. Illustrate the use of fork and exec system calls. BTL-3 Applying
20. What are the advantages of Peer –to- peer system over client -server BTL-6 Creating
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 BTL-5 Evaluating
System. (5)
2. Illustrate how the operating system has been evolved from serial
BTL-3 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. BTL-1 Remembering
(5)
4. Describe the evolution of operating system. (13) BTL-2 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 BTL-2 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 BTL-6 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
BTL-3 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 BTL-2 Understanding
diagrams. (6)
9. (i) Explain the various memory hierarchies with neat block diagram. (7)
BTL-1 Remembering
(ii) Explain interrupts in detail. (6)
10. How computer system handles interrupts? Discuss how interrupts can be
handled quickly. (13) BTL-4 Analyzing
11. (i)Distinguish between the client server and peer to peer models of
distributed systems. (7)
BTL-1 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)
BTL-1 Remembering
(ii) Multi-processor systems. (4)
(iii) Distributed systems. (5)
13. Explain cache memory and its mapping. (13) BTL-4 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) BTL-4 Analyzing

PART - C
1. (i) With neat sketch discuss computer system overview.(8)
(ii) Enumerate the different operating system structure and explain with BTL-6 Creating
neat sketch. (7)
2. (i)State the basic functions of OS and DMA.(5) Evaluating
BTL-5
(ii)Explain system calls system programs and OS generation.(10)
 
 
3. (i) Describe a mechanism for enforcing memory protection in order to
prevent a program from modifying the memory associated with other
programs. (8) BTL-5 Evaluating
(ii) What are the advantages and disadvantages of using the same system
call interface for manipulating both files and devices? (7)
4. (i) Describe in detail about multicore organization. (8)
(ii) Computer system architecture deals about how the component of a BTL-4 Analyzing
computer system may be organized? Discuss detail about different
architecture of a computer system. (7)

UNIT II -PROCESS SCHEDULING AND SYNCHRONIZATION


CPU Scheduling: Scheduling criteria – Scheduling algorithms – Multiple-processor scheduling.
Process Synchronization: The critical-section problem –Synchronization hardware – 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 BT Competence
Level
1. Name and draw five different process states with proper definition. BTL-1 Remembering
2. Define the term 'Dispatch Latency'. BTL-1 Remembering
3. Is the context switching an overhead? Justify your answer. BTL-4 Analyzing
4. Distinguish between CPU bounded and I/O bounded processes. BTL-2 Understanding
5. Why is IPC needed? Name the two fundamental models of IPC. BTL-1 Remembering
6. Give an programming example in which multithreading does not provide BTL-4 Analyzing
better performance than a single -threaded solutions.
7. What are the benefits of synchronous and asynchronous communication? BTL-3 Applying
8. Differentiate single threaded and multi-threaded processes. BTL-4 Analyzing
9. Differentiate preemptive and non-preemptive scheduling. BTL-2 Understanding
10. List out the data fields associated with Process Control Blocks. BTL-6 Creating
11. “Priority inversion is a condition that occurs in real time systems where a
low priority process is starved because higher priority processes have BTL-5 Evaluating
gained hold of the CPU” – Comment on this statement.
12. What is meant by 'starvation' in operating system? BTL-2 Understanding
13. What is the concept behind strong semaphore and spinlock? BTL-3 Applying
14. Give the queueing diagram representation of process scheduling BTL-2 Understanding
15. What is the meaning of the term busy waiting? BTL-5 Evaluating
16. Elucidate mutex locks with its procedure. BTL-1 Remembering
17. Under what circumstances would a user be better off using a timesharing BTL-3 Applying
system rather than a PC or single –user workstation?
18. What are the differences between user level threads and kernel level BTL-5 Evaluating
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 may not be BTL-6 Creating
in deadlock state“. Comment on this statement.
20. List out the methods used to recover from the deadlock. BTL-1 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-
preemptive SJF scheduling algorithm.(5)
Process Arrival Burst time
time
P1 0 7 BTL-4 Analyzing
P2 2 4
P3 4 1
P4 5 4
P5 3 4

2. Describe the differences among short- term, medium-term and


long-term scheduling with suitable example. (13)  BTL1 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. (8) BTL2 Understanding
(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) BTL1 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 BTL3 Applying
does 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:
Process Burst Time Arrival time
P1 8 0
P2 4 1
P3 9 2 BTL3 Applying
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.(13)
7. Explain the differences in the degree to which the following scheduling
algorithms discriminate in favor of short processes: BTL-4 Analyzing
(i) RR (7)
(ii) Multilevel feedback queues. (6)
8. Outline a solution using semaphores to solve dinning philosopher BTL-5 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. Develop BTL6 Creating
pseudo code for implementing operations. (7)
(ii)Discuss about issues to be considered with multithreaded programs.(6)

 
 
10. Explain Deadlock detection with suitable example. (13) BTL-4 Analyzing

11. Consider the snapshot of a system(13)

Max Allocation Available


ABCD ABCD ABCD
P0 2001 42 12 3 3 21
P1 3121 52 52
P2 2103 23 16
P3 1312 14 24
P4 1432 36 65 BTL2 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.
Current Allocation Maximum need BTL1 Remembering
Process
R1 R2 R3 R1 R2 R3
P1 2 2 3 3 6 8
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4
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 BTL2 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 BTL-3 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) BTL-6 Creating
Detail with Justification.

 
 
2. (i).Consider the following set of processes with the length of CPU
burst time given in milliseconds.
Process Burst Time priority Arrival
Time
P1 10 3 0
P2 1 1 1
P3 2 3 2
P4 1 4 1 BTL-5 Evaluating
P5 5 2 2
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)
BTL-4 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 BTL-5 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)

UNIT III - STORAGE MANAGEMENT


Main Memory Management: Background – Swapping – Contiguous memory allocation – Paging –
Segmentation – Segmentation with paging. Virtual Memory: Background – Demand paging –
Process creation – Page replacement – Allocation of frames – Thrashing.
PART - A
Q.No Questions BT Competence
Level
1. Name any two differences between logical and physical addresses. BTL-2 Understanding
2. Differentiate paging and segmentation. BTL-2 Understanding
3. What is the purpose of paging the page tables? BTL-4 Analyzing
4. What is a working set model? BTL-1 Remembering

 
 
5. In memory management consider the program named as Stack1 which
BTL-6 Creating
size is 100 KB.This program is loaded in the main memory from 2100 to
2200KB. Show the contents of the page map table for the given scenario.
6. What are the counting based page replacement algorithm? BTL-1 Remembering
7. Will optimal page replacement algorithm suffer from Belady’s anomaly? BTL-5 Evaluating
Justify your answer.
8. State the effect of Thrashing in an operating system. BTL-2 Understanding
9. What is thrashing? and how to resolve thisproblem? BTL-1 Remembering
10. What is meant by address binding? Mention the different types. BTL-1 Remembering
11. Write about swapping. Let us assume the user process is of size 1MB and
BTL-5 Evaluating
the backing store is a standard hard disk with a transfer rate of 5 MBPS.
Calculate the transfer rate.
12. How does the system detect thrashing? BTL-4 Analyzing
13. Consider the following Segmentation table.
Segment Base Length
0 219 600
1 2300 14 BTL-5 Evaluating
2 90 100
3 1327 580
4 1952 96
What arethe physical addresses for the logical addresses 3400 and 0110?
14. What do you mean by compaction? In which situation is it applied? BTL-3 Applying
15. Consider the following page-reference string:
1,2,3,4,5,6,7,8,9,10,11,12. BTL-1 Remembering
How many page faults and page fault ratio would occur for the FIFO page
replacement algorithm? Assuming there is four frames.
16. What is meant by prepaging? Is it better than demand paging? BTL-6 Creating
17. Define external fragmentation. BTL-1 Remembering
18. Define demand paging in memory management.What are the steps BTL-4 Analyzing
required to handle a page fault in demand paging?
19. Mention the significance of LDT and GDT in segmentation. BTL-3 Applying
20. Why are page sizes always powers of 2? BTL-3 Applying
PART - B
1. What is demand paging? Describe the process of demand paging in OS.
BTL-2 Understanding
(13)
2. (i)With a neat sketch, explain how logical address is translated into
physical address using Paging mechanism. (7) BTL-1 Remembering
(ii)Write short notes on memory-mapped files (6)
3. Explain why sharing a reentrant module is easier when segmentation is
BTL-3 Applying
used than when pure paging is used with example.(13)
4. (i) Discuss about free space management on I/O buffering and
blocking. (7)  BTL-5 Evaluating
(ii) Discuss the concept of buddy system allocation with neat sketch. (6) 
5. Discuss situation under which the most frequently used page replacement
algorithm generates fewer page faults than the least recently used page
BTL-2 Understanding
replacement algorithm. Also discuss under which circumstances the
opposite holds.(13)

 
 
6. When do page faults occur? Consider the reference
string:1,2,3,4,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.
How many page faults and page fault rate occur for the FIFO, LRU and BTL-6 Creating
optimal replacement algorithms, assuming one, two, three, four page
frames? (13)
7. Given memory partitions of 500 KB, 100 KB, 300 KB, 200 KB and 600
KB in order, how would each of the first-fit, best-fit, and worst-fit
algorithms place processes of size 418 KB, 202 KB, 506 KB,11 2 KB,
BTL-4 Analyzing
and 95 KB (in order)? Which the algorithms make the most efficient use
of memory? (7)
(ii) Differentiate external fragmentation with internal fragmentation.(6)
8. Compare paging with segmentation in terms of the amount of memory
required by the address translation structures in order to convert virtual BTL-1 Remembering
addresses to physical addresses. (13)
9. a) Explain in detail about thrashing. (7)
BTL-1 Remembering
b) Explain in detail about allocation of kernel memory. (6)
10. Draw the diagram of segmentation memory management scheme and
BTL-3 Applying
explain its principle. (13)
11. (i)Under what circumstances do page faults occur? Describe the actions
taken by the operating system when a page fault occurs.(7)
(ii)Discuss situations in which the least frequently used (LFU) page
BTL-4 Analyzing
replacement algorithm generates fewer page fault than the least recently
used (LRU) page replacement algorithm. Also Discuss under what
circumstances the opposite holds good.(6)
12. (i)Explain the global and local frame allocation algorithms and their pros
and cons. (3)
(ii)Consider the following page reference
String.1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults
would occur for the following replacement algorithms,assuming 1 and 3 BTL-4 Analyzing
free frames.Remember that all the frames are initially empty so that first
unique page request will all cost one fault each.LRU replacement, FIFO,
Optimal replacement,LFU,MFU.(10)
13. Discuss the given memory management techniques with diagrams.
(i)Partition Allocation Methods (7) BTL-2 Understanding
(ii)Paging and Translation Look-aside Buffer.(6)
14. (i)Consider a computer system with 16 bit logical address and 4KB page
size.The system support upto 1 MB of physical memory. Assume that the
actual addresssize is only 33KB,Page table base register contains
1000.and free frame list contains 13,11,9,7,5,3,1,2,4,6,8.
Construct physical and logical memory structures, page table of the
corresponding process.
Find the physical address of 13,256 and another logical address with page
number 2 and offset of 128.
Discuss about the possible valid-invaild bit and possible protection bits in BTL-1 Remembering
page table.(8)
(ii) Consider a paging system with page table stored in memory
(1) If a memory reference takes 50ns how long does a paged
memory referenced take?
(2) If we add TLB and 75% of all page table reference are found
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) BTL5 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
BTL-6 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 BTL5 Evaluating
algorithms. Assume there are four frames and initially all the frames are
empty. (12)
(ii) Explain the effect of thrashing. (3)
4.
(i) Explain the difference between internal and external fragmentation. (7)
(ii)Discuss situations in which the most frequently used (MFU) page
replacement algorithm generates fewer page faults than the least recently BTL4 Analyzing
used (LRU) page-replacement algorithm. Also discuss under what
circumstances the opposite holds. (8)

UNIT IV - FILE SYSTEMS


File-System Interface: File concept – Access methods – Directory structure – File system mounting –
Protection. File-System Implementation: Directory implementation – Allocation methods – Free-
space management – efficiency and performance – recovery – log-structured file systems.
PART - A
Q.No Questions BT Competence
Level
1. Compare the various file access methods. BTL-5 Evaluating
2. How does DMA increase system concurrency? BTL-4 Analyzing
3. Enlist different types of directory structure. BTL-3 Applying
4. Mention the common file types BTL-4 Analyzing
5. List out the major attributes and operations of a file system. BTL-1 Remembering
6. What is relative block number? BTL-3 Applying
7. Do FAT file system advantageous? Justify your answer? BTL-4 Analyzing
8. How the information in the file can be accessed? BTL-3 Applying
9. List out the drawbacks in indexed allocation BTL-1 Remembering
10. Define UFD and MFD. BTL-1 Remembering
11. Give the disadvantages of Contiguous allocation. BTL-2 Understanding
12. Analyze the advantages of bit vector free space management BTL-6 Creating
13. Differentiate between file and directory. BTL-1 Remembering
14. What is consistency checking? BTL-2 Understanding
15. Write Short notes on file system mounting. BTL-2 Understanding
16. What is the advantage of bit vector approach in free space management? BTL-1 Remembering
17. What is boot control block? BTL-1 Remembering

 
 
18. Analyze the backup and restore of a file system. BTL-5 Evaluating
19. Identify the two important function of virtual File System (VFS) layer in BTL-6 Creating
the concept of file system implementation.
20. Compare contiguous allocation with linked allocation method. BTL-2 Understanding
PART - B
1. Describe in detail about file sharing and protection.(13) BTL-1 Remembering
2. Analyze the various file system mounting methods in detail.(13) BTL-6 Creating
3. Explain in detail about tree structured and acyclic graph directories.(13) BTL-5 Evaluating
4. (i)Describe with a neat sketch about the various directory structure. (7)
BTL-1 Remembering
(ii)Describe in detail about free space management with neat examples.(6)
5. (i) Discuss about the various file access methods.(7)
(ii)With neat sketch explain about the: (6) BTL-2 Understanding
a) Directory structure b) File sharing
6. Explain in detail about file attributes and file operation.(13) BTL-2 Understanding
7. Illustrate an application that could benefit from operating system support
BTL-3 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
BTL-3 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) BTL-4 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 BTL-2 Understanding
files that cross mount points. (7)
11. (i)Explain in detail the various allocation methods with their pros and
cons (8)
BTL-1 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) BTL-4 Analyzing
(ii)Explain the issues in designing a file system. (6)
13. Examine in detail about Directory and disk structure. (13) BTL-4 Analyzing
14. (i)In a variable partition scheme, the operating system has to keep track of
allocated and free space. Suggest a means of achieving this. Describe the
effects of new allocations and process terminations in your suggested Remembering
BTL-1
scheme. (5)
(ii) Explain in brief about different allocation methods with neat sketch.
(8)
PART - C
1. Give an example of an application in which data in a file should be
accessed in the following order
BTL-6 Creating
(i) Sequential (8)
(ii) Random (7)

 
 
2. (i)Describe some advantages and disadvantages of using SSDs as a
caching tier and as a disk-drive replacement compared with using only
magnetic disks. (8) BTL-5 Evaluating
(ii)Discuss how performance optimizations for file systems might result
in difficulties in maintaining the consistency of the systems in the event
of computer crashes. (7)
3. (i) Discuss the functions of files and file implementation. (8) BTL-4 Analyzing
(ii)Explain free space management with neat example. (7)
4.
Consider a system that supports 5000 users. Suppose that you want to
allow 4990 of these users to be able to access one file
a) How would you specify this protection scheme in file system (7) BTL-5 Evaluating
b) Could you suggest another protection scheme that can be used
more effectively for this purpose than the scheme provided by the
file system. (8)

UNIT V - I/O SYSTEMS

I/O Systems – I/O Hardware – Application I/O interface – kernel I/O subsystem - streams –
performance. Mass-Storage Structure: Disk scheduling – Disk management – Swap-space
management – disk attachment.
PART - A
Q.No Questions BT Competence
Level
1. Give the advantages of polling. BTL-2 Understanding
2. Mention the variousbus structures. BTL-2 Understanding
3. Illustrate the typical pc bus structure BTL-1 Remembering
4. What is meant by interrupt driven I/O Cycle? BTL-1 Remembering
5. Why is it important to scale up system bus and device speeds as CPU BTL-4 Analyzing
6. Define rotational latency BTL-1 Remembering
7. What are the advantages of DMA? BTL-2 Understanding
8. Compare the synchronous and asynchronous streams BTL-4 Analyzing
9. What are the advantages of caching? BTL-1 Remembering
10. State the typical bad-sector transactions BTL-6 Creating
11. Why is rotational latency usually not considered in disk scheduling? BTL-2 Understanding
12. List out the disk scheduling algorithms? BTL-1 Remembering
13. How SSTF is more optimal than other disk scheduling algorithms? BTL-6 Creating
14. Mention the various RAID levels BTL-3 Applying
15. Liststhe advantages of blocking and non blocking I/O BTL-3 Applying
16. Explain device reservation? BTL-4 Analyzing
17. Mention about the error handling techniques? BTL-5 Evaluating
18. What is Streams? BTL-1 Remembering
19. List the system calls in Streams BTL-3 Applying
20. Summarize the advantages of swap space management? BTL-5 Evaluating
PART – B
1. (i)Explain about the RAID structure in disk management with various
RAID levels of organization in detail (13)
BTL-5 Evaluating

 
 
2. Suppose that the disk drive has 5000 cylinders number 0 to 4999. The
drive is serving a request at cylinder 143. The queue of pending request in
FIFO order is: 86,1470,913,1774,948,1509.1022,1750,130 starting from
the head position, what is the total distance (cylinders) that the disk arm BTL-2 Understanding
moves to satisfy all the pending requests for each of the disk scheduling
algorithms? FCFS,SSTF,SCAN ,LOOK,C-SCAN,C-LOOK. Explain the
pros and cons of all disks scheduling algorithms (13)
3. Illustrate the I/O hardware with a typical pc bus structure (13) BTL-3 Applying
4. Describe in detail about interrupts .(13) BTL-2 Understanding
5. (i) What are the advantages of polling (3)
(ii)Explain in detail about application I/O Interface(10) BTL-1 Remembering
6. Explain in detail about DMA Structure (13) BTL-1 Remembering
7. Demonstrate in detail about kernel I/O Subsystems (13) BTL-3 Applying
8. (i) Explain about kernel I/O subsystems and transforming I/O to hardware
operations. (7)
(ii)On a disk with 1000 cylinders, numbers 0 to 999, compute the number
of tracks, the disk arm must move to satisfy the entire requests in the disk
queue. Assume the last request service was at track 345 and the head is BTL-6 Creating
moving toward track 0. The queue in FIFO order contains requests for the
following tracks: 123, 874, 692, 475, 105, and 376. Find the seek length
for the following scheduling algorithm. (6)
a)SSTF b) LOOK c) CSCAN 
9. State and explain the FCFS, SSTF and SCAN disk scheduling with BTL-4 Analyzing
examples.(13)
10. Discuss in detail about the streams with a neat sketch(13) BTL-1 Remembering
11. Summarize in detail about swap space management(13) BTL-2 Understandin
12. Explain in detail about Disk management (13) BTL-4 Analyzing
13. Discuss in detail about the various disk attachment methods. (13) BTL-4 Analyzing
14. Explain in detail about mass storage structures. (13) BTL-1 Rememberin
PART – C
1. On a disk with 200 cylinders, numbered 0 to199. Compute the number of
tracks the disk arm must move to satisfy the entire request in the disc
queue. Assume the last request received at track 100. The queue in FIFO
order contains requests for the following tracks 55, 58, 39, 18, 90, 160, BTL-6 Creating
150, 38, 184. Perform the computation to find the seek time for the
following disk scheduling algorithms. (15)
FCFS (ii) SSTF (iii) SCAN (iv) C-SCAN (v) LOOK
2. How does a DMA increases system concurrency? How does it complicate BTL-5 Evaluating
the hardware design? (15)
3. Distinguish between a STREAMS driver and a STREAMS module. (15) BTL-4 Analyzing
4. Why rotational latency usually not considered in disk scheduling How
BTL-6 Creating
would you modify SSTF,SCAN and C-SCAN to include latency
optimization? (15)

You might also like