1
The address generated by the CPU is called the:
Correct AnswerB. Logical address
☑ MCQ PRACTICE
Operating Systems Unit 4
Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.
Operating Systems - Unit-4
2
The physical address refers to:
Correct AnswerB. Address in main memory
3
The set of addresses generated by a CPU is known as:
Correct AnswerB. Logical address space
4
Swapping is a technique in which a process is temporarily moved between:
Correct AnswerB. Main memory and backing store
5
In contiguous memory allocation, a process occupies:
Correct AnswerA. A single contiguous block of memory
6
Which of the following is a contiguous memory allocation strategy?
Correct AnswerA. First-fit
7
External fragmentation is mainly associated with:
Correct AnswerA. Contiguous memory allocation
8
Paging divides logical memory into fixed-size blocks called:
Correct AnswerB. Pages
9
Physical memory is divided into fixed-size blocks called:
Correct AnswerC. Frames
10
In paging, the page number is used to index the:
Correct AnswerB. Page table
11
The offset in a paged address identifies the:
Correct AnswerC. Location within the frame
12
A major advantage of paging is that it eliminates:
Correct AnswerB. External fragmentation
13
TLB is used to:
Correct AnswerB. Speed up address translation
14
Segmentation divides a program into:
Correct AnswerB. Logical segments
15
A logical address in segmentation consists of:
Correct AnswerB. Segment number and offset
16
A segment table generally contains the:
Correct AnswerA. Base and limit
17
If the offset exceeds the segment limit, it results in:
Correct AnswerB. Address violation
18
Segmentation with paging combines:
Correct AnswerA. Segmentation and paging
19
In segmentation with paging, each segment is divided into:
Correct AnswerB. Pages
20
Demand paging loads a page into memory:
Correct AnswerB. Only when it is needed
21
A page fault occurs when:
Correct AnswerB. A referenced page is not currently in main memory
22
When a page fault occurs, the operating system normally:
Correct AnswerB. Brings the required page into memory
23
The valid-invalid bit in a page table indicates whether:
Correct AnswerA. The referenced page is valid and available to the process
24
Which page replacement algorithm removes the page that has been in memory for the longest time?
Correct AnswerB. FIFO
25
The page replacement algorithm that replaces the page that will not be used for the longest period in the future is:
Correct AnswerC. Optimal
26
LRU page replacement algorithm replaces the page that was:
Correct AnswerB. Least recently used
27
Belady's anomaly is commonly associated with:
Correct AnswerA. FIFO page replacement
28
The optimal page replacement algorithm is difficult to implement because it requires knowledge of:
Correct AnswerB. Future page references
29
The main objective of a page replacement algorithm is to:
Correct AnswerB. Reduce the number of page faults
30
Thrashing occurs when a system spends excessive time in:
Correct AnswerB. Paging rather than executing processes