# Questions 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
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}
5
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
6
draw an entity diagram for the given queston
7
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?
8
9
10
#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
11
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
1 vote
12
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?
13
the regular expression for the given finite automata plz provide ans step by step
14
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?
15
self doubt the minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*?
16
17