KEMBAR78
Sample Questions | PDF | Operating System | Computer File
0% found this document useful (0 votes)
27 views5 pages

Sample Questions

The document outlines a comprehensive curriculum for an operating systems course, divided into five units with various topics. Each unit contains both 2-mark and 10-mark questions covering fundamental concepts such as operating system types, process management, synchronization, memory management, and file systems. The questions are designed to test understanding, application, and analysis of operating system principles.

Uploaded by

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

Sample Questions

The document outlines a comprehensive curriculum for an operating systems course, divided into five units with various topics. Each unit contains both 2-mark and 10-mark questions covering fundamental concepts such as operating system types, process management, synchronization, memory management, and file systems. The questions are designed to test understanding, application, and analysis of operating system principles.

Uploaded by

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

UNIT-I (2-MARKS)

1 What is an operating system? [2M, CO1, Remember]


2 What are the different types of operating systems? [2M, CO1, Remember]
3 Differentiate between multitasking and multiprocessing. [2M, CO1, Understand]
4 Define real-time operating systems with an example. [2M, CO1, Remember]
5 What is the purpose of a batch operating system? [2M, CO1, Remember]
6 Explain the concept of time-sharing in an operating system. [2M, CO1, Understand]
7 What is the kernel of an operating system? [2M, CO1, Remember]
8 List any four types of system calls. [2M, CO1, Remember]
9 Define operating system generation. [2M, CO1, Remember]
1 List any three services of an operating system. [2M, CO1, Remember]
0
UNIT-I(10-MARKS)
1 A) Define an operating system and explain its main functions. [5M, CO1, Remember]
B) Describe the essential characteristics of an operating system with examples. [5M, CO1, Understand]
2 A) Compare and contrast different types of operating systems (Batch, Time-sharing, Real-time, Distributed,
Embedded). [5M, CO1, Understand]
B) Explain the advantages and disadvantages of real-time operating systems. [5M, CO1, Understand]
3 A) Discuss the significance of system calls in operating systems with examples. [5M, CO1, Understand]
B) Explain different types of system calls with real-time applications. [5M, CO1, Remember]
4 A) Explain the role of the kernel in an operating system and its types. [5M, CO1, Understand]
B) Describe the Computer system Architecture. [5M, CO1, Remember]
5 A) Describe the following essential Operating System services with real-time examples:
i) Process Management
ii) File Management
iii) Memory Management
iv) Device Management
v) I/O Management [5M, CO1, Understand]
B) Explain the following key functionalities of an Operating System with real-time examples:
i) Job Accounting
ii) Security
iii) Error Handling
iv) Communication Control
v) Network Management [5M, CO1, Understand]
6 A) Compare and contrast distributed operating systems with client/server Network systems. [5M, CO1,
Understand]
B) Discuss the challenges and advantages of distributed operating systems. [5M, CO1, Analyze]
7 A) What is a Real-Time Operating System (RTOS)? Explain its characteristics with examples.[5M, CO1,
Understand]
B) Differentiate between Hard Real-Time and Soft Real-Time Operating Systems with real-world
applications.[5M, CO1, Understand]
8 A)Explain how OS generations evolved from Batch Processing to Modern Operating Systems.
[5M, CO1, Understand]
B)Define a Network Operating System (NOS) and describe its main functions.[5M, CO1, Analyze]
9 A) Define Mobile Operating System and explain its key features with examples.[5M, CO1, Understand]
B) How does a Mobile OS differ from a Desktop OS in terms of resource management and security?
[5M, CO1, Analyze]
1 A)Discuss the main features of Fourth Generation Operating Systems.[5M, CO1, Understand]
0 B)Compare and contrast First and Second Generation Operating Systems in terms of functionality.[5M, CO1,
Analyze]
UNIT-II (2-MARKS)
1 What is the difference between a process and a program? [2M, CO2, Understand]
2 What are the different types of schedulers in an OS? [2M, CO2, Remember]
3 What is the role of the long-term scheduler in process management? [2M, CO2, Understand]
4 What are the basic operations performed on a process? [2M, CO2, Remember]
5 Explain the difference between shared memory and message passing in IPC. [2M, CO2, Understand]
6 What is the difference between user-level and kernel-level threads? [2M, CO2, Understand]
UNIT-III (2-MARKS)
1 Define Process Synchronization. Why is it important in OS?[2M, CO3, Understand]
2 What are the requirements for a solution to the Critical-Section Problem?[2M, CO3, Remember]
3 What is Dekker’s algorithm? Why is it used?[2M, CO3, Understand]
4 Define a Semaphore. What are the two types of semaphores?[2M, CO3, Remember]
5 What is the Producer-Consumer Problem?[2M, CO3, Understand]
6 What is a Deadlock? How does it occur in an operating system?[2M, CO3, Understand]
7 What is Deadlock Prevention? How is it different from Deadlock Avoidance?[2M, CO3, Understand]
8 What is a Wait-for Graph? How is it used in deadlock detection?[2M, CO3, Understand]
9 List two limitations of the Banker's Algorithm.[2M, CO3, Remember]
10 What is a Monitor in OS synchronization?[2M, CO3, Remember]
UNIT-III (10-MARKS)
1 A). Define Process Synchronization and explain its importance in multi-programming environments.[5M,
CO3, Remember]
B). What is the Critical-Section Problem? Explain its three main requirements.[5M, CO3, Understand]
2 A). Describe Dekker’s Algorithm for solving the Critical-Section Problem.[5M, CO3, Understand]
B). How does the wait() and signal() operation associated with monitors differ from the corresponding
operation defined for semaphores. [5M, CO3, Apply]
3 A). Explain Peterson’s Algorithm for process synchronization.[5M, CO3, Understand]
B). How does Peterson’s Algorithm ensure mutual exclusion and progress?[5M, CO3, Apply]
4 A). How do hardware-based solutions such as test-and-set locks help achieve synchronization?[5M, CO3,
Understand]
B). Explain the limitations of using test-and-set locks for synchronization.[5M, CO3, Understand]
5 A). What is the Readers-Writers Problem? Explain its solutions using semaphores.[5M, CO3, Understand]
B). Describe the Producer-Consumer Problem and how semaphores can be used to solve it.[5M, CO3, Apply]
6 A). What is the Dining Philosophers Problem? How is it related to process synchronization?[5M, CO3,
Understand]
B). Suggest a semaphore-based solution for the Dining Philosophers Problem.[5M, CO3, Apply]
7 A). What is a Monitor in process synchronization? Explain with an example.[5M, CO3, Understand]
B). Compare Semaphores and Monitors in terms of synchronization mechanisms.[5M, CO3, Understand]
8 A). Define Deadlock and explain the necessary conditions for its occurrence.[5M, CO3, Remember]
B). What is a Resource Allocation Graph (RAG)? How does it help in deadlock analysis?[5M, CO3,
Understand]
9 A). What is the Banker’s Algorithm? How is it used for Deadlock Avoidance?[5M, CO3, Understand]
B). Considering a system with five processes P0 through P4 and three resources of type A, B, C. Resource
type A has 10 instances, B has 5 instances and type C has 7 instances. [5M, CO3, Apply]
(i)What will be the content of the Need matrix?
(ii)Is the system in a safe state? If yes, then what is the safe sequence?
10 A). Explain the difference between Deadlock Prevention and Deadlock Avoidance.[5M, CO3, Understand]
B). How does a Wait-For Graph (WFG) help in Deadlock Detection?[5M, CO3, Apply]

UNIT-IV (2-MARKS)
1 What is virtual memory?[2M, CO4, Remember]
2 Define page fault.[2M, CO4, Remember]
3 What is the difference between internal and external fragmentation?[2M, CO4, Understand]
4 Define segmentation.[2M, CO4, Remember]
5 Define thrashing in memory management.[2M, CO4, Remember]
6 What is TLB (Translation Lookaside Buffer)?[2M, CO4, Remember]
7 What is the purpose of the frame in paging?[2M, CO4, Understand]
8 List two differences between paging and segmentation.[2M, CO4, Understand]
9 Define hit ratio.[2M, CO4, Remember]
1 What is meant by non-contiguous memory allocation?[2M, CO4, Understand]
0
UNIT-IV (10-MARKS)
1 A) Explain the concept of page faults in demand paging.[5M, CO4, Understand]
B) Apply the FIFO page replacement algorithm to the reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5 using
3 frames and calculate page faults.[5M, CO4, Apply]
2 A) What are the advantages of segmentation over paging?[5M, CO4, Understand]
B) Apply segmentation to divide a 16 KB process into 4 segments and show how logical addresses are
translated.[5M, CO4, Apply]
3 A) Define fragmentation. Explain internal and external fragmentation.[5M, CO4, Remember]
B) Analyze how paging and segmentation solve fragmentation problems.[5M, CO4, Analyze]
4 A) What is TLB? Describe its importance in paging.[5M, CO4, Understand]
B) Compute the effective memory access time for 80% TLB hit ratio, 20ns TLB access, 100ns memory
access.[5M, CO4, Apply]
5 A) Define Thrashing in operating systems.[5M, CO4, Remember]
B) Analyze the reasons and solutions for thrashing in demand-paged systems.[5M, CO4, Analyze]
6 A) Briefly explain the Page Table and its types.[5M, CO4, Understand]
B) The Given Memory partitions of 20KB, 100KB, 40KB, 200KB and 10KB (in order),
how would each of the First-fit, Best-fit, and Worst-fit algorithms place Processes of
p1:90KB,
p2:50KB,
p3:30KB,
p4:40KB [5M, CO4, Apply]
7 A) What is demand paging?[5M, CO4, Remember]
B) Apply Optimal Page Replacement algorithm on reference string 1,2,3,4,2,1,5,2,3,2,5,2 with 3 frames
and count page faults.[5M, CO4, Apply]
8 A)Define paging and explain how it supports virtual memory.[5M, CO4, Remember]
B) Apply the LFU algorithm on reference string 6,7,8,9,6,7,1,6,7,8,9,1 with 3 frames and count the number
of page faults.[5M, CO4, Apply]
9 A) How to map a logical address to a physical address? [5M, CO4, Understand]
B) Analyze the difference between compile-time, load-time, and execution-time address binding.
[5M, CO4, Analyze]
1 A)Discuss briefly about non-contiguous memory allocation techniques.[5M, CO4, Understand]
0 B)Compute the number of page faults for the Optimal Page Replacement strategy
Reference string: 5,3,1,5,4,1,6,3,4,5,1 with 3-frames.[5M, CO4, Apply]

UNIT-V (2-MARKS)
1 Explain the working of FCFS and SSTF algorithms. [2M, CO5, Understand]
2 What are the advantages of using indexed allocation for file storage?[2M, CO5, Understand]
3 What are the different methods of free space management? [2M, CO5, Remember]
4 Name two disk scheduling algorithms. [2M, CO5, Remember]
5 Describe how disk scheduling optimizes performance. [2M, CO5, Understand]
6 What is a file system? [2M, CO5, Remember]
7 Explain the purpose of a directory in a file system. [2M, CO5, Understand]
8 What is the purpose of Device Drivers [2M, CO5, Remember]
9 List any two file attributes.[2M, CO5, Remember]
1 List the main components of Android architecture. [2M, CO5, Remember]
0
UNIT-V (10-MARKS)
1 A) “File is and Abstract data type” Justify this statement. [5M, CO5, Understand]
B) Why disk scheduling is needed? The disk is initially at cylinder 53. Schedule the given requests with
FCFS, SCAN, SSTF, LOOK algorithms. 98, 183, 37, 122, 14, 124, 65, 67, 10, 150. [5M, CO5, Apply]
2 A)Explain Android Application Process management. [5M, CO5, Understand]
Suppose the head of a moving- head disk with 200 tracks, numbered 0 to 199, is currently serving a
request at track 143 and has just finished a request at track 125. If the queue of requests is kept in FIFO
order: 86, 147, 91, 177, 94, 150, 102, 175, 130.
B)What is the total head movement to satisfy these requests for the following disk scheduling algorithms?
(i) FCFS (ii) SCAN (ii) SSTF (iv) LOOK[5M, CO5, Apply]
3 A) What are the various File Allocation Methods? Explain in detail[5M, CO5, Understand]
B) What problems could occur if a system allowed a file system to be mounted simultaneously at more
than one location? [5M, CO5, Understand]
4 A)With a neat sketch discuss the architecture of Android OS. [5M, CO5, Understand]
B)Analyze the Various Methods of Free-Space Management in Operating Systems[5M, CO5, Analyze]
5 A)Explain life cycle of android application. [5M, CO5, Understand]
B)Analyze the Objectives and Architecture of File Management Systems[5M, CO5, Analyze]
6 A)What is Android? Is Android Open-Source? Discuss the features of Android[5M, CO5, Understand]
B)Difference Between FAT (Linked Allocation) and Indexed Allocation[5M, CO5, Analyze]
7 A)What is relocation? Also explain the role of memory management unit in relocation. [5M, CO5,
Understand]
B)Discuss various page replacement algorithms used under LRU-Approximation strategy. [5M, CO5,
Analyze]
8 A)Explain and compare the FCFS and SSTF disk scheduling algorithms.[ 5M, CO5, Understand]
B)Discuss various issues involved in selecting appropriate disk scheduling algorithm. [5M, CO5, Analyze]
9 A)Explain the purpose of creating or deleting a directory in a file system. .[ 5M, CO5, Understand]
B)Apply the knowledge of mass storage structure to design a storage system for a specific use case or
scenario. [5M, CO5, Apply]
1 A) Explain the concept of free-space management. [ 5M, CO5,Understand]
0 B) Distinguish between single-level and multi-level directory structures with examples. [ 5M, CO5,
Analyze]

You might also like