22516 Operating Systems MCQs for Computer Engineering MSBTE Exam MCQs

22516 Operating Systems MCQs for Computer Engineering PDF
Welcome Diploma and degree students to mypractically. Get Operating Systems MCQs For Computer Engineering Students PDF.

This important and major post is helpful and beneficial for MSBTE Computer Engineering Diploma and Degree Students.

In this article you will get MSBTE Computer Engineering 22516 Operating Systems MCQs Pdf.

By getting this Operating Systems Mcqs, you will easily get more marks for MSBTE Exams.

In this post we have added MSBTE unit wise and chapter wise Operating Systems MCQs for Computer Engineering MCQs Pdf, so if you like it make sure you will share with your MSBTE diploma & degree Students

Question Bank for Multiple Choice Questions
Program: Diploma in Computer engineering Program Code:- CO
Scheme:-I Semester:- 5
Course:- OS Course Code:- 22516
Unit - I Overview of Operating System Marks:-08
1.1 Operating System - Concept, Components of operating system, operations of OS: Program Management,
Resource management, Security and protection, Views of OS: User view, System View
1.2 Different Types of Operating systems, Batch operating system, Multi Programmed, Time Shared OS, Multiprocessor Systems, Distributed System, Real time systems. Mobile OS (Android, iOS).
1.3 Command line based OS – DOS, UNIX GUI based OS -WINDOWS, LINUX.
Unit— II Services and Components of Operating System Marks:- 10
2.1 Different Services of Operating System. 2.2 System Calls- Concept, types of system calls
2.3 OS Components: - Process Management, Main Memory Management, File Management, I/O System management, Secondary management.
2.4 Use of operating system to user management, security device management, performance monitor, task scheduler
Unit- III Process Management Marks:- 14
3.1 Process-: process states, Process Control Block (PCB).
3.2 Process Scheduling- Scheduling Queues, Schedulers, Context switch.
3.3 Inter-process communication (IPC): Introduction, shared memory system and message passing system.
3.4 Threads - Benefits, users and kernel threads, Multithreading Models - Many to One, One to One, Many to Many.
3.5 Execute process commands- like ps, wait, sleep, exit, kill
Unit-IV CPU Scheduling and Algorithms Marks:- 14
4.1 Scheduling types scheduling Objectives, CPU and I/O burst cycles, Pre-emptive, Non- Pre-emptive
Scheduling, Scheduling criteria.
4.2 Types of Scheduling algorithms - First come first served (FCFS), Shortest Job First (SJF), Shortest
Remaining Time(SRTN), Round Robin (RR) Priority scheduling, multilevel queue scheduling.
4.3 Deadlock - System Models, Necessary Conditions leading to Deadlocks, Deadlock Handling -
Preventions, avoidance.
Unit -V Memory Management Marks:- 14
5.1 Basic Memory Management -Partitioning, Fixed and Variable, Free Space management Techniques - Bitmap, Linked List.
5.2 Virtual Memory - Introduction to Paging, Segmentation, Fragmentation, and Page fault.
5.3 Page Replacement Algorithms: FIFO, LRU, Optimal.
Unit-VI File Management Marks:- 10
6.1 File - Concepts, Attributes, Operations, types and File System Structure.
6.2 Access Methods - Sequential, Direct, Swapping, File Allocation Methods-Contiguous, Linked, Indexed.
6.3 Directory structure-- Single level, two levels, tree-structured directory, Disk Organization and disk
Structure-Physical structure, Logical structure, Raid structure of disk, raid level 0 to 6.


1. Which of the following is not an operating system?
a. Windows
b. Linux
c. Oracle
d. DOS
Answer: c

2. When was the first operating system developed?
a. 1948
b. 1949
c. 1950
d. 1951
Answer: c

3. What else is a command interpreter called?
a. prompt
b. kernel
c. shell
d. command
Answer: c

4. Which is the Linux operating system?
a. Private operating system
b. Windows operating system
c. Open-source operating system
d. None of these
Answer : c

5. What is an operating system?
a) interface between the hardware and application programs
b) collection of programs that manages hardware resources
c) system service provider to the application programs
d) all of the mentioned
Answer: d

6. What is the main function of the command interpreter?
a) to provide the interface between the API and application program
b) to handle the files in the operating system
c) to get and execute the next user-specified command
d) none of the mentioned
Answer: c

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

8. In operating system, each process has its own
a) open files
b) pending alarms, signals, and signal handlers
c) address space and global variables
d) all of the mentioned
Answer: d

9. The operating system is responsible for?
a) bad-block recovery
b) booting from disk
c) disk initialization
d) all of the mentioned
Answer: d

10. Hard real time operating system has jitter than a soft real time operating
system.
a) equal
b) more
c) less
d) none of the mentioned
Answer: c

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
Answer: A

12. In operating system, each process has its own
a) address space and global variables
b) open files
c) pending alarms, signals and signal handlers
d) all of the mentioned
Answer: D

13. In operating system, each process has its own
a) address space and global variables
b) open files
c) pending alarms, signals and signal handlers
d) all of the mentioned
Answer: D

14. What is the degree of multiprogramming?
a) the number of processes executed per unit time
b) the number of processes in the ready queue
c) the number of processes in the I/O queue
d) the number of processes in memory
Answer: D

15. 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
a) Blocked state
b) Ready state
c) Suspended state
d) Terminated state
Answer: B

16. The only state transition that is initiated by the user process itself is
a) block
b) wakeup
c) dispatch
d) none of the mentioned
Answer: A

17. In the sequential access method, information in the file is processed
a) one disk after the other, record access doesnt matter
b) one record after the other
c) one text document after the other
d) none of the mentioned
Answer: B

18. File type can be represented by
a) file name
b) file extension
c) file identifier
d) none of the mentioned
Answer: B

19. In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned
Answer: D

20. 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
Answer- c

21. Which of the following is not an operating system?
a.Windows
b.Linux
c.Oracle
d.DOS
Answer: c

22. The layer between the hardware and the user program is
A. Operating environment
B. System environment
C. Operating system
D. None
E. All of the above
Answer – C

23. 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
Answer -a

24. The layer between the hardware and the user program is
A. Operating environment
B. System environment
C. Operating system
D. None
E. All of the above
Answer – c

25. Memory protection is normally done by
a) the processor and the associated hardware
b) the operating system
c) the compiler
d) the user program
Answer: a

26. Which is single user operating system
a)MS-DOS
b)UNIX
c)XENIX
d)LINUX
Answer: a

27. 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
Answer -A

28. Main function of shared memory is:
a) to use primary memory efficiently
b) to do intra process communication
c) to do inter process communication
d) none of above
Answer: c

29. Size of virtual memory depends on
a) size of data bus
b) size of address bus
c) size of main memory
d) none of above
Answer: b

30. What is a Process Control Block?
a) Process type variable
b) Data Structure
c) A secondary storage section
d) A Block in memory
Answer: B

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

32. Which one of the following errors will be handle by the operating system?
a) lack of paper in printer
b) connection failure in the network
c) power failure
d) all of the mentioned
Answer: D

33. In operating system, each process has its own
a) open files
b) pending alarms, signals, and signal handlers
c) address space and global variables
d) all of the mentioned
Answer: D

34. In distributed system, each processor has its own
a) local memory
b) clock
c) both local memory and clock
d) none of the mentioned
Answer: c

35. The operating system is responsible for?
a) bad-block recovery
b) booting from disk
c) disk initialization
d) all of the mentioned
Answer: D

36. Hard real time operating system has jitter than a soft real time operating
system.
a) equal
b) more
c) less
d) none of the mentioned
Answer: C

37. For real time operating systems, interrupt latency should be
a) zero
b) minimal
c) maximum
d) dependent on the scheduling
Answer: B

38. Network operating system runs on
a) every system in the network
b) server
c) both server and every system in the network
d) none of the mentioned
Answer: B

39. What are the types of distributed operating systems?
a) Zone based Operating system
b) Level based Operating system
c) Network Operating system
d) All of the mentioned
Answer: C

40. What is Microsoft window?
1. Operating system
2. Graphics program
3. Processing
4. Database program
Answer: A
41. What are the services operating systems provides to both the users and to the programs?
A. File System manipulation
B. Error Detection
C. Program execution
D. Resource Allocation
Answer : C

42. Which of the following few common services provided by an operating system?
A. Protection
B. Program execution
C. I/O operations
D. All of the above
Answer: d

43. The systems which allow only one process execution at a time, are called
a) uniprogramming systems
b) uniprocessing systems
c) unitasking systems
d) none of the mentioned
Answer: b

44. In operating system, each process has its own
a) address space and global variables
b) open files
c) pending alarms, signals and signal handlers
d) all of the mentioned
Answer: d

45. What are the services operating systems provides to both the users and to the programs?
A. File System manipulation
B. Error Detection
C. Program execution
D. Resource Allocation
Answer : C

46. Which of the following few common services provided by an operating system?
A. Protection
B. Program execution
C. I/O operations
D. All of the above
Ans : D

47. Which of the following is false about File system manipulation?
A. Computers can store files on the disk (Primary storage), for long-term storage purpose
B. Program needs to read a file or write a file.
C. Operating System provides an interface to the user to create/delete files.
D. Operating System provides an interface to create the backup of file system.
Ans : A

48. The OS ensures that all access to system resources is controlled.The major activities of an
operating system with respect to?
A. Error handling
B. Resource Management
C. Protection
D. Communication
Ans : C

49. Two processes often require data to be transferred between them. The major activities of an
operating system with respect to?
A. Error handling
B. Resource Management
C. Protection
D. Communication
Ans : D

50. What is true about OS?
A. An operating system (OS) is a collection of software.
B. The operating system is a vital component of the system software in a computer system.
C. An Operating System (OS) is an interface between a computer user and computer hardware.
D. All of the above
Answer : D

51. Which of the following is not an important functions of an operating System?
A. Memory Management
B. File Management
C. Virus Protection
D. Processor Management
Answer : C

52. In OS, Memory management refers to management of?
A. Primary Memory
B. Main Memory
C. Secondary Memory
D. Both A and B
Ans : D

53. In multiprogramming environment, the OS decides which process gets the processor when and
for how much time. This function is called .
A. process scheduling
B. process rescheduling
C. traffic controller
D. Processor Management
Ans : A

54. Keeps tracks of processor and status of process. The program responsible for this task is
known as?
A. track manager
B. processor controller
C. traffic manager
D. traffic controller
Ans : D

55. What does I/O controller do?
A. Keeps tracks of primary memory
B. Keeps tracks of all devices
C. Keeps tracks of processes
D. All of the above
Ans : B

56. What does file system do?
A. Keeps track of information
B. Keeps track of location
C. Keeps track of information status
D. All of the above
Ans : D

57. Which of the following is true about Process?
A. A process is basically a program in execution
B. The execution of a process must progress in a sequential fashion.
C. A process is defined as an entity which represents the basic unit of work to be implemented in the
system.
D. All of the above
Ans : D

58.A memory buffer used to accommodate a speed differential is called
a) stack pointer
b) cache
c) accumulator
d) disk buffer
Answer: b

59. CPU fetches the instruction from memory according to the value of
a) program counter
b) status register
c) instruction register
d) program status word
Answer: a

60. Run time mapping from virtual to physical address is done by
a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned
Answer: a

61. The address of a page table in memory is pointed by
a) stack pointer
b) page table base register
c) page register
d) program counter
Answer: b

62. Operating System maintains the page table for
a) each process
b) each thread
c) each instruction
d) each address
Answer: a


63. In contiguous memory allocation
a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
Answer: a

64. The operating system and the other processes are protected from being modified by an already
running process because
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the relocation and limit registers
Answer: d

65. Transient operating system code is code that
a) is not easily accessible
b) comes and goes as needed
c) stays in the memory always
d) never enters the memory space
Answer: b

66. When memory is divided into several fixed sized partitions, each partition may contain
a) exactly one process
b) at least one process
c) multiple processes at once
d) none of the mentioned
Answer: a

67. In fixed size partition, the degree of multiprogramming is bounded by
a) the number of partitions
b) the CPU utilization
c) the memory size
d) all of the mentioned
Answer: a

68. BIOS is used?
a. By operating system
b. By compiler
c. By interpreter
d. By application software
Answer: a

69. Which one of the following is not a secondary storage?
a) Magnetic disks
b) Magnetic tapes
c) RAM
d) None of the mentioned
Answer: c


70. Which private network uses storage protocol rather than networking protocol?
a) storage area network
b) local area network
c) wide area network
d) none of the mentioned
Answer: a

71. Which algorithm of disk scheduling selects the request with the least seek time from the current
head positions?
a) SSTF scheduling
b) FCFS scheduling
c) SCAN scheduling
d) LOOK scheduling
Answer: a

72. The operating system is responsible for?
a) disk initialization
b) booting from disk
c) bad-block recovery
d) all of the mentioned
Answer: d

73.A swap space can reside in
a) Separate disk partition
b) RAM
c) Cache
d) None of the mentioned
Answer: a

74. RAID level 1 refers to
a) disk arrays with striping
b) disk mirroring
c) both disk arrays with striping and disk mirroring
d) none of the mentioned
Answer: b

75. Which of the following are forms of malicious attack?
a) Theft of information
b) Modification of data
c) Wiping of information
d) All of the mentioned
Answer: d

76. What are the common security threats?
a) File Shredding
b) File sharing and permission
c) File corrupting
d) File integrity
Answer: b

77. Why is one time password safe?
a) It is easy to generated
b) It cannot be shared
c) It is different for every access
d) It is a complex encrypted password
Answer: c

78. 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
Answer: a

79. By using the specific system call, we can
a) open the file
b) read the file
c) write into the file
d) all of the mentioned
Answer: d

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

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

82. 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
Answer: d

83. What is a Process Control Block?
a) Process type variable
b) Data Structure
c) A secondary storage section
d) A Block in memory
Answer: b


84. The entry of all the PCBs of the current processes is in
a) Process Register
b) Program Counter
c) Process Table
d) Process Unit
Answer: c

85. Which of the following do not belong to queues for processes?
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: b

86. When the process issues an I/O request
a) It is placed in an I/O queue
b) It is placed in a waiting queue
c) It is placed in the ready queue
d) It is placed in the Job queue
Answer: a

87. What will happen when a process terminates?
a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
Answer: a

88. What is a long-term scheduler?
a) It selects processes which have to be brought into the ready queue
b) It selects processes which have to be executed next and allocates CPU
c) It selects processes which heave to remove from memory by swapping
d) None of the mentioned
Answer: a

89. 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
Answer: c

90. What is a short-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
Answer: b

91. What will happen when a process terminates?
a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
Answer: a

92. 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
Answer: c

93. 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
Answer: d

94. Which of the following is not the state of a process?
a) New
b) Old
c) Waiting
d) Running
Answer: b

95. The entry of all the PCBs of the current processes is in
a) Process Register
b) Program Counter
c) Process Table
d) Process Unit
Answer: c

96. If a process is executeing in its critical section, then no other processes can be executing in their
critical section. What is this condition called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
Answer: a

97.A process can be terminated due to
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
Answer: d

98. Which of the following do not belong to queues for processes?
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: b

99. 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
Answer: c

100. What will happen when a process terminates?
a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
Answer: a

101. Cascading termination refers to the termination of all child processes if the parent process
terminates
a) Normally or abnormally
b) Abnormally
c) Normally
d) None of the mentioned
Answer: a

102. When a process is in a ―Blocked‖ state waiting for some I/O service. When the service is
completed, it goes to the
a) Terminated state
b) Suspended state
c) Running state
d) Ready state
Answer: d

103. Transient operating system code is a code that
a) stays in the memory always
b) never enters the memory space
c) comes and goes as needed
d) is not easily accessible
Answer: c

104. The portion of the process scheduler in an operating system that dispatches processes is
concerned with
a) assigning ready processes to waiting queue
b) assigning running processes to blocked queue
c) assigning ready processes to CPU
d) all of the mentioned
Answer: c

105. The FCFS algorithm is particularly troublesome for
a) operating systems
b) multiprocessor systems
c) time sharing systems
d) multiprogramming systems
Answer: d

106. For an effective operating system, when to check for deadlock?
a) every time a resource request is made at fixed time intervals
b) at fixed time intervals
c) every time a resource request is made
d) none of the mentioned
Answer: a

107. A deadlock avoidance algorithm dynamically examines the to ensure that a
circular wait condition can never exist.
a) operating system
b) resources
c) system storage state
d) resource allocation state
Answer: d

108. Swapping be done when a process has pending I/O, or has to execute I/O operations
only into operating system buffers.
a) must never
b) maybe
c) can
d) must
Answer: A

109. The main memory accommodates
a) cpu
b) user processes
c) operating system
d) all of the mentioned
Answer: c

110. The operating system is responsible for?
a) bad-block recovery
b) booting from disk
c) disk initialization
d) all of the mentioned
Answer: d

111. The operating system and the other processes are protected from being modified by an
already running process because
a) every address generated by the CPU is being checked against the relocation and limit registers
b) they have a protection algorithm
c) they are in different memory spaces
d) they are in different logical addresses
Answer: a

112. Using transient code, the size of the operating system during program execution.
a) maintains
b) changes
c) increases
d) decreases
Answer: b

113. The operating system maintains a table that keeps track of how many frames have
been allocated, how many are there, and how many are available.
a) memory
b) mapping
c) page
d) frame
Answer: d

114. To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine
is not loaded until it is called. For implementing dynamic loading
a) special support from operating system is essential
b) special support from hardware is required
c) user programs can implement dynamic loading without any special support from hardware or operating system
d) special support from both hardware and operating system is essential
Answer: c

115. The presents a uniform device-access interface to the I/O subsystem, much as
system calls provide a standard interface between the application and the operating system.
a) Device drivers
b) I/O systems
c) Devices
d) Buses
Answer: a

116. In real time operating system
a) process scheduling can be done only once
b) all processes have the same priority
c) kernel is not required
d) a task must be serviced by its deadline period
Answer: d

117. The operating system keeps a small table containing information about all open files called
a) file table
b) directory table
c) open-file table
d) system table
Answer: c
118. What will happen in the single level directory?
a) All files are contained in the same directory
b) All files are contained in different directories all at the same level
c) Depends on the operating system
d) None of the mentioned
Answer: a

119. The operating system the links when traversing directory trees, to preserve the acyclic
structure of the system.
a) deletes
b) considers
c) ignores
d) none of the mentioned
Answer: c

120. To recover from failures in the network operations information may be
maintained.
a) operating system
b) ip address
c) stateless
d) state
Answer: d

121. On systems where there are multiple operating system, the decision to load a particular one is
done by
a) process control block
b) file control block
c) boot loader
d) bootstrap
Answer: c

122. Whenever a process needs I/O to or from a disk it issues a
a) system call to the operating system
b) a special procedure
c) system call to the CPU
d) all of the mentioned
Answer: a

123. The two steps the operating system takes to use a disk to hold its files are and
a) caching & logical formatting
b) logical formatting & swap space creation
c) swap space creation & caching
d) partitioning & logical formatting
Answer: d

124. The program initializes all aspects of the system, from CPU registers to device
controllers and the contents of main memory, and then starts the operating system.
a) bootstrap
b) main
c) bootloader
d) rom
Answer: a

125. In SCSI disks used in high end PCs, the controller maintains a list of on the disk.
The disk is initialized during formatting which sets aside spare sectors not visible to the
operating system.
a) destroyed blocks, partitioning
b) bad blocks, low level formatting
c) destroyed blocks, high level formatting
d) bad blocks, partitioning
Answer: b

126. Which principle states that programs, users, and even the systems be given just enough
privileges to perform their task?
a) principle of least privilege
b) principle of process scheduling
c) principle of operating system
d) none of the mentioned
Answer: a

127. Network operating system runs on
a) every system in the network
b) server
c) both server and every system in the network
d) none of the mentioned
Answer: b

128. What are the types of distributed operating systems?
a) Zone based Operating system
b) Level based Operating system
c) Network Operating system
d) All of the mentioned
Answer: c

129. 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
Answer: c

130. 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
Answer: c

131. The primary distinction between the short term scheduler and the long term scheduler is
a) The length of their queues
b) The type of processes they schedule
c) The frequency of their execution
d) None of the mentioned
Answer: c

132. The only state transition that is initiated by the user process itself is
a) block
b) wakeup
c) dispatch
d) none of the mentioned
Answer: a

133. Which of the following system calls does not return control to the calling point, on
termination?
a) fork
b) exec
c) ioctl
d) longjmp
Answer: b

134. The following program results in the creation of?
main()
{
if(fork()>0)
sleep(100);
}
a) an orphan process
b) a zombie process
c) a process that executes forever
d) none of the mentioned
Answer: b

135. Which of the following system calls transforms executable binary file into a process?
a) fork
b) exec
c) ioctl
d) longjmp
Answer: b

136. Which of the following calls never returns an error?
a) getpid
b) fork
c) ioctl
d) open
Answer: a

137. A fork system call will fail if
a) the previously executed statement is also a fork call
b) the limit on the maximum number of processes in the system would be executed
c) the limit on the minimum number of processes that can be under execution by a single user would be executed
d) all of the mentioned
Answer: b

138. If a thread invokes the exec system call
a) only the exec executes as a separate process
b) the program specified in the parameter to exec will replace the entire process
c) the exec is ignored as it is invoked by a thread
d) none of the mentioned
Answer: b

139. If exec is called immediately after forking
a) the program specified in the parameter to exec will replace the entire process
b) all the threads will be duplicated
c) all the threads may be duplicated
d) none of the mentioned
Answer: a

140. If a process does not call exec after forking
a) the program specified in the parameter to exec will replace the entire process
b) all the threads should be duplicated
c) all the threads should not be duplicated
d) none of the mentioned
Answer: b

141. CPU scheduling is the basis of
a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
d) none of the mentioned
Answer: b

142. With multiprogramming is used productively.
a) time
b) space
c) money
d) all of the mentioned
Answer: a

143. 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
Answer: b

144. The model in which one kernel thread is mapped to many user-level threads is called
a) Many to One model
b) One to Many model
c) Many to Many model
d) One to One model
Answer: a

145. The model in which one user-level thread is mapped to many kernel level threads is called
a) Many to One model
b) One to Many model
c) Many to Many model
d) One to One model
Answer: b

146. the entire process will be blocked
b) a part of the process will stay blocked, with the rest running
c) the entire process will run
d) none of the mentioned
Answer: a

147. In the Many to One model, multiple threads are unable to run in parallel on multiprocessors
because of
a) only one thread can access the kernel at a time
b) many user threads have access to just one kernel thread
c) there is only one kernel thread
d) none of the mentioned
Answer: a

148. The One to One model allows
a) increased concurrency
b) decreased concurrency
c) increased or decreased concurrency
d) concurrency equivalent to other models
Answer: a

149. n the One to One model when a thread makes a blocking system call
a) other threads are strictly prohibited from running
b) other threads are allowed to run
c) other threads only from other processes are allowed to run
d) none of the mentioned
Answer: b

150. Which of the following is the drawback of the One to One Model?
a) increased concurrency provided by this model
b) decreased concurrency provided by this model
c) creating so many threads at once can crash the system
d) creating a user thread requires creating the corresponding kernel thread
Answer: d

151. When is the Many to One model at an advantage?
a) When the program does not need multithreading
b) When the program has to be multi-threaded
c) When there is a single processor
d) None of the mentioned
Answer: a

152. In the Many to Many model true concurrency cannot be gained because
a) the kernel can schedule only one thread at a time
b) there are too many threads to handle
c) it is hard to map threads with each other
d) none of the mentioned
Answer: a

153. In the Many to Many models when a thread performs a blocking system call
a) other threads are strictly prohibited from running
b) other threads are allowed to run
c) other threads only from other processes are allowed to run
d) none of the mentioned
Answer: b

154. The initial program that is run when the computer is powered up is called
a) boot program
b) bootloader
c) initializer
d) bootstrap program
Answer: d

155. How does the software trigger an interrupt?
a) Sending signals to CPU through bus
b) Executing a special operation called system call
c) Executing a special program called system program
d) Executing a spec

156. What is a trap/exception?
a) hardware generated interrupt caused by an error
b) software generated interrupt caused by an error
c) user generated interrupt caused by an error
d) none of the mentioned
Answer: b

157. What is an ISR?
a) Information Service Request
b) Interrupt Service Request
c) Interrupt Service Routine
d) Information Service Routine
Answer: c

158. What is an interrupt vector?
a) It is an address that is indexed to an interrupt handler
b) It is a unique device number that is indexed by an address
c) It is a unique identity given to an interrupt
d) None of the mentioned
Answer: a

159. In a memory mapped input/output
a) the CPU uses polling to watch the control bit constantly, looping to see if a device is ready
b) the CPU writes one data byte to the data register and sets a bit in control register to show that a byte is available
c) the CPU receives an interrupt when the device is ready for the next byte
d) the CPU runs a user written code and does accordingly
Answer: b

160. In a programmed input/output(PIO)
a) the CPU uses polling to watch the control bit constantly, looping to see if a device is ready
b) the CPU writes one data byte to the data register and sets a bit in control register to show that a byte is available
c) the CPU receives an interrupt when the device is ready for the next byte
d) the CPU runs a user written code and does accordingly
Answer: a

161. In an interrupt driven input/output
a) the CPU uses polling to watch the control bit constantly, looping to see if a device is ready
b) the CPU writes one data byte to the data register and sets a bit in control register to show that a byte is available
c) the CPU receives an interrupt when the device is ready for the next byte
d) the CPU runs a user written code and does accordingly
Answer: c

162. In the layered approach of Operating Systems
a) Bottom Layer(0) is the User interface
b) Highest Layer(N) is the User interface
c) Bottom Layer(N) is the hardware
d) Highest Layer(N) is the hardware
Answer: b


163. How does the Hardware trigger an interrupt?
a) Sending signals to CPU through a system bus
b) Executing a special program called interrupt program
c) Executing a special program called system program
d) Executing a special operation called system call
Answer: a

164. Which operation is performed by an interrupt handler?
a) Saving the current state of the system
b) Loading the interrupt handling code and executing it
c) Once done handling, bringing back the system to the original state it was before the interrupt occurred
d) All of the mentioned
Answer: d

165. . 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
Answer: a

166. To create a file
a) allocate the space in file system
b) make an entry for new file in directory
c) allocate the space in file system & make an entry for new file in directory
d) none of the mentioned
Answer: c

167. By using the specific system call, we can
a) open the file
b) read the file
c) write into the file
d) all of the mentioned
Answer: d

168. File type can be represented by
a) file name
b) file extension
c) file identifier
d) none of the mentioned
Answer: b

169. Which file is a sequence of bytes organized into blocks understandable by the system‘s linker?
a) object file
b) source file
c) executable file
d) text file
Answer: a


170. What is the mounting of file system?
a) crating of a filesystem
b) deleting a filesystem
c) attaching portion of the file system into a directory structure
d) removing the portion of the file system into a directory structure
Answer: c

171. Mapping of file is managed by
a) file metadata
b) page table
c) virtual memory
d) file system
Answer: a

172. Mapping of network file system protocol to local file system is done by
a) network file system
b) local file system
c) volume manager
d) remote mirror
Answer: a

173. 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
Answer: b

174. When will file system fragmentation occur?
a) unused space or single file are not contiguous
b) used space is not contiguous
c) unused space is non-contiguous
d) multiple files are non-contiguous
Answer: a

175. 1. 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
Answer: a

176. To create a file
a) allocate the space in file system
b) make an entry for new file in directory
c) allocate the space in file system & make an entry for new file in directory
d) none of the mentioned
Answer: c


177. 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
Answer: a

178. 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
Answer: d

179. A system is in the safe state if
a) the system can allocate resources to each process in some order and still avoid a deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned
Answer: a

180. 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
Answer: a
181. 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
Answer: a

182. What is the drawback of banker‘s algorithm?
a) in advance processes rarely know how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
d) all of the mentioned
Answer: d

183. For an effective operating system, when to check for deadlock?
a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mentioned
Answer: c


184. A problem encountered in multitasking when a process is perpetually denied necessary
resources is called
a) deadlock
b) starvation
c) inversion
d) aging
Answer: b

185. Which one of the following is a visual ( mathematical ) way to determine the deadlock
occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned
Answer: a

186. To avoid deadlock
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used
Answer: a

187. Physical memory is broken into fixed-sized blocks called
a) frames
b) pages
c) backing store
d) none of the mentioned
Answer: a

188. Logical memory is broken into blocks of the same size called
a) frames
b) pages
c) backing store
d) none of the mentioned
Answer: b

189. Every address generated by the CPU is divided into two parts. They are
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset
Answer: b

190. The table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame
Answer: c


191. The size of a page is typically
a) varied
b) power of 2
c) power of 4
d) none of the mentioned
Answer: b

192. If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n
addressing units, then the high order bits of a logical address designate the page number,
and the low order bits designate the page offset.
a) m, n
b) n, m
c) m – n, m
d) m – n, n
Answer: d
193. With paging there is no fragmentation.
a) internal
b) external
c) either type of
d) none of the mentioned
Answer: b

194. The operating system maintains a table that keeps track of how many frames have
been allocated, how many are there, and how many are available.
a) page
b) mapping
c) frame
d) memory
Answer: c

195. Paging increases the time.
a) waiting
b) execution
c) context – switch
d) all of the mentioned
Answer: c

196. Smaller page tables are implemented as a set of
a) queues
b) stacks
c) counters
d) registers
Answer: d

197. Which of the following page replacement algorithms suffers from Belady‘s Anomaly?
a) Optimal replacement
b) LRU
c) FIFO
d) Both optimal replacement and FIFO
Answer: c

198. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the
page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3
frames is?
a) 8
b) 10
c) 9
d) 7
Answer: c

199. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the
page replacement algorithm is FIFO, the number of page frames is increased to 4, then the number
of page transfers
a) decreases
b) increases
c) remains the same
d) none of the mentioned
Answer: b

200. A memory page containing a heavily used variable that was initialized very early and is in
constant use is removed, then the page replacement algorithm used is
a) LRU
b) LFU
c) FIFO
d) None of the mentioned
Answer: c

2 Comments

Previous Post Next Post