B Tech 3rd QB OS
B Tech 3rd QB OS
Unit 1
Operation System objective and function, The Evolution of operating Systems, Batch,
interactive, time sharing and real time systems, Protection. Operating System Structure,System
Components, operating system service, System structure. Distributed Computing,The Key
Architecture Trend; Parallel Computation, Input-Output Trends
Name of
University Bloom’s
S. N. Question Mark in which Year CO taxonomy
question Level
asked
1. What do you mean by system component? 4 Csvtu 2023 Co1 Un
2. what is operating system? What are 8 Csvtu 2023 Co1 Re
functions of operating system?
3. write a note on evolution of operating 8 Csvtu 2023 Co1 Un
system.
4. Explain batch processing operating system. 8 Csvtu 2023 Co1 Un
5. explain real time operating system. 8 Csvtu 2023 Co1 Un
6. explain distributed computing. 8 Csvtu 2023 Co1 Un
7. define time sharing and real time operating 8 Csvtu 2023 Co1 Un
system.
8. what are system component and services? 8 Csvtu 2023 Co1 Un
9. Define Operating System. List the objectives 8 Abvu 2023 Co1 Un
of an operating system.
10. Define Operating System. Explain the 8 abvu 2023 Co1 Un
evolution of operating system.
Unit 2
Process concept: Introduction, Definitions of “Process”, Process States, ProcessStateTransitions, The
process Control Block, Operations on Processes, Suspend and Resume,Interrupt Processing.Mutual
Exclusion, the Producer / Consumer problem, the critical section problem, Semaphores, Classical
problems inconcurrency, inter process communication.Asynchronous Concurrent Process: introduction,
parallel Processing, AControl Structure for indicating parallelism. CPU scheduling: concepts,
performance criteria, and schedulingAlgorithms. Algorithm evaluation, Multiprocessor scheduling.
Name of
University Bloom’s
S. N. Question Mark in which Year CO taxonomy
question Level
asked
1. What is process control block? 4 csvtu 2023 Co2
2. explain mutual exclusion and semaphores. 8 csvtu 2023 Co2
3. what is scheduling? Explain short term 8 csvtu 2023 Co2
scheduler and long term scheduler.
4. using pre emptive sjf scheduling draw the 8 csvtu 2023 Co2
gantt chart and calculate the
average waiting time for the given data
Process Arrival time Burst time
P1 0 19
P2 1 11
P3 2 83
P4 3 15
5. what is process? Explain process state and 8 csvtu 2023 Co2
transition.
6. explain producer consumer problem in 8 csvtu 2023 Co2
concurent process.
7. what do you understand by the process? 8 csvtu 2023 Co2
Explain variuos state with suitable diagram.
8. define preemtive scheduling algorithm. 8 csvtu 2023 Co2
9. what is cpu scheduling criteria? Explain 8 csvtu 2023 Co2
scheduling algorithm with example.
10. explain inter process communication and 8 csvtu 2023 Co2
interrupt processing.
Unit 3
Name of
University Bloom’s
S. N. Question Mark in which Year CO taxonomy
question Level
asked
1. Different between deadlock and starvation. 4 csvtu 2023 Co1 Un
2. what is the necessary condition of 8 csvtu 2023 Co2 Un
deadlock? Explain how the deadlock can be
prevented.
3. discuss banker's algorithm for deadlock 8 csvtu 2023 Co1 An
avoidance with suitable example.
4. consider a system with five process P0 8 csvtu 2023 Co2 Ev
through P4 and three resource types A, B,
C; the following snapshot of the system has
been taken:
Allocation Max 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 2 4 3 3
Unit 4
Name of
University Bloom’s
S. N. Question Mark in which Year CO taxonomy
question Level
asked
1. What is base machine? 4 csvtu 2023 Co1 Un
2. What do you mean by paging? Explain 8 csvtu 2023 Co2 Un
internal and external fragmentation.
3. What is segmentation? Explain virtual to 8 csvtu 2023 Co1 An
physical address mapping in a segmented
system with the help of a diagram.
4. If the contents of reference using are : 8 csvtu 2023 Co2 Ev
7,0,1,2,0,3,0,4,2,3,0,3 and there are three
frames available in the memory, then
compare an performance of given
algorithm in terms of page fault:
1. FCFS
2. Optimal page replacement
3. LRU
5. Explain base machine and resident monitor. 8 csvtu 2022 Co2 Re
6. What is paging and segmentation? Explain 8 csvtu 2021 Co2 Un
with suitable example.
7. Explain virtual memory. 8 csvtu 2021 Co2 Re
8. What is demand paging? Explain page 8 csvtu 2020 Co2 Un
replacement algorithm with suitable
example.
9. Explain threshing and allocation of frame. 4 csvtu 2020 Co2 Un
10. Explain cache memory organization. 4 csvtu 2020 Co2 Un
Unit 5
Name of
University Bloom’s
S. N. Question Mark in which Year CO taxonomy
question Level
asked
1. Define seek time and latency time. 4 csvtu 2023 Co1 Un
2. Differentiate between program driven and 8 csvtu 2023 Co2 Un
interrupt driven input/output.
3. Write different types of fill access method 8 csvtu 2023 Co1 An
with suitable diagram.
4. Suppose the moving head disk with 200 8 csvtu 2023 Co2 Ev
tracks is currently serving a request for
tracks 143 and just finished a request for
track 125 if the queue of request is kept in
FIFO order: 86, 147,91,177,94,150 what is
the total head movement for the following
scheduling schemes?
1. FCFS
2. C-SCAN
5. What is file system? Explain file 8 csvtu 2022 Co3 Re
organization and access mechanism.
6. Explain file sharing and file directories. 8 csvtu 2021 Co3 Un
7. Explain UNIX operating system in detail. 8 csvtu 2021 Co3 Re
8. Explain 8 csvtu 2020 Co3 Un