Galgotias College of Engineering & Technology

Affiliated to Dr A.P.J AKTU, Lucknow

Department of Computer Science & Engineering

Question Bank
OPERATING SYSTEMS (KCS-401)
(Even Semester, 2023-24)

Name : Mr. Manoj Kumar Dixit

Subject Name : Operating System
Subject Code : KCS-401
Semester : B.Tech (CSE,CSE AI, CSE AIML,
CSE DS, CSE CSD)
 Galgotias College of Engineering and Technology
Department of Computer Science and Engineering

Faculty Name: …Mr. Manoj Kumar Dixit…………Designation: …AP III……….

Subject Name / Subject Code: Operating System (KCS-401) Section: CSE

Checklist for Course File (Theory) # 2023 – 2024……………….( Even Semester)

S. No. Description
1. Cover Page
2. Vision and Mission of the Institute
3. Vision and Mission of the Department, PEOs, POs, PSOs
Course Description with:
4.
i) CO, CO-PO/PSO Mapping,
ii) Syllabus
iii) Course Plan
iv) Evaluation Scheme
5 Unit-wise question Bank
6. Resource used
 GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY
Knowledge Park-II, Greater Noida, U.P.

INSTITUTE VISION AND MISSION

Vision of the Institute

To be a leading educational institution recognized for excellence in engineering education &

research producing globally competent and socially responsible technocrats.

Mission of the Institute

• To provide state-of-the-art infrastructural facilities that support achieving academic excellence.
• To provide a work environment that is conducive for professional growth of faculty & staff.
• To collaborate with industry for achieving excellence in research, consultancy and
entrepreneurship development.

DEPARTMENT VISION, MISSION & PEOS

Department Vision

To be center of excellence in providing contemporary education and research in the field of Computer
Science and Engineering.

Department Mission

• M1: To create conducive learning environment through effective teaching and learning process
promoting quality education and research
• M2: To promote research, consultancy and entrepreneurship development through industry -
institute collaborations
• M3: To make the students corporate ready with the right spirit and interpersonal skills

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

• PEO1: Excel in their career by acquiring knowledge in the field of Computer Science &
Engineering with the usage of modern tools and emerging technologies.

• PEO2: Demonstrate and analyze real life problems of the society and produce innovative solutions.

• PEO3: Exhibit amicable communication skills and team work in the industry and research
organization through professional development and lifelong learning.
 GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY
Knowledge Park-II, Greater Noida, U.P.

PROGRAM OUTCOMES (POs)

Program Statement
Outcomes
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,
and an engineering specialization to the solution of complex computer engineering problems.

PO2 Problem analysis: Identify, formulate, review research literature, and analyse complex computer
engineering problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex computer engineering problems and
design system components or processes that meet the specific needs with appropriate considerations
for the public health and safety, and the cultural, societal, and environmental considerations.
PO4 Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information
to provide conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex engineering activities with an
understanding of the limitations
PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent relevant to the professional engineering
practices
PO7 Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norm of
the engineering practices
PO9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse
teams, and in multidisciplinary settings.
PO10 Communications: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions
PO11 Project management and finance: Demonstrate knowledge and understanding of the engineering and
management principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life learning in the broadest context of technological change.

PROGRAM SPECIFIC OUTCOMES (PSOs)

Program Statement
Specific Engineering graduates will be able to:
Outcomes
(PSO)
PSO1 Design computer-based systems using theoretical computer science that demonstrate the
comprehension of the trade-offs involve in the design choice.
PSO2 Design, develop and test software for different applications with real time constraints.
 GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY
Knowledge Park-II, Greater Noida, U.P.
Department of CSE & Allied Specialized Branches
Even Semester, 2023-24

FACULTY AND COURSE DETAIL

Faculty : Mr. Manoj Kumar Dixit

LTPC :3003

Course Type : CORE

Semester Offered : EVEN

Academic Year : 2023-24

Time : Mon: 11:10- 12:00 Noon

Tue: 09:30-10:20 AM

Wed: 10:20-11.10 AM
Thurs: 3:20-4:10 PM,

Class Room : E-110, E111, E112….

Course Description:

This course examines the important problems in operating system design and implementation.
The operating system provides an established, convenient, and efficient interface between
user programs and the bare hardware of the computer on which they run. The operating system
is responsible for sharing resources (e.g., disks, networks, and processors), providing common
services needed by many different programs (e.g., file service, the ability to start or stop
processes, and access to the printer), and protecting individual programs from interfering with
one another. The course will start with a brief historical perspective of the evolution of
operating systems over the last fifty years and then cover the major components of most
operating systems. This discussion will cover the trade-offs that can be made between
performance and functionality during the design and implementation of an operating system.
Emphasis will be given to three major OS subsystems: process management (processes,
threads, CPU scheduling, synchronization, and deadlock), memory management
(segmentation, paging, swapping), and file systems; and on operating system support for
distributed systems.
 GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY
Knowledge Park-II, Greater Noida, U.P.
Department of CSE & Allied Specialized Branches
Even Semester, 2023-24

COURSE OUTCOMES

CO-POs AND CO-PSOs MAPPING MATRICES

Program
Specific
Program Outcomes (PO)
Course Outcomes
Outcomes (PSO)
PSO1

PSO2
PO10

PO11

PO12
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

KCS-401.1 2 2 2 2 - - - - - - - 2 2 2

KCS-401.2 3 3 2 2 - - - - - - - 3 3 3

KCS-401.3 3 3 2 2 - - - - - - - 3 3 3

KCS-401.4 3 3 2 2 - - - - - - - 3 3 3

KCS-401.5 3 3 2 2 2 - - - - - - 3 3 3

Average 2.8 2.8 2 2 2 - - - - - - 2.8 2.8 2.8

GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY
Knowledge Park-II, Greater Noida, U.P.
Department of CSE & Allied Specialized Branches
Even Semester, 2023-24

SYLLABUS
GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY
Knowledge Park-II, Greater Noida, U.P.
Department of CSE & Allied Specialized Branches
Even Semester, 2023-24

Evaluation Scheme
Question Bank
 GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY
Knowledge Park-II, Greater Noida, U.P.
Department of CSE & Allied Specialized Branches
Even Semester, 2023-24

UNIT-1
CO1: Understand the structure and functions of OS
1. What is an Operating system? Discuss the main components of an O.S.
2. What inconveniences a user can face while interacting with a computer system, which is without
an O.S?
3. Discuss the user and system viewpoint of an O.S.
4. Justify “O.S is the control program of the system”.
5. Give five major functions of an O.S. Explain each of them in brief.
6. Differentiate between Interactive and Batch Processing Systems.
7. What are the advantages of a Multiuser O.S?
8. Difference between Multiprogramming and Multitasking O.S.
9. “Multitasking is logical extension to multiprogramming”. Justify the statement.
10. What is the role of threads in Multithreaded Systems?
11. Difference between Multiuser systems and multithreaded systems.
12. What is Real Time O.S? Illustrate some applications where they are used. What is the difference
between Hard Real time O.S and Soft Real Time O.S?
13. Discuss the services provided by an O.S.
14. What do you mean by kernel?
15. Explain System calls and System Programs in brief.
16. Enumerate the advantages of the layered approach to system design?
17. What are the components and subcomponents of different layer’s in operating system?
18. “Monolithic Design is the simple structure” Comment on the statement?
19. Explain the difference between Monolithic and Microkernel systems with their advantages and
disadvantages.
20. What are the benefits of having kernel as Re-entrant in the systems?
21. Briefly discuss the virtual machine with diagram.
22. Describe the steps involved in Booting.
23. Explain distinguished features of
i)Time Sharing System ii) Parallel Processing
24. Write a brief note on different operating system structures
25. Explain different sub components of an operating system.
26. Bring out the requirements of
i) Real time operating systems (ii) Distributed operating systems
27. Justify the statement “Operating System can be viewed as a government, resource allocator and a
control program”.
28. Define essential properties of the following types of Operating system:
Batch operating system
Interactive operating system
Time sharing operating system
Real time operating system
Distributed operating system
29. Distinguish among the following terminologies associated with the operating system and explain
each of them in detail.
30. Multiprogramming systems, Multitasking systems, Multiprocessor systems.
31. Define a virtual machine (VM). With a neat diagram, explain the working of a VM.
32. What are the benefits of a VM?
33. Explain the 'graceful degradation' and 'fault tolerant' in a multiprocessor system.

UNIT-2

CO2: Learn about Processes, Threads and Scheduling algorithms.

CO3: Understand the principles of concurrency and Deadlocks

1. Differentiate between User thread and Kernel thread. What is thread cancellation? Explain its types
2. What do you mean by a thread? How it is different from a process? Explain various thread models
with their relative advantages and disadvantages.
3. Explain in brief different principles of concurrency in operating system?
4. What is Critical Section? Discuss.
5. Explain the life cycle of a process?
6. What are the requirements of mutual exclusion?
7. Why two events need to be mutually exclusive?
8. How to solve the problem of race conditions?
9. What is the Peterson solution to critical section?
10. What is the difference between Dekker’s solution and Peterson solution?
11. How test and set operation works?
12. Write short notes on semaphore?
13. Explain binary semaphore
14. Explain counting semaphore.
15. Explain process synchronization?
16. Explain producer-consumer problem and its solution using semaphores.
17. Explain reader/writer problem.
18. Explain dining philosopher problem in concurrency?
19. Explain sleeping barber problem with solution.
20. How can the inter-process communication be achieved?
21. What is the main difficulty that a programmer must overcome in writing an operating
22. System for real time environment?
23. Give difference between Job-scheduling & CPU-scheduling.
24. Distinguish between
Process and Program
Multiprogramming and multiprocessing
Job scheduling and CPU scheduling
25. What are the five major activities of an operating system in regard to file management
26. What is the purpose of command interpreter? Why is it usually separate from kernel?
27. What are different differences between user level threads & Kernel supported threads?
28. What is Scheduler? What is a dispatcher?
29. Give the information that is kept in process control block?
 UNIT-3

CO2: Learn about Processes, Threads and Scheduling algorithms.

CO3: Understand the principles of concurrency and Deadlocks
1. Define the different states of a process with diagram. Explain the need of process suspension.
2. Differentiate between process and program.
3. Draw Process Transition Diagram.
4. What is the requirement of PID?
5. How do we get Process Identification Information?
6. Draw & explain process control block (PCB) with all its components
7. Discuss the performance criteria for C.P.U Scheduling.
8. Define: Dispatcher, dispatch latency, swapping, scheduling, context switching.
9. Define: Average waiting time, time slice (quantum), response time, turnaround time, CPU
utilization.
10. Why context switching is an overhead in the system?
11. What is the difference between pre-emptive and non-pre-emptive scheduling'?
12. Discuss the Multilevel Feedback Queue scheduling algorithm.
13. Explain short term, medium term and long-term scheduling. Describe the differences among
them.
14. What is convoy effect? Which algorithm causes it.
15. What is the difference between pre-emptive and non-pre-emptive scheduling'? Discuss the
Multilevel Feedback Queue scheduling algorithm.
16. Consider a variant of Round-robin scheduling algorithm where the entries in the ready queue are
pointers to the processes. What would be the effect of putting two pointers to the same process in
the ready queue? What would be advantages and disadvantages of this scheme?
17. What is starvation and its solution?
18. What are the necessary conditions to hold a deadlock in a system?
19. Differentiate between deadlock and starvation.
20. What is a resource allocation graph?
21. What are the approaches that can be used for Prevention of deadlock?
22. Write and explain Banker's algorithm for avoidance of deadlock.
23. How a resource allocation graph is converted to a wait-for graph?
24. Discuss deadlock detection algorithm
25. Write short notes on the following:
(i) Temporal and spatial locality of reference
(ii) Memory protection mechanism
(iii) Memory allocation algorithms.
26. What is the difference between a preemptive and non-preemptive scheduling algorithms? Explain
FCFS scheduling algorithm. Find the average turnaround time and average waiting time for the
processes given in the table below.
Process CPU burst time(in ms)
P1 24
P2 3
P3 3
27. Consider the following data with burst time given in milliseconds: i> SJF ii> Priority
scheduling
process Burst time Priority
p1 10 3
p2 1 1
 p3 2 3
p4 1 4
p5 5 2
The process has arrived in the order p1, p2, p3, p4, p5 all at time 0.
Draw Gantt charts for the execution of these processes using FCFS, SJF, a nonpreemptive priority
and RR (quantum=1) scheduling.
What is the turnaround time and waiting time of each process for each of the scheduling algorithm.
28. What 2 advantages do threads have over multiple processes? What major disadvantages do they
have? Suggest one application that would benefit from the use of threads.
29. Consider the following set of processes with their arrival and burst times as shown Process
A.T B.T
P0 0 10HR
P1 0 05HR
P2 1 02HR
P3 2 01HR
Compute the turn around time and waiting time of each job using the following scheduling
algorithms.
30. For the following set of processes, find the average waiting time & average turn around time using
GANTT Chart for
I > FCA
II> SJF preemptive.
III> SJF non-preemptive.
Process Arrival time (in sec) Burst Time(in sec) P1 0 4
P2 1 2
P3 2 5
P4 3 4
31. Five batch jobs A,B,C,D and E arrive at a computer centre at almost at the same time. They have
estimated running times of 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively,
with 5 being the highest priority. For each of the following scheduling algorithm determine the
turn around time of each process and waiting time of each process. Ignore process switching
overhead. Mention which algorithm results in minimal average waiting time.
Round Robin
Priority scheduling
First come first served
Shortest job first.
For case i) assume that system is multiprocessing and each job gets its fair share of the CPU.(time
quantum 2 minutes0. For cases (ii),(iii) and (iv) assume that only one job runs at a time, until it
finishes. All jobs are completely CPU bound.
32. Why is deadlock state more critical than starvation? Describe resource allocation graph with a
deadlock, with a cycle but no deadlock.
33. What are two options for breaking deadlock?
34. Describe necessary conditions for a deadlock situation to arise. Explain different methods to
handle deadlocks.
35. Explain the resource allocation graph.
36. Explain the methods for deadlock prevention
37. Given 3 processes A,B and C, three resources x,y and z and following events,
a. A requests x ii) A requests y iii) B requests y iv) B requests z
v) C requests z vi) C requests x vii) C requests y
 Assume that requested resources should always be allocated to the request process if it is available.
Draw the resource allocation graph for the sequences. And also mention whether it is a deadlock?
If it is, how to recover the deadlock.
38. What is deadlock? Explain the necessary conditions for its occurrence.

UNIT-4
CO4: Learn various memory management scheme
1. What is logical and physical address space?
2. Explain how logical address is translated to physical address in such a scheme.
3. Consider a logical address space of eight pages of 1024 words, each mapped onto a physical
memory of 32 frames then: (a) How many bits are in logical address? (b) How many bits are in
physical address?
4. If memory partitions of 100K,500K,200K,300K and 600K(in order)are given, how would each
of the first-fit, best-fit, and worst-fit algorithms place processes of 212K,417K,112K, and
426K(in order)?Which algorithm makes the most efficient use of memory
5. Explain different memory protection schemes?
6. Differentiate between internal and external fragmentation.
7. Write the difference between paging and segmentation.
8. Page sizes are kept in powers of 2. Why?
9. Explain paged segmentation with its advantages and disadvantages. In a paged segmented system,
a virtual address consists of 32 bits of which 12 bits are for displacement, 11 bits are segment
number and 9 bits are page number. Calculate the following: (a) Page size (b) Max Segment size
(c) Max number of Pages (d) Max number of segments.
10. Describe the paging scheme of memory management with reference to the hardware required to
support the system.
11. Describe the Segmentation scheme of memory management with reference to the hardware
required to support the system.
12. Discuss virtual memory concept in brief.
13. Consider a demand paged system. Page tables are held in registers. It takes 8 milliseconds to
service a page fault if an empty page is available or the replaced is not modified, and 20
milliseconds if the replaced page is modified. Memory access time is 100 nanoseconds. Assume
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?
14. What is the difference between virtual memory and primary memory?
15. “With the help of virtual memory programmer task is easy” Comment on the statement.
16. When do page faults occur? Describe in detail the actions taken by the operating system when a
page fault occurs.
17. What do you mean by Belady's anomaly? Which algorithm suffers from Belady’s anomaly?
18. Consider the following page reference string: 1,2,3, 4,2, l, 5, 6, 2, 1,2, 1, 5, 6. How many page
faults would occur for the following replacement algorithms, assuming three frames. (a) LRU
page replacement (b) FIFO page replacement (c) Optimal page replacement.
19. Explain the concept of thrashing?
20. Explain the cache memory Hit ratio and cache memory Miss Ratio.
 UNIT-5

CO5: Study I/O management and File systems.

1. Compare various mass storage devices.
2. Explain the various Disk Scheduling Algorithms.
3. Suppose that a disk has 500 cylinders. The drive is currently serving a request at cylinder 125 and
the previous request was at cylinder 100. The queue of pending request in FIFO order is 80, 147,
13, 177, 48, 409,22, 175,301. What is the total distance that the disk arm moves for the following
Disk scheduling algorithm: (a) SSTF (b) LOOK (c) C-SCAN?
4. What are different levels of RAID?
5. Explain RAID 1+2 and RAID 2+1.
6. Differentiate between: (a) Blocking and non-blocking I/O (b) Block and character devices
7. Discuss I/O Buffering.
8. What are different file attributes?
9. What are different file access methods? Compare them
10. What are different directory structures? Compare them
11. How indexed file allocation is better than linked file allocation?
12. How indexed file allocation is better than linked file allocation?
13. Differentiate between protection and security in file system. How they are implemented?
14. Explain the following i) file types ii) file operation iii) file attributes.
15. Explain the method used for implementing directories.
16. Describe various file access methods.
17. Explain file system mounting operation.
18. Mention the different file attributes and file types.
19. How free space is managed? Explain.
20. What are the three methods for allocating disk space? Explain.
21. Discuss the following page replacement algorithm with an example
i) Optimal ii) LRU
22. Name the different file allocation methods. Explain the linked allocation of file implementation
with merits and demerits.

Resource used
1. YouTube Videos:
SG Academy
https://www.youtube.com/channel/UCXmoAxvVyJIR2dukvJQn1tQ
2. Links of NPTEL lectures
https://nptel.ac.in/courses/106/105/106105214/
https://nptel.ac.in/courses/106/102/106102132/
https://nptel.ac.in/courses/106/106/106106144/
https://nptel.ac.in/courses/106/108/106108101/
3. Virtual Labs
http://ebootathon.com/labs/beta/csit/OS/exp2/