What is an operating system?

a) interface between the hardware and application programs

b) collection of programs that manages hardware resources
c) system service provider to the application programs
d) all of the mentioned
Answer-D
A Process Control Block (PCB) does not contain which of the following?
Code
Stack
Bootstrap program
Data
Answer-C
What is Scheduling?
allowing a job to use the processor
making proper use of processor
all of the mentioned
none of the mentioned
Answer-A
In Operating Systems, which of the following is/are CPU scheduling algorithms?
Priority
Round Robin
Shortest Job First
All of the mentioned
Answer-D
Semaphore is a/an _______ to solve the critical section problem.
a) hardware for a system
b) special program for a system
c) integer variable
d) none of the mentioned
Answer-C
Banker's algorithm is used?
To prevent deadlock
To deadlock recovery
To solve the deadlock
None of these
Answer-A
The _________ present a uniform device-access interface to the I/O subsystem, much as
system calls provide a standard interface between the application and the operating
system.
Devices
Buses
Device drivers
I/O systems
Answer-C
What is a medium-term scheduler?
It selects which process has to be brought into the ready queue
It selects which process has to be executed next and allocates CPU
It selects which process to remove from memory by swapping
None of the mentioned
Answer-C
Virtual memory is normally implemented by ________ ________
demand paging
buses
virtualization
all of the mentioned
Answer-A
An I/O port typically consists of four registers status, control, ________ and ________
registers.
data in, data out
system in, system out
flow in, flow out
input, output
Answer-A
To avoid the race condition, the number of processes that may be simultaneously inside
their critical section is
8
1
6
0
Answer-B
A deadlock avoidance algorithm dynamically examines the __________ to ensure that a
circular wait condition can never exist.
resource allocation state
system storage state
operating system
resources
Answer-A
Programs are executed on the basis of a priority number in a
Batch processing system
Time sharing
Multiprogramming
None of these
Answer-C
The entry of all the PCBs of the current processes is in __________
Process Register
Program Counter
Process Table
Process Unit
Answer-C
What is the degree of multiprogramming?
the number of processes executed per unit time
the number of processes in the ready queue
the number of processes in the I/O queue
the number of processes in memory
Answer-D
What is an operating system?
a) interface between the hardware and application programs
b) collection of programs that manages hardware resources
c) system service provider to the application programs
d) all of the mentioned
Answer-D
Semaphore is a/an _______ to solve the critical section problem.
a) hardware for a system
b) special program for a system
c) integer variable
d) none of the mentioned
Answer-C
To avoid the race condition, the number of processes that may be simultaneously inside
their critical section is
8
1
6
0
Answer-B
In general the two interrupt request lines are ____________
maskable& blocked interrupts
blocked & non maskable interrupts
maskable& non maskable interrupts
none of the mentioned
Answer-C
A page fault occurs when?
a page gives inconsistent data
a page cannot be accessed due to its absence from memory
a page is invisible
all of the mentioned
Answer-B
Programs are executed on the basis of a priority number in a
Batch processing system
Time sharing
Multiprogramming
None of these
Answer-C
Define and explain Long term scheduler and medium term scheduler.
Explain batch processing and multiprogramming system with neat diagram.
Define Safe and Unsafe Deadlock state with the help of a diagram and explain deadlock
avoidance technique (Bankers algorithm).
Define PCB and explain PCB with neat diagram.
Consider a reference string: 7,0,1,2,0,3,0,4,2,3,0,3,1,2,0 the number of frames in the
memory is 3. Find out the number of page faults respective to: optimal page algorithm
Page.
Explain different operations of file.
Sate types of I/O device and describe the concept of memory mapped I/O.
Explain race condition and critical section.
Explain monolithic structure with neat diagram.
Explain FIFO and shortest job first scheduling policies with the help of example
Describe the concept of DMA with neat diagram.
Explain multithreading with its types and state benefits of multithreading.
What is Operating system? Discuss an abstract view of an Operating System.
Explain monolithic structure with neat diagram.
Define PCB. Explain the process state transition.
Write short note on
a) Thread
b) Critical-Section Problem
Consider a reference string: 7,0,1,2,0,3,0,4,2,3,0,3,1,2,0 the number of frames in the
memory is 3. Find out the number of page faults respective to: Least Recently Used.
Explain time Sharing System with neat diagram.
Draw and explain different types of Scheduler.
What is deadlock? What are the four necessary conditions for Deadlock?
With the help of an example discuss contiguous and non- contiguous memory
allocation.
Explain concept of demand paging.
Differentiate between Synchronous and asynchronous I/O.
Discuss the bounded buffer classical synchronization problem.
Explain FIFO and shortest job first scheduling policies with the help of example
Define process, program and explain the process state transition diagram.
Define segmentation and explain Segmentation Architecture with neat diagram.
Explain file types and file access methods.
Consider a reference string: 7,0,1,2,0,3,0,4,2,3,0,3,1,2,0 the number of frames in the
memory is 3. Find out the number of page faults respective to: Least Recently Used.
Explain time Sharing System with neat diagram.
Define PCB and explain PCB with neat diagram.
Explain monolithic structure with neat diagram.
Define Safe and Unsafe Deadlock state with the help of a diagram and explain deadlock
avoidance technique (Bankers algorithm).
Explain the concept of segmentation with paging
What is deadlock? What are the necessary condition for deadlock
Discuss the bounded buffer classical synchronization problem.

What is Operating system? Discuss an abstract view of an Operating System.

Explain monolithic structure with neat diagram.
Define PCB. Explain the process state transition.
Write short note on
a) Thread
b) Critical-Section Problem
Consider a reference string: 7,0,1,2,0,3,0,4,2,3,0,3,1,2,0 the number of frames in the
memory is 3. Find out the number of page faults respective to: Least Recently Used.
Explain time Sharing System with neat diagram.
Draw and explain different types of Scheduler.
What is deadlock? What are the four necessary conditions for Deadlock?
With the help of an example discuss contiguous and non- contiguous memory
allocation.
Explain concept of demand paging.
Differentiate between Synchronous and asynchronous I/O.
Discuss the bounded buffer classical synchronization problem.