Sail E0 Webinar

MCQs

Total Questions : 10
Question 1. Because of virtual memory, the memory can be shared among:
  1.    processes
  2.    threads
  3.    instructions
  4.    none of the mentioned
 Discuss Question
Answer: Option A. -> processes


None.


Question 2. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then?
  1.    segmentation fault occurs
  2.    fatal error occurs
  3.    page fault occurs
  4.    no error occurs
 Discuss Question
Answer: Option C. -> page fault occurs


None.


Question 3. The pager concerns with the:
  1.    individual page of a process
  2.    entire process
  3.    entire thread
  4.    first page of a process
 Discuss Question
Answer: Option A. -> individual page of a process


None.


Question 4. _____ is the concept in which a process is copied into main memory from the secondary memory according to the requirement.
  1.    Paging
  2.    Demand paging
  3.    Segmentation
  4.    Swapping
 Discuss Question
Answer: Option B. -> Demand paging


None.


Question 5. Swap space exists in:
  1.    primary memory
  2.    secondary memory
  3.    CPU
  4.    none of the mentioned
 Discuss Question
Answer: Option B. -> secondary memory


None.


Question 6. Effective access time is directly proportional to:
  1.    page-fault rate
  2.    hit ratio
  3.    memory access time
  4.    none of the mentioned
 Discuss Question
Answer: Option A. -> page-fault rate


None.


Question 7. A process is thrashing if:
  1.    it is spending more time paging than executing
  2.    it is spending less time paging than executing
  3.    page fault occurs
  4.    swapping can not take place
 Discuss Question
Answer: Option A. -> it is spending more time paging than executing


None.


Question 8. Working set model for page replacement is based on the assumption of:
  1.    modularity
  2.    locality
  3.    globalization
  4.    random access
 Discuss Question
Answer: Option B. -> locality


None.


Question 9. In FIFO page replacement algorithm, when a page must be replaced:
  1.    oldest page is chosen
  2.    newest page is chosen
  3.    random page is chosen
  4.    none of the mentioned
 Discuss Question
Answer: Option A. -> oldest page is chosen


None.


Question 10. Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?
  1.    first in first out algorithm
  2.    additional reference bit algorithm
  3.    least recently used algorithm
  4.    counting based page replacement algorithm
 Discuss Question
Answer: Option C. -> least recently used algorithm


None.


Latest Videos
Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)
Direction Sense Test Part 1 Reasoning (Hindi)
Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE
Cube & Cuboid Part 1 Reasoning (Hindi)
Data Interpretation (DI) Basic Concept Reasoning (Hindi)
Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)
Sail E0 free webinar Webinars
Real Numbers Part 7 Class 10 Maths
Real Numbers Part 1 Class 10 Maths
Polynomials Part 1 Class 10 Maths

Latest Test Papers

Pie Chart - Test Paper 1 Data Interpretation Reasoning & DI
Tabulation - Test Paper 2 Data Interpretation Reasoning & DI
Test Paper 1 Direction Sense Test Reasoning & DI
ICA , RDIC,GFM Free Modal Test Paper - Non - Technical Branch Old Syllabus 2022 - SAIL Junior Officer E0
GFM Combined 1 Free Revision Test SAIL JO E-0