Question 35 Consider a fully associative cache with 8 cache blocks (numbered 0-7) and the following sequence of memory block requests: 4, 3, 25, 8, 19, […]
Question 25 Consider a paging system that uses a 1-level page table residing in main memory and a TLB for address translation. Each main memory access […]
Question 44 A solution to the Dining Philosophers Problem which avoids deadlock is A ensure that all philosophers pick up the left fork before the right […]
Question 32 Identify the true statement from the given statements (1) FIFO is non preemptive (2) Round robin is non preemptive (3) Multilevel queue scheduling is […]
Question 422 Computer uses 46-bit virtual address, 32 bit physical address, and a three level paged page table organization. The page table base register stores the […]
Question 1 An address in the memory is called A physical address B logical address C memory address D word address Operating-SystemsMemory-Management Question 1 Explanation: A […]
Question 32 The concurrent programming constructs fork and join are as below: fork which creates a new process executing from the specified label join which decrements […]