Showing posts with label long-term scheduling. Show all posts
Showing posts with label long-term scheduling. Show all posts

Wednesday, September 16, 2020

Operating System MCQ

 Q.1 The field that contains a segment index or an internal index is called

(A) target datum 

(B) target offset

(C) segment field 

(D) fix dat

Ans: (A)


Q.2 A program in execution is called

(A) process 

(B) function

(C) CPU 

(D) Memory

Ans: (A)


Q.3 Jobs which are admitted to the system for processing is called

(A) long-term scheduling 

(B) short-term scheduling

(C) medium-term scheduling 

(D) queuing

Ans: (A)


Q.4 A set of techniques that allow to execute a program which is not entirely in memory is called

(A) demand paging 

(B) virtual memory

(C) auxiliary memory 

(D) secondary memory

Ans: (B)


Q.5 SSTF stands for

(A) Shortest-Seek-time-first scheduling 

(B) small – small-time-first

(C) simple-seek-time-first 

(D) small-simple-time-first scheduling

Ans: (A)


Q.6 Before proceeding with its execution, each process must acquire all the resources it needs is called

(A) hold and wait 

(B) No pre-emption

(C) circular wait 

(D) starvation

Ans: (A)


Q.7 Virtual memory is

(A) simple to implement

(B) used in all major commercial operating systems

(C) less efficient in utilization of memory

(D) useful when fast I/O devices are not available

Ans: (B)


Q.8 Relocation bits used by relocating loader are specified by

(A) Relocating loader itself 

(B) Assembler or Translator

(C) Macro processor 

(D) Both (A) and (B)

Ans: (B)


Q.9 Resolution of externally defined symbols is performed by

(A) Linker 

(B) Loader

(C) Compiler 

(D) Editor

Ans: (A)


Q.10 Relocatable programs

(A) cannot be used with fixed partitions

(B) can be loaded almost anywhere in memory

(C) do not need a linker

(D) can be loaded only at one specific location

Ans: (B)


Q.11 Page stealing

(A) is a sign of efficient system

(B) is taking page frames other working sets

(C) should be the tuning goal

(D) is taking larger disk spaces for pages paged out

Ans: (B)


Q.12 The total time to prepare a disk drive mechanism for a block of data to be read from is its

(A) latency

(B) latency plus transmission time

(C) latency plus seek time

(D) latency plus seek time plus transmission time

Ans: (C)


Q.13 To avoid race condition, the maximum number of processes that may be

simultaneously inside the critical section is

(A) zero 

(B) one

(C) two 

(D) more than two

Ans: (B)


Q.14 The memory allocation scheme subject to “external” fragmentation is

(A) segmentation 

(B) swapping

(C) pure demand paging 

(D) multiple fixed contiguous partitions

Ans: (A)


Q.15 Page fault frequency in an operating system is reduced when the

(A) processes tend to the I/O-bound

(B) size of pages is reduced

(C) processes tend to be CPU-bound

(D) locality of reference is applicable to the process

Ans: (D)


Q.16 In which of the following page replacement policies Balady’s anomaly occurs?

(A) FIFO 

(B) LRU

(C) LFU 

(D) NRU

Ans: (A)


Q.17 Which of the following are language processors?

(A) Assembler 

(B) Compiler

(C) Interpreter 

(D) All of the above

Ans: (D)


Q.18 Virtual memory can be implemented with

(A) Segmentation 

(B) Paging

(C) None 

(D) all of the above

Ans: (D)


Q.19 Recognition of basic syntactic constructs through reductions, this task is performed by

(A) Lexical analysis 

(B) Syntax analysis

(C) Semantic analysis 

(D) Structure analysis

Ans: (B)


Q.20 A grammar for a programming language is a formal description of

(A) Syntax 

(B) Semantics

(C) Structure 

(D) Code

Ans: (C)


Q.21 ___________ is a technique of temporarily removing inactive programs from the memory of computer system

(A) Swapping 

(B) Spooling

(C) Semaphore 

(D) Scheduler

Ans: (A)


Q.22 ___________ is a technique of improving the priority of process waiting in Queue for CPU allocation

(A) Starvation 

(B) Aging

(C) Revocation 

(D) Relocation

Ans: (B)


Q.23 ________ is the time required by a sector to reach below read/write head.

(A) Seek Time 

(B) Latency Time

(C) Access time 

(D) None

Ans: (B)


Q.24 Which of the following is most general phase structured grammar?

(A) Context – Sensitive 

(B) Regular

(C) Context – Free 

(D) None of the above

Ans: (A)


Q.25 File record length

(A) Should always be fixed

(B) Should always be variable

(C) Depends upon the size of file

(D) Should be chosen to match the data characteristics.

Ans: (D)


Q.26 A public key encryption system

(A) Allows only the correct receiver to decode the data

(B) Allows only one to decode the transmission.

(C) Allows only the correct sender to decode the data.

(D) Does not encode the data before transmitting it.

Ans: (A)

Search Aptipedia