Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

MCQ Os

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 5

1. What is an operating system?

a) collection of programs that manages hardware resources


b) system service provider to the application programs
c) interface between the hardware and application programs
d) all of the mentioned

Answer: d
Explanation: An Operating System acts as an intermediary between user/user
applications/application programs and hardware. It is a program that manages hardware
resources. It provides services to application programs.

2. A Process Control Block(PCB) does not contain which of the following?


a) Code
b) Stack
c) Bootstrap program
d) Data

Answer: c
Explanation: Process Control Block (PCB) contains information related to a process such as
Process State, Program Counter, CPU Register, etc. Process Control Block is also known
as Task Control Block. Bootstrap program is a program which runs initially when the system
or computer is booted or rebooted.

3. The number of processes completed per unit time is known as __________


a) Output
b) Throughput
c) Efficiency
d) Capacity
4. What is a long-term scheduler?
a) It selects processes which have to be brought into the ready queue
b) It selects processes which have to be executed next and allocates CPU
c) It selects processes which heave to remove from memory by swapping
d) None of the mentioned
5. What is a short-term scheduler?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned
6.  In a time-sharing operating system, when the time slot given to a process is
completed, the process goes from the running state to the __________
a) Blocked state
b) Ready state
c) Suspended state
d) Terminated state

7. The context of a process in the PCB of a process does not contain __________
a) the value of the CPU registers
b) the process state
c) memory-management information
d) context switch time

8. Which module gives control of the CPU to the process selected by the short-term
scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned

9. The interval from the time of submission of a process to the time of completion is
termed as ____________
a) waiting time
b) turnaround time
c) response time
d) throughput

10. In priority scheduling algorithm, when a process arrives at the ready queue, its
priority is compared with the priority of ____________
a) all process
b) currently running process
c) parent process
d) init process

11. In multilevel feedback scheduling algorithm ____________


a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned

12. Concurrent access to shared data may result in ____________


a) data consistency
b) data insecurity
c) data inconsistency
d) none of the mentioned
13. The segment of code in which the process may change common variables, update
tables, write into files is known as ____________
a) program
b) critical section
c) non – critical section
d) synchronizing
View Answer

14. Which of the following conditions must be satisfied to solve the critical section
problem?
a) Mutual Exclusion
b) Progress
c) Bounded Waiting
d) All of the mentioned

15. Bounded waiting implies that there exists a bound on the number of times a process
is allowed to enter its critical section ____________
a) after a process has made a request to enter its critical section and before the
request is granted
b) when another process is in its critical section
c) before a process has made a request to enter its critical section
d) none of the mentioned

16. Which of the following condition is required for a deadlock to be possible?


a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other
resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned

17. A system is in the safe state if ____________


a) the system can allocate resources to each process in some order and still avoid a
deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned

18. The circular wait condition can be prevented by ____________


a) defining a linear ordering of resource types
b) using thread
c) using pipes
d) all of the mentioned
19. Which one of the following is the deadlock avoidance algorithm?
a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm

20. Which one of the following is a visual ( mathematical ) way to determine the
deadlock occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned

21.  TestAndSet instruction is executed ____________


a) after a particular process
b) periodically
c) atomically
d) none of the mentioned

22. Given a priori information about the ________ number of resources of each type that
maybe requested for each process, it is possible to construct an algorithm that
ensures that the system will never enter a deadlock state.
a) minimum
b) average
c) maximum
d) approximate

23. All unsafe states are ____________


a) deadlocks
b) not deadlocks
c) fatal
d) none of the mentioned

24. CPU fetches the instruction from memory according to the value of ____________
a) program counter
b) status register
c) instruction register
d) program status word

25. Which one of the following is the address generated by CPU?


a) physical address
b) absolute address
c) logical address
d) none of the mentioned

26. Physical memory is broken into fixed-sized blocks called ________


a) frames
b) pages
c) backing store
d) none of the mentioned

27.  If a page number is not found in the TLB, then it is known as a ____________
a) TLB miss
b) Buffer miss
c) TLB hit
d) All of the mentioned

28. Every address generated by the CPU is divided into two parts. They are
____________
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset

29.  In segmentation, each address is specified by ____________


a) a segment number & offset
b) an offset & value
c) a value & segment number
d) a key & value

30. Each entry in a segment table has a ____________


a) segment base
b) segment peak
c) segment value
d) none of the mentioned

You might also like