B.

TECH/CSBS/4TH SEM/CSBS 2201/2022

Group-E B.TECH/CSBS/4TH SEM/CSBS 2201/2022
8. (a) Compare between working principles of Interrupt Driven and polling based 10 OPERATING SYSTEM CONCEPT
using block diagram. (CSBS 2201)
((CO5)(Remember/L.0C)1
(b) Differentiate between virus, worm and trojan horse.
Time Allotted:3 hrs Full Marks : 70
LCCO6)(Understand/LOCQ)]
8+4 12
Figures out of the right margin indicate full marks.
9. (a) Explain VFS with diagram. [CC04)(Remember/LOC)] Candidates are required to answer Group A and
(b) Explain contiguous allocation, linked allocation and indexed alocation with
any5(five) from Group B to E, taking atleastone from each group.
example. ICCO4)(Understand/LOcO)]
C) What do you mean by vectored interrupt? I(cOs) Remember/LOC] Candidates are required to give answer in their own words as far as practicable.
3+6+3= 12
Group-A
(Multiple Choice Type Questions)
Cognition Level LOCQ 1OCQ HOCQ
Percentage distribution 59.37 37.5 3.12 1. Choose the correct alternative for the following: 10x 1 10
Course Outcome (C0 Banker's algorithm is used
(a) to prevent deadBock (b) to deadlock recovery
After the completion of the course students will be able to (c) to solve the deadlock (d) none of these.
1.
Analyse and differentiate between different types of operating systems (namely,
batch, multi programnmed,time-sharing, real-time, distributed, parallel processing (i) The real-time operating system, which of the following algorithm will be the
most suitable scheduling scheme?
system) based on their application domains andevolution.
(a) Round Robin (b) FCFS
2. and describe system operations, internal structure of computer system
Demonstrate
and operating system. (c) SJF (d) Pre-emptive Priority Scheduling.
3. Design multiprocessing and multithreading environments based on inter- (ii) An operating system uses the Shortest Remaining Time first (SRTF) process
process/thread communication andsynchronization. scheduling algorithm. Consider the arrival times and execution times for the
4. Compare the different level of memory (Primary memory, cache, virtual memory, following processes
secondary storage) andhow they are correlated to improve the performance of the Process Execution time Arrival time
system. P1 20
5. Demonstrate the operations of 10 devices and how they are governed by the P2 25 15
operating system. P3 10 30
6. Discuss the activity and impact ofthreat, virus, worm and how the system could be P4 15 45
protected from them. What is the total waiting time for process P2?
(a) 5 6) 40 (c) 15 (d) 55.
LOCQ: Lower Order Cognitive Question; 10CQ: Intermediate Order Cognitive Question;
HOCQ: Higher Order Cognitive Question (iv) The problem of indefinite blockage of lower priority job in general priorityy
scheduling is solved by
(a) starvation (b) aging
(c) compaction (d) dirty bit.
(v) Counting Semaphores
(a) can only have positive integer value b) can only have positive value
(c)can have anyinteger value (d) cannot be 0.
CSBS 2201 CSBS 2201 1
 B.TECH/CSBS/4TI SEM/CSBS 2201/2022 B.TECH/CSBS/4TH SEM/CSBS 2201/2022
(vi) System calls are usually invoked by using (b) "Race conditioncan while some shared resource is
only happen shared among
(a) software interrupt (b) polling some processes who try to make some alteration to it." - Justify.
) an indirect jump (d) privileged.
Compare and contrast between Process and Thread.
[CCO3)(Evaluate/HOCO)
[(Co2) (Analyse/1OcQ
(vii) Which module gives control of the CPU the process selected
(c)
to by the short-term 6+3+3 = 12
scheduler?
(a) Dispatcher (b) Loader
5. (a) Consider the set of 4 processes whose arrival time and burst time are given
(c) Scheduler (d) Linker.
(vii) If one thread opens a file with read privileges then
below
Process Burst Timme
(a) other threads in the another process can also read from that file No
Arva'
Time PriorityptL Burst 1/0 BurstCPU
(6) other threads in the same process can also read from that file P1 0
Burst 3
C) any other thread cannot read from that file P2 3
(d) any other thread cannot write from that file.
P3 2
(ix) if the CPU scheduling policy is Priority Scheduling, calculate the average waiting
Thrashing
(a) reduces page 1/0 time and average turnaround time. (Lower number means higher priority)
(b) decreases the degree of multiprogramming [(CO3)(Apply/10CQ)]
Cimplies excessive page 1/0 (b) A system is having 3 user processes P1, P2 and P3 where P1 requires 2 units of
(d) improve the system performance. resource R, P2 requires 3 units of resource R, P3 requires 4 units of resource R.
What will be the minimum number of units of R that ensures no deadlock?
Fragmentation is ((C03) (Apply/10C)]
(a) Dividing the secondary memory into equal sized fragments (4+4)+4 = 12
(b) Dividing the main memory into equal sized fragments
) Fragments of memory words used in a page
Group-D
(d) Fragments of memory words unused in a page.
6. (a) What are the differences between internal and external fragmentation?
Group-B CCCO4)(Understand/LOCO)]
Consider the following page reference string
2. (a) Explain Microkernel operating system architecture.
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
CCCO2)(Understand/LOCQ Find out
the number of page faults if there are 4 page frames, using the following
(b) With proper example explain the difference between multiprogramming and
multiprocessing.
page replacement algorithm (i) LRU (i) FCFS (ii) Optimal.
LCCO1)(Understand/LOcQ)] CCO4)(Apply/10C0)]
is Bootstrapping? Describe with diagram how Bootstrapping works when
What
the computer system starts.
(c) What is demand paging? What are the benefits of using it? What is pure demand
CCCO2)(Understand/LOCQ)] paging? CCO4)(Understand/LOco)]
4+4+4= 12 2+6+(2+1+1) 12
. 3. (a) What is the purpose of interrupts? What are the differences between a trap and . (a) What is thrashing? What are its causes? How can its occurrence be reduced?
an interrupt? Can traps be generated intentionally by a user program?
CCCO4)(Understand/LOc]
[CCO2)(Understand/LOCQ)] (b) Suppose a disk drive has 300 cylinders, numbered 0 to 299. The drive is
Draw and explain process life cycle. CCCO2)(Understand/LOc]
(b) Compare and contrast between User Level threads & Kernel Level threads.
currently serving request at linder 90, and the previous request was at
(c) cylinder 80. The queue of pending requests, in FIFO order is 36,79, 15, 120, 199,
CCCO2)(Analyse/10CQ)] 270,89 and 170.
(2+2+2)+3+3 12 Starting from the current head position, what is the total distance (in cylinders)
that the disk arm moves to satisfy all the pending requests for each of the
Group-C following disk-scheduling algorithms?
How the readers' - writers' problem can be solved using semaphore? Explain () SSTF (ii) SCAN ii) C-SCAN. ICCO5)Apply/10CO)]
4. (a) (2+2+2)+6 12
the algorithm. LCCO3) (Analyse/10CQ)]
2 CSBS 2201 3
CSBS 2201