Olete.in – MCQs, Mock Tests & Government Job Prep | Operating system paging|Page replacement policy|Secondary memory and Disk scheduling

Paging policy is :-

1. contiguous memory allocation
2. non contiguous allocation
3. Memory allocation
4. None of the above

✅ Correct Answer: 2

Which type of partitioning we can do in paging policy-

1. Global partitioning
2. Variable paritioning
3. Fixed partitioning
4. All of the above

✅ Correct Answer: 3

Which policy should we use in space allocation method ?

1. First fit
2. best fit
3. worst fit
4. All of the above

✅ Correct Answer: 4

Next fit is a policy of -

1. Disc scheduling
2. Process management
3. Space allocation method
4. None of the above

✅ Correct Answer: 3

Next fit is a improvement version of -

1. Best fit
2. first fit
3. worst fit
4. All of the above

✅ Correct Answer: 2

Variable sized partition may suffers with which kind of fragmentation ?

1. Internal fragmentation
2. External fragmentation
3. Global fragmentation
4. local fragmentation

✅ Correct Answer: 2

Fixed sized partition may suffers with which kind of fragmentation ?

1. Internal fragmentation
2. External fragmentation
3. Global fragmentation
4. local fragmentation

✅ Correct Answer: 1

Page table in paging is a

1. Hardware solution
2. Software solution
3. We implement in both way
4. None of the above

✅ Correct Answer: 2

Which of the following are true ?

1. Blocks in secondary memory are called as page while block in main memory are called as frame
2. Blocks in secondary memory are called as frame while block in main memory are called as page
3. The page size is equal as the frame size
4. 1 and 3 are true

✅ Correct Answer: 4

Which of the following are true ?

1. Every process have common page table
2. Every process have separate page table
3. depend on process
4. depends on number

✅ Correct Answer: 2

Paging policy is independent from the -

1. Internal fragmentation
2. External fragmentation
3. Both of the above
4. None of the above

✅ Correct Answer: 2

PTBR stands for-

1. primary table base register
2. process time block register
3. page table base register
4. None of the above

✅ Correct Answer: 3

Physical address are the combination of -

1. page number with offset
2. virtual address with offset
3. frame number with offset
4. its a 32 bit address

✅ Correct Answer: 3

Page fault is occur when-

1. frame of process are not present in main memory
2. required page of process are not present in main memory
3. all page of process are not present in main memory
4. process in not present in secondary memory

✅ Correct Answer: 2

Consider a system where main memory is 32 MB and length of logical address is 32 bit, if size of each page is 1 KB, find the number of offset bit.

1. 12
2. 10
3. 3
4. 23

✅ Correct Answer: 2

Consider a system where main memory is 32 MB and length of logical address is 32 bit, if size of each page is 1 KB, find the number of offset bit, frame bit and page bit.

1. 10,32,25
2. 22,10,15
3. 15,32,22
4. 10,22,15

✅ Correct Answer: 4

Consider main memory of 64 MB, each page are of 1 KB and the secondary memory is of 16 GB, find the total wastage in maintaining the page table.

1. 16 MB
2. 8 MB
3. 32 MB
4. None of the above

✅ Correct Answer: 3

If virtual address are of 34 bit and number of offset bit is 10. and each entry of frame in page table is of 2B, then find the total wastage in maintaining the page table.

1. 32MB
2. 16MB
3. 8MB
4. 64MB

✅ Correct Answer: 1

we have main memory is of 64 MB, virtual address is of 32 bit, page size is 4 KB, find total wastage in page table.

1. 16MB
2. 2MB
3. 8MB
4. 24MB

✅ Correct Answer: 2

Consider a system where secondary memory is 256 GB, each page is 2 KB , if main memory is of 512 KB, find space wastage in page table because of a process of size 16 MB.

1. 16 KB
2. 16 MB
3. 8 KB
4. 8 MB

✅ Correct Answer: 3

Consider a system where secondary memory is 256 GB, each page is 2 KB , if main memory is of 512 KB, find space wastage in page table because of a process of size 32 MB

1. 16 KB
2. 16 MB
3. 8 KB
4. 8 MB

✅ Correct Answer: 1

Consider a system where secondary memory is 4 TB, each page is 512 B , if main memory is of 8 GB, page table size is of 42 MB, find the size of a process.

1. 7GB
2. 4GB
3. 8GB
4. 16GB

✅ Correct Answer: 1

Consider a system where secondary memory is 4 TB, each page is 512 B , if main memory is of 8 GB, if process of size 72 MB, find the size of its page table.

1. 8 MB
2. 16 MB
3. 4 GB
4. None of the above

✅ Correct Answer: 4

which of the following are true ?

1. page table size is equal to the size of each entry multiple with number of enrty in page table
2. number of pages in process is equal to the process size divided by page size
3. page table contain meta data
4. All of the above

✅ Correct Answer: 4

TLB stands for -

1. transfer lookaside buffer
2. translation lookaside buffer
3. Both of the above
4. None of the above

✅ Correct Answer: 2

Main memory excess time is 400ms, TLB excess time is 100ms, if hit ratio of TLB is 80%, find the percent improvement with parallel to TLB excess compared to sequential excess.

1. no change
2. 34%
3. 3.44%
4. 2.50%

✅ Correct Answer: 3

Which of the following are true about TLB ?

1. It is a buffer which have one column contain the corresponding frame number
2. It is a buffer which have two column, first column contain page number and second number contain corresponding frame number
3. TLB are have some special bit like valid bit, flag bit
4. All of the above

✅ Correct Answer: 2

TLB may be-

1. 2-K set associative
2. 4-K set associative
3. 8-K set associative
4. All of the above

✅ Correct Answer: 4

Some of the entry in TLB are reserved for operating system called as

1. operating entry
2. wired down entry
3. wired up entry
4. No such kind of entry are available in TLB

✅ Correct Answer: 2

TLB is -

1. Hardware solution
2. Software solution
3. Both of the above
4. None of the above

✅ Correct Answer: 1

Consider a page string 1 2 3 4 1 2 5 1 2 3 4 5, and we have 3 number of frame available, and if we use FIFO policy for page replacement policy then the number of page fault occur is ?

1. 10
2. 12
3. 13
4. 9

✅ Correct Answer: 4

Consider a page string 1 2 3 4 1 2 5 1 2 3 4 5, and we have 4 number of frame available, and if we use FIFO policy for page replacement policy then the number of page fault occur is ?

1. 13
2. 12
3. 10
4. 15

✅ Correct Answer: 3

When we increases the number of frame so instead of decreasing the page fault it can increases, this type of anomaly known as

1. Belady anomaly
2. Frand anomaly
3. greedy anomaly
4. None of the above

✅ Correct Answer: 1

Belady anomaly is occur in case of-

1. LRU page replacement policy
2. FIFO page replacement policy
3. Optimal page replacement policy
4. All of the above

✅ Correct Answer: 2

Which of the page replacement policy are not to be implemented in practical situation ?

1. FIFO
2. LRU
3. Optimal
4. LIFO

✅ Correct Answer: 3

While executing some processes,Page fault occur in FIFO, LRU and optimal are x,y and z respectively. which of the following are always considered as true ?

1. z is always greater or equal to the x
2. z is always greater or equal to the y
3. There is no relation between x and y
4. All of the above

✅ Correct Answer: 4

Which of the following page replacement policy guarantees minimal page fault ?

1. optimal
2. FIFO
3. LRU
4. MRU

✅ Correct Answer: 1

Number of frame given is 3, and page strings are 2,3,4,2,1,5,3,2,4,6 if we use optimal page replacement policy then number of page faults occurs is ?

1. 10
2. 6
3. 7
4. 5

✅ Correct Answer: 3

Number of frame given is 5, and page strings are 3,8,2,3,9,1,6,3,8,9,3,6,2,1,3 if we use FIFO page replacement policy then number of page faults occurs is ?

1. 10
2. 9
3. 12
4. 8

✅ Correct Answer: 2

Number of frame given is 5, and page strings are 3,8,2,3,9,1,6,3,8,9,3,6,2,1,3 if we use LRU page replacement policy then number of page faults occurs is ?

1. 10
2. 11
3. 8
4. 9

✅ Correct Answer: 4

Consider a disk where each sector contain 256 bytes, each track contains 512 sectors and disk contain 64 tracks, what is the capacity of disk ?

1. 256 KB
2. 128 KB
3. 8 MB
4. 1 MB

✅ Correct Answer: 3

Consider a disk where each sector contain 64 bytes, each track contains 128 sectors and disk contain 1000 tracks, what is the capacity of disk ?

1. 8MB
2. 16MB
3. 32MB
4. None of the above

✅ Correct Answer: 1

Time taken by read/write header to reach the correct track is -

1. Rotational latency
2. Seek time
3. Transfer time
4. None of the above

✅ Correct Answer: 2

In single inter-leaving, the transfer time is

1. double
2. triple
3. constant
4. varies according to header

✅ Correct Answer: 1

In double inter-leaving , the transfer time is become

1. 3 times
2. 2 times
3. 2.75 time
4. remain constant

✅ Correct Answer: 3

Consider a circular disk where tracks are numbered from 0 to 100, if we have a following request vector 4,34,10,19,73,89,17 If currently header at 22 and moving up,find the total head moment in order to satisfy this request using FCFS.

1. 265
2. 233
3. 224
4. 223

✅ Correct Answer: 4

Consider a circular disk where tracks are numbered from 0 to 100, if we have a following request vector 4,34,10,19,73,89,17 If currently header at 22 and moving up,find the total head moment in order to satisfy this request using SSTF.

1. 103
2. 174
3. 123
4. 223

✅ Correct Answer: 1

Consider a circular disk where tracks are numbered from 0 to 100, if we have a following request vector 4,34,10,19,73,89,17 If currently header at 22 and moving up,find the total head moment in order to satisfy this request using Scan.

1. 103
2. 174
3. 187
4. 190

✅ Correct Answer: 2

Consider a circular disk where tracks are numbered from 0 to 100, if we have a following request vector 4,34,10,19,73,89,17 If currently header at 22 and moving up,find the total head moment in order to satisfy this request using LOOK.

1. 152
2. 167
3. 197
4. 180

✅ Correct Answer: 1

Consider a circular disk where tracks are numbered from 0 to 100, if we have a following request vector 4,34,10,19,73,89,17 If currently header at 22 and moving up,find the total head moment in order to satisfy this request using C-Scan.

1. 123
2. 197
3. 178
4. None of the above

✅ Correct Answer: 2