Operating System (OSY) MCQ 5i

Course:OperatingSystem Course Code: -22516
Semester:V
MCQ Question Bank
01. The part of machine level instruction, which tells the central processor what has to be done,is
A. Operation code
B. Address
C. Locator
D.Flip-Flop
02. Processis
A.program in High level language kept on disk
B. contents of main memory
C. a program in execution
D.a job in secondary memory
03. A user-interface that is easy to use is considered tobe
a. User-happy b.User-simple
c.User-friendly d. None of theabove
04. When a peripheral device needs immediate attention from the operating system, itgenerates(n)
a. Interrupt b. Spool
c.Stack d. Pagefile
05. System call routines of operating system are mostly writtenin
A.C B.C++ C.java D. both a andb

06. For web based computing system, computer used arenormally
A.personalcomputers B.servers C. networkcomputers D.tablets
07. A service not provided by operating systemis
A.networking B.userinterface C. programexecution D. errordetection
08 What is operating system?

a) collection of programs that manages hardwareresources
b) system service provider to the applicationprograms
c) link to interface the hardware and applicationprograms
d) all of thementioned
09. To access the services of operating system, the interface is provided bythe
a)Systemcalls b) API
c) Library d) Assemblyinstructions
10. Which one of the following is nottrue?

a) kernel is the program that constitutes the central core of the operatingsystem
b) kernel is the first part of operating system to load into memory duringbooting
c) kernel is made of various modules which can not be loaded in running operatingsystem
d) kernel remains in the memory during the entire computersession
11. If a process fails, most operating system write the error information toa
a) log file
b) another runningprocess
c) newfile
d) none of thementioned
12. What is the main function of the commandinterpreter?

a) to get and execute the next user-specifiedcommand
b) to provide the interface between the API and applicationprogram
c) to handle the files in operatingsystem
13. A Process Control Block(PCB) does not contain which of thefollowing?

a) Code
b) Stack
c) Bootstrapprogram
d) Data
14. The state of a process is definedby

a) the final activity of theprocess
b) the activity just executed by theprocess
c) the activity to next be executed by theprocess
d) the current activity of theprocess
15. The number of processes completed per unit time is knownas

a)Output b)Throughput
c)Efficiency d) Capacity
16. A single thread of control allows the process toperform

a) only one task at atime
b) multiple tasks at atime
c) only two tasks at atime
17. What is the objective ofmultiprogramming?

a) Have some process running at alltimes
b) Have multiple programs waiting in a queue ready torun
c) To minimize CPUutilization
d) None of thementioned
18. What is a Process ControlBlock?

a) Process typevariable
b) DataStructure
c) A secondary storagesection
d) A Block inmemory
19. What is Inter processcommunication?

a) allows processes to communicate and synchronize their actions when using the same addressspace
b) allows processes to communicate and synchronize their actions without using the same addressspace
c) allows the processes to only synchronize their actions withoutcommunication
20. Which of the following two operations are provided by the IPCfacility?
a) write & deletemessage
b) delete & receivemessage
c) send & deletemessage
d) receive & sendmessage
21. Messages sent by aprocess

a) have to be of a fixedsize
b) have to be a variablesize
c) can be fixed or variablesized
22. The link between two processes P and Q to send and receive messages iscalled
a) communicationlink
b) message-passinglink
c) synchronizationlink
23. Message passing system allows processesto

a) communicate with one another without resorting to shareddata
b) communicate with one another by resorting to shareddata
c) sharedata
d) name the recipient or sender of themessage
24. Which of the following do not belong to queues forprocesses?

a) JobQueue
b) PCBqueue
c) DeviceQueue
d) ReadyQueue
25. What is a long-termscheduler?

a) It selects which process has to be brought into the readyqueue
b) It selects which process has to be executed next and allocatesCPU
c) It selects which process to remove from memory byswapping
26. If all processes I/O bound, the ready queue will almostalwaysbe and the Short term Scheduler willhavea
todo.
a) full,little
b) full, lot
c) empty, little
d) empty,lot
27. What is a medium-termscheduler?

a) It selects which process has to be brought into the readyqueue
b) It selects which process has to be executed next and allocatesCPU
c) It selects which process to remove from memory byswapping
28. In a multiprogrammingenvironment
a) the processor executes more than one process at atime
b) the programs are developed by more than oneperson
c) more than one process resides in thememory
d) a single user can execute many programs at the sametime
29. The context of a process in the PCB of a process does notcontain

a) the value of the CPUregisters
b) the processstate
c) memory-managementinformation
d) context switchtime
30. Which of the following does not interrupt a runningprocess?

a) A device
b) Timer
c) Schedulerprocess
d) Powerfailure
31. The processes that are residing in main memory and are ready and waiting to execute are kept on a listcalled
a) jobqueue
b) readyqueue
c) executionqueue
d) process queue
32. The interval from the time of submission of a process to the time of completion is termedas
a) waitingtime
b) turnaroundtime
c) responsetime
d) throughput
33. Which scheduling algorithm allocates the CPU first to the process that requests the CPUfirst?
a) first-come, first-servedscheduling
b) shortest jobscheduling
c) priorityscheduling
34. Process are classified into different groupsin

a) shortest job schedulingalgorithm
b) round robin schedulingalgorithm
c) priority schedulingalgorithm
d) multilevel queue schedulingalgorithm
35. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared
with the priorityof
a) allprocess
b) currently runningprocess
c) parentprocess
d) initprocess
36. What are the two steps of a processexecution?

a) I/O & OSBurst
b) CPU & I/OBurst
c) Memory & I/OBurst
d) OS & MemoryBurst
37. An I/O bound program will typicallyhave

a) a few very short CPUbursts
b) many very short I/Obursts
c) many very short CPUbursts
d) a few very short I/Obursts
38. In the following cases non – preemptive schedulingoccurs?

a) When a process switches from the running state to the readystate
b) When a process goes from the running state to the waitingstate
c) When a process switches from the waiting state to the readystate
d) All of thementioned
39. Scheduling is done so asto

a) increase CPUutilization
b) decrease CPUutilization
c) keep the CPU moreidle
40 Consider the following set of processes, the length of the CPU burst time given in milliseconds.
Process Burst time

P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm.
a) The waiting time for process P1 is3ms
b) The waiting time for process P1 is0ms
c) The waiting time for process P1 is16ms
d) The waiting time for process P1 is9ms
41. Which of the following scheduling algorithms gives minimum average waitingtime?
a) FCFS
b) SJF
c) Round – robin
d) Priority
42. What is a reusableresource?

a) that can be used by one process at a time and is not depleted by thatuse
b) that can be used by more than one process at atime
c) that can be shared between variousthreads
43. The circular wait condition can be preventedby
a) defining a linear ordering of resourcetypes
b) usingthread
c) usingpipes
44. Which one of the following is the deadlock avoidancealgorithm?

a) banker’salgorithm
b) round-robinalgorithm
c) elevatoralgorithm
d) karn’salgorithm
45. Which of the following condition is required for a deadlock to bepossible?

a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of otherresources
c) no resource can be forcibly removed from a process holdingit
d) all of the mentioned
46. For Mutual exclusion to prevail in thesystem

a) at least one resource must be held in a non sharablemode
b) the processor must be a uniprocessor rather than amultiprocessor
c) there must be at least one resource in a sharablemode
47. Which one of the following is the address generated byCPU?

a) physicaladdress
b) absoluteaddress
c) logicaladdress
48. Memory management technique in which system stores and retrieves data from secondary storage
for use in main memory iscalled?
a) fragmentation
b) paging
c) mapping
49. The page tablecontains

a) base address of each page in physical memory
b) pageoffset
c) pagesize
50. Operating System maintains the page tablefor

a) eachprocess
b) eachthread
c) eachinstruction
d) eachaddress
51. is a unique tag, usually a number identifies the file within the filesystem.
a) Fileidentifier
b) Filename
c) Filetype
52. File type can be representedby

a) filename
b) fileextension
c) fileidentifier
53. Which one of the following explains the sequential file accessmethod?
a) random access according to the given bytenumber
b) read bytes one at a time, inorder
c) read/write sequentially byrecord
d) read/write randomly byrecord
54. When in contiguous allocation the space cannot be extendedeasily?

a) the contents of the file have to be copied to a new space, a largerhole
b) the file getsdestroyed
c) the file will get formatted and lost all itsdata
55. What is the major disadvantage with a linked allocation?

a) internalfragmentation
b) externalfragmentation
c) there is no sequential access
d) there is only sequentialaccess
56. Contiguous allocation hastwoproblems and that linked allocationsolves.

a) external – fragmentation & size –declaration
b) internal – fragmentation & external –fragmentation
c) size – declaration & internal –fragmentation
d) memory – allocation & size –declaration
57. Indexedallocation direct access.

a) supports
b) does notsupport
c) is not relatedto
58. Each has its own indexblock.

a) partition
b) address
c) file
59. Because of virtual memory, the memory can be sharedamong

a) processes
b) threads
c) instructions
60. In FIFO page replacement algorithm, when a page must bereplaced

a) oldest page ischosen
b) newest page ischosen
c) random page ischosen
All The Best

Operating System (OSY) MCQ 5i

Uploaded by

Copyright:

Available Formats

Operating System (OSY) MCQ 5i

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Operating System (OSY) MCQ 5i

Uploaded by

Copyright:

Available Formats

Course:OperatingSystem Course Code: -22516

03. A user-interface that is easy to use is considered tobe

05. System call routines of operating system are mostly writtenin

A.C B.C++ C.java D. both a andb

A.personalcomputers B.servers C. networkcomputers D.tablets

07. A service not provided by operating systemis

A.networking B.userinterface C. programexecution D. errordetection

08 What is operating system?

10. Which one of the following is nottrue?

12. What is the main function of the commandinterpreter?

13. A Process Control Block(PCB) does not contain which of thefollowing?

14. The state of a process is definedby

15. The number of processes completed per unit time is knownas

16. A single thread of control allows the process toperform

17. What is the objective ofmultiprogramming?

18. What is a Process ControlBlock?

19. What is Inter processcommunication?

21. Messages sent by aprocess

23. Message passing system allows processesto

24. Which of the following do not belong to queues forprocesses?

25. What is a long-termscheduler?

27. What is a medium-termscheduler?

29. The context of a process in the PCB of a process does notcontain

30. Which of the following does not interrupt a runningprocess?

34. Process are classified into different groupsin

36. What are the two steps of a processexecution?

37. An I/O bound program will typicallyhave

38. In the following cases non – preemptive schedulingoccurs?

39. Scheduling is done so asto

Process Burst time

42. What is a reusableresource?

44. Which one of the following is the deadlock avoidancealgorithm?

45. Which of the following condition is required for a deadlock to bepossible?

46. For Mutual exclusion to prevail in thesystem

47. Which one of the following is the address generated byCPU?

49. The page tablecontains

50. Operating System maintains the page tablefor

52. File type can be representedby

54. When in contiguous allocation the space cannot be extendedeasily?

55. What is the major disadvantage with a linked allocation?

56. Contiguous allocation hastwoproblems and that linked allocationsolves.

57. Indexedallocation direct access.

58. Each has its own indexblock.

59. Because of virtual memory, the memory can be sharedamong

60. In FIFO page replacement algorithm, when a page must bereplaced

You might also like