PREVIOUS YEAR SOLVED PAPERS - GATE 2019

11. A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?

  • Option : D
  • Explanation :
    Given cache block size is 16 bytes, so block or word offset is 4 bits. Fully associative cache of size 16 kB, so line offset should be,
    = cache size / block size
    = 16 kB / 16 B = 1 k
    = 1024
    = 10 bits Line or Index Offset
    Tag bit size would be,
    = processor address size - (line offset + word offset)
    = 32 - 10 - 4
    = 18 bits tag size
    Since, there no option matches, but if we assume that Line Offset is a part of Tag bits, therefore,
    Tag bits = 18+10 = 28 bits
    Line or Index offset = 0 bits (since fully associative cache memory),
    Word or block offset = 4 bits
    32 - bit
    Tag offsetWord offset
    28 bit4 bit
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


12. The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has 16 address lines denoted by A15 to A0. What is the range of addresses (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


13. Which one of the following kinds of derivation is used by LR parsers?

  • Option : D
  • Explanation :
    LR parser is a bottom up parser. Hence it uses right most derivation in reverse order.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


14. In 16-bit 2’s complement representation, the decimal number −28 is:

  • Option : C
  • Explanation :
    +28 ⇒ 0000 0000 0001 1100
    –28 ⇒ 1111 1111 1110 0100 (2’s complement form)
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


15. Let U = {1, 2, ..., Q.16 n} and A = {(x, X), x ∈ X and X ⊆ U}. Consider the following two statements on ⏐A⏐.

  • Option : C
  • Explanation :
    A = {(x, X), x ∈ X and X ⊆ U}
    The number of k element subsets of a set U with n elements = = nCk'
    The number of possible ordered pairs (x, X) where x ∈ X is then 2n-1 Sets are possible so for all n elements total n ⋅ 2n-1 number of order pairs are possible.
    thus statement I is true and
    But since by the combinatoric identity

    statement II is identity similar to statement I thus also true.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
GATE 2019