Log In

Recent activity by suneetha

0 answers
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 admission in nit’s or iiit’s and please give me the list of universitie’s of information where can i get admission
asked Apr 5, 2019 in NITs 131 views
0 answers
please gie the answer
asked Feb 6, 2019 in Algorithms 106 views
1 answer
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 answers
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
closed Jan 23, 2019 in Theory of Computation 21 views
0 answers
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 answers
1 answer
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
answered Jan 15, 2019 in CO and Architecture 165 views
0 answers
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?
commented Jan 15, 2019 in CO and Architecture 119 views
0 answers
draw an entity diagram for the given queston
asked Jan 14, 2019 in Databases 17 views
5 answers
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$
commented Jan 8, 2019 in Algorithms 4.5k views
5 answers
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
commented Jan 7, 2019 in Algorithms 6.1k views
0 answers
#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
commented Jan 5, 2019 in Programming 65 views
1 answer
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 answer
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
1 answer
the regular expression for the given finite automata plz provide ans step by step
asked Dec 24, 2018 in Theory of Computation 87 views
1 answer
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
2 answers
3 answers
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$
commented Dec 21, 2018 in Theory of Computation 9.6k views
3 answers
Consider a computer has 64 registers and support 15 different instructions. Each instruction has 4 fields i.e. opcode, source register, destination register and immediate value of 6 bits. If each instruction in byte aligned and 50 instructions are present in ... the answer My question is, in this question what is difference between computer has 15 instruction and memory has 50 instructions?
commented Dec 18, 2018 in CO and Architecture 625 views
0 answers
consider a 900KB memory is managed using variable partitions but no compaction it currently has 3 processes occupied partition sizes 212KB 114KB and 100KB respectively which of the following smallest request wil be denied a)475 b)285 c)355 d)none of the above
asked Dec 17, 2018 in Operating System 277 views
1 answer
consider a network connecting two nodes A and B having a propagation delay of 6*10^-4 micro sec.bandwidth of network is 150 Mbps if each frame size is 5000 bytes and both uses go back n sliding window protocal, where maximum 100 frames can be sent at a time then the maximum possible data rate is ----- [ mbps]
commented Dec 10, 2018 in Computer Networks 386 views