LORDSINSTITUTEOFENGINEERINGANDTECHNOLOGY

UGC Autonomous
|Approved by AICTE |Affiliated to Osmania University|
Department of CSE – Data Science

QUESTION BANK
Course Name: Operating Systems Year/Sem: II / IV
Course Code: U23CD301 Month/Year: Nov-2024
Name of the Faculty : Mr. Feroz Amer, Mr. Asif Ahmed

UNIT-I
CO
S.NO QUESTION MARKS Mapping
BTL
Short Answer Questions – 2 Marks
1 Define bootstrap program 2 CO1 BTL1
2 What is system call 2 CO1 BTL1
3 What is system program 2 CO1 BTL1
4 Differentiate protection and security 2 CO1 BTL1
5 What are different types of system call 2 CO1 BTL3
6 State process scheduling 2 CO1 BTL2
7 What do you mean by inter process communication 2 CO1 BTL1
8 What do you mean by booting 2 CO1 BTL1
9 Differentiate between process and program 2 CO1 BTL2
10 What do you mean by interrupt 2 CO1 BTL1
11 Define device driver 2 CO1 BTL1
12 Differentiate between multiprogramming and multiprocessing 2 CO1 BTL2
13 What is process control block 2 CO1 BTL1
14 What is kernel mode and user mode 2 CO1 BTL1
15 What do you mean by client server computing 2 CO1 BTL2
Long Answer Questions - 7 Marks
1 a) Explain storage device with respect to cost, size and access 7 CO1 BTL2
speed.
b) Draw neat diagram to show storage devices and their 5
hierarchy CO1 BTL4
2 Classify general purpose processor in a computer system 12 CO1 BTL4
architecture
3 Describe operating system structure 12 CO1 BTL2
4 Discuss memory management system and responsibility of 12 CO1 BTL2
operating system for memory management
5 Illustrate the responsibilities of operating system for storage 12 CO1 BTL3
management
6 a) Discuss in detail about traditional computing and 6 CO1 BTL2
mobile computing
b) Differentiate between distributed systems and 6 CO1 BTL3
client-server computing
7 Draw process state diagram and explain each state of 12 CO1 BTL4
process
8 Describe the types of system program and system calls 12 CO1 BTL2
9 What are the different types of user and operating- 12 CO1 BTL2
system interface, explain in detail.
10 Explain different services that are provided by operating 12 CO1 BTL2
 system with neat diagrams

UNIT-II
CO
S.NO QUESTION MARKS Mapping
BTL
Short Answer Questions – 2 Marks
1 What are the different scheduling criteria 2 CO2 BTL1
2 What do you mean by critical section problem 2 CO2 BTL1
3 What is semaphore 2 CO2 BTL1
4 What is monitor 2 CO2 BTL1
5 Define mutual exclusion 2 CO2 BTL1
6 What are the characteristics of deadlock 2 CO2 BTL1
7 What is job queue 2 CO2 BTL1
8 What is ready queue 2 CO2 BTL1
9 What is device queue 2 CO2 BTL2
10 What do you mean by scheduler 2 CO2 BTL1
11 Differentiate between long term scheduler and short term 2 CO2 BTL2
scheduler
12 How a child process is created 2 CO2 BTL3
13 What do you mean by starvation 2 CO2 BTL1
14 Define preemptive scheduling 2 CO2 BTL1
15 What is function of dispatcher 2 CO2 BTL2
Long Answer Questions - 7 Marks
1 a) Describe FCFS CPU scheduling algorithm. 4 CO2 BTL2
b) Illustrate FCFS algorithms for the following process, 8 CO2 BTL5
calculate average waiting time, the order of process entry
is p2,p1,p3
Process Burst Time
P1 5
P2 10
P3 4
2 a) Explain the working of Round Robin algorithm. 4 CO2 BTL2
b) Illustrate Round Robin algorithm for the following 8 CO2 BTL5
process, Quantum is 4
Process Burst Time
P1 12
P2 5
P3 6
3 Illustrate the priority algorithm with the help of an example 12 CO2 BTL5
4 Describe peterson’s solution with the help of code 12 CO2 BTL3
5 Illustrate dining philosopher problem with neat diagram 12 CO2 BTL4
6 What are the four necessary conditions of deadlock 12 CO2 BTL2
7 Describe deadlock avoidance with the help graph 12 CO2 BTL2
8 a) Explain shortest job first algorithm. 4 CO2 BTL2
b) Illustrate SJF algorithms for the following process, 8 CO2 BTL5
calculate average waiting time, the order of process entry
is p2,p1,p3
Process Burst Time
P1 5
P2 10
P3 4
9 Explain resource allocation graph with example 12 CO2 BTL3
 10 Explain deadlock prevention and what are four necessary 12 CO2 BTL2
conditions that must hold for deadlock prevention.

UNIT-III
CO
S.NO QUESTION MARKS Mapping
BTL
Short Answer Questions - 2Marks
1 What do you mean by swapping 2 CO3 BTL1
2 What is segmentation 2 CO3 BTL1
3 What do you mean by fragmentation 2 CO3 BTL1
4 Define Thrashing 2 CO3 BTL1
5 What is demand paging 2 CO3 BTL3
6 What are different types of file access methods 2 CO3 BTL2
7 What is page fault 2 CO3 BTL1
8 Define file and directory 2 CO3 BTL1
9 State file mounting 2 CO3 BTL2
10 Mention the different operation performed on Files 2 CO3 BTL3
11 What do you mean by swapping 2 CO3 BTL1
12 What is segmentation 2 CO3 BTL2
13 Describe page table 2 CO3 BTL2
14 Differentiate first fit, best fit and worst fit 2 CO3 BTL2
15 What do you mean by lazy swapper 2 CO3 BTL2
Long Answer Questions - 7 Marks
1 Explain multistep processing of a user program with a diagram 12 CO3 BTL3
2 Explain Contiguous memory allocation with the help of a diagram 12 CO3 BTL3
3 Illustrate paging technique and the structure of a page table 12 CO3 BTL4
4 Describe demand paging technique in detail 12 CO3 BTL2
5 With a the help of graph explain thrashing 12 CO3 BTL3
6 a) Describe page replacement technique. 4 CO3 BTL2
b) Illustrate LRU page replacement algorithm, assuming there 8 CO3
are 3 frames and the page reference string is BTL4
70120304230321201701
Find the number of percentage page fault and hits
7 a) Describe the FIFO page replacement algorithm, 4 CO3 BTL2
b) Assuming there are 3 frames and the page reference string 8 CO3
is 70120304230321201701 BTL4
Find the number of percentage page fault and hits
8 Describe the Optimal page replacement algorithm, assuming there 12 CO3 BTL4
are 3 frames and the page reference string is
70120304230321201701
Find the number of percentage page fault and hits
9 Describe different types of directory structure 12 CO3 BTL2
10 Explain different file access methods 12 CO3 BTL2

UNIT-IV
CO
S.NO QUESTION MARKS Mapping
BTL
Short Answer Questions - 2Marks
1 What do you mean by seek time and rotational latency 2 CO4 BTL2
2 What do you mean by File Control Block 2 CO4 BTL2
3 What is bit vector 2 CO4 BTL1
4 What do you mean by RAID 2 CO4 BTL1
 5 What is File Allocation Table 2 CO4 BTL3
6 What is data striping 2 CO4 BTL2
7 What is mirroring 2 CO4 BTL1
8 Describe boot control block 2 CO4 BTL1
9 Describe volume control block 2 CO4 BTL2
10 What do you mean by file mounting 2 CO4 BTL1
11 What are the different types of directory implementation 2 CO4 BTL1
12 What do you mean by backup and restore 2 CO4 BTL2
13 Describe solid state disk 2 CO4 BTL2
14 What is the significance of storage area network 2 CO4 BTL2
15 Explain RAID level 1 2 CO4 BTL2
Long Answer Questions - 7 Marks
1 Illustrate file attributes and file operations in detail 12 CO4 BTL2
2 Explain in detail file access method and its types 12 CO4 BTL4
3 a) Explain in detail directory structure 6 CO4 BTL2
b) Differentiate between the levels in directory structure 6 CO4 BTL3
4 Describe three basic disk space allocation methods 12 CO4 BTL2
5 Explain free space management 12 CO4 BTL3
6 a) Draw the neat diagram of magnetic disks. 5 CO4 BTL4
b) Explain the working of magnetic 7 CO4 BTL3
7 Describe different types of disk attachment 12 CO4 BTL2
8 a) Explain FCFS disk scheduling algorithm for a disk queue with 6 CO4 BTL4
request for I/O to blocks on cylinder
queue = 98, 183, 37, 122, 14, 124, 65, 67
head starts at 53
a) Explain SSTF disk scheduling algorithm for a disk queue with 6 CO4 BTL4
request for I/O to blocks on cylinder
queue = 98, 183, 37, 122, 14, 124, 65, 67
head starts at 53
9 a) Explain SCAN disk scheduling algorithm for a disk queue 6 CO4 BTL4
with request for I/O to blocks on cylinder
queue = 98, 183, 37, 122, 14, 124, 65, 67
head starts at 53
a) Explain C-SCAN disk scheduling algorithm for a disk 6 CO4 BTL4
queue with request for I/O to blocks on cylinder
queue = 98, 183, 37, 122, 14, 124, 65, 67
head starts at 53
10 a) Explain LOOK disk scheduling algorithm for a disk queue 6 CO4 BTL4
with request for I/O to blocks on cylinder
queue = 98, 183, 37, 122, 14, 124, 65, 67
head starts at 53
b) Explain C-LOOK disk scheduling algorithm for a disk 6 CO4 BTL4
queue with request for I/O to blocks on cylinder
queue = 98, 183, 37, 122, 14, 124, 65, 67
head starts at 53

UNIT-V
CO
S.NO QUESTION MARKS Mapping
BTL
Short Answer Questions - 2Marks
1 What are the goals of protection 2 CO5 BTL1
2 What are the principles of protection 2 CO5 BTL1
3 What is lock key scheme 2 CO5 BTL1
4 What do you mean by security 2 CO5 BTL1
5 Differentiate between authentication and authorization 2 CO5 BTL2
6 What is encryption and decryption 2 CO5 BTL2
7 What do you mean by domain of protection 2 CO5 BTL1
8 What is access right 2 CO5 BTL1
9 In how many ways domain can be realized 2 CO5 BTL2
10 Define access matrix 2 CO5 BTL1
11 What do you mean by object 2 CO5 BTL1
12 What is full form of RBAC 2 CO5 BTL2
13 What are the different types of program threats 2 CO5 BTL1
14 Differentiate between Trojan horse and trap door 2 CO5 BTL2
15 What do you mean by phishing 2 CO5 BTL1
Long Answer Questions - 7 Marks
1 a) Explain domain structure and sharing of access rights by 6 CO5 BTL3
different domains
b) Illustrate access matrix used for protection with the help of an 6 CO5 BTL4
example
2 a) Describe access control mechanism 6 CO5 BTL2
b) Differentiate between different types of access matrix 6 CO5
implementation BTL3
3 a) Explain revocation of access rights. 12 CO5 BTL2
b) Justify protection technique in java language
4 a) Explain different types of security violation 12 CO5 BTL3
b) What are four different levels of security measures
5 What are different types of program threats, explain in detail 12 CO5 BTL2
6 What are the different types of system and network threats 12 CO5 BTL3
7 a) Illustrate cryptography as a security tool 6 CO5 BTL4
b) Describe how cryptography is implemented 6 CO5 BTL4
8 Explain symmetric and asymmetric encryption with the help of an 12 CO5 BTL4
example
9 Illustrate how user authentication is achieved and what are the 12 CO5 BTL3
different types of user authentications
10 Explain firewalling to protect system and networks 12 CO5 BTL2

Course Coordinator HoD