Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by suneetha
0
answers
1
gate 2019
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
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’...
505
views
asked
Apr 5, 2019
NITs
gate-2019
+
–
0
answers
2
textbook
please gie the answer
please gie the answer
367
views
asked
Feb 6, 2019
2
answers
3
textbook
T(n)=T(7n/8)+0.05 solve this equation and find out the time complexity?
T(n)=T(7n/8)+0.05solve this equation and find out the time complexity?
505
views
asked
Feb 5, 2019
Algorithms
recurrence-relation
testbook-test-series
+
–
0
answers
4
textbook
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
146
views
closed
Jan 23, 2019
0
answers
5
text book
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}
please construct a pda for the languagel={w belongs to {0,1,2}* the number of 0’s is exactly 3 times the number of 1’s}
217
views
asked
Jan 23, 2019
2
answers
6
MadeEasy Subject Test 2019: Computer Networks - Tcp
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
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.52728.8220.8221.22
861
views
commented
Jan 17, 2019
Computer Networks
computer-networks
tcp
made-easy-test-series
+
–
1
answer
7
general
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 ... Miss penalty of L2 = ((16/ 100) x 5) + ((16/ 100) (8 / 16) x 50) = (16/ 100) (26)=4.8
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 mem...
550
views
answered
Jan 15, 2019
0
answers
8
textbook
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?
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?
716
views
commented
Jan 15, 2019
CO and Architecture
co-and-architecture
cache-memory
+
–
0
answers
9
textbook
draw an entity diagram for the given queston
draw an entity diagram for the given queston
224
views
asked
Jan 14, 2019
0
answers
10
MadeEasy Test Series 2019: Digital Logic - Hamming Code
plz tell the answer
plz tell the answer
653
views
commented
Jan 12, 2019
Digital Logic
digital-logic
hamming-code
made-easy-test-series
+
–
4
answers
11
GATE CSE 1999 | Question: 2.20
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$
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 ...
14.6k
views
commented
Jan 8, 2019
Algorithms
gate1999
algorithms
normal
greedy-algorithm
+
–
5
answers
12
GATE CSE 2000 | Question: 2.18
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 ... , then its removal must disconnect $G$ No minimum spanning tree contains $e_{max}$ $G$ has a unique minimum spanning tree
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 th...
15.6k
views
commented
Jan 7, 2019
Algorithms
gatecse-2000
algorithms
spanning-tree
normal
+
–
2
answers
13
MadeEasy Test Series: Programming & DS - Programming In C
#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
#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); ...
411
views
commented
Jan 5, 2019
Programming in C
made-easy-test-series
programming-in-c
+
–
1
answer
14
made easy
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
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
260
views
asked
Dec 30, 2018
Databases
databases
+
–
1
answer
15
IP Address allocation
64,128 32,16 32,128 64,32
64,12832,1632,12864,32
895
views
commented
Dec 30, 2018
Computer Networks
computer-networks
ip-addressing
subnetting
+
–
1
answer
16
engineering maths
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?
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 eq...
286
views
asked
Dec 25, 2018
Linear Algebra
engineering-mathematics
+
–
1
answer
17
regular expression
the regular expression for the given finite automata plz provide ans step by step
the regular expression for the given finite automata plz provide ans step by step
377
views
asked
Dec 24, 2018
Theory of Computation
regular-expression
+
–
1
answer
18
MadeEasy Test Series: Theory Of Computation - Recursive And Recursive Enumerable Languages
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 ... exists an input whose length is less than 100 on which M halts } the problems which are RE but not REC?
consider the following problemsp1: {<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 o...
1.3k
views
asked
Dec 24, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
1
answer
19
MadeEasy Test Series: Theory Of Computation - Regular Expressions
self doubt the minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*?
self doubtthe minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*?
454
views
commented
Dec 23, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
regular-expression
+
–
0
answers
20
MadeEasy Subject Test 2018: Theory Of Computation - Regular Grammar
524
views
commented
Dec 23, 2018
1
answer
21
MadeEasy Subject Test 2019: Theory Of Computation - Finite Automata
what is the answer
what is the answer
910
views
commented
Dec 22, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
2
answers
22
MadeEasy Test Series: Theory Of Computation - Grammar
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
347
views
asked
Dec 22, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
grammar
+
–
1
answer
23
MadeEasy Test Series: Theory Of Computation - Grammar
what is the answer
what is the answer
634
views
commented
Dec 22, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
grammar
+
–
1
answer
24
MadeEasy Test Series: Theory Of Computation - Grammar
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
G1: S-→ aSa| bSb|eG2:S → aaS|bbS| ethe shortest length strings which does not belongs to L(g1) but belongs to L(G2) is
555
views
commented
Dec 22, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
grammar
+
–
1
answer
25
MadeEasy Subject Test 2019: Theory Of Computation - Regular Expressions
the length of the shortest string which is not present in the regular expression 1*(0+10)*1* is?
the length of the shortest string which is not present in the regular expression 1*(0+10)*1* is?
637
views
asked
Dec 22, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
regular-expression
+
–
4
answers
26
GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA ... 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$
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}, \p...
23.8k
views
commented
Dec 21, 2018
Theory of Computation
gatecse-2015-set1
theory-of-computation
pushdown-automata
normal
+
–
3
answers
27
Instruction Format
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 ... answer My question is, in this question what is difference between computer has 15 instruction and memory has 50 instructions?
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...
2.5k
views
commented
Dec 18, 2018
CO and Architecture
machine-instruction
instruction-format
co-and-architecture
+
–
1
answer
28
MadeEasy Subject Test 2019: Computer Networks - Flow Control Methods
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]
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...
1.7k
views
commented
Dec 10, 2018
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
sliding-window
+
–
2
answers
29
TCP Congestion window
Assume the scenario where size of the congestion window of a TCP connection be 40KB when timeout occurs. The MSS is 2KB. Propagation delay be 200msec. Time taken by TCP connection to get back to 40KB congestion window is …...
Assume the scenario where size of the congestion window of a TCP connection be 40KB when timeout occurs. The MSS is 2KB. Propagation delay be 200msec. Time taken by TCP c...
1.2k
views
answer edited
Dec 9, 2018
Computer Networks
computer-networks
tcp
congestion-control
+
–
0
answers
30
MadeEasy Workbook: Computer Networks - Sliding Window
Consider a sliding window protocol operating at the data link layer between two stations 1000 kilometers apart, directly connected by an error-free 1.0 Mbps link. The frame sizes used are 500 bits, of which 50 bits are header and 450 bits are data ... delay is 10 µsec/km. If a window size of W = 10 is used, then the efficiency of the channel is
Consider a sliding window protocol operating at the data link layer between two stations 1000kilometers apart, directly connected by an error-free 1.0 Mbps link. The fram...
877
views
comment edited
Dec 6, 2018
Computer Networks
computer-networks
sliding-window
made-easy-booklet
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register