Scribd
Upload
88 views2 pages

CS C372/IS C362 - Operating System: Birla Institute of Technology & Science, Pilani QUIZ 2 - Closed Book

This document contains an 18 question quiz on operating system concepts related to memory management techniques like paging and segmentation. The questions cover topics such as page replacement algorithms, segment table contents, fragmentation, and properties of paging vs segmentation.

Uploaded by

Vishal Mittal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
88 views2 pages

CS C372/IS C362 - Operating System: Birla Institute of Technology & Science, Pilani QUIZ 2 - Closed Book

This document contains an 18 question quiz on operating system concepts related to memory management techniques like paging and segmentation. The questions cover topics such as page replacement algorithms, segment table contents, fragmentation, and properties of paging vs segmentation.

Uploaded by

Vishal Mittal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

SOLUTION

BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI


I SEMESTER 2008-2009
QUIZ 2 – Closed Book
CS C372/IS C362 - Operating System
Weightage: 10 marks
Date: 05/11/2008
Time: 20 Minutes
ENCIRCLE THE CORRECT OPTION
1. Which of the placement algorithm minimizes wastage in each hole it selects:
(a) First Fit (b) Best fit (c) Both First fit & Best fit (d) Worst fit
2. The content of the segment table will be
(a) Segment number
(b) Base and limit register value
(c) Physical address (without offset)
(d) Offset value
3. A system uses a page size of 4k. The average amount of external fragmentation for this system would
be
(a) 2k (b) 4k (c) 8k (d) No fragmentation would be there
(e) 100 % fragmentation would occur
4. The main problem with implementation of optimal page replacement algorithm is
(a) It has a large overhead
(b) It requires additional hardware support
(c) The addresses that will be referenced are not known ahead in time
(d) It results in large number of page faults
5. A system supporting variable size segmentation with the maximum segment size of 512k is required
to execute a user process of 1 MB size. To execute this process
(a) System will allocate two segments to the process
(b) System will break segments into pages and resort to demand paging
(c) Such a process cannot be executed
(d) Both (a) & (b)
6. In the additional reference bit algorithm, the 8-bit history register value for a page is 11010000. This
value indicates that
(a) The page has not been used for last 4 units and is used 3 times in the last 8 units of time
(b) The page has not been used for last 4 units and is used 3 times in the last 3 units of time
(c) The page has not been used for last 2 units and is used 3 times in the last 4 units of time
(d) The page has been used for last 2 units and is used 3 times in the last 4 units of time
7. Choose the most correct statement about the second chance LRU algorithm
(a) When a page gets second chance its reference bit is set to 1
(b) When all the page reference bits are found to be set to 1, the algorithm degenerates to FIFO
(c) When all the page reference bits are found to be set to 0, the algorithm degenerates to FIFO
(d) Both (a) and (b)
8. In case of Enhanced second chance algorithm, the reference bit and modify bit ordered pair for two
pages, P1 and P2 are (0,0) and (1,1) respectively. Then
(a) Page P1 is the page to be replaced
(b) Page P2 is the page to be replaced
(c) Any of the two pages can be replaced
(d) None of the two pages can be replaced and a third page should be considered
9. Consider the following address string and 3 frames per process.
2133151213
Initially all frames are empty. The number of page faults that will occur if the optimal page
replacement algorithm is used and not counting the first three page faults are
(a) One (b) Two
(c) Three (d) Four
10. Consider the following address string and 3 frames per process.
2133151213
Initially all frames are empty. The number of page faults that will occur if the LRU page
replacement algorithm is used and not counting the first three page faults are
(a) One (b) Two
(c) Three (d) Four
11. Consider the following address string and 3 frames per process.
2133151213
Initially all frames are empty. The number of page faults that will occur if the FIFO page
replacement algorithm is used and not counting the first three page faults are
(a) One (b) Two
(c) Three (d) Four
12. With respect to page faults, the systems performance
(a) Improves with increase in no. of frames per process
(b) Degrades with increase in no. of frames per process
(c) Improves with decrease in no. of frames per process
(d) May improve or degrade, depending upon the page replacement policy
(e) Is independent of page replacement policy
13. Pick the wrong statement about compaction
(a) Needs dynamic relocation capability
(b) Overcomes external fragmentation problem
(c) Overcomes internal fragmentation problem
(d) Wasteful of processor time
14. Maximum hardware support is needed for
(a) FIFO (b) Optimal (c) LRU (d) Clock
15. In a page table, when the invalid bit is set, which statement is not true:
(a) Page is not in the processes’ logical address space
(b) Page is not there in memory
(c) PTLR must be used for address translation
(d) All are correct
16. In segmentation, the number of offset bits depend on
(a) Size of the process
(b) Size of the segment
(c) Size of the memory
(d) Size of the instruction pointer
17. In paging, the number of offset bits depend on
(a) Size of the process
(b) Size of the memory
(c) Size of the instruction pointer
(d) Size of the frame
18. For each of the following properties, state whether the property holds for
Paging (P), Segmentation (S), Both (B), Neither (N)
(a) Allows virtual memory to be larger than physical memory. Ans: B
(b) Avoids external fragmentation. Ans: P
(c) Avoids internal fragmentation. Ans: S
(d) Makes it easy to share code or data among processes. Ans: B
(e) Requires an allocation algorithm such as first fit or best fit. Ans: S
[0.3*5=1.5]

You might also like