Home › Quizzes › Process and Memory Management

Process and Memory Management

Process and Memory Management

14 Questions Published
Play Quiz Practise this topic out loud

Questions

Question 1 Multiple Choice (Single Answer)

__________ helps us to distinguish the pages in the memory and the pages on the disk.

  1. Base register
  2. Limit register
  3. Dispatcher
  4. Valid-invalid bit
  5. TLB (Translation Look-Aside Buffer)
Question 2 Multiple Choice (Single Answer)

If a process is spending much more time in paging than executing, then this phenomenon is called __________.

  1. belady's anomaly
  2. page fault
  3. compaction
  4. thrashing
  5. none of the above
Question 3 Multiple Choice (Single Answer)

Local replacement algorithm is used to avoid

  1. thrashing
  2. fragmentation
  3. belady's anomaly
  4. starving
  5. deadlock
Question 4 Multiple Choice (Single Answer)

A process can be swapped out from the memory, if
i. its time quanta has expired in Round-robin scheduling
ii. higher priority process has arrived in priority scheduling
iii. a new process of less execution time has arrived in FCFS scheduling

  1. Only i
  2. Only i and ii
  3. Only i and iii
  4. Only ii and iii
  5. All of these
Question 5 Multiple Choice (Single Answer)

Which process controls the block that consists of the contents of the processor register, such as user-visible register, control and status registers?

  1. Process indentification
  2. Processor state information
  3. Process control identification
  4. None of these
Question 6 Multiple Choice (Single Answer)

Demand paging is commonly used in ___________.

  1. paged memory management system
  2. segmented memory management system
  3. virtual memory management
  4. compaction
  5. none of these
Question 7 Multiple Choice (Single Answer)

___________ policy determines where in real memory a process piece is to reside.

  1. Fetch
  2. Placement
  3. Replacement
  4. Memory
Question 8 Multiple Choice (Single Answer)

Where does the swap space reside in the system?

  1. RAM
  2. Hard disk
  3. Optical device
  4. Pen drive
  5. None of these
Question 9 Multiple Choice (Single Answer)

Which scheduling algorithm is used to pick the quickest little job that needs to be done?

  1. First Come First Serve [FCFS ]
  2. Shortest-Job-First [SJF]
  3. Priority
  4. Round-robin
Question 10 Multiple Choice (Single Answer)

__________ is the module that gives control of the CPU to the process selected by the scheduler.

  1. Dispatcher
  2. Time quantum
  3. Through put
  4. Response time
Question 11 Multiple Choice (Single Answer)

Which of the following algorithms is non preemptive?

  1. FCFS
  2. SJF
  3. Round robin
  4. Priority scheduling
Question 12 Multiple Choice (Single Answer)

In preemptive scheduling, the running process is temporarily suspended

  1. to allow starving process to run
  2. before the CPU time expires
  3. when it requests I/O
  4. when two processes do not use the same resources
Question 13 Multiple Choice (Single Answer)

Which CPU scheduling algorithm is probably the most optimal in terms of turnaround/response time?

  1. FCFS
  2. Shortest Job First
  3. Priority based scheduling
  4. Round-robin scheduling
Question 14 Multiple Choice (Single Answer)

Which of the following CPU scheduling algorithms would a time-sharing system likely use?

  1. FCFS scheduling
  2. Priority based CPU scheduling
  3. Round robin scheduling
  4. Shortest Job First
← Back to Quizzes