# Recent activity by Astitva Srivastava

1
Question: $T(1)=1$ $T(n) = 2 T(n - 1) + n$ evaluates to? Can anyone solve it by substitution method? Given answer $T(n) = 2^{n+1} - (n+2)$ How?
2
Consider a cache as follows: Direct mapped 8 words total cache data size 2 words block size A sequence of eight memory read is performed in the order shown from the following addresses: 0 , 11 , 4 , 14 , 9 , 1 , 8 , 0 Calculate No. of misses No of compulsory misses No. of conflict misses No. of capacity misses
3
There are $4$ women $P, Q, R, S$ and $5$ men $V, W, X, Y, Z$ in a group. We are required to form pairs each consisting of one woman and one man. $P$ is not to be paired with $Z$, and $Y$ must necessarily be paired with someone. In how many ways can $4$ such pairs be formed? $74$ $76$ $78$ $80$
4
Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________
5
I'm facing a problem these days, the question is saying the following: " Imagine we are having an array of positive integers called (a) and a variable called (k). Among this integers, we are looking for two numbers such that the sum of these two would be the (k). we ... ----- numbers: 6,2 in this case what would be the designing of the algorithm? Thank you all for your efforts, they worth a lot!
6
Which of the following statements is/are not correct? (P) The class of all Turing Machines is countably infinite (Q) The class of all DCFL's is countably infinite (R) The class of all formal languages is uncountably infinite (S) The set of all primes is countably infinite Only R Only R and S All are incorrect except P None of the above
7
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is even. The probability of getting any even numbered face is the same. If the probability that the face is ... one of the following options is closest to the probability that the face value exceeds $3$? $0.453$ $0.468$ $0.485$ $0.492$
8
A computer uses $46-bit$ virtual address, $32-bit$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $(T1)$, which occupies exactly one page. Each entry of $T1$ stores the base address of a page of ... cache block size is $64$ bytes. What is the size of a page in $KB$ in this computer? $2$ $4$ $8$ $16$
9
Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the colour white. Gulab and Neel like all the colours. In how many different ways can they choose the shirts so that no one has a shirt with a colour he or she dislikes? $21$ $18$ $16$ $14$
Consider the following cache A and B .let the average access times in cache A and B is $t_A$ and $t_B$ respectively.the value of $t_A+t_B$ _(in ns) Answer is given as 30.18 ns I am getting 31.2 ns .Please verify it .
Q- Which one of following languages is inherently ambiguous? (A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$ (B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$ (C) $\left\{a^nb^nc^md^m,n,m>0 \right\}\;\cup \;\left\{a^nb^mc^md^n,n,m>0 \right\}$ (D) Both (B) and (C) Plz explain.. ..........Is there any criteria on the basis of which we could identify inherently ambiguous grammar