Operating System Top 500 + MCQS Download Pdf Set No 04

by
Print/Downlaod pdf

151. An interaction is supposed to be in basic segment in the event that it executes code that controls shared information?

  1. Valid
  2. Bogus

  152. Legitimate location is created by?

  1. Central processor
  2. Compiler
  3. Hard plate
  4. none

153. Consider a UNIX framework with edge need of 125. Expect two cycles, P1 and P2, which came into the framework simultaneously. P1 has a pleasant worth of 15 and ‘late CPU use’ 45 ticks. P2 has a pleasant worth of 10 and „recent CPU usage‟ 65 ticks. It is the ideal opportunity for booking. Which of the two cycles will be picked for execution?

  1. P1 on the grounds that its new CPU utilization is t exactly that of P2‟s and, accordingly, its need is higher than P2‟s need.
  2. P2 in light of the fact that its pleasant worth is more modest than that of P1’s.  
  3. P2 on the grounds that its need number is more modest than that of P1‟s.
  4. P1 on the grounds that its interaction ID is more modest than P2‟s measure ID.
  5. none of the given decisions

154. What is spooling?

  1. Capacity of an OS to shield occupations from composing into some unacceptable memory area
  2. Capacity of an OS to do long haul work planning
  3. Capacity of an OS to peruse occupations from cards onto the plate, and burden a new position from the circle to purge memory segment
  4. Capacity of an OS to offer need to each work for execution. ne of the given decisions.

155.To a PC working framework, a string is?

  1. Hint of framework calls made by an interaction.
  2. Recognizable calculation unit with state executing an undertaking.
  3. Info/yield stream related with a cycle
  4. The entirety of the given decisions. ne of the given decisions.

 156. What segment guarantees that a cycle can execute just inside its own location space? I/O gadget?

  1. Clock
  2. Virtual memory
  3. none.
  4. Memory-tending to equipment

157. Sectioned paging brings about less inside discontinuity than unadulterated cycle level paging. Valid ?

  1. Bogus 
  2. Uncertain inquiry 

158. The Multi-Level Feedback Queue (MLFQ) planning calculation is equivalent to Shortest-Job-First. Valid ?

  1. Bogus
  2. Uncertain inquiry

159. Paging Framework? in paging frameworks, outside discontinuity can’t happen?

  1. Invalid
  2. Valid

160.  Race conditions can’t happen on a Uni processor?

  1. Bogus
  2. Not bogus

161. SJF can be executed as a need calculation, where the need is dictated by the appearance season of the work?

  1. Progress
  2. Bogus

162.  An interaction in the Ready state can just change to Running or Exit states? Valid

  1. True
  2. False

163.  The two-stage locking convention ensures that simultaneous exchanges are without stop Bogus?

  1. Yes
  2. No

164.A condition where a bunch of hindered measures each holding an asset and standing by to secure an asset held by other cycle in the set is named as?

  1. Start
  2. Stop 
  3. Starvation

165. Forestalling a state of to occur, stops can be forestalled to occur?

  1. Basic district
  2. Roundabout stand by
  3. Screens
  4. Basic area

  166. Coming up next is anything but an old style issue of synchronization Bounded cushion issue Reader essayist issue ?

  1. Feasting philosopher’s issue
  2. Checking semaphore issue  

  167. The whole number worth of semaphores can run over an unlimited whole number area?

  1. Checking  
  2. Parallel
  3. Mute
  4. Limited cushion

  168.The condition in which a set {P0, P1… Pn} of holding up measures should exist to such an extent that P0 is hanging tight for an asset that is held by P1, P1 is sitting tight for an asset that is held by P2, etc, Pn-1 is sitting tight for an asset held by Pn, and Pn is hanging tight for an asset held by P0. This condition is known as?

  1. Mutual prohibition
  2. Hold and stand by
  3. acquisition
  4. Round pause

  169. Halt recognition and recuperation procedure is by and large like gridlock evasion method to deal with stop in the framework?

  1. True
  2. False

170. In Overlay procedure, we can over-burden any piece of the program with the piece of the program required as of late?

  1. True
  2. Bogus

 171. Working framework is deals with the utilization of equipment among the different application programs for the clients?

  1. Valid
  2. Bogus

 172.In most limited occupation first calculation CPU plan measure as per the?

  1. Need savvy
  2. Computer chip Burst
  3. Appropriate CPU assets similarly among all cycles

173.In UNIX, a document descriptor is?

  1. Its worth depicts the sort of information in the record and the document area on circle.
  2. record descriptor table to ultimately get to an open file‟
  3. which focuses to the idle of the document containing the executable picture of the interaction on circle.
  4. All

174. The entirety of the given decisions. one of the given decisions framework call ?

  1. Is a passage point into the bit code
  2. Permits a program to demand a part administration
  3. Is a method to secure I/O gadgets and other framework assets
  4. The entirety of the these
  5. All are given

175. VPR stands?

  1. Virtual Physical Re locatable

176. Size of page?

  1. The size of a page is characterized by
  2. virtual physical symbolic
  3. Frames
  4. All

177.Computer processor? 

  1. RAM
  2. ROM
  3. All Chips

178. . What planning strategy will you use for every one of the accompanying cases? Clarify your explanations behind picking them.?. The cycles show up everywhere time spans:  The system’s proficiency is estimated by the level of occupations finished. Every one of the cycles set aside practically equivalent measures of effort to finish.

  1. FCFS
  2. STF
  3. FCFS or RR

179. The principle program is stacked into memory and is executed. This kind of stacking is called ?

  1. Static stacking
  2. Dynamic stacking
  3. Dynamic connecting
  4. Overlays\

180. Which of coming up next is vital time while getting to information on the circle?

  1. Seek time
  2. Rotational time
  3. Transmission time
  4. Waiting time

181. The host more than once checks if the regulator is occupied until it isn’t. It is in a circle that status register’s occupied piece turns out to be clear. This is called advise the CPU that it is prepared is called?

  1. Interrupt and Polling
  2. Polling and Spooling
  3. Polling and Interrupt
  4. Deadlock and Starvation

182.  Unix Operating System is a?.

  1. Time Sharing Operating System
  2. Multi-User Operating System
  3. Multi-entrusting Operating System
  4. All the Above

.

183. Which of the accompanying memory designation plot experiences External discontinuity?

  1. Segmentation
  2. Pure interest paging
  3. Swapping
  4. Paging

184. Information about a cycle is kept up in a?

  1. Stack
  2. Translation Look aside Buffer
  3. Process Control Block
  4. Program Control Block

185.  Distributed OS deals with the rule?

  1. File Foundation
  2. Single framework picture
  3. Multi framework picture
  4. Networking picture

186. The issue of fracture emerges in?

  1. Static stockpiling distribution
  2. Stack distribution stockpiling
  3. Stack distribution with dynamic restricting
  4. Heap assignment

187. Which record framework does DOS commonly use ?

  1. FAT16
  2. FAT32
  3. NTFS
  4. WNFS

188.  The program is known as ?

  1. Compiler
  2. Device Driver
  3. Protocol
  4. Shell

189. The time taken by the circle arm to find the particular location of an area for getting data is called?

  1. Rotational Latency
  2. Seek Time
  3. Search Time
  4. Response Time

190.  Which record framework does Windows 95 regularly use ?

  1. FAT16
  2. FAT32
  3. NTFS
  4. LMFS

191) Identify the odd thing in the administrations of working framework?

  1. Accounting
  2. Protection
  3. Error location and revision
  4. Dead lock dealing with

192. Cryptography procedure is utilized in?

  1. Polling  
  2. Job Scheduling
  3. Protection
  4. File Management

193. Which of coming up next isn’t benefit of multiprogramming?

  1. Increased throughput
  2. Shorter reaction time
  3. Decreased working framework overhead
  4. Ability to appoint needs to occupations

194.  In OS, the reaction time is extremely basic?

  1. Multitasking
  2. Batch
  3. Online
  4. 4 Real-time

195.  An ideal booking calculation regarding limiting the  holding up season of a given arrangement of measures is?

  1. FCFS booking calculation
  2. Round robin booking calculation
  3. Shortest work – first booking calculation
  4. none

196.  Real time frameworks are?

  1. Primarily utilized on centralized server PCs
  2. Used for observing occasions as they happen
  3. Used for program improvement
  4. Used for continuous intuitive clients

197) Which strategy was presented in light of the fact that a solitary occupation couldn’t keep both the CPU and the I/O gadgets occupied?

  1. Time-sharing
  2. Spooling
  3. Preemptive planning
  4. Multiprogramming

198.  Inter interaction correspondence should be possible through ?

  1. Mails
  2. Messages
  3. System calls
  4. Traps

199.In Priority Scheduling a need (number) is related with each interaction. The CPU is distributed to the cycle with the most elevated need (littlest whole number = most teworthy need). The issue of, Starvation ? low need cycles may never execute, is settled by?

  1. Terminating the interaction.
  2. Aging
  3. Mutual Exclusion
  4. Semaphore

200. CPU execution is estimated through ?

  1.  Throughput
  2. MHz
  3. Flaps
  4. none of the abovementioned

151. Variable names are – addresses?

  1. Physical
  2. Re locatable
  3. Relative Symbolic
  4. logical

152. The assortment of cycles the?

  1. an interaction for planning a name to a location.
  2. Tending to Binding Routing Memory

153. At the point when the location utilized in a program gets changed over to a real actual RAM address, it is called?

  1. Execution
  2. Stacking
  3. Address Binding
  4. Assembling

 154. holds the littlest legitimate actual memory address for an interaction?

  1. Base register
  2. Cutoff register
  3. Record register
  4. Stack pointers register

155. Principle Memory will be memory?

  1. Unpredictable
  2. n-unpredictable
  3. Perpetual
  4. Virtual

   159. In the library documents are connected at load time?

  1. Static Linking
  2. Dynamic Linking

160. The ….is a solitary program that creates an item record?

  1. Linker
  2. Compiler
  3. Loader
  4. Word processor

161. Reserve is n-unpredictable memory?

  1. Valid
  2. Bogus

163. LRU page substitution calculation can be carried out by?

  1. Counter
  2. Stack
  3. Connected rundown
  4. The entirety of the given alternatives  

124. Accept an intelligent location space of 16 pages of 1024 words, each planned into an actual memory of edges. Each word comprises of 2 bytes. What will be the absolute number of pieces needed for p?

  1. 4 pieces
  2. 8 pieces
  3. 16 pieces
  4. 32 pieces

125. Accept an intelligent location space of 16 pages, every one of 1024 words, each planned into an actual memory of 32 edges. Each word comprises of 2 bytes. What will be the all out number of pieces needed for f (outlines)?

  1. 5  
  2. 6
  3. 7
  4. 8
  5. 5

126. In page substitution calculation we will supplant the page that has t been utilized for the longest timeframe?

  1. Counter based
  2. Least Frequently Used
  3. FIFO
  4. LRU

127. is the partition of client legitimate memory from actual memory?

  1. ROM
  2. Actual memory
  3. Virtual Memory
  4. none

128. Following are the benefits of Virtual memory EXCEPT?

  1. Effective cycle creation
  2. Idea of memory planned documents
  3. Low CPU utilization
  4. Running huge estimated measures

129. A framework is like a paging framework with trading?

  1. Context exchanging
  2. Request paging  
  3. Page flaw
  4. none

  130. In portion plot number of edges dispensed to a cycle is corresponding to its size .

  1. Fixed Allocation
  2. Relative Allocation
  3. Need Allocation
  4. none

131. The significant standard in the determination of a specific calculation is that we need to Limit the quantity of page deficiencies?

  1. Exec
  2. Fork
  3. Request Paging
  4. Whipping

  132. To dispense with outer fracture in division the plan utilized is?

  1. Fixed size segment conspire
  2. Variable size parcel plot
  3. Fixed size paging plan
  4. Variable size paging plan

  133. In a UNIX framework, framework call can be utilized to demand the working framework to memory map an opened record?

  1. M map( )
  2. fork ( )
  3. executive( )
  4. peruse( )

134. For some page substitution calculations, the page issue rate may increment as the quantity of assigned edges?

  1. Constant
  2. Diminished
  3. Expanded
  4. all

135. is a variety of fork framework bring in a few Unix working framework?

  1. Virtual fork ( )
  2. work ( )
  3. avoid fork ( )
  4. b fork ( )

136. The fundamental rules for Page Replacement in Optimal Page Replacement Algorithm is to Supplant that page which won’t be utilized for the longest timeframe?

  1. Replace that page which will be required most habitually in the execution of a cycle
  2. Replace the page which is greatest in size
  3. Supplant the page which is more modest in size

137. In pages division, the consistent location is legitimate if d is portion length?

  1. Under
  2. More to worthy than
  3. Equivalent to
  4. More the worthy than or equivalent to

 138. The o Segment number s is lawful if s < STLR, and counterbalance, d, is legitimate if d < breaking point or Segment Length. The edge that has been altered during execution of a cycle is rmally called outline?

  1. Clean
  2. Grimy
  3. Overwritten
  4. Ideal

139. FIFO Page Replacement Algorithm has the most minimal page deficiency rate

  1. True
  2. Bogus

140. At the point when the interaction attempts to get to areas that are t in memory, the equipment traps the working framework. This is called as ?

  1. Page Fault  
  2. Page substitution
  3. Paging
  4. Division

141. Following plans permit productive executions of page tables EXCEPT

  1. Hashed Page Table
  2. Various leveled
  3. Multilevel Paging
  4. Altered Page Table
  5. Parallel Page Table

142. We need a page supplanting calculation with the page-deficiency rate?

  1. Most elevated
  2. Most minimal 
  3. Ordinary
  4. none

143.If there should arise an occurrence of whipping if CPU usage is too low the working framework multiprogramming?

  1. Increases
  2. Decreases
  3. w and then increments and w and then reductions
  4. none of the given choices

144. What is preposterous to expect to run a program whose size is more prominent than the size of the fundamental memory.?

  1. Valid
  2. Physical
  3. virtual

145. An ideal page-substitution calculation has the least page flaw pace, everything being equal?

  1. Valid 
  2. Bogus

The basic segment issue should fulfill the accompanying prerequisites with the exception o?:

  1. Progress
  2. Common Exclusion
  3. Limited Waiting
  4. Race Condition

150. The answer for Critical Section Problem is ?

  1. Mutual Exclusion
  2. Progress
  3. Bounded Waiting.

<Previous Page
Take Quiz No 04
Next Page >

Post Views: 786