MCA Entrance Previous Year Question Bank

consider a page size of $2000\text{ bytes}$, and the following page table:

Which of the following virtual addresses would generate a page fault?

• I. $10451$

• II. $5421$

• III. $14123$

• IV. $9156$

On a simple paging system with $2^{24}$ bytes of physical memory, $256$ pages of logical address space, and a page size of $2^{10}$ bytes, how many bits are in logical address?

Given a disk with $1000$ cylinders numbered from $0$ to $999$, calculate the total number of tracks the disk arm must move to service all requests in the disk queue using FIFO and SCAN scheduling algorithms. Assume the last serviced request was at track $345$, with the disk head currently moving toward track $0$. The disk queue (in FIFO order) contains requests for the following tracks: $123,874,692,475,105,\text{ and }376$.

A thread is usually defined as a 'light weight process' because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the followings is TRUE?

Which of the following is/are shared by all the threads in a process?

• I. program counter

• II. stack

• III. address space

• IV. registers

Consider the following page reference string: $1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6$, with $4$ page frames. How many page faults occur using the FIFO (First in First Out) and LRU (Least Recently Used) page replacement algorithms?