Scribd
Upload
8 views3 pages

Question Bank - OS

The document is a question bank for an Operating Systems course, covering a wide range of topics such as functions of operating systems, scheduling algorithms, deadlocks, memory management, and file operations. It includes detailed questions on concepts like multiprogramming, multithreading, system calls, and various algorithms for CPU scheduling and page replacement. Additionally, it addresses practical scenarios and problems related to process management, security, and resource allocation.

Uploaded by

hema d
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
8 views3 pages

Question Bank - OS

The document is a question bank for an Operating Systems course, covering a wide range of topics such as functions of operating systems, scheduling algorithms, deadlocks, memory management, and file operations. It includes detailed questions on concepts like multiprogramming, multithreading, system calls, and various algorithms for CPU scheduling and page replacement. Additionally, it addresses practical scenarios and problems related to process management, security, and resource allocation.

Uploaded by

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

Question Bank - Operating Systems : 2MCA1

1. Explain the functions of operating System?


2. Explain operating system services in detail
3. What is an operating system? Explain Multiprogramming and Multitasking OS in detail
4. What is a system call? Explain different categories of system calls
5. Explain various types of schedulers in brief
6. Explain Multithreading models
7. What is a Deadlock? Explain the deadlock characteristics in detail
8. What are the operations that are performed on a directory?
9. What is segmentation concept? Explain segmentation hardware in detail
10. Explain various file allocation methods in detail
11. Explain Inter process communication facility in detail
12. What is CPU Scheduling? What are the CPU scheduling criteria
13. What is a Deadlock? What are the necessary conditions an OS must satisfy for a deadlock
to occur
14. What is paging concept? Explain paging hardware in detail
15. What is fragmentation? Distinguish between External fragmentation & Internal
fragmentation
16. Explain various file attributes in detail

17. What is a process? Explain the various operations on process and Distinguish between
Cooperating process & Independent process
b) Explain queuing diagram in brief.

18 a) Explain swapping concept with a neat diagram


b) What is first fit, best fit and worst fit strategy in memory management

19 a) Explain Banker’s algorithm in detail


b) Consider the following snap shot of the system -
Allocation Max Available
Process ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433

i) Compute need matrix

1|Page
ii) Find out safe sequence of processes execution without Deadlock
P.T.O.

20) Consider the following snap shot of the system the processes arriving at time 0 where length
of the CPU burst time given in milliseconds

Process CPU Burst time Priority


P0 8 3
P1 4 1
P2 6 4
P3 2 2
i) Draw the Gantt chart for the following scheduling algorithms FCFS & Priority each
ii) Find out average waiting time & average turnaround time of each process for the
above scheduling algorithms

21) What is a Directory? Explain the various types of Directory structure in detail

22a) how do you handle the security in operating system?


b) What do you mean by Virtual Machine? Explain its types in detail

23a) Explain Process Control Block in detail


b) Explain how CPU will switch from one process to another with a neat diagram

24 a) what is a semaphore? What are the types of semaphores?


b) Explain producer-consumer problem approach in detail

25) Consider the following snap shot of the system where length of the CPU burst time given in
milliseconds.

Process CPU Burst time

P0 9

P1 6

P2 10

P3 2

2|Page
i) Draw the Gantt chart for the following scheduling algorithms, FCFS & RR(Time
Quantum=5ms)
ii) Find out average waiting time & average turnaround time of each process for the
above scheduling algorithms
26) consider the reference string –

7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1

With the frame size as 3, calculate the total number of page faults using First-in-first-out
(FIFO), Optimal and least recently used (LRU) page replacement algorithm and give your
suggestions by comparing all the three algorithms

27) Explain various file operations in detail


b) Explain various file access methods in detail

28 a) what are the components of LINUX OS? Discuss the different File system types in LINUX
OS?
b) What do you mean by virtual Machine? Explain its types in detail

29a) Differentiate between preemptive and non-preemptive scheduling


b) Explain two operations on process.

30 a) Explain critical section problem


b) Explain Dining-philosophers problem

31a) Explain Resource allocation graph with and without deadlock


b) Distinguish between paging and segmentation

3|Page

You might also like