1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The optimal page replacement algorithm will select the page that.
A
Has not been used for the longest time in the past.
B
Will not be used for the longest time in the future.
C
Has been used least number of times.
D
Has been used most number of times.
2
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
Dynamic linking can cause security concerns because
A
Security is dynamic
B
The path for searching dynamic libraries is not known till runtime
C
Linking is insecure
D
Cryptographic procedures are not available for dynamic linking
3
GATE CSE 2002
Subjective
+5
-0
A computer system uses $$32$$-bit virtual address, and $$32$$-bit physical address. The physical memory is byte addressable, and the page size is $$4$$ kbytes. It is decided to use two level page tables to translate from virtual address to physical address. Equal number of bits should be used for indexing first level and second level page table, and the size of each page table entry is $$4$$ bytes.

(a) Give a diagram showing how a virtual address would be translated to a physical address.

(b) What is the number of page table entries that can be contained in each page?

(c) How many bits are available for storing protection and other information in each page table entry?

4
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on
A
The size of the blocks, and the size of the address of the blocks.
B
The number of blocks used for the index, and the size of the blocks.
C
The size of the blocks, the number of blocks used for the index, and the size of the address of the blocks.
D
None of the above.
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12