Question 13 Consider a set-associative cache of size 2KB (1KB = 210bytes) with cache block size of 64 bytes. Assume that the cache is byte-addressable and […]
Consider a computer system with DMA support, The DMA module is transferring one 8-bit character in one CPU cycle from a device to memory through cycle […]
Question 12 Assume a two-level inclusive cache hierarchy, L1 and L2, where L2 is the larger of the two. Consider the following statements. S1:Read misses in […]
(A + B) A’B’ is equivalent to Correct Answer: A Question 7 Explanation: We can solve this boolean expression into 2 ways. 1. Boolean simplification 2. […]
Consider the following assertion (A) and reason (R) and select the correct code given below: (A): No man is perfect. (R): Some men are not perfect. […]
The minimum height of an AVL tree with n nodes is Correct Answer: A Question 8 Explanation: Minimum: ceil(log2(n+1)) Maximum: floor(1.44*log2(n+2)-.328) Node: Option B is most […]
Arrange the following functions in increasing asymptotic order: A. n1/3 B. en C. n7/4 D. n log9n E. 1.0000001n Correct Answer: A Question 10 Explanation: A […]
The following circuit compares two 2-bit binary numbers, X and Y represented by X1X0 and Y1Y0 respectively. ( X0 and Y0 represent Least Significant Bids) Under […]
Question 25 Let R(A,B,C,D) be a relational schema with the following function dependencies A->B,B->C C->D and D->B The decomposition of R into (A,B)(B,C)(B,D) A gives a […]
Question 1 A set of Boolean connectives is functionally complete if all Boolean functions can be synthesized using those. Which of the following sets of connectives […]