# Recent activity by suneetha

1
in gate 2019 my marks are 29.67 and my gate score is 352 in general category please give some information about is there any chance of getting m.tech admission in nit’s or iiit’s and please give me the list of universitie’s of information where can i get m.tech admission
2
3
T(n)=T(7n/8)+0.05 solve this equation and find out the time complexity?
4
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
5
please construct a pda for the language l={w belongs to {0,1,2}* the number of 0’s is exactly 3 times the number of 1’s}
6
If TCP RTT is currently 20 ms and following acknowledgement come in after 22,24 and 23 ms respectively. What is new RTT estimate ? 28.527 28.82 20.82 21.22
7
Consider a two level cache system. For 100 memory references, 16 misses in the first level cache and 8 misses in the second level cache. Miss penalty from L2 cache to memory is 50 cycles. The hit time of L2 cache is 5 cycles and hit time of the L1 cache is 1 clock cycle. What is the average memory access ... x Miss penalty of L2 = ((16/ 100) x 5) + ((16/ 100) (8 / 16) x 50) = (16/ 100) (26)=4.8
8
consider a 12 bit physical address and a direct-mapped cache with 64 blocks and each block has a size of 16 bytes. To which block number does the byte address 1200 map?
9
draw an entity diagram for the given queston
10
11
12
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
13
Let $G$ be an undirected connected graph with distinct edge weights. Let $e_{max}$ be the edge with maximum weight and $e_{min}$ the edge with minimum weight. Which of the following statements is false? Every minimum spanning tree of $G$ must contain $e_{min}$ ... spanning tree, then its removal must disconnect $G$ No minimum spanning tree contains $e_{max}$ $G$ has a unique minimum spanning tree
14
#include<stdio.h> int main() { code(4); return 0; } int code(int m) { if(m>0){ int i=1; for(;i<3;i++){ code(m-i); code(m-i-1); printf("MadeEasy"); } } return 0; } the number of times made easy will be printed? plz explain in detail
15
for 2 relations R(A,B) with functional dependency F={A->B} and S(B,C) witht functional dependency S={B->C} natural join of R and S is in BCNF
16
64,128 32,16 32,128 64,32
17
Let $A=\begin{bmatrix} 2\\-4 \\7 \end{bmatrix}.\begin{bmatrix} 1 &9 &5 \end{bmatrix}$ and $x,y$ and $z$ be the eigenvalue of $A$, then the value of $xyz$ is equal to?
18
the regular expression for the given finite automata plz provide ans step by step
19
consider the following problems p1: {<M,x,k>| M is a Turing machine M does not halt on x within k steps } p2:{<M>|M is a Turing machine and M accepts at least two strings of different length} p3:{<M>| M is a Turing machine and there exists an input whose length is less than 100 on which M halts } the problems which are RE but not REC?
20
self doubt the minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*?
21
22
23
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
24
25
G1: S-→ aSa| bSb|e G2:S--→ aaS|bbS| e the shortest length strings which does not belongs to L(g1) but belongs to L(G2) is
26
the length of the shortest string which is not present in the regular expression 1*(0+10)*1* is?
Consider the NPDA $\left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \perp, F =\left \{ q_{2} \right \} \right \rangle$ ... is as follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$