Operating System Set 26
On This Page
This set of Operating System (OS) Multiple Choice Questions & Answers (MCQs) focuses on Operating System Set 26
Q1 | A process stack does not contain
- Function parameters
- Local variables
- Return addresses
- PID of child process
Q2 | Which system call returns the process identifier of a terminated child?
- wait
- exit
- fork
- get
Q3 | The address of the next instruction to be executed by the current process is provided by the
- CPU registers
- Program counter
- Process stack
- Pipe
Q4 | A Process Control Block(PCB) does not contain which of the following :
- Code
- Stack
- Bootstrap program
- Data
Q5 | The number of processes completed per unit time is known as __________
- Output
- Throughput
- Efficiency
- Capacity
Q6 | The state of a process is defined by:
- the final activity of the process
- the activity just executed by the process
- the activity to next be executed by the process
- the current activity of the process
Q7 | Which of the following is not the state of a process?
- New
- Old
- Waiting
- Running
Q8 | The Process Control Block is:
- Process type variable
- Data Structure
- A secondary storage section
- A Block in memory
Q9 | The entry of all the PCBs of the current processes is in:
- Process Register
- Program Counter
- Process Table
- Process Unit
Q10 | The degree of multiprogramming is:
- 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
Q11 | A single thread of control allows the process to perform:
- only one task at a time
- multiple tasks at a time
- only two tasks at a time
- all of the mentioned
Q12 | The objective of multiprogramming is to :
- Have some process running at all times
- Have multiple programs waiting in a queue ready to run
- To minimize CPU utilization
- None of the mentioned
Q13 | Which of the following condition is required for deadlock to be possible?
- mutual exclusion
- a process may hold allocated resources while awaiting assignment of other resources
- no resource can be forcibly removed from a process holding it
- all of the mentioned
Q14 | A system is in the safe state if
- the system can allocate resources to each process in some order and still avoid a deadlock
- there exist a safe sequence
- all of the mentioned
- none of the mentioned
Q15 | The circular wait condition can be prevented by
- defining a linear ordering of resource types
- using thread
- using pipes
- all of the mentioned
Q16 | Which one of the following is the deadlock avoidance algorithm?
- banker’s algorithm
- round-robin algorithm
- elevator algorithm
- karn’s algorithm
Q17 | What is the drawback of banker’s algorithm?
- in advance processes rarely know that how much resource they will need
- the number of processes changes as time progresses
- resource once available can disappear
- all of the mentioned
Q18 | To avoid deadlock
- there must be a fixed number of resources to allocate
- resource allocation must be done only once
- all deadlocked processes must be aborted
- inversion technique can be used
Q19 | If the wait for graph contains a cycle :
- then a deadlock does not exist
- then a deadlock exists
- then the system is in a safe state
- either deadlock exists or system is in a safe state
Q20 | All unsafe states are :
- deadlocks
- not deadlocks
- fatal
- none of the mentioned
Q21 | Physical memory is broken into fixed-sized blocks called ________
- frames
- pages
- backing store
- none of the mentioned
Q22 | Logical memory is broken into blocks of the same size called _________
- frames
- pages
- backing store
- none of the mentioned
Q23 | The __________ is used as an index into the page table.
- frame bit
- page number
- page offset
- frame offset
Q24 | _____ is the concept in which a process is copied into main memory from the secondarymemory according to the requirement.
- Paging
- Demand paging
- Segmentation
- Swapping
Q25 | Linux uses a time-sharing algorithm
- to pair preemptive scheduling between multiple processes
- for tasks where absolute priorities are more important than fairness
- all of the mentioned
- none of the mentioned