smartworld.asia smartzworld.

com

Operating System Unit Wise Important Questions

Prepared For R13 Batch Students

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
UNIT – I
1 Define operating system? Knowledge 1
2 Discuss batch systems? Understand 1
3 List any four functions of operating system? Knowledge 1
4 Define system call? Knowledge 4
5 List any four types of system calls? Knowledge 4
Distinguish between user mode and kernel mode operations of the
6 Understand 1
operating system?
7 List the advantages of multiprogramming? Knowledge 1
8 Distinguish between multiprogramming and multitasking? Understand 1
9 Define interrupt? Knowledge 2
10 Define distributed systems? Knowledge 1
11 Define real-time operating system? Knowledge 1
12 Define virtual machine? Knowledge 1
13 List the memory hierarchy available in operating system? Knowledge 1
14 Define multiprocessor system? Knowledge 1
15 Describe the different types of multiprocessing? Knowledge 1
16 Describe the different types of multiprocessor systems? Knowledge 1
17 Define kernel? Knowledge 2

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
18 Define time-sharing systems? Knowledge 1
19 Describe the use of fork () and exec () system calls? Knowledge 1
20 Define privileged instructions? Knowledge 2
21 State the difference between system call and system program? Knowledge 1
22 State the five major activities of an operating system in regard to process
Knowledge 1
management?
23 State the main advantage of the layered approach to system design?
Knowledge 1
What are the disadvantages of using the layered approach?
24 List the contemporary operating systems that use the microkernel
Knowledge 1
approach?
25 List the various OS components? Knowledge 1
26 State the challenges in designing a distributed operating system? Knowledge 1
UNIT – II
1 Define process. What is the information maintained in a PCB? Knowledge 2
2 Define process state and mention the various states of a process? Knowledge 2
3 Describe context switching? Knowledge 2
4 Explain the use of job queues, ready queues and device queues? Understand 2
5 Distinguish between thread with process? Understand 2
6 Explain benefits of multithreaded programming? Understand 2
7 Explain different ways in which a thread can be cancelled? Understand 2
8 Distinguish between user threads and kernel threads? Understand 2
9 Define CPU scheduling? Knowledge 2
10 List the various scheduling criteria for CPU scheduling? Knowledge 2
Distinguish between preemptive and non-preemptive scheduling
11 Understand 2
techniques?
12 Define turnaround time? Knowledge 2
13 List different types of scheduling algorithms? Knowledge 2
14 State critical section problem? Knowledge 3
15 State the requirements that a solution to the critical section problem must
Knowledge 3
satisfy?
16 Define race condition? Knowledge 3
17 Define semaphores. Mention its importance in operating system? Knowledge 3
18 State two hardware instructions and their definitions which can be used for
Knowledge 4
implementing mutual exclusion?
19 Explain bounded waiting in critical region? Understand 3
20 Distinguish between semaphore and binary semaphore? Understand 3
21 Define monitor? Knowledge 3
22 Describe entry and exit sections of a critical section? Knowledge 3
23 State the real difficulty with the implementation of the SJF CPU
Knowledge 2
scheduling algorithm?
24 State the factors on which the performance of the Round Robin CPU
Knowledge 2
scheduling algorithm depends?
25 Name the algorithms used for foreground and background queue
Knowledge 2
scheduling in a multilevel queue-scheduling algorithm?
26 State the assumption behind the bounded buffer producer consumer
Knowledge 3
problem?
UNIT – III
1 Explain the main function of the memory-management unit? Understand 5
2 Distinguish between logical address and physical address? Understand 5

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
3 Describe dynamic loading and dynamic linking? Knowledge 5
4 Distinguish between compile time, load time and execution time address
Understand 5
binding?
5 Define swapping? Knowledge 5
6 List dynamic storage allocation strategies in contiguous memory allocation
Knowledge 5
scheme?
7 Distinguish between MFT and MVT? Understand 5
8 Distinguish between internal and external fragmentation? Understand 5
9 Define compaction? Knowledge 5
10 List and define non-contiguous memory allocation schemes? Knowledge 5
11 Distinguish between paging and segmentation? Understand 6
12 State the purpose of TLB? Knowledge 6
13 Explain the basic approach of page replacement? Understand 6
14 Distinguish between page table and inverted page table? Understand 6
15 State the benefits of a virtual memory system? Knowledge 5
16 Distinguish between demand paging and pure demand paging? Understand 6
17 Explain the calculation of effective access time of a demand-paged
Understand 6
memory system?
18 Explain page fault and its effect on the performance of the demand paged
Understand 6
memory system?
19 Explain the need for page-replacement.? Understand 6
20 List various page replacement algorithms? Knowledge 6
21 Distinguish between local and global page replacement strategies? Understand 6
22 Distinguish between equal and proportional frame allocation strategies? Understand 5
23 Explain the concept of thrashing and why thrashing should be avoided in a
Understand 5
system?
UNIT – IV
1 Define the terms – file, file path, directory? Knowledge 7
2 Explain any four common file attributes? Understand 7
3 Explain any four file operations? Understand 7
4 Distinguish between shared and exclusive lock? Understand 7
5 List any four common file types and their extensions? Knowledge 7
6 Explain the information associated with an open file? Understand 7
7 List the different file accessing methods? Knowledge 7
8 Explain the operations that can be performed on a directory? Understand 7
9 Discuss the most common schemes for defining the logical structure of a
Understand 7
directory?
10 Describe UFD and MFD.? Knowledge 7
11 Describe file system mounting? Knowledge 7
12 Write the format of a typical file-control block? Knowledge 7
13 List the different disk-space allocation methods? Knowledge 8
14 List the various layers of a file system? Knowledge 7
15 Explain the functions of virtual file system (VFS)? Understand 7
16 Describe about different types of disk scheduling? Knowledge 8
17 Define the terms with respect to disk I/O - seek time, latency time? Knowledge 8
18 Explain the allocation methods of a disk space? Understand 8
19 State the advantages of linked disk-space allocation strategy? Knowledge 8
20 State the advantages of indexed disk-space allocation strategy? Knowledge 8

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
21 List the different free disk-space management techniques? Knowledge 8
22 Explain the bit vector method free space management on disk? Understand 8
23 Discuss the advantages of contiguous memory allocation of disk space? Understand 8
24 Discuss the drawbacks of contiguous allocation of disk space? Understand 8
25 List any four secondary storage memory devices? Knowledge 8
26 Describe about logical formatting of the disk? Knowledge 8
27 List various disk-scheduling algorithms? Knowledge 8
28 State the purpose of boot block? Knowledge 8
UNIT – V
1 Define deadlock? Knowledge 9
2 Define resource. List some resources that a process might need for its
Knowledge 9
execution?
3 Explain the sequence in which a process may utilize the resources in
Understand 9
normal mode of operation?
4 Describe the conditions under which a deadlock situation may arise? Knowledge 9
5 Explain safe state and unsafe state? Understand 9
6 Describe the representation of a resource-allocation graph? Knowledge 9
7 Distinguish between deadlock avoidance and prevention strategies? Understand 9
8 Describe the purpose of banker’s algorithm? Knowledge 9
9 List the four data structures (matrices) that must be maintained to
Knowledge 9
implement banker’s algorithm?
10 Describe the techniques for recovery from deadlock? Knowledge 9
11 List the goals of protection? Knowledge 11
12 Define the terms – object, domain, access right? Knowledge 9
13 Write the format of an access matrix? Knowledge 9
14 List the implementation techniques of access matrix? Knowledge 9
15 Describe role-based access control? Knowledge 9
16 List the schemes that implement revocation of capabilities? Knowledge 9
17 List any two example systems that implement capability-based protection? Knowledge 11
18 Describe any one language-based protection schemes. Knowledge 11
19 Write the main differences between capability lists and access lists? Knowledge 9
20 State the protection problems that may arise if a shared stack is used for
Knowledge 11
parameter passing?
21 State principle of least privilege? Knowledge 11

GROUP-B (LONG ANSWER QUESTIONS)

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
UNIT – I
1 State and explain various types of computer systems? Knowledge 1
2 a) Define an operating system? State and explain the basic functions or
services of an operating system?
Understand 1
b) Explain the differences between multiprogramming and time-sharing
systems?
3 Explain how protection is provided for the hardware resources by the
Understand 1
operating system?

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
4 Describe the system components of an operating system and explain them
Understand 1
briefly?
5 Describe the operating system structures? Knowledge 1
6 Discuss the following structures of OS?
a) Simple structures
Understand 1
b) Layered approach
c) Micro kernels
7 Explain briefly system calls with examples? Understand 4
8 Define the essential properties of the following operating systems?
a) Batch
b) Interactive
Knowledge 1
c) Time sharing
d) Real time
e) Distributed
9 a) Explain the architecture of an operating system?
b) Draw and explain the architecture of windows 2000 and traditional Understand 1
UNIX?
10 Computer system architecture deals about how the component of a
computer system may be organized? Discuss in detail about different Understand 1
architectures of a computer system?
11 Does an operating system generally need to keep about running processes
Understand 1
in order to execute them? Explain in detail.
12 Discuss the view of an operating system as a resource manager? Understand 1
13 Distinguish between multiprogramming, multitasking and
Understand 1
multiprocessing?
14 Explain how operating system services are provided by system calls? Understand 4
15 Describe the functionalities listed below?
a) Batch programming
Knowledge 1
b) Virtual Memory
c) Time sharing
16 Distinguish between the client-server and peer-to-peer models of
Understand 1
distributed systems?
17 Explain the advantages and disadvantages of using the same system call
Understand 4
interface for both files and devices?
UNIT – II
1 Explain the reasons for process termination? Understand 2
2 Discuss the following process, program, process state, process control
Understand 2
block, and process scheduling?
3 Explain the process state transition diagram with examples. Understand 2
4 Discuss the attributes of the process. Describe the typical elements of
Understand 2
process control block?
5 Explain the principles of concurrency and the execution of concurrent
Understand 3
processes with a simple example?
6 Describe dining-philosophers problem? Device an algorithm to solve the
Understand 3
problem using semaphores?
7 Explain the infinite buffer producer/consumer problem for concurrent
Understand 3
processing which uses binary semaphores?
8 Define monitor? Distinguish between monitor and semaphore. Explain in
Understand 3
detail a monitor with notify and broadcast functions using an example?
9 List out the various process states and briefly explain the same with a state
Understand 2
diagram?
10 a) Describe process scheduling? Explain the various levels of
scheduling. Understand 2
b) Distinguish pre-emptive and non-pre-emptive scheduling algorithms?

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
11 Discuss about following?
a) Process
b) Components of process
c) Program versus process Understand 2
d) Process states
e) Process control block
f) Thread
12 Discuss the following?
a) CPU-I/O burst cycle
b) CPU schedule Understand 2
c) Pre-emptive and non-preemptive scheduling
d) Dispatcher
13 Explain the concept of multi-threading? Discuss the following multi-
threading models.
a) Many-to-one
Understand 2
b) One-to-one
c) Many-to-many
d) Two-level
14 Explain the issues that may rise in multi-threading programming. Discuss
Understand 2
about each in detail?
15 Discuss the following CPU scheduling algorithms
a) Round robin
Understand 2
b) Multilevel- queue scheduling
c) Multi-level feedback queue scheduling
16 A scheduling mechanism should consider various scheduling criteria to
Knowledge 2
realize the scheduling objectives? List out all the criteria.
17 Define semaphore? Explain the method of application of semaphore for
Understand 3
process synchronization?
18 Explain the Readers and Writers problem and its solution using the
Understand 4
concept of semaphores?
19 Explain the uses of the following:
a) Mutex object
Understand 4
b) Semaphore object
c) Waitable timer object
20 Write short notes about the following:
a) Binary Semaphores Knowledge 4
b) Bounded Waiting
UNIT – III
1 Describe the following?
a) Virtual Memory
Understand 5
b) Cache Memory
c) Auxiliary Memory
2 Explain in detail the requirements that memory management technique
Understand 5
needs to satisfy?
3 Explain
a) Paging
b) Page table structure Understand 5
c) Translation look-aside buffer
d) Segmentation
4 Explain why the “principle of locality” is crucial to the use of virtual
Understand 5
memory? What is accomplished by page buffering?
5 Discuss briefly the swapping concept with necessary examples? Understand 5
6 Describe contiguous memory allocation concept with advantages and
Knowledge 5
disadvantages?

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
7 Differentiate the main memory organization schemes of contiguous-
memory allocation, segmentation, and paging with respect to the following
issues. Understand 5
a) external fragmentation
b) internal fragmentation
8 Differentiate between internal and external fragmentation and Which one
Understand 5
occurs in paging scheme?
9 Explain briefly about paging with neat diagram? Understand 5
10 Discuss the following
a) Hierarchical paging Understand 5
b) Inverted page Tables
11 Draw and explain the working procedure of paging hardware in detail? Understand 5
12 Explain the basic concepts of segmentation with neat diagrams? Understand 5
13 Define page fault? When does a page fault occur? Describe the action
Knowledge 5
taken by OS when page fault occurs?
14 State and explain about virtual memory concept with neat diagram? Knowledge 5
15 Differentiate between paging and segmentation? Understand 5
16 Explain briefly the performance of demand paging with necessary
Understand 5
examples?
17 Explain the basic Scheme of page replacement and about the various page
Understand 5
replacement strategies with examples?
18 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
Calculate how many page faults would occur for the following
replacement algorithms, assuming the frame size to be 4. Assume that the
Apply 6
frames are initially empty.
a) LRU replacement
b) FIFO replacement
c) Optimal replacement
19 Define thrashing? Explain available methods to avoid thrashing? Knowledge 6
20 Describe belady's anomalous behaviour of FIFO? Knowledge 6
21 Write short notes on the following terms
a) Fragmentation
b) Relocation
c) Swapping
Understand 5
d) Sharing
e) Protection
f) Dynamic loading
g) Address binding
UNIT – IV
1 a) Discuss the criteria for choosing a file organization?
Understand 7
b) Describe indexed file and indexed sequential file organization?
2 Describe the file system of UNIX? Understand 7
3 List the common file types along with their extensions and describe each
Knowledge 7
file type?
4 Differentiate among the following disk scheduling algorithms?
a) FCFS
b) SSTF
c) SCAN Understand 8
d) C-SCAN
e) LOOK
f) C-LOOK
5 a) Explain magnetic disk structure and its management?
Understand 8
b) Exemplify swap space management?

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
6 Explain the following in detail with respect to disk?
a) Seek time
b) Latency Understand 8
c) Access time
d) Transfer time
7 a) Explain in detail the interrupts and interrupt handling features?
Understand 7
b) Explain with neat diagram the steps in DMA transfer?
8 a) Discuss the N-step SCAN policy for disk scheduling?
b) Explain how double buffering improves the performance than a single Understand 8
buffer for I/O?
9 a) Explain the techniques used for performing I/O?
b) Give an example of an application in which data in a file should be
accessed in the following order: Understand 7
i. sequential
ii. Random
10 Discuss in detail the performance issues of secondary storage
Understand 8
management?
11 Explain how disk caching can improve disk performance? Understand 8
12 Explain low-level formatting or physical formatting? Understand 7
13 Define buffering, caching and spooling? Knowledge 7
14 Discuss the following
Understand 8
a) File system mounting b) Thrashing
15 Explain the following file concepts:
a) File attributes
b) File operations Understand 7
c) File types
d) Internal file structure
16 Explain the concept of file sharing? What are the criteria to be followed in
Understand 7
systems which implement file sharing?
17 Describe the following Directory Implementation methods?
Knowledge 7
a) Linear List b) Hash Table
18 Explain the concept and techniques of free space management? Understand 8
19 Discuss about
a) Disk space management Understand 8
b) Swap -space management
UNIT – V
1 Define deadlock? What are the four conditions necessary for a deadlock
Knowledge 9
situation to arise? How it can be prevented?
2 Explain briefly resource allocation graph with examples? Understand 9
3 Differentiate the deadlock handling methods? Understand 9
4 Discuss in detail the technique of deadlock avoidance? Understand 9
5 Explain Banker’s algorithm for deadlock avoidance with an example? Understand 9
6 Discuss deadlock detection method in detail? Understand 9
7 State and explain the methods involved in recovery from deadlocks? Knowledge 9
8 Describe resource-allocation graph? Explain how resource graph can be
Understand 9
used for detecting deadlocks?
9 Describe the terms.
a) Race condition
b) Atomic transaction Knowledge 9
c) Critical section
d) Mutual exclusion
10 Describe how the access matrix facility and role-based access control
Knowledge 10
facility are similar? How do they differ?

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

Blooms
Course
S. No. Question Taxonomy
Outcomes
Level
11 Explain why a capability based system such as Hydra provides greater
flexibility than the ring- protection scheme in enforcing protection Understand 10
policies?
12 Explain the following.
a) Goals of protection Understand 10
b) Principles of protection
13 Discuss about domain of protection? Understand 10
14 Why do you need to provide protection to the system? Explain how access
Understand 10
matrix can be used for the purpose?
15 Discuss the access matrix implementation techniques? Understand 10
16 Compare the various access matrix implementation techniques? Understand 10
17 Discuss the various issues that need to be considered through the process
Understand 10
of revocation of access rights?
18 Explain various schemes to implement revocation for capabilities? Understand 10
19 Explain how language-based protection scheme can be used for
Understand 10
providing system protection at kernel level?
20 Explain relative merits of compiler-based enforcement based solely on
Understand 10
a kernel, as opposed to enforcement provided largely by a compiler?

GROUP-III (ANALYTICAL QUESTIONS)

Blooms
Program
S. No. Question Taxonomy
Outcome
Level
UNIT – I
1 How does the distinction between kernel mode and user mode
function as a rudimentary form of protection (security) system? Apply 1
Justify.
2 Explain using a simple system call as an example (e.g. getpid, or
uptime), what is generally involved in providing the result, from the
Understand 4
point of calling the function in the C library to the point where that
function returns?
3 In a multiprogramming and time-sharing environment, several users
share the system simultaneously. This situation can result in various
security problems?
Apply 1
a) Explain two such problems?
b) Can we ensure the same degree of security in a time-shared machine
as we have in a dedicated machine? Explain your answer.
4 Explain why must the operating system be more careful when accessing
input to a system call (or producing the result) when the data is in Understand 4
memory instead of registers?
5 Discuss how a multi-threaded application can be supported by a user-
level threads package. It may be helpful to consider (and draw) the Understand 2
components of such a package, and the function they perform?
UNIT – II
1 Suppose we have a single processor system, and jobs arrive at a rate of
10 jobs a Seconds, suppose each job takes an average of 50 milli-seconds
to complete. Assure that both distributions are exponential. What is the Apply 2
expected number of jobs in the system and the average time in the
system?

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

2 Suppose the following jobs arrive for processing at the times indicated,
each job will run the listed amount of time.
Burst Time
Jobs Arrival Time
(in secs)
1 0.0 8
2 0.4 4 Apply 2
3 1.0 1
Give Gantt chart illustrating the execution of these jobs using the non-
pre-emptive FCFS and SJF scheduling algorithms. Compute the average
turnaround time and average waiting time of each job for above
algorithms.
3 Consider system with five processor P0 to P4 and 3 resources A, B and
C, Resources type A has 10 instances, B has 5 instances and C has 7
instances. The snapshot at time T0 is

ALLOTED MAX
A B C A B C
P0 0 1 0 7 5 3
Apply 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

Now the process P1 request one additional resource type A and two
instances of C. Determine whether this new site is safe or not.
4 Explain the advantage of using semaphores over Test And Set () and
Swap () functions. Describe the use of wait() and signal() functions on
Understand 3
semaphore and how these can provide the solution to the
Critical section problem?
5 Consider the following set of processes with the length of the CPU burst
time given in milliseconds
Process BurstTime Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order p1, p2, p3, p4, p5
Apply 2
all at time 0.
a) Draw four Gantt charts illustrating the execution of these processes
using FCFS, SJF, anon pre-emptive priority (a smaller priority
number implies a higher priority) and RR (quantum=1) scheduling.
b) What is the turnaround time of each process for each of the
scheduling algorithms in part?
c) What is the waiting time of each process for each of the scheduling
algorithms in part? Which of the schedules in part a results in the
minimal average waiting time?
UNIT – III
1 Suppose you have 16M bytes of main memory. Using the list method
there is an overhead of 8B per memory block. Using the bitmap method,
the allocation granularity is of 128B. How many blocks are there when Apply 5
the space overhead of both methods is the same? What is the average
block size for this many blocks?

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

2 Consider the following page reference string

7,0,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0
Assuming three frames, how many page faults would occur in each of the
following cases?
Apply 6
a) LRU
b) FIFO
c) Optimal algorithms
Note that initially all frames are empty.
3 Analyze that we have a paging system with page table stored in memory
A. If a memory reference takes 200 nanoseconds how long does a
paged
B. If we add associative registers and 75% of all page table
Analyze 5
references are memory reference take found in the associative
registers, what is the effective memory reference time? Assume
that finding a page table entry in the associative registers takes
zero time, if the entry is there.
4 In two level nested loops, the outer index (i) runs from 1 to 5 and the
inner index (j) runs from 1 to 10.The page faults seem to occur for every
Apply 6
7th innermost iterations. If it takes 0.02 micro second to load a new page
– what is the extra time required because of occurrence of page faults?
5 Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in
order), how would each of the First-fit, Best-fit, and Worst-fit algorithms
Apply 6
place processes of 212K, 417K, 112K, and 426K (in order)? Explain
Which algorithm makes the most efficient use of memory?
6 Suppose we have a demand paged memory. The page table is held in
registers. It takes 8 milliseconds to service a page fault if an empty frame
is available or the replaced page is not modified and 20 milliseconds if
the replaced page is modified. Memory access time is 100 nanoseconds. Apply 5
Consider that the page to be replaced is modified 70 percent of the time.
What is the maximum acceptable page-fault rate for an effective access
time of no more than 200 nanoseconds?
7 Consider a logical address space of eight pages of 1024 words each
mapped onto a physical memory of 32 frames
Apply 5
a) How many bits are in the logical address?
b) How many bits are in the physical address?
UNIT – IV
1 Suppose we have files F1 to F4 in sizes of 7178, 572, 499 and 1195
bytes. Our disks have fixed physical block size of 512 bytes for
allocation. Explain how many physical blocks would be needed to store
these four files if we were to use a chained allocation strategy assuming Understand 7
that we need 5 bytes of information to determine the next block in the
link? Which file results in the maximum internal fragmentation
(measured as a percentage of the file size itself)?
2 Using a diagram, show how an indexed allocation of a file may be done
for a disked based system with the following characteristics. The disc
size is 30blocks each of 1024 bytes (may be modelled as 6 X 5 matrixes).
Apply 7
File f1 is 11 logical records of 112 bytes, file f2 is 890 logical records of
13 bytes, file f3 is 510 bytes of binary data stream and file f4 is 4 logical
blocks of 95 bytes.
3 A hard disk has 63 sectors per tracks, 10 platters each with 2 recording
surfaces and 1000 cylinders. The address of a sector is given as a triple
<c, h, and s> where c is the cylinder number, h is the surface number and
Understand 8
s is the sector number. Thus 0th sector is addressed as <0, 0, and 0>, the
1st sector is Addressed as <0, 0, and 1> and so on. Calculate the address
of 1050th sector.
4 Explain the maximum file size supported by a file system with 16 direct
blocks, single, double, and triple indirection? The block size is 512 bytes. Understand 7
Disk block numbers can be stored in 4 bytes.

Specworld.in jntuworld.xyz
smartworld.asia smartzworld.com

5 Consider that a disk drive has 5,000 cylinders, numbered 0 to 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
Apply 8
of the following disk scheduling algorithms?
A. FCFS
B. SSTF
C. SCAN
D. C-SCAN
E. LOOK
F. C-LOOK
UNIT – V
1 Consider the following snapshot of a system
Allocation Max Available
A B C D A B C D A B C D
P1 0 0 1 3 0 0 1 2 1 5 2 0
P2 1 0 0 0 1 7 5 0
P3 1 3 5 4 2 3 5 6 Apply 9
P4 0 6 3 2 0 6 5 2
Answer the following questions using the banker’s algorithm:
a) What is the content of matrix “Need”?
b) Is the system in a safe state?
c) If a request from process P1 arrives for (0, 4, 2, 0) can the request be
granted immediately?
2 Consider the version of the dining-philosophers problem in which the
chopsticks are placed at the center of the table and any two of them
can be used by a philosopher. Assume that requests for chopsticks are
Analyze 9
made one at a time. Describe a simple rule for determining whether a
particular request can be satisfied without causing deadlock given the
current allocation of chopsticks to philosophers.
3 Consider a system consisting of m resources of the same type being
shared by n processes. A process can request or release only one
resource at a time. Show that the system is deadlock free if the
following two conditions hold: Analyze 9
a) The maximum need of each process is between one resource and
m resources.
b) The sum of all maximum needs is less than m + n.
4 How does the principle of least privilege aid in the creation of
Analyze 9
protection systems?
5 Describe how the Java protection model would be compromised if a
Java program were allowed to directly alter the annotations of its Analyze 9
stack frame.

Specworld.in jntuworld.xyz