Memory Management GATE Questions

Memory Management GATE Questions are always asked in the GATE examination. Memory Management is an important topic of operating system.

This post covers the memory management questions and answers for GATE exam. Various gate questions on virtual memory are explained in this post. So let’s practice these operating system memory management questions and answers for gate exam.

Q1. Increasing the RAM of a laptop usually improves performance because:

A.Virtual memory will increase

B.Larger RAMs area unit quicker

C.Fewer page faults occur

D.Fewer segmentation faults occur.

Answer:C

Q2. Page fault happens 

A.When a requested page is in memory

B.When a requested page isn’t in memory

C.When a page is currupted

D.When associate degree exception is thrown

Answer:B

Q3. Which of the subsequent page replacement algorithms suffers from Belady’s anomaly?

A.FIFO

B.LRU

C.Optimal Page Replacement

D. None

Answer:A

Q4.What is the disc space within the disk used for?

(A) Saving temporary HTML pages

(B) Saving method knowledge

(C) Storing the super-block

(D) Storing device drivers

Answer:B

Q5. A processor uses thirty six bit physical addresses and thirty two bit virtual addresses, with a page frame size of four Kbytes. Every page table entry is of size four bytes. a 3 level page table is employed for virtual to physical address translation, wherever the virtual address is employed as follows
• Bits 30-31 area unit accustomed index into the primary level page table
• Bits 21-29 area unit accustomed index into the second level page table
• Bits 12-20 area unit accustomed index into the third level page table, and
• Bits 0-11 area unit used as offset within the page the quantity of bits needed for addressing consequent level page table (or page frame) within the page table entry of the primary, second and third level page tables area unit severally.

A.20, 20 and 20

B.24, 24 and 24

C.24, 24 and 20

D.25,25,24

Answer:D

Q6. A multilevel page table is most popular compared to one level page table for translating virtual address to physical address as a result of

A.It reduces the operation time to browse or write a memory location.

B.It helps to cut back the dimensions of page table required to implement the virtual address area of a method.

C.It is needed by the interpretation look aside buffer.

D.It helps to cut back the quantity of page faults in page replacement algorithms.

Answer:B

Q7. Thrashing happens

A.When a page fault happens

B.Processes on system area unit in running state

D.Processes on system area unit in waiting state

Answer:B

Q8.A computer system supports 32-bit virtual addresses similarly as 32-bit physical addresses. Since the virtual address area is of constant size because the physical address area, the operating system designers attempt to get get rid of the virtual memory entirely.Which  one in all the subsequent is true?

A.Efficient implementation of multi-user support isn’t any longer potential

B.The processor cache organization is created additional economical currently

C.Hardware support for memory management isn’t any longer required

D.CPU planning is created additional economical currently

Answer:C

Q9. A laptop uses 46–bit virtual address, 32–bit physical address, and a three–level paged page table organization. The page table base register stores the base address of the first–level table (T1), that occupies specifically one page. every entry of T1 stores the base address of a page of the second–level table (T2). every entry of T2 stores the base address of a page of the third–level table (T3). every entry of T3 stores a page table entry (PTE). The PTE is thirty two bits in size. The processor employed in the pc encompasses a one MB sixteen way set associativevirtually indexed physically labeled cache. The cache block size is sixty four bytes. What is the size of a page in KB during this computer? (GATE 2013)

A.2

B.4

C.8

D.16

Answer:C

Q10. Assume information given within the question 9. what’s the minimum variety of page colors required to ensure that no 2 synonyms map to completely different sets within the processor cache of this computer? (GATE  2013)

A.2

B.4

C.8

D.16

Answer:C

Q11. The essential content(s) in every entry of a page table is / area unit

A.Virtual number

B.Page frame number

C.Both virtual page number and page frame number

D.Access right info

Answer:B

Q12.A system uses first in first out policy for page replacement. it’s four page frames with no pages loaded to start with. The system initial accesses a hundred distinct pages in some order so accesses  hundred distinct pages in some order and then wants to access 100 pages in  reverse order. what number page faults can occur?

A.196

B.192

C.197

D.195

Answer:A

Q13.Let the page fault service time be 10ms in an exceedingly laptop with average access time of  20ns. If one page fault is generated for each 10^6 memory accesses, what’s the effective access time for the memory?

A.21ns

B.30ns

C.23ns

D.35ns

Answer:B

Q14. Assume the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a requirement paged memory board system running on computer system that main memory size of three pages frames that are empty initially . Let LRU, first in first out and optimal algorithm denote the quantity of page faults under the corresponding page replacements policy. Then

A.OPTIMAL < LRU < first in first out

B.OPTIMAL < first in first out < LRU

C.OPTIMAL = LRU

D.OPTIMAL = first in first out

Answer:B

Q15. Which of the subsequent needs a tool driver? (GATE  2001)

a) Register

b) Cache

c) Main memory

d) Disk

Answer:D

16.What happens to the CPU on receiving an interrupt from an IO device?

(a) hand over control of address bus and data bus to the interrupting device

(b) branches off to the interrupt service routine after completion of the current instruction

(c) halts for predetermined time

(d) branches off to the interrupt service routine immediately

Answer:D

17.Which of the following is the most popular 16-ibit operating system?

(a) TRS-DOS

(b) CP/M

(c) MS-DOS

(d) UNIX

Answer:B

18.When a process executes the code

fork();

fork();

fork();

What are the total number of child processes created?

(a) 7

(b) 3

(c) 8

(d) 4

Answer:C

19.Which of the below given system calls results in the sending of SYN packets?

(a) listen

(b) socket

(c) connect

(d) bind

Answer:C

20.When a process has been allocated 3-page frames, none of the pages of the process are available in the memory initially. The process makes the following sequence of page references (reference string): 1, 2, 1, 3, 7, 4, 5, 6, 3, 1. Least Recently Used (LRU) page replacement policy is a practical approximation to optimal page replacement. For the above reference string, how many more page faults occur with LRU than with the optimal page replacement policy?

(a) 1

(b) 0

(c) 2

(d) 3

Answer:A

21.What is the amount of ROM needed to implement a 4 bit multiplier?

(a) 2 Kbits

(b) 1 Kbits

(c) 128 bits

(d) 64 bits

Answer:B

22._______ is the disk used to cold boot a PC.

(a) Setup disk

(b) Program disk

(c) Diagnostic disk

(d) Set up disk

Answer:C

23. _____ is the command used to set a name to a disk in DOS?

(a) VOL

(b) LABEL

(c) VOLUME

(d) DISKLABEL

Answer:B

24. Which one of the below statements is FALSE about SJF or Shortest Job First Scheduling?

S1: It causes minimum average waiting time

S2: It can cause starvation

(a) Neither S1 nor S2

(b) Only S1

(c) Both S1 and S2

(d) Only S2

 Answer:B

25. When an input occurs, an operating system ______

(a) Always resumes execution of interrupted process after processing the interrupt

(b) Ignore the interrupt .

(c) May change state of interrupted process to “blocked” and schedule other process

(d) Always changes state of interrupted process after processing the interrupt

Answer:C

26. State whether the following statement is TRUE or FALSE with reason. The data transfer between memory and I/O devices using programmed I/O is faster than interrrupt-driven I/O.

A.True

B.False

Answer:B

27. The swap space resides in______

A.On chip-cache

B.RAM

C.Disk

D.ROM

Answer:C

28. If a computer has six tape drives, with n processes competing for them and each process may need two drives, what is the maximum value of n for the system to be deadlock free?

(a) 3

(b) 4

(c) 5

(d) 6

Answer:A

29. Which of these given below are the characteristics of UNIX?

(a) Multi-tasking

(b) Multi user

(c) Kernel Manages data

(d) All the above

Answer:D

30. Which of these given statements are true?

I. The shortest remaining time first scheduling may cause starvation

II. Pre-emptive scheduling may cause starvation

III. Round-robin is better than FCFS in terms of response time

(a) I and III only

(b) I, II and III

(c) I only

(d) II and III only

Answer:B

I hope these memory management gate questions will be helpful to GATE CS aspirants.

if you have any suggestion or query then please ask in comment section, we Will try to solve your problem.