Consider a system with 2 level cache. Access times of Level 1 cache, Level 2 cache and main memory are 1 ns, 10 ns and 500 ns, respectively. The hit rates of Level 1 and Level 2 caches are 0.8 and 0.9, respectively. What is the average access time of the system ignoring the search time within the cache…………?
-
Solution
Level Access time
1 1 ns
2 10 ns
main memory 5000 nsSo average access time= 0.8 × 1 +0.2 × 0.9 × 10 + 0.2 × 0.1× 500= 12.6
What is the upper bound on the recurrence T(n) = 2T([n/2]+7)+n?
-
Solution
Which one of the following statements is FALSE?
-
Solution
Acceptability capability of deterministic and non deterministic push down automata are different, so both deterministic as well as non-deterministic automata not always accept the same set of language.Hence correct answer is (c).
What is the minimum number of NAND gates required to implement a 20-input EXCLUSIVE-OR function without using any other logic gate…………..?
-
Solution
Which one of the following regular expressions is NOT equivalent to the regular expression (a + b + c)*?
-
Solution
((ab)* +c*)* = {e, ab, abab, ab ab ab + c)*Contains the string which is not present in expansion of (a +b + c)*. Hence not equivalent.
What values of x, y and z satisfy the following system of linear equations?
\(\begin{bmatrix} 1 & 2 & 3\\ 1 & 3 & 4\\ 2 & 2 & 3 \end{bmatrix}\begin{bmatrix} x\\ y\\ z \end{bmatrix}=\begin{bmatrix} 6\\ 8\\ 12 \end{bmatrix}\)What is the maximum number of edges in an acyclic undirected graph with n vertices?
-
Solution
A acyclic undirectional graph with n node has n– 1 edges.Hence correct answer is (a).
Let R1 be a relation from A = {1, 3, 5, 7} to B = {2,4, 6,8} and R2 be another relation from B to C = {1, 2, 3, 4} as defined below:(i)An element x in A is related to an element y in B (under R1) if x + y is divisible by 3.(ii)An element x in B is related to an element y in C (under R2) if x + y is even but not divisible by 3.Which is the composite relation R1R2 from A to C?
-
Solution
A ={1, 3, 5, 7}
B = {2, 4, 6, 8}
C = {1, 2, 3, 4}
R1= A→B = {(1, 2) (1, 8) (5, 4) (7, 2) (7, 8)
R2 ®B→C = {(2, 2)(4, 4)(6, 2)(6, 4) (8,2)}
Let a(x, y), b(x, y) and c(x, y) be three statements with variables x and y chosen from some universe.
Consider the following statement:
(∃x)(∀y)[(a(x,y)^b)(x,y)v¬c(x,y)]
Which one of the following is its equivalent?
-
Solution
(∃x)(∀y)[(a(x,y)^b)(x,y)^c(x,y)] is same as ¬(∀x)(∃y)[(a(x,y)^b)(x,y)→c(x,y)]
In a population of N families, 50% of the families have three children, 30% of the families have two children and the remaining families have one child. What is the probability that a randomly picked child belongs to a family with two children?
-
Solution