Question 1 |

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?

24 bits and 0 bits | |

28 bits and 4 bits | |

24 bits and 4 bits | |

28 bits and 0 bits |

Question 1 Explanation:

Question 2 |

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 A_{15} \; to \; A_0. What is the range of address (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal?

C800 to CFFF | |

CA00 to CAFF | |

C800 to C8FF | |

DA00 to DFFF |

Question 2 Explanation:

Question 3 |

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

Leftmost | |

Leftmost in reverse | |

Rightmost | |

Rightmost in reverse |

Question 3 Explanation:

Question 4 |

In 16-bit 2's complement representation, the decimal number -28 is:

1111 1111 0001 1100 | |

0000 0000 1110 0100 | |

1111 1111 1110 0100 | |

1000 0000 1110 0100 |

Question 4 Explanation:

Question 5 |

Let U=\{1,2,,...n\}. Let A=\{(x,X)|x\in X,X\subseteq U\}. Consider the following two statements on |A|.

I. |A|=n2^{n-1}

II. |A|=\sum_{k=1}^{n}k\binom{n}{k}

Which of the above statements is/are TRUE?

I. |A|=n2^{n-1}

II. |A|=\sum_{k=1}^{n}k\binom{n}{k}

Which of the above statements is/are TRUE?

Only I | |

Only II | |

Both I and II | |

Neither I nor II |

Question 5 Explanation:

Question 6 |

Which one of the following is NOT a valid identity?

(x\oplus y)\oplus z=x\oplus (y\oplus z) | |

(x+ y)\oplus z=x\oplus (y+z) | |

x\oplus y=x+y, \; if \; xy=0 | |

x\oplus y=(xy+x'y')' |

Question 6 Explanation:

Question 7 |

If L is a regular language over \Sigma =\{a,b\}, which one of the following languages is NOT regular ?

L\cdot L^R=\{xy|x \in L,y^R \in L\} | |

\{ww^R|w \in L\} | |

Prifix(L)={x \in \Sigma ^*|\exists y \in \Sigma ^* such that xy \in L} | |

Suffix(L)={y \in \Sigma ^*|\exists x \in \Sigma ^* such that xy \in L} |

Question 7 Explanation:

Question 8 |

Consider Z = X - Y where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a minimum of:

n bits | |

n-1 bits | |

n+1 bits | |

n+2 bits |

Question 8 Explanation:

Question 9 |

Let X be a square matrix. Consider the following two statements on X.

I. X is invertible

II. Determinant of X is non-zero

Which one of the following is TRUE?

I. X is invertible

II. Determinant of X is non-zero

Which one of the following is TRUE?

I implies II; II does not imply I | |

II implies I; I does not imply II | |

I does not imply II; II does not imply I | |

I and II are equivalent statements |

Question 9 Explanation:

Question 10 |

Let G be an arbitrary group. Consider the following relations on G:

R1: \forall a,b \in G, aR_1b if and only if \exists g \in G such that a=g^{-1}bg

R2: \forall a,b \in G, aR_2b if and only if a=b^{-1}

Which of the above is/are equivalence relation/relations?

R1: \forall a,b \in G, aR_1b if and only if \exists g \in G such that a=g^{-1}bg

R2: \forall a,b \in G, aR_2b if and only if a=b^{-1}

Which of the above is/are equivalence relation/relations?

R1 and R2 | |

R1 only | |

R2 only | |

Neither R1 nor R2 |

Question 10 Explanation:

There are 10 questions to complete.