search
Log In

Questions by suneetha

0 votes
0 answers
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
asked Apr 5, 2019 in NITs 131 views
0 votes
0 answers
2
please gie the answer
asked Feb 6, 2019 in Algorithms 106 views
0 votes
1 answer
3
T(n)=T(7n/8)+0.05 solve this equation and find out the time complexity?
asked Feb 5, 2019 in Algorithms 113 views
0 votes
0 answers
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}
asked Jan 23, 2019 in Theory of Computation 38 views
0 votes
0 answers
5
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
asked Jan 23, 2019 in Theory of Computation 21 views
0 votes
0 answers
6
draw an entity diagram for the given queston
asked Jan 14, 2019 in Databases 17 views
0 votes
0 answers
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?
asked Jan 14, 2019 in CO and Architecture 119 views
0 votes
0 answers
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
asked Jan 5, 2019 in Programming 65 views
0 votes
1 answer
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
asked Dec 30, 2018 in Databases 40 views
1 vote
1 answer
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?
asked Dec 25, 2018 in Linear Algebra 86 views
0 votes
1 answer
13
the regular expression for the given finite automata plz provide ans step by step
asked Dec 24, 2018 in Theory of Computation 87 views
0 votes
1 answer
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?
asked Dec 24, 2018 in Theory of Computation 241 views
0 votes
2 answers
18
0 votes
1 answer
20
...