Operating Systems Basics Solved MCQs

 

Operating Systems Basics Solved MCQs

Hello Friends,this particular section is well focused on the Frequently asked Operating Systems MCQs in various competitive exams.This set of questions are very basic and easily understandable by students.we have kept the questions hardness level to very basic.

 

1.What is operating system?

• collection of programs that manages hardware resources
• system service provider to the application programs
• link to interface the hardware and application programs
• all of the mentioned

D. all of the mentioned

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

• system calls
• API
• library
• assembly instructions

D. assembly instructions

3.Which one of the following error will be handle by the operating system?

• power failure
• lack of paper in printer
• connection failure in the network
• all of the mentioned

D. all of the mentioned

4.The main function of the command interpreter is

• to get and execute the next user-specified command
• to provide the interface between the API and application program
• to handle the files in operating system
• none of the mentioned

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

5.By operating system, the resource management can be done via

• time division multiplexing
• space division multiplexing
• both (a) and (b)
• none of the mentioned

C. both (a) and (b)

6.If a process fails, most operating system write the error information to a

• log file
• another running process
• new file
• none of the mentioned

A. log file

7.The systems which allows only one process execution at a time, are called

• uniprogramming systems
• uniprocessing systems
• unitasking systems
• none of the mentioned

A. uniprogramming systems

8.In operating system, each process has its own

• address space and global variables
• open files
• pending alarms, signals and signal handlers
• all of the mentioned

D. all of the mentioned

9.A process can be terminated due to

• normal exit
• fatal error
• killed by another process
• all of the mentioned

D. all of the mentioned

10.What is the ready state of a process?

• when process is scheduled to run after some execution
• when process is unable to run until some task has been completed
• when process is using the CPU
• none of the mentioned

A. when process is scheduled to run after some execution

1.What is interprocess communication?

• communication within the process
• communication between two process
• communication between two threads of same process
• none of the mentioned

B. communication between two process

2.A set of processes is deadlock if

• each process is blocked and will remain so forever
• each process is terminated
• all processes are trying to kill each other
• none of the mentioned

A. each process is blocked and will remain so forever

3.A process stack does not contain

• function parameters
• local variables
• return addresses
• PID of child process

D. PID of child process

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

• wait
• exit
• fork
• get

A. wait

5.The address of the next instruction to be executed by the current process is provided by the

• CPU registers
• program counter
• process stack
• pipe

B. program counter

6.When the process issues an I/O request :

• It is placed in an I/O queue
• It is placed in a waiting queue
• It is placed in the ready queue
• It is placed in the Job queue

A. It is placed in an I/O queue

7.What is a long-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 these

A. It selects which process has to be brought into the ready queue

8.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 these

C. It selects which process to remove from memory by swapping

9.What is a short-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 these

B. It selects which process has to be executed next and allocates CPU

10.The primary distinction between the short term scheduler and the long term scheduler is :

• The length of their queues
• The type of processes they schedule
• The frequency of their execution
• None of these

C. The frequency of their execution

 

1.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 :

• Blocked state
• Ready state
• Suspended state
• Terminated state

B. Ready state

2.In a multi-programming environment :

• the processor executes more than one process at a time
• the programs are developed by more than one person
• more than one process resides in the memory
• a single user can execute many programs at the same time

C. more than one process resides in the memory

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

• Running state
• Ready state
• Suspended state
• Terminated state

B. Ready state

4.Which of the following does not interrupt a running process ?

• A device
• Timer
• Scheduler process
• Power failure

C. Scheduler process

5.Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) ____.

• Shared Memory Segments
• Entry Section
• Race condition
• Process Synchronization

C. Race condition

6.Which of the following state transitions is not possible ?

• blocked to running
• ready to running
• blocked to ready
• running to blocked

A. blocked to running

7.Which process can affect of be affected by other processes executing in the system?

• cooperating process
• child process
• parent process
• init process

A. cooperating process

8.If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called

• mutual exclusion
• critical exclusion
• synchronous exclusion
• asynchronous exclusion

A. mutual exclusion

9.Which one of the following is a synchronization tool?

• thread
• pipe
• semaphore
• socket

C. semaphore

10.A semaphore is a shared integer variable

• that can not drop below zero
• that can not be more than zero
• that can not drop below one
• that can not be more than one

A. that can not drop below zero

 

1.Process synchronization can be done on

• hardware level
• software level
• both (a) and (b)
• none of the mentioned

C. both (a) and (b)

2.A monitor is a module that encapsulates

• shared data structures
• procedures that operate on shared data structure
• synchronization between concurrent procedure invocation
• all of the mentioned

D. all of the mentioned

3.What is the reusable resource?

• that can be used by one process at a time and is not depleted by that use
• that can be used by more than one process at a time
• that can be shared between various threads
• none of the mentioned

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

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

D. all of the mentioned

5.Which one of the following is the deadlock avoidance algorithm?

• banker’s algorithm
• round-robin algorithm
• elevator algorithm
• karn’s algorithm

A. banker’s algorithm

6.For effective operating system, when to check for deadlock?

• every time a resource request is made
• at fixed time intervals
• both (a) and (b)
• none of the mentioned

C. both (a) and (b)

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

A. there must be a fixed number of resources to allocate

8.An un-interruptible unit is known as :

• single
• atomic
• static
• None of these

B. atomic

9.Semaphore is a/an _______ to solve the critical section problem.

• hardware for a system
• special program for a system
• integer variable
• None of these

C. integer variable

10.CPU fetches the instruction from memory according to the value of

• program counter
• status register
• instruction register
• program status word

A. program counter

 

1.Operating System maintains the page table for

• each process
• each thread
• each instruction
• each address

A. each process

2.Because of virtual memory, the memory can be shared among

• processes
• threads
• instructions
• none of the mentioned

A. processes

3._____ is the concept in which a process is copied into main memory from the secondary memory according to the requirement.

• Paging
• Demand paging
• Segmentation
• Swapping

B. Demand paging

4.The pager concerns with the

• individual page of a process
• entire process
• entire thread
• first page of a process

A. individual page of a process

5.Swap space exists in

• primary memory
• secondary memory
• CPU
• none of the mentioned

B. secondary memory

6.A memory buffer used to accommodate a speed differential is called

• stack pointer
• cache
• accumulator
• disk buffer

B. cache

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

• physical address
• absolute address
• logical address
• none of the mentioned

C. logical address

8.Run time mapping from virtual to physical address is done by

• memory management unit
• CPU
• PCI
• none of the mentioned

A. memory management unit

9.Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

• fragmentation
• paging
• mapping
• none of the mentioned

B. paging

10.Program always deals with

• logical address
• absolute address
• physical address
• relative address

A. logical address

 

1.In FIFO page replacement algorithm, when a page must be replaced

• oldest page is chosen
• newest page is chosen
• random page is chosen
• none of the mentioned

2.______ is a unique tag, usually a number, identifies the file within the file system.

• File identifier
• File name
• File type
• none of the mentioned

3.To create a file

• allocate the space in file system
• make an entry for new file in directory
• both (a) and (b)
• none of the mentioned

4.By using the specific system call, we can

• open the file
• read the file
• write into the file
• all of the mentioned

5.File type can be represented by

• file name
• file extension
• file identifier
• none of the mentioned

6.Mapping of file is managed by

• file metadata
• page table
• virtual memory
• file system

7.file system fragmentation occurs when

• unused space or single file are not contiguous
• used space is not contiguous
• unused space is non-contiguous
• multiple files are non-contiguous

8.If one or more devices use a common set of wires to communicate with the computer system, the connection is called ______.

• CPU
• Monitor
• wirefull
• bus

9.A ________ is a collection of electronics that can operate a port, a bus, or a device.

• controller
• driver
• host
• bus

10.An I/O port typically consists of four registers status, control, ________ and ________ registers.

• system in, system out
• data in, data out
• flow in, flow out
• input, output

 

1.The ______ register is read by the host to get input.

• flow in
• flow out
• data in
• data out

C. data in

2.The ______ register is written by the host to send output.

• status
• control
• data in
• data out

D. data out

3.The hardware mechanism that allows a device to notify the CPU is called _______.

• polling
• interrupt
• driver
• controlling

B. interrupt

1.What does Belady’s Anomaly related to?

• Page Replacement Algorithm
• Memory Management Algorithm
• Deadlock Prevention Algorithm
• Disk Scheduling Algorithm

A. Page Replacement Algorithm

2.What are the two types of Semaphore?

• Digital Semaphores and Binary Semaphores
• Analog Semaphores and Octal Semaphores
• Counting Semaphores and Binary Semaphores
• Critical Semaphores and System Semaphores

C. Counting Semaphores and Binary Semaphores

3.What are the requirements for the solution to critical section problem?

• Mutual Exclusion
• Progress
• Bounded Waiting
• All of Above

D. All of Above

4.Which of the following memory unit that processor can access more rapidly

• Main Memory
• Virtual Memory
• Cache memory
• Read Only Memory

C. Cache memory

5.Which of the following is the system tool?

• Backup
• Disk defragmenter
• Both of above
• File

C. Both of above

6.When a computer is first turned on or restarted, a special type of absolute loader called ____ is executed

• Compile and Go loader
• Boot loader
•  Bootstrap loader
• Relating loader

C.  Bootstrap loader

7.In which type of the following OS, the response time is very crucial.

• Network Operating System
• Real Time Operating System
• Batch Operating System
• Unix Operating System

B. Real Time Operating System

8.Virtual Memory is

• Extremely Large Main memory
• Extremely Large Secondary memory
• An illusion of extremely large main memory
• An illusion of extremely large secondary memory

C. An illusion of extremely large main memory

9.Swapping

• Works best with many small partitions
• Allows many programs to use memory simultaneously
• Allows each program in turn to use the memory
• Does not work with overlaying

C. Allows each program in turn to use the memory

10.A program in execution is called

• A Paging
• A Process
• A virtual memory
• A Demand Page

B. A Process

 

1.What is thrashing?

• A high paging activity is called thrashing.
• A high executing activity is called thrashing
• A extremely long process is called thrashing
• A extremely long virtual memory is called thrashing

A. A high paging activity is called thrashing.

2.Symptoms of swap-file problems include extremely slow system speed and a disk that is constantly being accessed, which is referred to as ______________.

• Clocking
• Thrashing
• Booting
• Filtering

B. Thrashing

3.What hole will allocates in “Worst-Fit” algorithm of memory management?

• It allocates the smaller hole than required memory hole
• It allocates the smallest hole from the available memory holes
• It allocates the largest hole from the available memory holes
• It allocates the exact same size memory hole

C. It allocates the largest hole from the available memory holes

4.Which of the following is the allocation method of a disk space?

• Contiguous allocation
• Linked allocation
• Indexed allocation
• All of the Above

D. All of the Above

5.Which of the following concept is best to preventing page faults?

• Paging
• The working set
• Hit ratios
• Address location resolution

B. The working set

6.Poor response time are usually caused by

• Process busy
• High I/O rates
• High paging rate
• Any of the above

D. Any of the above

7.Virtual memory typically located on

• RAM
• CPU
• Flash card
• Hard drive

D. Hard drive

8.What is contained in the page table?

• Base address of each frame and corresponding page number
• Memory address and corresponding page number
• File name and corresponding page number
• None of Above

A. Base address of each frame and corresponding page number

9.Tree structure displays the

• File only
• Directory only
• File and directory name
• None of above

C. File and directory name

10.Multiprogramming systems:

• Are easier to develop than single programming systems
• Execute each job faster
• Execute more jobs in the same time period
• Are used only one large mainframe computers.

C. Execute more jobs in the same time period

 

1.Bringing a page into memory only when it is needed,this mechanism is called

• Deadlock
• Page Fault
• Dormant Paging
• Demand Paging

D. Demand Paging

2.What do you mean by Memory Compaction?

• Combine multiple equal memory holes into one big hole
• Combine multiple small memory holes into one big hole
• Divide big memory hole into small holes
• Divide memory hole by 2

B. Combine multiple small memory holes into one big hole

3.Copying a process from memory to disk to allow space for other processes is Called

• Swapping
• Deadlock
• Demand Paging
• Page Fault

A. Swapping

4.Page stealing

• Is a sign of an efficient system
• Is taking page frame from other working sets
• Should be the turning goal
• Is taking layer disk space for page in page out

B. Is taking page frame from other working sets

5.A spooler is a

• Location in memory that maintains the contents of documents until it prints out
• Queue of print job that are waiting to print
• Program that coordinates the print job that are waiting to process
• Message sent from the printer to the operating system when a print job is completed

C. Program that coordinates the print job that are waiting to process

6.What is the method of handling deadlocks?

• Use a protocol to ensure that the system will never enter a deadlock state.
• Allow the system to enter the deadlock state and then recover.
• Pretend that deadlocks never occur in the system
• All of the Above

D. All of the Above

7.The Banker’s algorithm is used

• to rectify deadlock
•  to detect deadlock
• to prevent deadlock
• to slove deadlock

C. to prevent deadlock

8.All of the following are TRUE regarding virtual memory EXCEPT

• Any amount of RAM can be allocated to virtual memory
• The setting for the amount of hard disk drive space to allocate virtual memory can be manually change
• This temporary storage is called the swap file or page file
• Virtual memory is the physical space of the hard drive

B. The setting for the amount of hard disk drive space to allocate virtual memory can be manually change

9.What is dispatch latency?

• The time taken by the dispatcher to stop one process and start another
• The time taken by the processor to write a file into disk
• The whole time taken by all processor
• None of Above

A. The time taken by the dispatcher to stop one process and start another

10.A page fault occurs when

• the Deadlock happens
• the Segmentation starts
• the page is found in the memory
• the page is not found in the memory

D. the page is not found in the memory