‏إظهار الرسائل ذات التسميات Operating System. إظهار كافة الرسائل
‏إظهار الرسائل ذات التسميات Operating System. إظهار كافة الرسائل

Objective Questions on Core Operating System set-12

1) An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of process is ...

A. FCFS scheduling

B. Round robin scheduling algorithm

C. Shortest job first scheduling algorithm

D. Priority scheduling algorithm


2) The hardware mechanism that enables a device to notify the CPU is called .......

A. polling

B. interrupt

C. system call

D. none of the above


3) In the running state ........

A. only the process which has control of the processor is found

B. all the process waiting for I/O to be completed are found

C. all the processes waiting for the processor are found

D. none of the above


4) Which technique was introduced because a single job could keep both the CPU and the I/O devices busy?

A. Time sharing

B. Spooling

C. Preemptive scheduling

D. Multiprogramming


5) RMA works on static priorities while EDF algorithm works on ........

A. starvation

B. dynamic priorities

C. RR scheduling

D. FIFO scheduling


6) In the ........... method of data transfer, the participation of the processor is eliminated during data transfer.

A. buffering

B. caching

C. direct memory access

D. indirect memory access


7) Inter process communication can be done through ....

A. mails

B. messages

C. system calls

D. traps


8) RR scheduling is most suitable for ........

A. time shared OS

B. distributed OS

C. real time OS

D. an Ordinary OS


9) The aim of ......... transparency is to ensure that the movement of the object is handled automatically by the system in a user transparent manner.

A. location

B. name

B. migration

D. scaling


10) ........... is a memory management scheme that permits the physical address space of a process to be noncontiguous.

A. Paging

B. Segmentation

C. Virtual memory

D. main memory


11) Context switching is ........

A. part of spooling

B. part of polling

C. part of interrupt handling

D. part of paging


12) The normal functioning of an RPC may get disrupted due to ..........

A. call message gets lost

B. response message gets lost

C. callee node and caller node crashes and is restarted

D. All of the above


13) Mutual exclusion is referred as .......

A. if one process is in a critical region others are excluded

B. prevents deadlock

C. requires semaphore to implement

D. is found only in the windows NT operating system


14) IFO scheduling is ..........

A. preemptive

B. non-preemptive

C. deadline scheduling

D. RR scheduling


15) .......... deals with the process of deciding which process should be assigned to which processor.

A. Process migration

B. Processor allocation

C. threads

D. none of the above


16) Which scheduler controls the degree of multiprogramming?

A. Short term scheduler

B. Long term scheduler


C. Middle term scheduler

D. Pre term scheduler


17) Safe state is .......

A. deadlock state

B. non-deadlocked state

C. polling state

D. spooling state


18) ........ time is defined as the time period for which the execution of the process is stopped for transferring its information to the destination node.

A. turn around

B. latency

C. freezing

D. execution



19) The principle of locality of reference justifies the use of

A. virtual memory

B. interrupts

C. main memory

D. cache memory


20) For a multiple instances of resource type which algorithm is used .......

A. divide and conquer algorithm

B. banker's algorithm

C. partition algorithm

D. sorting algorithm


Answers:

1) C. Shortest job first scheduling algorithm
2) B. interrupt
3) A. only the process which has control of the processor is found
4) D. Multiprogramming
5) C. RR scheduling
6) C. direct memory access
7) B. messages
8) A. time shared OS
9) B. migration
10) A. Paging
11) C. part of interrupt handling
12) D. All of the above
13) A. if one process is in a critical region others are excluded
14) B. non-preemptive
15) B. Processor allocation
16) B. Long term scheduler
17) B. non-deadlocked state
18) C. freezing
19) D. cache memory
20) B. banker's algorithm


Related Posts:

More MCQs on Operating System

Interview Questions on Operating System Basis set-11

1) Which of the following is crucial time while accessing data on the disk?

A. Seek time

B. Rotational time

C. Transmission time

D. Waiting time


2) What is the primary job of the operating system is a computer?

A. Command resources

B. Manage resources

C. Provide utilities

D. Be user friendly


3) The ......... is a user process that initiates a remote procedure call.

A. client

B. server

C. network

D. operating system


4) Which of the following memory allocation scheme suffers from external fragmentation?

A. Segmentation

B. Pure demand paging

C. Swapping

D. Paging


5) Which of the following is used to removal of process from active contention of CPU and reintroduce them into memory later?

A. Interrupt

B. Swapping

C. Signal

D. Thread


6) The operating system manages .....

A. memory

B. processor

C. disk and I/O devices

D. all of the above


7) Information about a process is maintained in a .........

A. stack

B. translation look a side buffer

C. process control block

D. program control block


8) Paging .........

A. solves the memory fragmentation problem

B. allows modular programming

C. allows structured programming

D. avoids deadlock


9) Which is not the layer of the Operating system?

A. Kernel

B. Shell

C. Application program

D. Critical Section


10) Distributed OS works on the ............ principle.

A. file foundation

B. single system image

C. multi system image

D. networking image


11) The collection of processes on the disk that is waiting to be brought into memory for execution forms the .......

A. ready queue

B. device queue

C. input queue

D. priority queue


12) In ....... condition, processes are allowed to request for new resources without releasing the resources that they are currently holding.

A. Mutual exclusion

B. Hold and wait

C. No preemption

D. Circular wait


13) The time taken by the disk arm to locate the specific address of a sector for getting information is called .....

A. rotational delay

B. seek time

C. search time

D. response time


14) The principle of locality of reference justifies the use of ........

A. virtual memory

B. interrupts

C. main memory

D. cache memory


15) In .......... condition, a resource that has been allocated to a process becomes available for allocation to another process only after it has been voluntarily released by the process holding it.

A. Mutual exclusion

B. Hold and wait

C. No preemption

D. Circular wait


16) Identify the odd thing in the services of operating system ...

A. Accounting

B. Protection

C. Error detection and correction

D. Dead lock handling


17) Multiprocessing ...........

A. makes the operating system simpler

B. allows multiple processes to run simultaneously

C. is completely understood by all major computer vendors

D. allows the same computer to have the multiple processors


18) In ............. condition, two or more processes must form a circular chain in which each process is waiting for a resource that is held by the next member of the chain.

A. Mutual exclusion

B. Hold and wait

C. No preemption

D. Circular wait


19) Which of the following is not advantage of multiprogramming?

A. Increased throughput

B. Shorter response time

C. Decreased operating system overhead

D. Ability to assign priorities of jobs


20) Which is not a state of the process?

A. Blocked

B. Running

C. Ready

D. Privileged


Answers:

1) A. Seek time
2) B. Manage resources
3) A. client
4) A. Segmentation
5) B. Swapping
6) D. all of the above
7) C. process control block
8) A. solves the memory fragmentation problem
9) D. Critical Section
10) B. single system image
11) C. input queue
12) B. Hold and wait
13) B. seek time
14) D. cache memory
15) C. No preemption
16) C. Error detection and correction
17) D. allows the same computer to have the multiple processors
18) D. Circular wait
19) C. Decreased operating system overhead
20) D. Privileged


Related Posts:

More MCQs on Operating System

MCQ on Operating System Fundamental set-10

1) The process of storing extra or duplicate information used for rebuilding the lost information in event of disks failure is known as ...

A. stripping

B. redundancy

C. disk array

D. RAID


2) A thread that is to be canceled is often referred to as the ....

A. target thread

B. thread cancellation

C. asynchronous cancellation

D. defined cancellation


3) ........... ensures the every message sent to a group of receivers will be delivered to either all of them or none of them.

A. Ordered delivery

B. Atomicity

B. Survivability

D. Realiability


4) An arrangement of record in a sequence in which they arrive is known as a ...........

A. pile

B. file

C. disk

D. directory


5) ........... also known as monitor mode.

A. User mode

B. System mode

C. Unprivileged mode

D. Process mode


6) The technique, for sharing the time of a computer among several jobs, which switches jobs so rapidly such that each job appears to have the computer to itself, is called ........

A. time sharing

B. time out

C. time domain

D. multitasking


7) For batch and payroll applications which of the following file organization is better ........

A. random file

B. sequential file

C. indexed file

D. hashed file


8) Name the scheduler that selects among the processes that are ready to execute and allocates the CPU to one of them.

A. Long term scheduler

B. Medium term scheduler

C. Job scheduler

D. Short term scheduler


9) Failure during inter-process communication may be due to .....

A. loss of request transfer unit

B. single datagram messages

C. multi datagram messages

D. message passing


10) The process of direct mapping by using some faster algorithms is called as .........

A. hashing

B. searching

C. sorting

D. indexing


11) Name the system in which the processors do not share memory and each processor that its own local memory.

A. Tightly coupled system

B. Parallel processing system

C. Loosely coupled system

D. Batch processing system


12) Which technique was introduced because a single job could not keep both the CPU and I/O devices busy?

A. Time-sharing

B. Spooling

C. preemptive scheduling

D. Multiprogramming


13) Those directories in which the root directory has all system file and no other sub-directory is known as ...

A. flat directory

B. single directory

C. hierarchical directory

D. indexed directory


14) Which is responsible for maintaining all the important abstractions of the operating system?

A. Kernel

B. System libraries

C. System utilities

D. Daemons


15) A four message reliable IPC protocol for client server communication works as ........

A. request, reply, acknowledgment

B. reply, acknowledgment, request, acknowledgment

C. request, acknowledgment, reply, acknowledgment

D. request, request, reply, acknowledgment


16) A path name that starts at root directory is ..........

A. absolute

B. relative

C. hybrid

D. hierarchical


17) Where does the problem of fragmentation occur?

A. Static storage allocation

B. Static allocation storage

C. Stack allocation with dynamic binding

D. Heap allocation


18) Idempotency basically means .........

A. reliability

B. repeatability

C. Survivability

D. flexibility


19) All path names are specified relative to the working directory ........

A. absolute path name

B. relative path name

C. hybrid path name

D. hierarchical path name


20) The time taken by the disk arm to locate the specific address of a sector for getting information is called ........

A. rotational latency

B. seek time

C. search time

D. response time

Answers:

1) B. redundancy
2) A. target thread
3) B. Atomicity
4) A. pile
5) B. System mode
6) A. time sharing
7) B. sequential file
8) D. Short term scheduler
9) B. single datagram messages
10) A. hashing
11) C. Loosely coupled system
12) D. Multiprogramming
13) A. flat directory
14) A. Kernel
15) C. request, acknowledgment, reply, acknowledgment
16) A. absolute
17) D. Heap allocation
18) B. repeatability
19) B. relative path name
20) D. response time


Related Posts:

More MCQs on Operating System

Solved Objective Questions on Operating System set-8


1. A small program which loads OS into the memory is called as ...........
Objective Questions on Operating System
System management components (Photo credit: Wikipedia)

A) ROM

B) bootstrap loader

C) BIOS

D) RAM



2. Virtual memory is ..............

A) Simple to implement

B) Used by all major commercial OS

C) Less efficient memory utilization

D) Less effective



3. A special purpose register that is set to the highest address occupied by the OS code is ...........

A) fence register

B) general purpose register

C) protection register

D) control register



4. As OS program module that selects the next job to be admitted for execution is called as .....

A) scheduler

B) compiler

C) throughput

D) dispatcher





5. Multiprogramming systems .................

A) are easier to develop than single programming systems.

B) execute each job faster

C) execute more jobs in the same time.

D) are used only on large main frame computers



6. SSTF stands for ........................

A) Small seek Time First

B) Simple Seek Time First

C) Shortest Seek Time First

D) Synchronous Seek Time First



7. The program is known as .................. which interacts with the inner part of called kernel.

A) compiler

B) device driver

C) protocol

D) shell



8. Semaphore can be used for solving ............

A) wait & signal

B) deadlock

C) synchronization

D) priority



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

A) output

B) throughput

C) efficiency

D) capacity



10. On what principle does Distributed OS work?

A) File foundation

B) Single system image

C) Multi system image

D) Networking image


Answers:



1. A small program which loads OS into the memory is called as ...........

B) bootstrap loader

2. Virtual memory is ..............

B) Used by all major commercial OS

3. A special purpose register that is set to the highest address occupied by the OS code is ...........

A) fence register

4. As OS program module that selects the next job to be admitted for execution is called as .....

A) scheduler

5. Multiprogramming systems .................

C) execute more jobs in the same time.

6. SSTF stands for ........................

C) Shortest Seek Time First

7. The program is known as .................. which interacts with the inner part of called kernel.

D) shell

8. Semaphore can be used for solving ............

C) synchronization

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

B) throughput

10. On what principle does Distributed OS work?

B) Single system image



Related Posts:


Solved MCQ Questions on Operating System set-7


1. Operating System means ........................

A) a set of programs which controls computer working.

MCQ Questions on Operating System
Operating System (Photo credit: Wikipedia)
B) a way of computer drives works

C) a set of devices and programs

D) All of the above



2. The basic types of OS are ...................

A) batch and time sharing

B) sequential and real time

C) direct and interactive

D) batch and interactive



3. The simplest way of deadlock is to ...

A) preempt a resource

B) rollback

C) kill one of the processes

D) lock one of the processes



4. Throughput of a system is

A) Number of programs processed by it per unit time

B) Number of times the program is invoked by the system

C) Number of requests made to a program by the system

D) None of the above



5. Which of the following is not OS layer?

A) Kernel

B) Shell

C) Application Programs

D) Critical Section



6. Round robin scheduling is essentially the preemptive version of ...........

A) first in first out

B) shortest job first

C) shortest remaining

D) longest time first



7. The process that are residing in the main memory and are waiting to execute are kept on a list called the ............

A) job queue

B) ready queue

C) wait queue

D) device queue



8. Which of the following describes the ability of an OS to support multiple, concurrent paths of execution within a single process?

A) Multithreading

B) Multiprocessing

C) Multitasking

D) Multiprogramming



9. Virtual memory is

A) an extremely large main memory

B) an extremely large secondary memory

C) an illusion of extremely large main memory

D) a type of memory used in super computers



10. A thread is a .................... precess.

A) heavy weight

B) multiprocess

C) inter thread

D) light weight






Answers:


1. Operating System means ........................

A) a set of programs which controls computer working.

2. The basic types of OS are ...................

D) batch and interactive

3. The simplest way of deadlock is to ...

C) kill one of the processes

4. Throughput of a system is

A) Number of programs processed by it per unit time

5. Which of the following is not OS layer?

D) Critical Section

6. Round robin scheduling is essentially the preemptive version of ...........

A) first in first out

7. The process that are residing in the main memory and are waiting to execute are kept on a list called the ............

B) ready queue

8. Which of the following describes the ability of an OS to support multiple, concurrent paths of execution within a single process?

A) Multithreading

9. Virtual memory is

C) an illusion of extremely large main memory

10. A thread is a .................... precess.

D) light weight



Related Posts:

What are the different types of scheduling methods?


Process scheduling is one way for a processor to handle n processes, by scheduling the execution process. Each process is executed one by one according to prescribed schedule.

The aim of processor scheduling is to assign processes to be executed by the processor or processors over time, in a way that meets system objectives, such as response time, throughput and processor efficiency. In many systems, this scheduling activity is broken down into three separate functions: long, medium and short-term scheduling.

Types of Scheduling 


Long term Scheduling

The long term scheduler determines which programs are admitted to the system for processing. Thus, it controls the degree of multiprogramming. Once admitted a job or user program becomes a process and added to the queue for the short term scheduler. In some systems, a newly created process begins in a swapped-out condition, in which case it is added to the queue for the medium term scheduler.

Medium term scheduling

 Medium term scheduling is a part of the swapping function. The swapping in decision is based on the need to manage the degree of multiprogramming.
 It is the decision to add to the number of processes that are partially of fully in main memory.

Short term scheduling

The short term scheduler is also known as the dispatcher executes must frequently and makes the fine grained decision of which process to execute next.

It is the decision as to which available process will be executed by the processor.

You Might also view the following Related Posts

MCQ of Computer Security with answer set – 2


1. …………….. are used in denial of service attacks, typically against targeted web sites.
A) Worm
B) Zombie
C) Virus
D) Trojan horse

2. Select the correct order for the different phases of virus execution.
i) Propagation phase                      ii) Dormant phase
iii) Execution phase                         iv) Triggering phase
A) i, ii, iii, and iv
B) i, iii, ii and iv
C) ii, i, iv an iii
D) ii, iii, iv and i


3. A ………………… attaches itself to executable files and replicates, when the infected program is executed, by finding other executable files to infect.
A) Stealth virus
B) Polymorphic Virus
C) Parasitic Virus
D) Macro Virus

4. …………………….. is a form of virus explicitly designed to hide itself from detection by antivirus software.
A) Stealth virus
B) Polymorphic Virus
C) Parasitic Virus
D) Macro Virus

5. A …………………….. creates copies during replication that are functionally equivalent but have distinctly different bit patterns.
A) Boot Sector Virus
B) Polymorphic Virus
C) Parasitic Virus
D) Macro Virus

6. A portion of the Polymorphic virus, generally called a …………………….. , creates, a random encryption, key to encrypt the remainder of the virus.
A) mutual engine
B) mutation engine       
C) multiple engine
D) polymorphic engine

7. State whether the following statement is true.
i) A macro virus is platform independent.
ii) Macro viruses infect documents, not executable portions of code.
A) i-only
B) ii-only
C) Both i and ii
D) Non i and ii

8. The type(s) of auto executing macros, in Microsoft word is/are
A) Auto execute
B) Auto macro
C) Command macro
D) All of the above

9. In …………….., the virus places an identical copy of itself into other programs or into certain system areas on the disk.
A) Dormant phase
B) Propagation phase
C) Triggering phase
D) Execution phase

10. A ……………… is a program that secretly takes over another Internet-attached computer and then uses that computer to launch attacks.
A) Worm
B) Zombie
C) Virus
D) Trap doors
Answers:
1.       B) Zombie
2.       C) ii, i, iv an iii
3.       C) Parasitic Virus
4.       A) Stealth virus
5.       B) Polymorphic Virus
6.       B) mutation engine
7.       C) Both i and ii
8.       D) All of the above
9.       B) Propagation phase
10.   B) Zombie


You may also wanted to view the following related posts

For other more Multiple Choice Questions (MCQs): Click Here

Solved MCQ of Computer Security set -1


1. In computer security, ……………………. means that computer system assets can be modified only by authorized parities.
A) Confidentiality
B) Integrity
C) Availability
D) Authenticity

2. In computer security, …………………….. means that the information in a computer system only be accessible for reading by authorized parities.
A) Confidentiality
B) Integrity
C) Availability
D) Authenticity


3. The type of threats on the security of a computer system or network are ……………………..
i) Interruption                   ii) Interception                  iii) Modification
iv) Creation                         v) Fabrication
A) i, ii, iii and iv only
B) ii, iii, iv and v only
C) i, ii, iii and v only
D) All i, ii, iii, iv and v

4. Which of the following is independent malicious program that need not any host program?
A) Trap doors
B) Trojan horse
C) Virus
D) Worm

5. The ……….. is code that recognizes some special sequence of input or is triggered by being run from a certain user ID of by unlikely sequence of events.
A) Trap doors
B) Trojan horse
C) Logic Bomb
D) Virus

6. The …………….. is code embedded in some legitimate program that is set to “explode” when certain conditions are met.
A) Trap doors
B) Trojan horse
C) Logic Bomb
D) Virus

7. Which of the following malicious program do not replicate automatically?
A) Trojan Horse
B) Virus
C) Worm
D) Zombie

8. …………… programs can be used to accomplish functions indirectly that an unauthorized user could not accomplish directly.
A) Zombie
B) Worm
C) Trojan Horses
D) Logic Bomb

9. State whether true of false.
i) A worm mails a copy of itself to other systems.
ii) A worm executes a copy of itself on another system.
A) True, False
B) False, True
C) True, True
D) False, False

10. A ………….. is a program that can infect other programs by modifying them, the modification includes a copy of the virus program, which can go on to infect other programs.
A) Worm
B) Virus
C) Zombie
D) Trap doors
Answers:
1.       B) Integrity
2.       A) Confidentiality
3.       C) i, ii, iii and v only
4.       D) Worm
5.       A) Trap doors
6.       C) Logic Bomb
7.       A) Trojan Horse
8.       C) Trojan Horses
9.       C) True, True
10.   B) Virus


You may also wanted to view the following related posts

For other more Multiple Choice Questions (MCQs): Click Here

Solved MCQ of Operating System Set-6


1. …………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes.
A) Partition management
B) Memory management
C) Disk management
D) All of the above

2. A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a …………….
A) virtual memory, true memory
B) virtual memory, real memory
C) real memory, virtual memory
D) imaginary memory, real memory


3. In process scheduling, …………………… determines when new processes are admitted to the system.
A) long term scheduling
B) medium term scheduling
C) short term scheduling
D) none of the above

4. In process scheduling, ………………… determines which ready process will be executed next by processor.
A) long term scheduling
B) medium term scheduling
C) short term scheduling
D) none of the above

5. The sum of the seek time, and the rotational delay is called the ………………..
A) reached time
B) access time
C) arrived time
D) common time

6. The …………….. policy segments the disks request queue into sub queues of the length N.
A) SCAN
B) C-SCAN
C) N-Step SCAN
D) FSCAN

 7. Which of the following are the functions of operating system?
i) recovering from errors                              ii) facilitating input/output
iii) facilitating parallel operation                 iv) sharing hardware among users
v) implementing user interface
A) i, ii, ii, and v only
B) i, ii, iii, and iv only
C) ii, iii, iv and v only
D) All i, ii, iii, iv and v

8. File management function of the operating system includes
i) File creation and deletion                         ii) Disk scheduling
iii) Directory creation                                      iv) Mapping file in secondary storage.
A) i, ii and iii only
B) i, iii and iv only
C) ii, iii and iv only
D) All i, ii, iii and iv

9. The ……………. Determines when a page should be brought into main memory.
A) Fetch policy
B) Placement policy
C) Replacement policy
D) Resident set management

10. With …………………. A page is written out to secondary memory only when it has been selected for replacement.
A) pre-cleaning
B) demand cleaning
C) required cleaning
D) fast cleaning
Answers:
1.       B) Memory management
2.       C) real . virtual memory
3.       A) long term scheduling
4.       C) short term scheduling
5.       B) access time
6.       C) N-Step SCAN
7.       D) All i, ii, iii, iv and v
8.       B) i, iii and iv only
9.       A) Fetch policy
10.   B) demand cleaning

 You may also wanted to view the following related posts

For other more Multiple Choice Questions (MCQs): Click Here

MCQ of Operating System with answer set-4


1. .............. refers to a situation in which a process is ready to execute but is continuously denied access to a processor in deference to other processes.
A) Synchronization
B) Mutual Exclusion
C) Dead lock
D) Starvation

2. Which of the following is not the approach to dealing with deadlock?
A) Prevention
B) Avoidance
C) Detection
D) Deletion


3. Which of the following are the states of a five state process model?
i) Running            ii) Ready               iii) New                 iv) Exit                   v) Destroy
A) i, ii, iii and v only
B) i, ii, iv and v only
C) i, ii, iii, and iv only
D) All i, ii, iii, iv and v

4. State which statement is true for Suspended process?
i) The process is not immediately available for execution.
ii) The process may be removed from suspended state automatically without removal order.
A) i only
B) ii only
C) i and ii only
D) None

5. Following is/are the reasons for process suspension.
A) Swapping parent process
B) Inter request
C) Timing
D) All of the above

6. The different types of tables maintained by the operating system are .............
A) memory, logical , I/O file
B) memory, I/O, file, physical
C) memory, I/O, file, process
D) memory, logical, I/O, physical

7. Which of the following information not included in memory table?
A) The allocation of main memory to process.
B) The allocation of secondary memory to process
C) Any information needed to manage virtual memory
D) Any information about the existence of file

8. Process Management function of an operating system kernel includes.
A) Process creation and termination.
B) Process scheduling and dispatching
C) Process switching
D) All of the above

9. The typical elements of process image are .....................
i) User data         ii) System Data                  iii) User program              iv) System stack
A) i, iii and iv only
B) i, ii,  and iv only
C) ii, iii, and iv only
D) All i, ii, iii, and iv

10. Match the following mechanisms for interrupting the execution of a process and their uses.
i) Interrupt                                                                         a) Call to an operating system function
ii) Trap                                                                              b) Reaction to an asynchronous external event
iii) Supervisor Call                                                             c) Handling of a error or an exception condition
A) i-a, ii-b, iii-c
B) i-c, ii-a, iii-b
C) i-b, ii-c, iii-a
D) i-a, ii-c, iii-b

Answers:
1.   D) Starvation
2.   D) Deletion
3.   C) i, ii, iii, and iv only
4.   A) i only
5.   D) All of the above
6.   C) memory, I/O, file, process
7.   D) Any information..... of file
8.   D) All of the above
9.   A) i, iii and iv only
10.   C) i-b, ii-c, iii-a

You may also wanted to view the following related posts
For other more MCQs: Click Here

Solved MCQ of Operating System Theory set-3

1. Which of the following is not the function of Micro kernel?
A) File management
B) Low-level memory management
C) Inter-process communication
D) I/O interrupts management

2. Match the following.
i) Mutual exclusion                          a) A process may hold allocated resources while waiting assignment.
ii) Hold and wait                             b) No resource can be forcibly removed from a process holding it.
iii) No preemption                           c) Only one process may use a resource at a time.
A) i-a, ii-b, iii-c
B) i-a, ii-c, iii-b
C) i-b, ii-c, iii-a
D) i-c, ii-a, iii-b



3. A direct method of deadlock prevention is to prevent the occurrences of ...................
A) Mutual exclusion
B) Hold and wait
C) Circular waits
D) No preemption

4. The methods or algorithms which are used to increase the performance of disk storage sub-system is called .............
A) Disk performing
B) Disk scheduling
C) Disk storing
D) Disk extending

5. ................. is the time required to move the disk arm to the required track.
A) Seek time
B) Rotational delay
C) Latency time
D) Access time

6. The ............... policy restricts scanning to one direction only.
A) SCAN
B) C-SCAN
C) N-Step SCAN
D) Both A and B

7. ............... policy selects the disk I/O request that requires the least movement of the disk arm from its current position.
A) FSCAN
B) SSTF
C) SCAN
D) C-SCAN
8. .................. refers to the ability of an operating system to support multiple threads of execution with a single process.
A) Multithreading
B) Multiprocessing
C) Multiexecuting
D) Bi-threading

 9. State whether the following statement is true.
i) It takes less time to terminate a thread than a process.
ii) Threads enhance efficiency in communication between different executing programs.
A) i-True, ii-False
B) i-True, ii-True
C) i-False, ii-True
D) i-False, ii-False

10. ............ is a special type of programming language used to provide instructions to the monitor simple batch processing schema.
A) Job control language (JCL)
B) Processing control language (PCL)
C) Batch control language (BCL)
D) Monitor control language (MCL)

Answers:
1.   A) File management
2.   D) i-c, ii-a, iii-b
3.   C) Circular waits
4.   B) Disk scheduling
5.   A) Seek time
6.   B) C-SCAN
7.   B) SSTF
8.   A) Multithreading
9.   B) i-True, ii-True
10.   A) Job control language (JCL)

MCQ of Operating System with answer set-2


1. The first batch operating system was developed in the ................. by General Motors for use on an IBM 701.
A) mid 1940's
B) mid 1950's
C) mid 1960's
D) mid  1970's

2. Process is ........................
A) A program in execution
B) An instance of a program running on a computer.
C) The entity that can be assigned to and executed
D) All of the above.


3. ................... is a facility that allows programmers to address memory from a logical point of view, without regard to the main memory, physically available.
A) Visual memory
B) Real memory
C) Virtual memory
D) Secondary memory


4. ............ is a large kernel, including scheduling file system, networking, device drivers, memory management and more.
A) Monolithic kernel
B) Micro kernel
C) Macro kernel
D) Mini kernel

5. A .................... architecture assigns only a few essential functions to the kernel,  including address spaces, Inter process communication(IPC) and basic scheduling.
A) Monolithic kernel
B) Micro kernel
C) Macro kernel
D) Mini kernel

6. State whether true or false.
 i) Multithreading is useful for application that perform a number of essentially independent tasks that do not be serialized.
ii) An example of multithreading is a database server that listens for and process numerous client request.
A) i-True, ii-False
B) i-True, ii-True
C) i-False, ii-True
D) i-False, ii-False

7. With ................ only one process can execute at a time; meanwhile all other process are waiting for the processer. With .............. more than one process can be running simultaneously each on a different processer.
A) Multiprocessing, Multiprogramming
B) Multiprogramming, Uniprocessing
C) Multiprogramming, Multiprocessing
D) Uniprogramming, Multiprocessing

8. The two central themes of modern operating system are ...............
A) Multiprogramming and Distributed processing
B) Multiprogramming and Central Processing
C) Single Programming and Distributed processing
D) None of above

9. ............... refers to the ability of multiple process (or threads) to share code, resources or data in such a way that only one process has access to shared object at a time.
A) Synchronization
B) Mutual Exclusion
C) Dead lock
D) Starvation

10. ................. is the ability of multiple process to co-ordinate their activities by exchange of information
A) Synchronization
B) Mutual Exclusion
C) Dead lock
D) Starvation

Answers:
1.       B) mid 1950's
2.       D) All of the above.
3.       C) Virtual memory
4.       A) Monolithic kernel
5.       B) Micro kernel
6.       B) i-True, ii-True
7.       C) Multi.......Multiprocessing
8.       A) Multiprogra ......processing
9.       B) Mutual Exclusion
10.   A) Synchronization

You may also wanted to view the following related posts