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

Which of The Following Is Not An Important Functions of An Operating System?

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

Operating System MCQ

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
2. To access the services of operating system, the interface is provided by the ___________
a) System calls
b) API
c) Library
d) Assembly instructions

3. Which of the following is not an important functions of an operating System?


A. Memory Management
B. File Management
C. Virus Protection
D. Processor Management

4. In OS, Memory management refers to management of?

A. Primary Memory
B. Main Memory
C. Secondary Memory
D. Both A and B

5. In multiprogramming environment, the OS decides which process gets the processor when and
for how much time. This function is called _____________.
A. process scheduling
B. process rescheduling
C. traffic controller
D. Processor Management

6. What does I/O controller do?


A. Keeps tracks of primary memory
B. Keeps tracks of all devices
C. Keeps tracks of processes
D. All of the above

7. What does file system do?


A. Keeps track of information
B. Keeps track of location
C. Keeps track of information status
D. All of the above
8.  ______________ is a technique in which an Operating System collects the programs and data
together in a batch before processing starts.
A. Batch processing
B. Interactivity processing
C. Real Time processing
D. Distributed processing

9.  Which of the following is Advantages of Batch processing?


A. A job could not enter an infinite loop.
B. Easy to debug program.
C. Increased performance
D. All of the above

10. ________ is when multiple jobs are executed by the CPU simultaneously by switching between
them.
A. Multiprogramming
B. Multitasking
C. Distributed Environment
D. Spooling

11. Multiprogramming generally?


A. decreases CPU utilization
B. Share the processor
C. Both A and B
D. None of the above

12. Multitasking Operating Systems are also known as?

A. Processing system
B. Time-sharing system
C. Real Time system
D. Distributed system

13. Interactivity refers to?

A. The ability of users to interact with a memory.


B. The ability of users to interact with a I/O devices.
C. The ability of users to interact with a CPU.
D. The ability of users to interact with a computer system.

14. Which one of the following is not true?


a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
c) kernel is made of various modules which can not be loaded in running operating system
d) kernel remains in the memory during the entire computer session
15. Which one of the following error will be handle by the operating system?
a) power failure
b) lack of paper in printer
c) connection failure in the network
d) all of the mentioned
16. In Operating Systems, which of the following is/are CPU scheduling algorithms?
a) Round Robin
b) Shortest Job First
c) Priority
d) All of the mentioned
17. If a process fails, most operating system write the error information to a ______
a) log file
b) another running process
c) new file
d) none of the mentioned
18. In operating system, each process has its own __________
a) address space and global variables
b) open files
c) pending alarms, signals and signal handlers
d) all of the mentioned
19. In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned
20. A process can be terminated due to __________
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
21. What is the ready state of a process?
a) when process is scheduled to run after some execution
b) when process is unable to run until some task has been completed
c) when process is using the CPU
d) none of the mentioned
22. What is interprocess communication?
a) communication within the process
b) communication between two process

c) communication between two threads of same process

d) none of the mentioned


12. A set of processes is deadlock if __________

a) each process is blocked and will remain so forever

b) each process is terminated

c) all processes are trying to kill each other

d) none of the mentioned

13. A process stack does not contain __________

a) Function parameters

b) Local variables

c) Return addresses

d) PID of child process

14. Which system call can be used by a parent process to determine the termination of child process?

a) wait

b) exit

c) fork

d) get

15. 10. The address of the next instruction to be executed by the current process is provided by the
__________

a) CPU registers

b) Program counter

c) Process stack

d) Pipe

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

a) Code

b) Stack

c) Bootstrap program
d) Data

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

a) Output

b) Throughput

c) Efficiency

d) Capacity

18. What is a Process Control Block?

a) Process type variable

b) Data Structure

c) A secondary storage section

d) A Block in memory

19. The entry of all the PCBs of the current processes is in __________

a) Process Register

b) Program Counter

c) Process Table

d) Process Unit

20. What is the degree of multiprogramming?

a) the number of processes executed per unit time

b) the number of processes in the ready queue

c) the number of processes in the I/O queue

d) the number of processes in memory

21. A single thread of control allows the process to perform __________

a) only one task at a time

b) multiple tasks at a time

c) only two tasks at a time


d) all of the mentioned

22. What is the objective of multiprogramming?

a) Have a process running at all time

b) Have multiple programs waiting in a queue ready to run

c) To increase CPU utilization

d) None of the mentioned

23. Which of the following do not belong to queues for processes?

a) Job Queue

b) PCB queue

c) Device Queue

d) Ready Queue

24. When the process issues an I/O request __________

a) It is placed in an I/O queue

b) It is placed in a waiting queue

c) It is placed in the ready queue

d) It is placed in the Job queue

25. What will happen when a process terminates?

a) It is removed from all queues

b) It is removed from all, but the job queue

c) Its process control block is de-allocated

d) Its process control block is never de-allocated

26. 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

27. The processes that are residing in main memory and are ready and waiting to execute are kept on a list
called _____________

a) job queue

b) ready queue

c) execution queue

d) process queue

28. 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

29. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

a) first-come, first-served scheduling

b) shortest job scheduling

c) priority scheduling

d) none of the mentioned

30. In priority scheduling algorithm ____________

a) CPU is allocated to the process with highest priority

b) CPU is allocated to the process with lowest priority

c) Equal priority processes can not be scheduled

d) None of the mentioned

31. 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

32. Which algorithm is defined in Time quantum?

a) shortest job scheduling algorithm

b) round robin scheduling algorithm

c) priority scheduling algorithm

d) multilevel queue scheduling algorithm

33. Process are classified into different groups in ____________

a) shortest job scheduling algorithm

b) round robin scheduling algorithm

c) priority scheduling algorithm

d) multilevel queue scheduling algorithm

34. 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

35. Which one of the following can not be scheduled by the kernel?

a) kernel level thread

b) user level thread

c) process

d) none of the mentioned

36. What is a reusable resource?

a) that can be used by one process at a time and is not depleted by that use

b) that can be used by more than one process at a time


c) that can be shared between various threads

d) none of the mentioned

You might also like