A Learning Platform

SUCCESS

Success = Discipline + Consistency + Sacrifice.
Discipline - in what you do.
Consistency - in what you do.
Sacrifice - for what you do.

                   -- Manjunatha C. P. --

OPERATING SYSTEM MCQ SET 7

1. Memory management in an operating system is responsible for:
A) CPU scheduling
B) Process synchronization
C) Allocation and deallocation of memory
D) File access control

C) Allocation and deallocation of memory

2. Which of the following memory allocation schemes suffers from external fragmentation?
A) Paging
B) Segmentation
C) Fixed partitioning
D) Both B and C

D) Both B and C

3. External fragmentation occurs when:
A) Memory is wasted inside allocated blocks
B) Free memory exists but is not contiguous
C) Too many pages are used
D) Page size is too small

B) Free memory exists but is not contiguous

4. Internal fragmentation occurs when:
A) Memory blocks are too small
B) Allocated memory is slightly larger than requested
C) Pages are swapped out
D) Segments are shared

B) Allocated memory is slightly larger than requested

5. Which memory management technique eliminates external fragmentation?
A) Segmentation
B) Paging
C) Fixed partitioning
D) Variable partitioning

B) Paging

6. In paging, logical address space is divided into:
A) Frames
B) Segments
C) Pages
D) Blocks

C) Pages

7. Physical memory in paging is divided into:
A) Pages
B) Segments
C) Frames
D) Clusters

C) Frames

8. The mapping between pages and frames is maintained by:
A) Segment table
B) Page table
C) File table
D) FAT

B) Page table

9. Which hardware component speeds up paging address translation?
A) Cache
B) Register
C) TLB
D) ALU

C) TLB

10. TLB stands for:
A) Translation Lookaside Buffer
B) Temporary Logical Buffer
C) Total Load Buffer
D) Table Lookaside Block

A) Translation Lookaside Buffer

11. Segmentation is based on:
A) Fixed-size blocks
B) Logical division of programs
C) Physical memory size
D) Page size

B) Logical division of programs

12. Which memory management scheme supports protection and sharing naturally?
A) Paging
B) Segmentation
C) Fixed partitioning
D) Swapping

B) Segmentation

13. Virtual memory allows:
A) Programs to execute partially in memory
B) Execution only if full program fits in memory
C) Faster CPU execution
D) Elimination of page faults

A) Programs to execute partially in memory

14. The main advantage of virtual memory is:
A) Increased CPU speed
B) Larger logical address space
C) Reduced I/O operations
D) No fragmentation

B) Larger logical address space

15. Which of the following causes a page fault?
A) Accessing a page not in main memory
B) Invalid instruction
C) Arithmetic overflow
D) I/O interrupt

A) Accessing a page not in main memory

16. Which memory management technique involves swapping processes in and out of memory?
A) Paging
B) Segmentation
C) Swapping
D) Caching

C) Swapping

17. Demand paging means:
A) All pages are loaded initially
B) Pages are loaded only when needed
C) Pages are swapped periodically
D) Pages are loaded sequentially

B) Pages are loaded only when needed

18. Page replacement is needed when:
A) A page fault occurs and no free frame is available
B) CPU is idle
C) Disk is full
D) Page table is full

A) A page fault occurs and no free frame is available

19. Which of the following is NOT a page replacement algorithm?
A) FIFO
B) LRU
C) Optimal
D) FCFS

D) FCFS

20. Which parameter measures the effectiveness of memory management?
A) Turnaround time
B) Page fault rate
C) CPU utilization
D) Throughput

B) Page fault rate

21. Which address is generated by the CPU?
A) Physical address
B) Logical address
C) Frame address
D) Disk address

B) Logical address

22. Which memory management scheme combines paging and segmentation?
A) Simple paging
B) Segmented paging
C) Swapping
D) Multilevel paging

B) Segmented paging

23. Thrashing occurs when:
A) CPU is underutilized
B) System spends most time paging
C) Memory is full
D) Page size is large

B) System spends most time paging

24. Which technique is used to reduce thrashing?
A) Increasing degree of multiprogramming
B) Decreasing page size
C) Working set model
D) FIFO scheduling

C) Working set model

25. Which of the following best describes paging?
A) Logical division of program
B) Fixed-size memory allocation
C) Variable-size memory allocation
D) Disk scheduling technique

B) Fixed-size memory allocation