OPS Q Bank - hmgaikwad

Gaikwad H.M./OPS
-
QB1
-
5

Page
1

of
4

K.K.WAGH WOMEN'S POLYTECHNIC,NASHIK
.






Question Bank




SUB: Operating System (
91
15)


CLASS: TYCM

Sem: 5C

-----------------------------------------------------------------------------------------------
---------

Chapter 1: Introduction

1.

Define operating system. State the different types of OS.

2.

Write about the evolution of operating system from sequential to multiprogramming.

3.

What is multitasking? Explain with example.

4.

Describe multiprogramming system

5.

Wha
t are different functions of operating system?

6.

Which are the various types of services provided by an operating system?

7.

Write brief about threading and list its advantages.

8.

Explain real time OS in brief.

9.

Describe real time system. State any two application
s of it.

10.

What is a
thread? Write in brief about multithreading and its advantages.


11.

What is operating system? Explain the concept of time sharing.

12.

State generations of computer. Explain any two generations.

13.

What are features of fourth generation computer?

14.

State the period, technology, operating system and features of third generation computer.

15.

Differentiate between sequential and batch processing.

16.

Differentiate between multiprogramming and multitasking.

17.

State real time and multiprocessing system.

18.

Write brie
f about threading and list its advantages.

19.

Describe real time system. State any two applications of it.

20.

Explain multiprocessor system concept.

21.

Explain following terms:

a.

Multiprocessor system

b.

Distributed system

c.

Clustered system


Chapter 2: Operating system S
tructure

1.

Give the names of various system calls of different categories.

2.

What is the purpose of system call? State any four process
control

system calls
with their

purpose.

3.

State file
management
system calls. Write in brief about ant two.

4.

State process rel
ated system calls. Write in brief about an
y

two.

5.

State device related system calls. Write in brief about ant two.

6.

Explain information management & state related system calls.

7.

Describe device management system in OS.

8.

State and explain different OS services.

9.

State uses of system calls.

10.

What is process management? State four functions to be performed by OS for process
management.

11.

Give the names of various system calls of different categories.

12.

What are different functions of operating system?

13.

State various com
ponents of system. Explain any two.

14.

Explain file management and process management.

15.

Explain memory management and I/O subsystem management.

16.

Explain I/O subsystem management component of OS. State different functions required in I/O
system management.

17.

Expla
in secondary storage management.

18.

What is mean by system call? State any four process control system calls with their purpose.

Gaikwad H.M./OPS
-
QB1
-
5

Page
2

of
4

19.

Explain layered and monolithic structure of operating system with suitable diagram.

20.

What is booting? Explain booting process of co
mputer.

21.

Write different types of OS structures. Explain any two with diagram.

22.

Explain following OS structure in detail: i) Monolithic


ii) Microkernel


Chapter 3:
Process Management

1.

Explain what do you mean by a process? Explain different process states wi
th diagram. Also
explain different process state transitions.

2.

Draw a process state diagram and write in brief about all process states.

3.

What is PCB? Explain in brief the contents of PCB.

4.

What is context switch? Explain when context switch occurs?

5.

Which ar
e different types of process queues? Explain use of queues in process scheduling.

6.

Explain two models of IPC (Interprocess communication).

7.

Explain shared memory and message passing models of Interprocess communication.

8.

What do you mean by scheduler? State t
ypes of scheduler.

9.

Explain how a process is created and how it is terminated?

10.

State and explain operations on processes.

11.

Define a thread and state the benefits of threads.

12.

Explain in detail
different
multithreading models with suitable example.

13.

Describe Ma
ny to one, one to one and many to many multithreading models.

14.

What is deadlock? How to prevent deadlock?

15.

What is deadlock? State methods/ techniques to handle the deadlock.

16.

Explain the concept of critical region and deadlock handling.

17.

State the concept of

mutual exclusion.

18.

Describe system model of resource utilization with examples.

19.

Explain various ways to solve deadlock problem.

20.

Explain detection and recovery of deadlock..


Chapter 4:
S
cheduling

1.

What is a CPU scheduling? State different scheduling algorit
hms. Explain any one with example.

2.

State the meaning of following terms related to process scheduling criteria:

a) Response time b) Throughput c) Turn around time d) Waiting time

3.

State the criteria for selecting various process scheduling algorithms
.

4.

Compare FCFS,

SJF,

PR,

RR

algorithms on the basis of scheduling type, avg. waiting time, turn
around time and throughput
.

5.

Explain different process scheduling criteria.

6.

Differentiate between
preemptive scheduling and Non
-
preemptive scheduling
.

7.

Explain
pr
e
-
emptive and Non
-
pre
-
emptive
type of
scheduling
. State when
pre
-
emptive and Non
-
pre
-
emptive scheduling

should be used?

8.

Explain process
scheduler
. What is preemptive scheduling and Non
-
preemptive

scheduling?

9.

State the meaning of following terms related to
scheduling processes:

a) CPU burst b) Preemptive scheduling c) Non
-
Preemptive scheduling

10.

What is process scheduler? Write in brief about the priority scheduling method. State its
advantages over the Round Robin method of process scheduling.

11.

With
proper example and Gantt chart, explain the shortest job first scheduling algorithm. Also
state its advantages and disadvantages.

12.

Describe the short term and long term scheduling.

13.

Describe shortest remaining time next scheduling with example.

14.

Solve the fol
lowing problem by using following scheduling algorithms:

i.

FCFS

ii. SJF


iii. RR

Process

Burst time

1

27

2

6

Gaikwad H.M./OPS
-
QB1
-
5

Page
3

of
4

3

3


15.

Consider the following 4 workloads:

Job

Arrival Time

Burst time

Priority

1

1

7

1

2

0

5

0

3

2

5

3

4

3

10

2

Find out which of the followi
ng algorithm give the least average waiting time for the above
work load.

a)

FCFS

b) SJF c) Round Robin (Quantum = 4 unit) d) Priority scheduling

16.

Consider the following set of processes with the length of the CPU burst time given in
milliseconds.

Pro
cess

Burst Time

Priority

P11

20

4

P12

6

1

P13

15

2

P21

8

3

P22

12

2

P23

5

4

Find waiting time for each process using SJF algorithm and Priority algorithm.

17.

Describe CPU
burst
and I/O burst cycle.

Give example.

18.

Compare FCFS and SJF scheduling algorith
ms with respect to following:

i) Turn around time

ii) Waiting Time

iii) Throughput

19.

What is non
-
preemptive CPU scheduling? Which scheduling algorithms are non
-
preemptive?
Explain any one.

20.

Explain multiprocessor scheduling.

21.

Describe the Round Robin
(RR)
algo
rithm with example.

22.

Explain multilevel queue scheduling with example.


Chapter 5:
File system and
Memory Management

File system:

1.

What is a file? What are different file operations? Explain any two file operations.

2.

Explain the six file operations performed
by OS for a disk file.

3.

List various file types with their extensions used.

4.

Explain any 8 attributes of file.

5.

What are file attributes? State different file attributes maintained by operating system.

6.

Which are different types of directory structures ? Expla
in any two.

7.

Explain directory structures: i. Single level


ii. Two level


iii. Tree

8.

Describe the indexed allocation method for file allocation.

9.

Explain any two allocation methods.

10.

Explain different free space management techniques.

11.

Which are different fre
e space management techniques? Explain any one.

12.

What are the problems of contiguous allocation of disk space to a file? How these problems are
overcome in linked allocation method?

13.

Explain the following terms
:

a.

Sequential access method

b.

Direct access method

14.

Describe direct access method.

15.

With figure and example, describe the sequential file access method.

16.

Name different file protection methods. Write in brief about them.

Gaikwad H.M./OPS
-
QB1
-
5

Page
4

of
4

17.

Compare the Indexed file access and direct file access methods in terms of their advanta
ges and
disadvantages.

18.

Name various file access methods used by an operating system and explain any one in brief.

19.

Explain Bit map and Linked list techniques for free space management.

20.

How is disk space management done by single user operating system?

21.

Diffe
rentiate between : i. Contiguous and Linked allocation


ii. Linked and Indexed allocation

22.

State merits and demerits of linked file allocation.

23.

Explain different approaches used to maintain free space list in dynamic storage allocation.

Memory Managem
ent
:

24.

What are different responsibilities of memory management? Explain.

25.

Explain concept of swapping with diagram.

26.

What is swapping? When it is used?

27.

Write in brief on ‘Paging’ method of memory allocation.

28.

Consider the following hole sizes in memory: 9KB, 7

KB, 15 KB, 18 KB, 10 KB,

20 KB, 12 KB. Which hole is taken for a segment request of


i) 12 KB


ii) 10KB

iii) 9 KB for first fit, Next fit and Best fit.

29.

Explain different placement algorithms used to allocate a memory hole out of available memory

holes.

30.

What is need for swapping? Describe swapping with example. State its two merits.

31.

Describe the process of dynamic relocation in memory management.

32.

Describe fixed partitioning memory management technique.

33.

Explain contiguous memory allocation, its adv
antages and limitations.

34.

What is external fragmentation related to memory? How it is solved?

35.

What is compaction process? Why compaction is needed in memory management?

36.

Which are the types of memory management techniques? What are the various memory
allocat
ion techniques in each type?

37.

Describe dynamic memory partitioning. State its advantages over static partitioning.

38.

What is page fault? How it is handled

by operating system?

39.

What is page fault? Explain different page replacement algorithms.

40.

What is virtual
memory? Explain the concept of paging.

41.

What is the virtual memory? State four techniques for page replacement.

42.

Explain virtual memory paging technique.
o
r Explain demand
paging technique.

43.

Explain lazy swapping in demand paging.

44.

Explain the concept of page
replacement with diagram.

45.

Explain least recently used page replacement algorithm used in memory management.

46.

Explain the FIFO, optimal and LRU page replacement algorithm for the reference string:

7

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

47.

Explain the

following terms:

a.

First in First out (FIFO)

b.

Least Recently used (LRU)