Operating System Basics Questions and Answers

Practice Mode
Showing 10 of 563 questions
Q361
In Multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1-The number of threads in a process can be altered during the course of execution. 2-This provides inplicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.
  • A A-1, B-2, C-3
  • B A-2, B-1, C-3
  • C A-1, B-3, C-2
  • D A-3, B-1, C-1
Answer: Option D
Q362
In Real time computing
  • A The result of computation does not depend on the time at which computation is done.
  • B The result of computation also depends on the time at which computation is done.
  • C The results are independent of the time cnsidered.
  • D None of these
Answer: Option B
Q363
In soft real time tasks
  • A The dead line is always mandatory.
  • B The Dead line is desireable but not mandatory.
  • C The results are independent of the time, When it took place
  • D None of these
Answer: Option B
Q364
In real time scheduling: A: Static table driven approach, B: Static Priority driven preemptive approach, C: Dynamic planning based approach; 1-A Static analysis of feasible scheduler of dispatching is done and implemented. 2-A Static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasiblity is determined at run time.
  • A A-1, B-2, C-3
  • B A-2, B-3, C1
  • C A-3, B-1, C-2
  • D None of these
Answer: Option A
Q365
Match the following I/O devieces: A-Keyboard, 1-Human readable, B-Disk and tape drives, 2-Communication, C-Modern, 3-Machine readable
  • A A-1, B-3, C-2
  • B A-1, B-2, C-3,
  • C A-3, B-2, C-1
  • D A-2, B-1, C-3
Answer: Option A
Q366
In memory management: A-Fetch Polocy B-Cleaning Policy C- Placement Policy: 1- It determnes when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.
  • A A-1, B-2, C-3
  • B A-2, B-1, C-3
  • C A-2, B-1, C-3
  • D A-3, B-1, C-2
Answer: Option C
Q367
In memory management when demand cleaning policy is applied
  • A A modified page is written before their page frames are needed to so that pages can be written out in batches.
  • B A page is written out to secondary memory only when it has been selected for replacement.
  • C A and B both true.
  • D None of these
Answer: Option B
Q368
When pre cleaning polocy is applied in memory management
  • A A page is written out to secondary memory only when it has been selected for replacement
  • B Modified pages are written before their page frames are needed so that can be written out in batches.
  • C A and B both true.
  • D None of these
Answer: Option B
Q369
In Virtual memory management, when local control polocy is applied
  • A It detemines the number of processes that are to be resident in main memory.
  • B It determines the number of processes that are to be resdent in virtual memory.
  • C it determines when a modified pages should be written out to secondary memory
  • D None of these.
Answer: Option A
Q370
In defining page table structure in virtual memory, a page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as
  • A One page table per process structure.
  • B Two level page table structure.
  • C Inverted page table structure.
  • D None of these
Answer: Option C

📚 More from Technical

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
Technical
Back to Technical
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test