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
Answers by santhoshdevulapally
1
votes
41
How many packets are in the buffer on an average?
Consider a router having buffer capacity to hold 5000 packets. The router is connected to multiple links which are having the bandwidth of 1 Gbps. Suppose the incoming data from 5 links are being redirected to one of its links. In these 5 ... 9/10 as incomin bits are 9 * 108 and outgoing flow is 109..but how to calculate average pakctes in buffer?
Consider a router having buffer capacity to hold 5000 packets. The router is connected to multiple links which are having the bandwidth of 1 Gbps. Suppose the incoming da...
621
views
answered
Jan 4, 2017
Computer Networks
computer-networks
+
–
1
votes
42
what is the total number of fragments received at destination?
Consider the network shown below. The MTU of networks given in the order 216, 1520 and 29 respectively in bytes. Assume the source has a packet of length 40000 bytes, what is the total number of fragments received at destination? ... (40000/488)= around 82 but if i do consider according to different MTU sizes then i will get diff answer
Consider the network shown below. The MTU of networks given in the order 216, 1520 and 29 respectively in bytes. Assume the source has a packet of length 40000 bytes, wha...
1.4k
views
answered
Jan 2, 2017
Computer Networks
computer-networks
+
–
2
votes
43
Minimal Finite Automata
What is the minimum no of states in the finite automata that accept all the strings over {0,1} where its binary equivalent is congruent to 2 modulo 5? Please explain.
What is the minimum no of states in the finite automata that accept all the strings over {0,1} where its binary equivalent is congruent to 2 modulo 5? Please explain.
1.2k
views
answered
Jan 2, 2017
3
votes
44
GATE CSE 1989 | Question: 13a
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$ ... Design a prefix binary code for the language which would minimize the average length of the encoded words of the language.
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$. The relative frequency of use of each letter of the alphabet in the language is as given be...
2.7k
views
answered
Dec 16, 2016
Algorithms
descriptive
gate1989
algorithms
huffman-code
+
–
2
votes
45
Permutation and combinations
Number of binary strings of length 10 with 3 consecutive 0's or 1's is ?
Number of binary strings of length 10 with 3 consecutive 0's or 1's is ?
2.2k
views
answered
Dec 15, 2016
Combinatory
combinatory
+
–
1
votes
46
Simplified CFG
Consider the following grammar $S\rightarrow Aa\mid B $ $B\rightarrow a\mid BC$ $C \rightarrow a\mid \in$ the no of productions in simplified cfg is
Consider the following grammar$S\rightarrow Aa\mid B $$B\rightarrow a\mid BC$$C \rightarrow a\mid \in$the no of productions in simplified cfg is
3.5k
views
answered
Dec 15, 2016
Compiler Design
compiler-design
context-free-grammar
+
–
5
votes
47
Algorithms Hashing
437
views
answered
Dec 15, 2016
Algorithms
algorithms
hashing
data-structures
test-series
+
–
4
votes
48
Master Theorem Algorithm
How is master theorem applicable here?
How is master theorem applicable here?
502
views
answered
Dec 15, 2016
Algorithms
master-theorem
algorithms
time-complexity
test-series
+
–
5
votes
49
MadeEasy Test Series: Algorithms - Time Complexity
Professor Arjun develops an algorithm to multiply two square matrix that is asmptoticaly faster than strassen's algorithm using divide and conquer method . Arjun's algorithm divide matrix into pieces of $\frac{n}{4} \times \frac{n}{4}$ create $'P'$ ... $P$ is ______-
Professor Arjun develops an algorithm to multiply two square matrix that is asmptoticaly faster than strassen's algorithm using divide and conquer method . Arjun's algori...
712
views
answered
Dec 15, 2016
Algorithms
made-easy-test-series
algorithms
time-complexity
+
–
1
votes
50
BST (DS)
17. The binary search tree contains the values—1, 2, 3, 4, 5, 6, 7 and 8. The tree is traversed in preorder and the values are printed out. Which of the following sequences is a valid output? (a) 5 3 1 2 4 7 8 6 (b) 5 3 1 2 6 4 8 7 (c) 5 3 2 4 1 6 7 8 (d) 5 3 1 2 4 7 6 8
17. The binary search tree contains the values—1, 2, 3, 4, 5, 6, 7 and 8. The tree is traversed in preorder and the values are printed out. Which of the following seque...
1.1k
views
answered
Dec 14, 2016
0
votes
51
made Easy compiler test q 10
correct answer
correct answer
336
views
answered
Dec 14, 2016
Compiler Design
compiler-design
parsing
operator-grammar
operator-precedence
made-easy-test-series
+
–
3
votes
52
Array-name and pointer manipulation + type casting
#include <stdio.h> int main() { int A[3][4] = {{1,2,3,4}, {4,5,6,7}, {8,9,10,11} }; int *p = &A[0][0]; int *q = (int*)(&A[0]+1); int *z = (int*)(&A+1); int *w = (int*)A; printf("%d\n",*(p + 1)); printf("%d\n",*(q - 2)); printf("%d\n",*(z - 2)); printf("%u %d\n",w,*(w+1)); }
#include <stdio.h int main() { int A[3][4] = {{1,2,3,4}, {4,5,6,7}, {8,9,10,11} }; int *p = &A[0][0]; int *q = (int*)(&A[0]+1); int *z = (int*)(&A+1); int *w = (int*)A; p...
1.2k
views
answered
Dec 14, 2016
Programming in C
programming-in-c
programming
+
–
1
votes
53
Gate 2016
737
views
answered
Dec 13, 2016
1
votes
54
Algorithm Time Complexity
Which of the following describes growth of f(x)? 1. Quadratic 2.Linear 3.Exponential 4.Logarithm
Which of the following describes growth of f(x)?1. Quadratic2.Linear3.Exponential4.Logarithm
808
views
answered
Dec 13, 2016
Algorithms
time-complexity
algorithms
+
–
3
votes
55
regular Language
r1 = 1 (0 + 1)* r2 = 1 (1 + 0)+ r3 = 11*0 Relation? (a) L (r1) ⊆ L (r2) and L(r1) ⊆ L(r3) (b) L (r1) ⊇ L (r2) and L(r2) ⊇ L(r3) (c) L (r1) ⊇ L (r2) and L(r2) ⊆ L(r3) (d) L (r1) ⊆ L (r3) and L(r2) ⊆ L(r1)
r1 = 1 (0 + 1)*r2 = 1 (1 + 0)+r3 = 11*0Relation?(a) L (r1) ⊆ L (r2) and L(r1) ⊆ L(r3) (b) L (r1) ⊇ L (r2) and L(r2) ⊇ L(r3)(c) L (r1) ⊇ L (r2) and ...
1.9k
views
answered
Dec 13, 2016
Theory of Computation
theory-of-computation
regular-language
+
–
3
votes
56
Time Complexity
Consider the following function for(int n) { for(i = 1; i <= n; i = i*2) { for(j = 1; j <= i; j = j*2) printf(“GATE 2017”); } }
Consider the following function for(int n) { for(i = 1; i <= n; i = i*2) { for(j = 1; j <= i; j = j*2) printf(“GATE 2017”); } }
3.9k
views
answered
Dec 12, 2016
Algorithms
algorithms
time-complexity
+
–
2
votes
57
MADE EASY TEST SERIES
Consider the following C program What will be the output of above program ?
Consider the following C program What will be the output of above program ?
338
views
answered
Dec 12, 2016
1
votes
58
binomial theorem and expansions
can anyone please explain these things: formula for (1-x)n formula for 1/(1-x)n general term in expansion of (1-x)n and 1/(1-x)n and coeffecient of a term in these expansions. please elaborate a little because i have read few ... these things are used but i am getting very confused.i dun know much about them and gathering info from internet is also confusing me.
can anyone please explain these things:formula for (1-x)nformula for 1/(1-x)ngeneral term in expansion of (1-x)n and 1/(1-x)nand coeffecient of a term in these expansions...
921
views
answered
Dec 12, 2016
Combinatory
engineering-mathematics
discrete-mathematics
combinatory
+
–
2
votes
59
Pointers and arrays
#include <stdio.h> int main() { int a[][3] = {1, 2, 3, 4, 5, 6}; int (*ptr)[3] = a; printf("%d %d ", (*ptr)[1], (*ptr)[2]); ++ptr; printf("%d %d\n", (*ptr)[1], (*ptr)[2]); return 0; } (a) 2 3 5 6 (b) 2 3 4 5 (c) 4 5 0 0 (d) none of the above
#include <stdio.h int main() { int a[][3] = {1, 2, 3, 4, 5, 6}; int (*ptr)[3] = a; printf("%d %d ", (*ptr) , (*ptr) ); ++ptr; printf("%d %d\n", (*ptr) , (*ptr) ); return ...
4.1k
views
answered
Dec 12, 2016
Programming in C
programming
pointers
array-of-pointers
array
+
–
0
votes
60
test book
a. m+n b. m+n-1 c. 2m+1 d. 2m+n-1
a. m+nb. m+n-1c. 2m+1d. 2m+n-1
400
views
answered
Dec 11, 2016
8
votes
61
MadeEasy Workbook [2017] Q33 - Efficiency of Cache using Write Through Scheme
Data: Hit Ratio for Read Op - 80% Hit Ratio for Write Op - 90% There are 30% updations. Cache Access time: 20ns [CMAT] MM Access Time - 100ns [MMAT] If there is a miss (either for read or write entire 2 block word block ... i.e. 11.9 Million Ops per sec Please tell me if it's right or wrong or how it will be solved.
Data:Hit Ratio for Read Op - 80%Hit Ratio for Write Op - 90%There are 30% updations.Cache Access time: 20ns [CMAT]MM Access Time - 100ns [MMAT]If there is a miss (either ...
1.2k
views
answered
Dec 11, 2016
CO and Architecture
cache-memory
write-through
co-and-architecture
+
–
1
votes
62
basic gate
A car alarm system is to be designed considering 4 inputs door closed(D),key in(K),seat pressure(S), seat belt closed(B). the alarm A should sound if: 1. the key is in and door is not closed 2. the door is closed the key is in, driver in the ... the system is to be designed with 2 input basic gates and inputs are available in basic forms only. how many number of gates are required???
A car alarm system is to be designed considering 4 inputs door closed(D),key in(K),seat pressure(S), seat belt closed(B).the alarm A should sound if:1. the key is in and ...
5.8k
views
answered
Dec 9, 2016
0
votes
63
Ace Test Series: Computer Networks - Flow Control Methods
630
views
answered
Dec 7, 2016
Computer Networks
ace-test-series
computer-networks
flow-control-methods
sliding-window
+
–
3
votes
64
GATE CSE 1993 | Question: 02.6
The value of the double integral $\int^{1}_{0} \int_{0}^{\frac{1}{x}} \frac {x}{1+y^2} dxdy$ is_________.
The value of the double integral $\int^{1}_{0} \int_{0}^{\frac{1}{x}} \frac {x}{1+y^2} dxdy$ is_________.
3.8k
views
answered
Dec 7, 2016
Calculus
gate1993
calculus
integration
normal
fill-in-the-blanks
out-of-gate-syllabus
+
–
0
votes
65
Are all options wrong?
336
views
answered
Dec 6, 2016
3
votes
66
Parse tree evaluation
626
views
answered
Dec 6, 2016
Compiler Design
compiler-design
parsing
test-series
numerical-answers
+
–
0
votes
67
ace test
264
views
answered
Dec 6, 2016
Page:
« prev
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register