1.10,32,25
2.22,10,15
3.15,32,22
4.10,22,15
1.12
2.10
3.3
4.23
1.16 KB
2.16 MB
3.8 KB
4.8 MB
1.16 KB
2.16 MB
3.8 KB
4.8 MB
1.8 MB
2.16 MB
3.4 GB
4.None of the above
1.7GB
2.4GB
3.8GB
4.16GB
1.16 MB
2.8 MB
3.32 MB
4.None of the above
1.Internal fragmentation
2.External fragmentation
3.Global fragmentation
4.local fragmentation
1.32MB
2.16MB
3.8MB
4.64MB
1.no change
2.34%
3.3.44%
4.2.5%
1.Best fit
2.first fit
3.worst fit
4.All of the above
1.Disc scheduling
2.Process management
3.Space allocation method
4.None of the above
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
1.Hardware solution
2.Software solution
3.We implement in both way
4.None of the above
1.contiguous memory allocation
2.non contiguous allocation
3.Memory allocation
4.None of the above
1.Internal fragmentation
2.External fragmentation
3.Both of the above
4.None of the above
1.page number with offset
2.virtual address with offset
3.frame number with offset
4.its a 32 bit address
1.primary table base register
2.process time block register
3.page table base register
4.None of the above
1.operating entry
2.wired down entry
3.wired up entry
4.No such kind of entry are available in TLB
1.Hardware solution
2.Software solution
3.Both of the above
4.None of the above
1.2-K set associative
2.4-K set associative
3.8-K set associative
4.All of the above
1.transfer lookaside buffer
2.translation lookaside buffer
3.Both of the above
4.None of the above
1.Internal fragmentation
2.External fragmentation
3.Global fragmentation
4.local fragmentation
1.16MB
2.2MB
3.8MB
4.24MB
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
1.Every process have common page table
2.Every process have separate page table
3.depend on process
4.depends on number
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
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
1.First fit
2.best fit
3.worst fit
4.All of the above
1.Global partitioning
2.Variable paritioning
3.Fixed partitioning
4.All of the above