Scribd
Upload
17 views5 pages

OS - Preparatory QB

The document is an OS question bank for the Computer Science and Engineering department at Cambridge Institute of Technology, covering various topics in operating systems across three modules. It includes questions on dual mode operation, computing environments, process management, memory management, threading, scheduling algorithms, inter-process communication, deadlock, and paging. Each module contains theoretical questions, practical problems, and scenarios for students to analyze and solve.

Uploaded by

Kumar Abhinav
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
17 views5 pages

OS - Preparatory QB

The document is an OS question bank for the Computer Science and Engineering department at Cambridge Institute of Technology, covering various topics in operating systems across three modules. It includes questions on dual mode operation, computing environments, process management, memory management, threading, scheduling algorithms, inter-process communication, deadlock, and paging. Each module contains theoretical questions, practical problems, and scenarios for students to analyze and solve.

Uploaded by

Kumar Abhinav
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/ 5

CAMBRIDGE INSTITUTE OF TECHNOLOGY

K.R. PURAM, BENGALURU-560036.

Department of Computer Science and Engineering

OS QUESTION BANK-17CS64
MODULE 1
1.What is dual mode operation of an OS.
2.Explain with a neat diagram, the simple structure and layered approach for operating system.
3.Explain the different computing environments:
i) Client-server computing
ii)Peer to peer computing
iii) Web based computing.
4. What are the goals of an operating system?
5. Describe the different activities of OS and its responsibility to carry out process management and
memory management.
6.Define the following:
i) Microkernel
ii) Virtual machine.
7.Explain virtual machines and its implementation. What are its advantages?
8.Explain how a system call is invoked by operating system for handling user application.
9.What are the goals of an operating system?
10.Write the sequence of system calls for copying a file to another new file.
11.Write the pictorial representation of CPU switching from process to process.
12.Define the following:
i) Operating system
ii) Process control block.
13.Explain the various computing techniques.
14.Write the neat diagram of process states and explain the different schedulers available in the
operating systems with diagram.
15.What is the difference between trap and an interrupt?
16.Explain the following:
i) Real time embedded systems
ii) Multimedia devices
iii) Hand held devices.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
K.R. PURAM, BENGALURU-560036.

Department of Computer Science and Engineering

OS QUESTION BANK-17CS64

17. Explain virtual machines and its implementation. Write its advantages?
18. What is a PCB? Draw the various fields in PCB.

19. Describe the implementation of IPC using shared memory and message passing.
20. Describe the implementation of IPC using message passing and shared memory.

QUESTION BANK OF MODULE 2


1. 1. List out the differences between a thread and a process.
2. Explain thread library. Explain the primary ways of implementing a thread library.
3. What is a thread? List the benefits of threads.
4. Explain various multithreading models.
5. Consider the following set of processes.
Process Arrival Time Priority Burst Time
P1 0 3 10
P2 1 1 1
P3 2 3 2
P4 3 4 1
(i) Draw Gantt charts showing the execution of these processes using FCFS, Preemptive
SJF, non- preemptive SJF and RR (Quantum -1) scheduling schemes.
(ii) Calculate the turnaround time and waiting time for each process for each of the schemes
above.
(iii) Calculate the average turnaround time and average waiting time in each scheme and thus
find the best scheme in this particular case.
6. Consider the following set of processes.
Process Arrival Time Burst Time Priority
P1 0 5 3
P2 2 2 1
P3 2 6 3
P4 5 3 4
(i) Draw Gantt charts showing the execution of these processes using FCFS,
CAMBRIDGE INSTITUTE OF TECHNOLOGY
K.R. PURAM, BENGALURU-560036.

Department of Computer Science and Engineering

OS QUESTION BANK-17CS64

Preemptive SJF, Preemptive Priority and RR (Quantum -2) scheduling schemes.


(ii) Calculate the turnaround time and waiting time for each process for each of the
schemes above.
(iii) Calculate the average turnaround time and average waiting time in each scheme
and thus find the best scheme in this particular case.

7. Discuss multiple processor scheduling in operating system.


8. Discuss the concept of Semaphore and its implementation.
9. Describe various criteria for a good process scheduling algorithm and also explain any two
preemptive scheduling algorithms in brief.
10. Describe the concept of critical section problem? What requirements should a solution to critical
section problem satisfy? State Peterson’s solution and indicate how it satisfies the above requirement.

11. Illustrate Dining Philosopher’s problem using monitor.


12. Write various CPU scheduling algorithms for processes.
13.Explain the terms related to Inter Process Communication:
i) Race condition
ii) Mutual exclusion.

14.Utilize Peterson’s solution for achieving mutual exclusion.


15. Explain the syntax and schematic view of monitors.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
K.R. PURAM, BENGALURU-560036.

Department of Computer Science and Engineering

OS QUESTION BANK-17CS64

QUESTION BANK OF MODULE 3

1. Consider the following snapshot of a system

Find the need matrix and calculate safe sequence using Banker’s algorithm. Mention
the above system is safe or not safe.

2. What are the necessary conditions for deadlock? Explain different methods to recover
from deadlock.
3. What is paging? Explain paging hardware with translation look-aside buffer.
4. Explain the structure of page table with respect to hierarchical paging.
5. Given the 5 memory partitions 100 KB, 500 KB, 200 KB,300 KB and 600 KB, how
each of the first fit, best fit and worst fir algorithms place processes of 212 KB, 417
KB, 112 KB and 426 KB size. Which algorithm makes efficient use of memory?
6. Assume that there are 5 Processes P0 through P4 and 4 types of resources. At time To
we have the following state:
Process Allocation Maximum Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6

Apply Banker’s algorithm to answer the following:

i) What is the content of need matrix?


CAMBRIDGE INSTITUTE OF TECHNOLOGY
K.R. PURAM, BENGALURU-560036.

Department of Computer Science and Engineering

OS QUESTION BANK-17CS64

ii) Is the system in a safe state?


iii) If a request from a process P1(0, 4, 2, 0) arrives, can it be granted?
7. Define deadlock. Write short notes on 4 necessary conditions that arise deadlocks.
8. Write short notes on:
i)External and internal fragmentation
ii) Dynamic loading and linking.
9. Analyze the problem in simple paging technique and show how TLB is used to solve
the problem.
10. Given the memory partitions of 200k, 700k, 500k, 300k, 100k, 400k. Apply first fit
and best fit to place 315k, 427k, 250k, 550k.
11. Determine whether the following system is in safe state by using Banker’s algorithm.

Process Allocation Maximum Available


A B C A B C A B C
P0 0 1 0 7 5 3 3 3 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 0 4 3 3

If a request for P1 arrives for (1 0 2), can the request be granted immediately?

12. Illustrate with example, the internal and external fragmentation problem encountered
in continuous memory allocation.
13. Explain the structure of page table.
14. What is deadlock? What are necessary conditions an operating system must satisfy for
a dead lock to occur?
15. What is a Resource Allocation Graph (RAG)? Explain how RAG is very useful in
describing deadly embrace by considering own example.
16. What are Translation Look aside buffer? Explain TLB in detail with a simple paging
system with a neat diagram.
17. Discuss the various approaches used for deadlock recovery.

You might also like