🧪 Operating system MCQ Quiz Hub

1. Paging policy is :-
contiguous memory allocation
non contiguous allocation
Memory allocation
None of the above

2. Which type of partitioning we can do in paging policy-
Global partitioning
Variable paritioning
Fixed partitioning
All of the above

3. Which policy should we use in space allocation method ?
First fit
best fit
worst fit
All of the above

4. Next fit is a policy of -
Disc scheduling
Process management
Space allocation method
None of the above

5. Next fit is a improvement version of -
Best fit
first fit
worst fit
All of the above

6. Variable sized partition may suffers with which kind of fragmentation ?
Internal fragmentation
External fragmentation
Global fragmentation
local fragmentation

7. Fixed sized partition may suffers with which kind of fragmentation ?
Internal fragmentation
External fragmentation
Global fragmentation
local fragmentation

8. Page table in paging is a
Hardware solution
Software solution
We implement in both way
None of the above

9. Which of the following are true ?
Blocks in secondary memory are called as page while block in main memory are called as frame
Blocks in secondary memory are called as frame while block in main memory are called as page
The page size is equal as the frame size
1 and 3 are true

10. Which of the following are true ?
Every process have common page table
Every process have separate page table
depend on process
depends on number

11. Paging policy is independent from the -
Internal fragmentation
External fragmentation
Both of the above
None of the above

12. PTBR stands for-
primary table base register
process time block register
page table base register
None of the above

13. Physical address are the combination of -
page number with offset
virtual address with offset
frame number with offset
its a 32 bit address

14. Page fault is occur when-
frame of process are not present in main memory
required page of process are not present in main memory
all page of process are not present in main memory
process in not present in secondary memory

15. 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.
12
10
3
23

16. 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.
10,32,25
22,10,15
15,32,22
10,22,15

17. 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.
16 MB
8 MB
32 MB
None of the above

18. 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.
32MB
16MB
8MB
64MB

19. 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.
16MB
2MB
8MB
24MB

20. 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.
16 KB
16 MB
8 KB
8 MB

21. 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
16 KB
16 MB
8 KB
8 MB

22. 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.
7GB
4GB
8GB
16GB

23. 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.
8 MB
16 MB
4 GB
None of the above

24. which of the following are true ?
page table size is equal to the size of each entry multiple with number of enrty in page table
number of pages in process is equal to the process size divided by page size
page table contain meta data
All of the above

25. TLB stands for -
transfer lookaside buffer
translation lookaside buffer
Both of the above
None of the above

26. 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.
no change
34%
3.44%
2.50%

27. Which of the following are true about TLB ?
It is a buffer which have one column contain the corresponding frame number
It is a buffer which have two column, first column contain page number and second number contain corresponding frame number
TLB are have some special bit like valid bit, flag bit
All of the above

28. TLB may be-
2-K set associative
4-K set associative
8-K set associative
All of the above

29. Some of the entry in TLB are reserved for operating system called as
operating entry
wired down entry
wired up entry
No such kind of entry are available in TLB

30. TLB is -
Hardware solution
Software solution
Both of the above
None of the above

31. 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 ?
10
12
13
9

32. 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 ?
13
12
10
15

33. When we increases the number of frame so instead of decreasing the page fault it can increases, this type of anomaly known as
Belady anomaly
Frand anomaly
greedy anomaly
None of the above

34. Belady anomaly is occur in case of-
LRU page replacement policy
FIFO page replacement policy
Optimal page replacement policy
All of the above

35. Which of the page replacement policy are not to be implemented in practical situation ?
FIFO
LRU
Optimal
LIFO

36. 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 ?
z is always greater or equal to the x
z is always greater or equal to the y
There is no relation between x and y
All of the above

37. Which of the following page replacement policy guarantees minimal page fault ?
optimal
FIFO
LRU
MRU

38. 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 ?
10
6
7
5

39. 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 ?
10
9
12
8

40. 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 ?
10
11
8
9

41. 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 ?
256 KB
128 KB
8 MB
1 MB

42. 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 ?
8MB
16MB
32MB
None of the above

43. Time taken by read/write header to reach the correct track is -
Rotational latency
Seek time
Transfer time
None of the above

44. In single inter-leaving, the transfer time is
double
triple
constant
varies according to header

45. In double inter-leaving , the transfer time is become
3 times
2 times
2.75 time
remain constant

46. 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.
265
233
224
223

47. 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.
103
174
123
223

48. 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.
103
174
187
190

49. 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.
152
167
197
180

50. 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.
123
197
178
None of the above