0% found this document useful (0 votes)
7 views6 pages

Operating SystemQB BCA3rdSemMAWT IoT Bhupendra Meena

Uploaded by

tabeve4928
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
0% found this document useful (0 votes)
7 views6 pages

Operating SystemQB BCA3rdSemMAWT IoT Bhupendra Meena

Uploaded by

tabeve4928
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/ 6

Question Bank

Course & Branch : BCA (MAWT/IoT) Semester: III

Subject : Operating Systems Subject Code: CA103301/CA106301

No. of Students: 44 + 19 Regular/ Reappear: Regular

Short Answer Type Questions

Sr. Level in BT Identify Question


CO Question
No Type
K1 CO1 Unit -1 Define operating system and list the basic services provided by operating
1
system.
K2 CO1 Unit -1 Differentiate among the following types of OS by defining their essential
2
properties.
K1 CO1, Explain OS as resources manager
Unit -1
3 CO2,
CO3
K1 CO1 Unit -1 What is Batch Operating System?
4
K2 CO1 Unit -1 What is the O.S features required for multiprogramming?
5
K1 CO1 Unit -1 What is Real Time Operating System?
6
K1 CO1 Unit -1 List any four process management system call.
7
K1 CO1 Unit -1 What are advantages of distributed System?
8
K3 CO1 Unit -1 What is the key difference between a trap and an interrupt?
9
K1 CO1 Unit -1 Distinguish between the client-server and peer-to-peer models of distributed
10
system
K1 CO2 Unit -2 Define process and Explain process states in details with diagram
11
K3 CO2 Unit -2 Explain process states and process control block in details
12
K1 CO2 Unit -2 Explain the process state transition diagram used in multiprogramming
13
environment.
K1 CO2 Unit -2 Describe the fields in a process control block (PCB).What is switching overhead?
14
K1 CO2 Unit -2 What is thread? Explain classical thread model
15
K1 CO2 Unit -2 Explain and differentiate between user level and kernel level thread.
16
K3 CO2 Explain the effect of increasing the time quantum to an arbitrary large Number
Unit -2
17 and decreasing the time quantum to an arbitrary small number for round robin
scheduling algorithm with suitable example?
K1 CO2 Unit -2 What are various criteria for a good process scheduling algorithm?
18
K1 CO2 Unit -2 What are critical sections?
19
20 K1 CO2 Unit -2 What are the different Process states?

K2 CO3 Unit-3 What are the objectives and minimal set of requirement for the file management
21
system?
K1 CO3 Unit-3 What criteria are important in choosing a file organization?
22
K2 CO3 Unit-3 Explain briefly file system architecture & file management function.
23
K1 CO3 Unit-3 List& briefly explain 5 file organization.
24
K2 CO3 Unit-3 Explain multiprogramming with dynamic partition.
25
K1 CO3 Unit-3 What are the memory management requirements?
26
K2 CO3 Unit-3 Explain the difference between logical and physical addresses?
27
K1 CO3 Unit-3 What are the differences of internal and external memory Fragmentation?
28
K2 CO3 Unit-3 What is segmentation? Explain the basic segmentation method.
29
K3 CO3 Unit-3 What is paging? Discuss basic paging technique in details.
30
K2 CO4 Unit-4 What are methods of free space management of Disk?
31
K1 CO4 Unit-4 Which are the typical information elements of a file directory?
32
K2 CO4 Unit-4 Which are the typical operations performed on directory?
33
K1 CO4 Unit-4 What is directory? Explain directory operation in details.
34
K2 CO4 Unit-4 Explain file system implementation using linked list with index and i-node in
35
detail?
K1 CO4 Unit-4 What are methods of free space management of Disk?
36
K2 CO4 Unit-4 Explain linked list allocation using index in details.
37
K1 CO4 Unit-4 Explain file system performance in detail.
38
K2 CO4 Unit-4 Explain file system reliability & performance in detail.
39
K1 CO4 Unit-4 What are the typical access rights that may be granted or denied to a particular
40
user for a particular file?
K3 CO5 Unit-5 Write short notes on Interrupt handler.
41
K1 CO5 Unit-5 Discuss the following related to disk space management.
42
K2 CO5 Unit-5 Explain about Magnetic disk.
43
K1 CO5 Unit-5 What is RAID?
44
K2 CO5 Unit-5 What are the goals of Goals of I/O software?
45
K1 CO5 Unit-5 What is role of Device controllers?
46
K3 CO5 Unit-5 Explain role of Interrupt handler.
47

K1 CO5 Unit-5 Discuss in details devices drivers.


48
K2 CO5 Unit-5 Explain file system performance in detail.
49
K1 CO5 Unit-5 Which are the typical operations performed on directory?
50

Long Answer Type Questions

Sr. Level in BT Identify Questio


CO Question
No n Type
K1 CO1 Unit -1 Differentiate among the following types of OS by defining their essential
1 properties: a) Time Sharing System b) Parallel System
K2 CO1 Unit -1 Differentiate among the following types of OS by defining their essential
2 properties: a)Simple batch System b) Real time System
K3 CO1 Unit -1 Explain the essential properties of Distributed operating system.
3

K4 CO1 Unit -1 Explain O.S as extended machine in detail.


4

K3 CO1 Unit -1 Explain OS as resources manager


5

K6 CO1 Unit -1 Differentiate among the following types of OS by defining their essential
6 properties.
K2 CO1 Unit -1 Define operating system and list the basic services provided by operating
7 system.
K3 CO1 Unit -1 Explain the working of Smart Card O.S
8

K2 CO1 Unit -1 Explain the terms : a) Real time System b) Distributed System
9

K2 CO1 Explain essential features of following structure of O.S a) Monolithic System b)


Unit -1
10 Layered Systems c) Micro Kernels d) Client Server Model e) Virtual Machines f)
Exokernels
K2 CO2 Unit -2 Explain and differentiate between user level and kernel level thread.
11

K2 CO2 Unit -2 Explain the process state transition diagram used in multiprogramming
12 environment.
K5 CO2

Unit -2
13

K4 CO2 Unit -2 Explain the terms related to IPC –a) Race condition b) critical section c)Mutual
14 exclusion d)Semaphores
K2 CO2 Unit -2 Write short notes on: a) Process states b) Critical section c) Race condition
15

K2 CO2 Unit -2 Write short notes on:


16 a) Starvation b) PCB c) Two level scheduling d) Round robin scheduling
K4 CO2 Unit -2 What is wait for graph? Explain with example.
17

K3 CO2 Unit -2 What are the necessary conditions of deadlock? Explain in details
18

K2 CO2 Unit -2 Explain Banker’s Algorithm in details.


19

K2 CO2 Unit -2 What is monitor? Explain solution for producer-consumer problem using
20 monitor.
K2 CO3 Unit-3 What is paging? Discuss basic paging technique in details.
21

K3 CO3 Unit-3 Explain paging in detail.


22

K2 CO3 Unit-3 What is virtual memory? How it is implemented.


23

K3 CO3 Unit-3 Explain Segmentation in detail.


24

K2 CO3 Unit-3 Explain following allocation algorithm. a. First fit b. Best fit c. Worst fit d. Next fit
25

K3 CO3 Unit-3 Explain memory management with linked list in details.


26

K5 CO3 Explain static partitioned allocation with partition sizes 300,150, 100, 200, 20.
Unit-3
27 Assuming first fit method indicate the memory status after memory request for
sizes 80, 180, 280, 380, 30.
K4 CO3 Unit-3
28 What are the differences of internal and external memory Fragmentation?

K3 CO3 Unit-3 Write short note on: a. Segmentation b. Page table c. Compaction d. Working
29 set model e. fragmentation
K5 CO3 Free memory holes of sizes 15K, 10K, 5K, 25K, 30K, 40K are available. The
Unit-3
30 processes of size 12K, 2K, 25K, 20K is to be allocated. How processes are placed
in first fit, best fit, worst fit. Calculate internal as well as external fragmentation.
K3 CO4 Unit-4 Explain file system reliability & performance in detail.
31

K3 CO4 Unit-4 Explain file system implementation using linked list with index and i-node in
32 detail?
K2 CO4 Unit-4 What are points to be consider in file system design? Explain linked list
33 allocation & index allocation in detail.
K5 CO4 Consider the following page reference string.
Unit-4
34 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2How many page faults would occur for
the following replacement algorithm, assuming four and six frames respectively?
K3 CO4 Unit-4 Explain the following page replacement algorithm. a) Optimal page replacement
35 b) Least recently used page replacement.
K3 CO4 Unit-4 Explain the following techniques to improve file system performance. a) block
36 read ahead and b) Reducing disk arm motion
K2 CO4 Unit-4 Which are the typical operations performed on directory?
37

K3 CO4 Unit-4 Explain the following file allocation methods a) Contiguous allocation b) i-node
38

K3 CO4 Unit-4 Explain linked list allocation & index allocation in detail.
39

K3 CO4 Unit-4 What are the typical access rights that may be granted or denied to a particular
40 user for a particular file?
K4 CO5 Unit-5 Discuss briefly the following issues related to device independent i/o software.
41
a. Uniform interfacing for device drivers. b. Buffering.
K4 CO5 Unit-5 Discuss the following related to disk space management a) Block size b) Keeping
42 track of free blocks.
K5 CO5 Suppose a disk drive has 400 cylinders , numbered 0 to 399.The driver is
currently serving a request at cylinder 143 and previous request was at cylinder
125 .The queue of pending request in FIFO
Unit-5
43 order is: 86,147,312,91,177,48,309,222,175,130. Starting from the current
head position what is the total distance in cylinders that the disk to satisfy all the
pending request for each of the following disk scheduling algorithms? 1] SSTS 2]
SCAN 3]
C-SCAN
K3 CO5 Unit-5 Briefly explain security features of WINDOWS7.
44

K3 CO5 Unit-5 Explain process and thread management WINDOWS- 7 in detail.


45

K5 CO5 Suppose that a disk drive has 5000 cylinders, numbered 0 through 4999.The
Unit-5 drive is serving a request at cylinder 143. FIFO order is, 86, 1470, 913,
46
1774,948,1509,1022,1750,130 starting from head position. What is total
distance? FCFS, SSTF, SCAN, LOOK, C SCAN, C-LOOK
K5 CO5 Disk requests come in to the disk for cylinders 10, 22, 20, 2, 40, 6 and 38. A seek
takes 6 msec per cylinder move. How much seek time is for Closest cylinder next
Unit-5
47 algorithm? Initially arm is at cylinder 20.Starting track at 100.The queue of
pending request is, 55,58,39,18,90,160,150,38,184 – FCFS, SCAN ( elevator),
SSTF,C SCAN
K3 CO5 Unit-5 Explain kernel structure in UNIX.
48
K3 CO5 Unit-5 Give the functions of following UNIX commands: cat, cp, pwd
49

K3 CO5 Unit-5 Explain System administration commands in Unix


50

You might also like