JAYAWANT SHIKSHAN PRASARAK MANDAL’s

Bhivrabai Sawant Polytechnic

(Approved by AICTE, New Delhi, Govt. of Maharashtra, Affiliated to MSBTE
Mumbai)
Gat No. 720 (1&2), Wagholi, Pune-Nagar Road, Pune-412207)
Phone: 020 – 65335100 Tele fax: - + 91-020-65335100
E-mail: [email protected] Website: www.jspm.edu.in

Academic Year 2019-20

Course: Operating System 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. Process is
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 to be

a. User-happy b. User-simple
c. User-friendly d. None of the above

04.When a peripheral device needs immediate attention from the operating system, it generates(n)

a. Interrupt b. Spool
c. Stack d. Page file

05. System call routines of operating system are mostly written in

A.C B.C++ C.java D. both a and b

06. For web based computing system, computer used are normally

A. personal computers B. servers C. network computers D. tablets

07. A service not provided by operating system is

A. networking B. user interface C. program execution D. error detection

08 What is operating system?

a) collection of programs that manages hardware resources
b) system service provider to the application programs
c) link to interface the hardware and application programs
d) all of the mentioned

09. To access the services of operating system, the interface is provided by the ___________
a) System calls b) API
c) Library d) Assembly instructions

10. Which one of the following is not true?

a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
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 computer session

11. If a process fails, most operating system write the error information to a ______
a) log file
b) another running process
c) new file
d) none of the mentioned

12. 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 API and application program
c) to handle the files in operating system
d) none of the mentioned

13. A Process Control Block(PCB) does not contain which of the following?
a) Code
b) Stack
c) Bootstrap program
d) Data

14. The state of a process is defined by __________

a) the final activity of the process
b) the activity just executed by the process
c) the activity to next be executed by the process
d) the current activity of the process

15. The number of processes completed per unit time is known as __________
a) Output b) Throughput
c) Efficiency d) Capacity

16. A single thread of control allows the process to perform __________

a) only one task at a time
b) multiple tasks at a time
c) only two tasks at a time
d) all of the mentioned

17. What is the objective of multiprogramming?

a) Have some process running at all times
b) Have multiple programs waiting in a queue ready to run
c) To minimize CPU utilization
d) None of the mentioned

18. What is a Process Control Block?

a) Process type variable
b) Data Structure
c) A secondary storage section
d) A Block in memory

19. What is Inter process communication?

a) allows processes to communicate and synchronize their actions when using the same address space
b) allows processes to communicate and synchronize their actions without using the same address space
c) allows the processes to only synchronize their actions without communication
d) none of the mentioned
20. Which of the following two operations are provided by the IPC facility?
a) write & delete message
b) delete & receive message
c) send & delete message
d) receive & send message

21. Messages sent by a process __________

a) have to be of a fixed size
b) have to be a variable size
c) can be fixed or variable sized
d) None of the mentioned

22. The link between two processes P and Q to send and receive messages is called __________
a) communication link
b) message-passing link
c) synchronization link
d) all of the mentioned

23. Message passing system allows processes to __________

a) communicate with one another without resorting to shared data
b) communicate with one another by resorting to shared data
c) share data
d) name the recipient or sender of the message

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

a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue

25. What is a long-term scheduler?

a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned

26. If all processes I/O bound, the ready queue will almost always be ______ and the Short term Scheduler will have a ______
to do.
a) full, little
b) full, lot
c) empty, little
d) empty, lot

27. What is a medium-term scheduler?

a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned

28. In a multiprogramming 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

29. The context of a process in the PCB of a process does not contain __________
a) the value of the CPU registers
b) the process state
c) memory-management information
d) context switch time

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

a) A device
b) Timer
c) Scheduler process
d) Power failure

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

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

33. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned

34. Process are classified into different groups in ____________

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

35. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared
with the priority of ____________
a) all process
b) currently running process
c) parent process
d) init process

36. What are the two steps of a process execution?

a) I/O & OS Burst
b) CPU & I/O Burst
c) Memory & I/O Burst
d) OS & Memory Burst

37. An I/O bound program will typically have ____________

a) a few very short CPU bursts
b) many very short I/O bursts
c) many very short CPU bursts
d) a few very short I/O bursts

38. In the following cases non – preemptive scheduling occurs?

a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state
c) When a process switches from the waiting state to the ready state
d) All of the mentioned

39. Scheduling is done so as to ____________

a) increase CPU utilization
b) decrease CPU utilization
c) keep the CPU more idle
d) none of the mentioned

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 is 3ms
b) The waiting time for process P1 is 0ms
c) The waiting time for process P1 is 16ms
d) The waiting time for process P1 is 9ms

41. Which of the following scheduling algorithms gives minimum average waiting time?
a) FCFS
b) SJF
c) Round – robin
d) Priority

42. What is a reusable resource?

a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned
43. The circular wait condition can be prevented by ____________
a) defining a linear ordering of resource types
b) using thread
c) using pipes
d) all of the mentioned

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

a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm

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

a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned

46. For Mutual exclusion to prevail in the system ____________

a) at least one resource must be held in a non sharable mode
b) the processor must be a uniprocessor rather than a multiprocessor
c) there must be at least one resource in a sharable mode
d) all of the mentioned

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

a) physical address
b) absolute address
c) logical address
d) none of the mentioned

48. Memory management technique in which system stores and retrieves data from secondary storage
for use in main memory is called?
a) fragmentation
b) paging
c) mapping
d) none of the mentioned

49. The page table contains ____________

a) base address of each page in physical memory
b) page offset
c) page size
d) none of the mentioned

50. Operating System maintains the page table for ____________

a) each process
b) each thread
c) each instruction
d) each address

51. ______ is a unique tag, usually a number identifies the file within the file system.
a) File identifier
b) File name
c) File type
d) None of the mentioned

52. File type can be represented by ____________

a) file name
b) file extension
c) file identifier
d) none of the mentioned

53. Which one of the following explains the sequential file access method?
a) random access according to the given byte number
b) read bytes one at a time, in order
c) read/write sequentially by record
d) read/write randomly by record

54. When in contiguous allocation the space cannot be extended easily?

a) the contents of the file have to be copied to a new space, a larger hole
b) the file gets destroyed
c) the file will get formatted and lost all its data
d) none of the mentioned

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

a) internal fragmentation
b) external fragmentation
c) there is no sequential access
d) there is only sequential access

56. Contiguous allocation has two problems _________ and _________ that linked allocation solves.
a) external – fragmentation & size – declaration
b) internal – fragmentation & external – fragmentation
c) size – declaration & internal – fragmentation
d) memory – allocation & size – declaration

57. Indexed allocation _________ direct access.

a) supports
b) does not support
c) is not related to
d) none of the mentioned

58. Each _______ has its own index block.

a) partition
b) address
c) file
d) all of the mentioned

59. Because of virtual memory, the memory can be shared among ____________
a) processes
b) threads
c) instructions
d) none of the mentioned

60. In FIFO page replacement algorithm, when a page must be replaced ____________
a) oldest page is chosen
b) newest page is chosen
c) random page is chosen
d) none of the mentioned