Job Saarnee

JOB SAARNEE

Top Most Platform for Job Updates O Level Results Answer keys AKTU MCQs

OPERATING SYSTEM 999+ MCQ BASED Most Important QUESTION WITH ANSWER | Operating System MCQs with Answer

OPERATING SYSTEM MCQ BASED QUESTION 
(Multi Choice Question)

Operating System MCQs with Answer 

This Blog cover all possible Multi Choice Question from topic operating system, type of operating system, process, synchronization , dead lock, memory management 

Total amount of question covers in  This MCQ series is 100. They cover all the important aspect related to that topic provided below. 

If you want the Hard copy of MCQ then u can comment in the comment session. The Question is prepared after putting lot of effort so instead of copy it please share the Link so that we can able to take Benefit of our effort.   

Q1 Operating System means

a) A Set of programs which control computer working

b) A way of managing resources

c) it work like a interface between user and Hardware

d) All of the Above

Sol: All of the above

Q2 The Primary job of an operating system is to:

a) Command Resources

b) Manage Resources

c) Provide utilities

d) Be user Friendly 

Sol: Manage Resources

Q3 When a computer is ON then its OS software has to reside in 

a) Primary Storage

b) Main Storage

c) AUX Storage

d) None of the above

Sol. Primary Storage

Q4 Two Basic types of Operating System are

a) Batch and Time Sharing

b) Sequential and Real Time

c) Direct and interactive 

d) Batch and interactive

Sol: Batch and Time Sharing

Q5 A computer is a combination of

a) Computer Hardware + Software

b) Hardware + Software + Processes

c) Computer Hardware + Operating System

d) None of the Above

Sol. Computer Hardware + Operating System

Q6 SPOOLING stand for

a) Simultaneous Peripheral Operation Online

b) Simple Peripheral Operation Online

c) Simultaneous Printing Operation Online

d) None of the Above

Sol. Simultaneous Peripheral Operation Online

Q7 Which of the following is not the example of operating system

a) DOS

b) Window

c) Mach

d) All of them are Operating System

Sol. All of them are Operating System

Q8 The Process of transferring Data intended for a peripheral device onto a disk for some period of time is known as 

a) Multi Programming

b) Spooling

c) Caching

d) None of the above

Sol. Spooling

Q9 An Operating system is 

a) Application Software 

b) System Software

c) AI program

d) None of the above

Sol. System Software

Q10 To access the services of operating system, the interface is provided by the 

a) System calls

b) API

c) Library

d) Assembly instructions  

Sol. System calls

Q11) Which of the following is not an operating system?

a) ULTRiX

b) AIX

c) Oracle

d) Rhapsody

Sol. Oracle

Q12 When was the first operating system developed?

a) 1946

b) 1942

c) 1950

d) 1958

Sol. 1950

Q13 A Shell is a 

a) Hardware Component

b) Command Interpreter

c) Kernel

d) None of the above

Sol. Command Interpreter

Q14 Which of the following not a Operating System layer 

a) Kernel 

b) Shell

c) Application

d) Critical Section

Sol. Critical Section

Q15  BIOS is used?

a) By compiler

b) By operating system

c) By application software

d) By interpreter

Sol. By operating system

Q16 Which one of the following is not true?

a) kernel is the central core of the operating system

b) During booting, kernel is the first part of operating system to load into memory 

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 Execution

Sol. kernel is made of various modules which can not be loaded in running operating system

Q17 What is the main function of the command interpreter?

a) to get and execute the next user-specified command

b) to provide the interface between the application and Hardware

c) to handle the files Request

d) none of the above

Sol. to get and execute the next user-specified command

Q18 A Small Program Which Load OS into the memory is called as 

a) ROM

b) BIOS

c) Boot Strap Loader

d) None of the above

Sol. Boot Strap Loader

Q19 Which of the Open-source operating system?

a) UNIX Operating System

b) Windows Operating system

c) Linux Operating system

d) None of these

Sol. UNIX Operating System

Q20 In Soft Real Time System data files are 

a) Small

b) Medium

c) Large

d) None of the Above

Sol. Medium

Q21 Which of the following is an Example of Real time OS

a) UNIX

b) MARUTI 

c) WIN-NT

d) None of the above

Sol. MARUTI 

Q22 An Example of Network Operating System

a) BSD

b) Harmony

c) MS-DOS

d) None of the above

Sol. BSD

Q23 What is the advantage of layered approach to the design of Operating System

a) It simplifies the construction and debugging

b)A modification made in a particular layer will not affect the other layers.

c) The hardware layer is the innermost layer So a user  cannot directly modify or access it

d) All of the above

Sol. All of the above

Q24 Reason behind dual mode operation of processors?

a) Dual-mode operation is used to provide protection & security to the user’s program.

b) If you do not have Dual-mode, then you can write over the Operating System.

c) The Operating System gains the main control of the computer in the kernel mode.

d) All of the above

Sol. All of the above

Q25 Which of the following is type of Kernel

a) monolithic kernel

b) hybrid kernel

c) microkernel

d) All of the above

Sol. All of the above

Q26 The Term Process was coined by

a) Barry Boehm

b) Daley

c) Albrecht

d) None of the above

Sol. Daley

Q27 One can interact with an Operating System by mean of 

a) System commands

b) System Call

c) Both a and b

d) None of the above

Sol. Both a and b

Q28 PCB stands for 

a) Process common block

b) Process control Block

c) Process care Block

d) None of the above

Sol. Process control Block  

Q29 The size of WIN-NT OS is above 1,60,000 LOC While WIN-2000 has size of

a) 1,19,00,000 LOC

b) 2,60,00,000 LOC

c) 3,25,00,000 LOC

d) None of the above

Sol.3,25,00,000 LOC

Q30 A process can be terminated due to __________

a) normal exit

b) Occurrence of Fault

c) killed by another process

d) all of the Above

Sol. All of the Above

Q31 What is the ready state of a process?

a) when process is ready scheduled 

b) when process is unable to run until some IO has been completed

c) when process is executing in the CPU

d) none of the mentioned

Sol. when process is ready scheduled

Q32 In Unix, Which system call creates the new process?

a) fork

b) create

c) new

d) none of the mentioned

Sol. Fork

Q33 Which of the following is true about shell?

a) Term “terminal” is synonymous to shell

b) Bash is synonymous to shell

c) Shells are ought to be part of the operating system

d) Users can install third party shells to replace ones shipped with OS if any

Sol. Users can install third party shells to replace ones shipped with OS if any

Q34 Which of the following is abstracted by operating system?

a) Processor

b) Memory

c) Network Cards

d) All of the above

Sol. All of the above

Q35 Which of the following are valid differences between CreateProcess() and fork():

a) fork() by default creates a child process with same file descriptors while CreateProcess() does not.

b) CreateProcess() by default creates a child process with same file descriptors while fork() does not.

c) fork() duplicates the program for different process. CreateProcess() creates different process with new program.

d) CreateProcess() does not return the pid of the child process to the parent process while fork()

returns the child process pid to parent process.

e) CreateProcess() is more efficient than fork() then exec() without copy-on-write.

Sol.

a) fork() by default creates a child process with same file descriptors while CreateProcess() does not.

c) fork() duplicates the program for different process. CreateProcess() creates different process with new program.

e) CreateProcess() is more efficient than fork() then exec() without copy-on-write.

Q36 Which system call returns the process identifier of a terminated child?

a) wait

b) exit

c) fork

d) get

Sol. Wait 

Q37 The address of the next instruction to be executed is provided by 

a) CPU registers

b) program counter

c) process stack

d) pipe

Sol. Program Counter

Q 38 When the process want to perform I/O operation  

a) It is placed in an termination state

b) It is placed in a waiting state

c) It is placed in the ready state

d) None of the above

Sol. It is placed in a waiting queue

Q39 Long-term scheduler is responsible for?

a) selecting which process has to be brought into the ready queue

b) selecting which process has to be executed next 

c) selecting which process to remove from memory by swapping

d) None of these

Sol. selecting which process has to be brought into the ready queue 

Q 40 Medium-term scheduler is responsible for ?

a) selecting which process has to be brought into the ready queue

b) selecting which process has to be executed next 

c) selecting which process to remove from memory by swapping

d) None of these

Sol. selecting which process to remove from memory by swapping

Q41 Short-term scheduler is responsible for?

a) selecting which process has to be brought into the ready queue

b) selecting which process has to be executed next 

c) selecting which process to remove from memory by swapping

d) None of these

Sol. selecting which process has to be executed next

Q42 The primary distinction between the short term scheduler and the long term scheduler is 

a) The length of their queues

c) The type of processes they schedule

d) The frequency of their execution

e) None of these

Sol. The frequency of their execution

Q 43 Which of the following is responsible for context switching

a) short term scheduler

b) long term scheduler

c) Dispatcher

d) medium-term scheduler

Sol. Dispatcher

Q44 PCB is

a) Data Structure

b) Command

c) Controlling of process

d) None of the above

Sol. Data Structure

Q45 In Which mode of execution the control is taken form the process force fully 

a) Preemptive Mode

b) Non Preemptive Mode

c) in both Preemptive Mode and Non Preemptive Mode

d) None of the above

Sol. Preemptive Mode

Q46 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

Sol. Ready state

Q47 CPU bound Process Spend most of the time in

a) CPU

b) Input / Output

c) block state

d) None of the above

Sol. CPU

Q48 In a multi-programming environment

a) the processor executes more than one process at a time

b) the programs are developed by more than one person

c) more than one process resides in the memory

d) a single user can execute many programs at the same time

Sol. the processor executes more than one process at a time

Q49 Each process has their own process control block

a) True 

b) False

Sol. True

Q50 Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the

a) Running state

b) Ready state

c) Suspended state

d) Terminated state

Sol. Ready state

Q51 Consider a system with n CPU processor then What is maximum and minimum number of process the may be reside ready , running and block state 

a) Ready: min=0 & max=n-1 ,Running: min=0 & max=n, Ready: min=0 & max=all  

b) Ready: min=0 & max=all ,Running: min=0 & max=n, Ready: min=0 & max=all  

c) Ready: min=0 & max=all ,Running: min=0 & max=all, Ready: min=0 & max=all  

d) Ready: min=all & max=all ,Running: min=0 & max=n, Ready: min=0 & max=all  

Sol. b) Ready: min=0 & max=all ,Running: min=0 & max=n, Ready: min=0 & max=all

Q52.Which section comprises the compiled program code, read in from non-volatile storage when the program is launched.

a) text section

b) data section

c)  heap

d) stack

Sol. Text Section

Q53 ____ section is dynamically allocated memory to a process during its run time

a) text section

b) data section

c)  heap

d) stack

Sol. Heap

Q54 which contains temporary data for process (such as function parameters, return addresses, and local variables)

a) text section

b) data section

c)  heap

d) stack

Sol. stack

Q55 Process control block (PCB) consist of 

a) list of open Registers

b) process state

c) process id

d) All of the above

Sol. All of the above

Q56

Consider the following Statement 
1. if a process make a transaction D it would result in another process making transaction immediately
2. A Process P2 in Block state can make a transaction E while another process P1 in running state
3. the operating system used preemptive scheduling 
4. the operating system used non preemptive scheduling  


Which is True 

a) 1,2
b) 1,3
c) 2,3
b) 2,4

Sol. 2,3

Q57 Operating systems identify processes by unique number called __________

a) Process state
b) Program counter
c) Process ID
d) Process number
Sol. Process Id

Q58 Which of the following statement is true when a process creates a new process
1) The parent continues to execute concurrently with child process.
2) The parent Stop their to execute child process.
3) The parent waits until some or all of its children have terminated.
4) The parent do not wait until some or all of its children have terminated.
a) 1 and 2
b) 2 and 3
c) 2 and 4
d) 1 and 3
Sol. 1 and 3
Q59 the process is
a) an instance of a program in execution
b) a program only 
c) A Process state
d) none of the above
Sol. An instance of a program in execution  

Q60 a Program is passive while process is 
a) in active
b) active 
c) there is no difference
d) None of the above
Sol. active

Q61 A process is created and is initially put in the 
a) Ready Queue
b) Waiting Queue
c) both a and b
d) None of the above
Sol. Ready Queue

Q62 Exit system call result in 
a) Forced Termination
b) Abnormal Termination
c) Normal Termination
d) None of the above
Sol. Normal Termination
Q63. A thread is 
a) Small task
b) Process 
c) Light Weight Process
d) None of the above
Sol.  Light Weight Process

Q64. Generally we have Kernel Level Process and
a) Program Level Process
b) Thread level process
c) User level Process
d) None of the above  
Sol. User level Process
Q65 IPC stand for 
a) Internal Program Controller 
b) Internal Process control
c) Inter process communication 
d) None of the above
Sol. Inter process communication 
Q67. Inter Process communication is done through
a) Mails
b) Kernel
c) Message
d) System Call
Sol. Message 

Q68. number of process executed per unit of time is called
a) CPU Utilization
b) Bandwidth
c) turn around time
d) Throughput 
Sol. Throughput 

Q69 if Dispatcher latency increase then the degree of multiprogramming
a) Increase 
b) Decrease
c) do not change
d) None of the above
Sol. Decrease

Q70 The new process consists of a copy of the ____ to allows the parent process to communicate easily with its child process
a) address space
b) process state
c) process register
d) Process Id
Sol. Address Space

Q71 Which of the following scheduling algorithms is non-preemptive?

a) Round Robin 
b) First-In First-Out 
c) Multilevel Queue Scheduling 
d) Multilevel Queue Scheduling with Feedback 

Sol. First-In First-Out 

Q72 Which of the following does not interrupt a running process? 
a) A device 
b) Timer 
c) Scheduler process 
d) Power failure 

Sol. Scheduler process 

Q73 Where does the swap space reside ? 
a) RAM 
b) Disk 
c) ROM 
d) On-chip cache 
Sol. Disk  

Q74 Which of the following need not necessarily be saved on a context switch between processes? 
a) General purpose registers 
b) Translation look-aside buffer 
c) Program counter 
d) All of the above 

Sol. Translation look-aside buffer  

Q75 What is the swap space in the disk used for?
a) Saving temporary html pages
b) Saving process data
c) Storing the super-block
d) Storing device drivers

Sol. Saving process data

Q76 The objective of multi programming is

1. to have more than one process running at all times.

2. to have single process run at a time

3. to achieve maximum CPU utilization

4. to achieve minimize CPU utilization

a) 1,2

b) 1,3

c) 2,3

d) 2,4

Sol. 1,3

Q77 In single-processor system

1.  it never support more than one running process at a time

2. if more than one processes, one process execute at a time rest will wait until the CPU is free.

3. the CPU utilization can be maximize 

4. there more than one process can run in CPU

a) 1,3

b) 1,2

c) 2,3

d) 2,4

Sol. 1,2

Q 78 The ready queue is generally stored as a______

a) Array

b) Stack

c) Linked List 

d) None of the above

Sol. Linked List

Q 79 Once the process is allocated the CPU and is executing, which of several events could occur:

1. The process can perform an I/O request and can be placed in waiting queue

2. The process can able to create a new child process and wait for the child’s termination.

3. The process could be removed forcibly from the CPU can be put back in ready queue, due to interrupts, due to incoming of higher priority process, due to time stamp

a) 1 only
b) 1 and 2
c) 1,2,3
d) 2,3

Sol. 1,2,3

Q80 Which of the following stands is True about short-term scheduler 
1. selects from among the processes that are present in ready queue and allocates the CPU to one of them.
2. selects processes from the disk and loads them into memory for execution.
3. The short-term scheduler must select a new process for the CPU frequently.
4. The short-term scheduler executes much less frequently.

a) 1,2
b) 1,3
c) 2,4
d) 2,3
Sol. 1,3 

Q81 Which of the following is TRUE about  I/O-bound process.
1. spends more of its time doing I/O
2. spends more of its time doing computations.
3. If all processes are I/O bound, the CPU will almost always be empty
4. If all processes are I/O bound, the CPU will almost always be Full
a) 1,2
b) 2,3
c) 1,3
d) 2,4
Sol. 1,3 

Q 82 Which of the following is TRUE about CPU-bound process.
1. spends more of its time doing I/O
2. spends more of its time doing computations.
3. If all processes are I/O bound, the CPU will almost always be empty
4. If all processes are I/O bound, the CPU will almost always be Full
a) 1,2
b) 2,3
c) 1,3
d) 2,4
Sol. 2,4
Q 83 Convoy Effect is phenomenon associated with
a) SJF
b) SRTF
c) FIFO
d) LJF
Sol. FIFO

Q84 RR Scheduling is a preemptive version of
a)FIFO
b)SJF
c) Multi Level Queue
d) None of the above

Sol: FIFO

Q85 FIFO Scheduling is 
a) Preemptive
b) Non Preemptive
c) Deadline Scheduling
d) None of the above
Sol. Non Preemptive

Q86 The Preemption of process takes place after a fixed interval of time called as
a) Time Slice
b) Time Quantum
c) Response time 
d) None of the Above
Sol. Time Quantum

Q87 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

Sol. Turn around Time

Q88 Which scheduler is also called a job scheduler?
a) Long-Term Scheduler
b) Short-Term Scheduler
c) Medium-Term Scheduler
d) All of the above
Sol. Long Term Scheduler

Q89 Which scheduler is also called a CPU scheduler?
a) Long-Term Scheduler
b) Short-Term Scheduler
c) Medium-Term Scheduler
d) All of the above
Sol. Short Term Scheduler

Q90 When the suspended process is moved to the secondary storage. This process is called?
a) Process mix.
b) Swapping
c) Swap-In
d) Swap-Out
Sol. Swapping

Q91 Which scheduler Speed is fastest?
a) Long-Term Scheduler
b) Short-Term Scheduler
c) Medium-Term Scheduler
d) Swapping
Sol. Short-Term Scheduler

Q92 A_________ is the mechanism to store and restore the state
a) PCB
b) Program Counter
c) Scheduling information
d) Context Switching
Sol. Context Switching

Q93 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
Sol. Ready Queue

Q94 Process are classified into different groups in ____________

a) shortest job scheduling 
b) round robin scheduling 
c) priority scheduling 
d) multilevel queue scheduling 

Sol. multilevel queue scheduling 

Q95 How many times the following C program prints yes?
main()
{
fork();
fork();
print f(“yes”);
}
a) Only once
b) Twice
c) Four times
d) Eight times
Sol. Four times
first fork call one fork and one yes statement then fork further call one yes statement mean total 2 yes
second fork only call one yes statement mean 1 more yes
then third yes print statement call which mean 1 more yes
So total number of yes is 4 
Q96 Which one of the following is false about the operating system?
a) OS code base consists of a bit of assembly code
b) OS communicates with hardware devices directly
c) OS is independent of the hardware on which it executes
d) Timing plays a crucial role in an OS   

Sol. OS is independent of the hardware on which it executes 

Q97 State True or False for the question related to system calls. An OS designer who is designing a network stack,

1. Exposes, to the User, the details of the protocol used to send the data.

2. Exposes, to the User, the interface to set the protocol used for sending the data.

a) 1- False 2 – True

b) 1- True 2- False

c) 1 – True 2-True

d) 1-False 2-False

Sol. 1- False 2 – True

Q98 State True or False. In the absence of system calls, a user process can never access the memory allocated to kernel processes.

  • True
  • False
Sol. True

Q99 Consider the 3 processes, P1, P2 and P3 shown in the table.
Process           Arrival time   Burst time
   P1                0                         5
   P2                1                         7
   P3                3                         4
The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are
a) FCFS: P1, P2, P3 and  RR2: P1, P2, P3
b) FCFS: P1, P3, P2 and  RR2: P1, P3, P2
c) FCFS: P1, P2, P3 and  RR2: P1, P3, P2
d) FCFS: P1, P3, P2 and  RR2: P1, P2, P3
Sol. c) FCFS: P1, P2, P3 and  RR2: P1, P3, P2
In FCFS as it execute in non preemptive mode, Gantt Chart P1 execute completely then P2 and then P3
So Sequence is P1, P2, P3

In the case of Round Robin, Gantt Chart include P1 for 2 time Quantum
then P2, as it arrived in queue after that P1 then P3 SIMILARLY WE PROCEED FURTHER 
So Sequence is p1, p2, p1, p3, p2, p1, p3, p2, p2  
Q100 Consider the following table of arrival time and burst time for three processes P0, P1 and P2.
Process   Arrival time   Burst Time
P0            0 ms          9 ms
P1            1 ms          4 ms
P2            2 ms          9 ms
The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?
a) 5.0 ms
b) 4.33 ms
c) 6.33 ms
d) 7.33 ms
Sol. 5 ms
here as it is Shortest Remaining time first then we start with P0 and execute for 1 time quantum after this P1 is arrived in ready queue, as Burst Time of P1 is Smaller in comparison to P0 the P1 is going to execute for 1 time  Quantum, now all the process arrived in the Ready queue but time quantum of P1 is smaller it will execute completely than P0 then P2
So Gantt Chart Sequence is P0, P1,P1,P0,P2

PNO

AT

BT

CT

TAT

WT

P0

0

9

13

13

4

P1

1

4

5

4

0

P2

2

9

22

20

11

So Avg Waiting Time is (4+0+11)/3=5

For More Question Visit the Provided Below

OPERATING SYSTEM 999+ MCQ BASED Most Important QUESTION WITH ANSWER Part 2

Click here

Leave a Comment

Your email address will not be published. Required fields are marked *

Shopping Cart

You cannot copy content of this page