Operating System Top 500 + MCQS Download Pdf Set No 06


251. Accept that P1 is at the top of the prepared line and P5 is at the tail, and disregard the ideal opportunity for evolving between measures. Utilizing Round Robin booking calculation (where the quantum q= 1ms) which is the internal turnaround time?

  1. tav = 12ms
  2. turn = 9.2ms
  3. turn = 7ms
  4. turn = 10.8ms 

252. There are 10 unique cycles running on a workstation. Inactive cycles are sitting tight for an info occasion in the information line. Occupied cycles are booked with the Round-Robin timesharing strategy. Which out of the accompanying quantum times is the best incentive for little reaction times, if the cycles have a short runtime, for example under 10ms?

  1. TQ = 15ms
  2. TQ = 40ms
  3. TQ = 45ms
  4. TQ = 50ms 

253. Consider a trading framework wherein memory comprises of the accompanying opening sizes in memory request: H0 H1 H2 H3 H4 H5 H6 H7 10K 4KB 20KB 18KB 7KB 9KB 12KB 15KB furthermore, a progressive fragment solicitation of?

  1. 12 KB
  2. 10KB
  3. 9KB

254. Which of the accompanying sentences is/are valid?

  1. First Fit calculation distributes H2, H0, H3 for the referenced solicitation.
  2. Best Fit calculation distributes H2, H0, H3 for the referenced solicitation.
  3. First Fit calculation allots H2, H6, H7 for the referenced solicitation.
  4. Worst Fit calculation distributes H2, H3, H6 for the referenced solicitation.

255. Page flaw happens when?

  1. The page is undermined by application programming.
  2. The page is in memory.
  3. The page isn’t in memory
  4. One attempts to separate a number by 0. 

256. Determine the quantity of page shortcomings when references to page happen in the accompanying request  1,2,4,5,2,1,2,4. accept that the primary memory can oblige 3 pages and the principle memory as of w has the pages 1 and 2, with page 1 having been brought sooner than page 2. (LRU calculation is utilized)?

  1. 3
  2. 5
  3. 4
  4. none of these.

257. The page substitution strategy that occasionally prompts more page issues when the size of the memory is expanded is ?

  1. FIFO
  2. LRU
  3. such arrangement exists
  4. thing unless there are other options.

258. DIJKSTRA’S preparing calculation in a working framework, tackles the issue of?

  1. Deadlock evasion
  2. halt recuperation
  3. Mutual avoidance
  4. setting exchanging.  

259. Necessary conditions for gridlock are?

  1. n pre-emption and roundabout wait
  2. common avoidance promotion halfway portion
  3. Both an and b
  4. thing from what was just mentioned.  

260. At a specific time, the benefit of checking semaphore is 10. it will get 7 after?

  1. 3 V tasks
  2. 5P activities
  3. 5V and 2P tasks
  4. 13 P and 10 V activities

261. Semaphores are utilized to take care of the issue of ?

  1. Race condition
  2. measure synchronization
  3. Both of above
  4. thing from what was just mentioned.

262. The size of virtual memory relies upon?

  1. The size of the information transport
  2. the size of primary memory
  3. The size of address transport
  4. thing from what was just mentioned.

263. Suppose that a cycle is in ‘BOCKED’ state sitting tight for some I/O administration. At the point when the assistance is finished, it goes to the ?

  1. RUNNING state
  2. READY state
  3. SUSPENDED state
  4. TERMINATED state. 

264. progressively working frameworks, which of coming up next is the most appropriate planning plan?

  1. P/2
  2. 40
  3. 97

265. Limited Buffer is a support of size?

  1. Variable
  2. Fixed

266. …… is additionally called Swapper. Long haul?

  1. Present moment
  2. Medium term
  3. Trade space

267. Shared libraries and piece modules are put away in index.?

  1. /canister
  2. /dev
  3. /boot
  4. /lib

268……… shows data about the top cycles?

  1. Cs
  2. Top  
  3. Album

269. Collaborating measures never share any information, code, memory or state?

  1. Bogus
  2. Valid

270. First _______ passages in Per Process File Descriptor Table are utilized when the interaction is made.?

  1. 1
  2. 2
  3. 3
  4. 4

271.At the point when interaction opens its first document expressly it will get descriptor number?

  1. 1
  2. 2
  3. 3
  4. 4

272. Taking the CPU from one interaction and giving the CPU to  other cycle is named as? Setting Switching ?

  1. Dispatching
  2. Trading
  3. Following

273……. scheduler chooses the interaction from the work pool and put them in principle memory?

  1. Long haul
  2. Present moment
  3. Medium term
  4. Swapper

274. Linux OS can uphold different clients all at once?

  1. True
  2. False

275  The Operating framework is a layer of programming between…?

  1. equipment, programming application P/1
  2. Kernel, equipment
  3. Dos, Windows
  4. Windows, Kernel

276. The significant benefit of multi-programming framework is ?

  1. More than one positions can be prepared at a given time
  2. CPU usage can be expanded
  3. Jobs can be finished rapidly
  4. All of the choices are  P/7

278. The principle internal for a Real time framework is?

  1. Efficiency
  2. Large Virtual Memory
  3. Large auxiliary stock piling gadget
  4. Usability  

279. Order line mediator is likewise called __________ in some working frameworks?

  1. Kernel
  2. Shell P/13
  3. Signal
  4. API

280. I/O directions are Privileged Instructions?

  1. True P/8
  2. False

281. In Linux index structure, there is  root catalog?

  1. 1
  2. 2
  3. 3
  4. 4

282. Utilities utilized for framework organization (stop, if configuration, file disk, and so on are put away in  index?

  1. /dev
  2. b)/boot
  3. /lib
  4. /SBIN

283. Ram and ram kill directory orders are utilized to  index?

  1. Create
  2. Move
  3. Remove
  4. Modify

284. You can utilize the mv file1 file2command to move ?

  1. file1 to file2.
  2. document 2 to record 1
  3. this order won’t work for moving documents
  4. one of the alternative is .
  5.  Both alternative an and b are 

285. Taking the CPU from one interaction and giving the CPU to other cycle is named as?

  1. Context Switching
  2. Dispatching
  3. Swapping
  4. Tracking

286..  scheduler is likewise called Swapper?

  1. Long expression
  2. Short term
  3. Medium term
  4. Swap space

287. A Process A that has wrapped up working, a s well as its parent interaction has likewise completed its execution. In this express the interaction A will be called as ……. Measure?

  1. Child
  2. Thread
  3. Zombie
  4. Fork

288.Limited Buffer is a support of ____________ size?

  1. variable
  2. Fixed

289.  In….. correspondence the interaction which needs to speak with the other cycle should expressly name the beneficiary and the sender?

  1. Direct P/43
  2. Indirect
  3. Automatic
  4. Self

290.  In roundabout bury measure correspondence, a sender twice the name of the beneficiary?

  1. does
  2. doesn’t
  3. both

291. The returned code to the kid cycle after fruitful fork framework call execution is?

  1. 1
  2. 2
  3. 3
  4. 0

292. On the off chance that the fork framework call comes up short, it returns?

  1. 1
  2. 2
  3. 0

293. At the point when a cycle opens its first document expressly it will get descriptor number?

  1. 1
  2. 2
  3. 3
  4. 4

294. In Unix/Linux, naturally the standard information document is connected to the ?

  1. Mouse
  2. Keyboard
  3. Light pen
  4. Joystick

295. The record descriptor for Standard Input (Standard IN) is ?

  1. 0  
  2. 1
  3. 2
  4. 3

296. The piece of the program where the common memory is gotten to is called  Buffer?

  1. Basic segment
  2. Semaphore
  3. none

297. Linux is just single client working framework?

  1. T
  2. F
  3. Both
  4. none

300. Client mode can run the Privileged guidelines ?

  1. T
  2. Both
  3. F
  4. none