search
Log In

Answers by akb1115

3 votes
1
#include <stdio.h> int main() { //int a; char c='a'; switch(c){ case 'a' && 1:printf("gate"); case 'b' && 1:printf("cse"); break; default: printf("2018"); } return 0; } what is the output for the program?
answered Oct 27, 2017 in Programming 71 views
18 votes
2
A link of capacity $100$ $\text{Mbps}$ is carrying traffic from a number of sources. Each source generates an on-off traffic stream; when the source is on, the rate of traffic is $10$ $\text{Mbps}$, and when the source is off, the rate of traffic is zero. The duty cycle, which is the ratio of ... , $10$ $\text{and}$ $30$ $12$ $\text{and}$ $25$ $5$ $\text{and}$ $33$ $15$ $\text{and}$ $22$
answered Oct 24, 2017 in Computer Networks 4.6k views
2 votes
3
Consider bandwidth of line is 100 Mbps and sequence number of field consists 32 bits on a TCP machine. How much time it will take to cover all possible sequence numbers? ________________ sec (integer value only).
answered Oct 24, 2017 in Computer Networks 291 views
15 votes
4
Ten chocolates are distributed randomly among three children standing in a row. The probability that the first child receives exactly three chocolates is $\frac{5 \times 2^{11}}{3^9}$ $\frac{5 \times 2^{10}}{3^9}$ $\frac{1}{3^9}$ $\frac{1}{3}$
answered Oct 22, 2017 in Probability 658 views
1 vote
6
Suppose that host A is connected to a router R 1, R 1 is connected to another router, R 2, and R 2 is connected to host B. Suppose that a TCP message that contains 900 bytes of data and 20 bytes of TCP header is passed to the IP code at host A for delivery ... 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 512 bytes including a 12-byte frame header.
answered Oct 19, 2017 in Computer Networks 2.7k views
2 votes
7
Suppose that host A is connected to a router R 1, R 1 is connected to another router, R2, and R2 is connected to host B. Suppose that a TCP message that contains 900 bytes of data and 20 bytes of TCP header is passed to the IP code at host A for delivery to ... 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 512 bytes including a 12-byte frame header.
answered Oct 19, 2017 in Computer Networks 344 views
0 votes
8
2 votes
9
I mean how it is a trivial property, we can write Tyes ( TM having even states) and Tno ( TM having odd states) for it.Can Turing machine can never have odd number of states?
answered Jul 18, 2017 in Theory of Computation 125 views
2 votes
11
Consider the following regular expression (RE) RE = (aa + ab)+ (a + b)+ (a + b)* How many minimal strings exist for the above RE? I think answer should be 1 i.e ἑ but answer given is 4.
answered Mar 21, 2017 in Programming 400 views
0 votes
12
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.
answered Jan 29, 2017 in DS 13.9k views
4 votes
13
A weather forecasting computation requires 250 billion floating point operations. The problem is processed in a super computer that can perform 100 mega flops. How long will it take to do these calculations?(in mins) a.  21.32      b. 31.42    c. 41.67   d. 38.67
answered Oct 9, 2016 in CO and Architecture 868 views
0 votes
14
0 votes
15
If it is asked for minimum states required in FA for some language, we can have both NFA and DFA, and NFA has lesser number of states but many books write that consider DFA as default. What to take into consideration in such case?NFA or DFA?
answered Jan 28, 2016 in Theory of Computation 265 views
0 votes
16
let L=(a,b,c)* | the length of x is square then L is - a)Regular b)recursive but not context free c)context free but not regular d)none of these.
answered Jan 28, 2016 in Theory of Computation 153 views
1 vote
17
Let $L_1$ and $L_2$ be languages over $\Sigma$ and assume that $L_1 \cap L_2 = \phi$. if $L_1$ is finite language and $L_1 \cup L_2$ is regular then $L_2$ is ____ ? a. Regular language and finite b. Regular language and infinite c. Need not be regular d. None of these.
answered Jan 25, 2016 in Theory of Computation 113 views
0 votes
18
my question is as it is odd length palindrome , so it can be ababa , right ? Now , in the given diagram , they have not mentioned the scenario : 1) when a is the stack top element and input symbol is b ( b , a / ? ) 2) when b is the stack top element and input symbol is a ( a, b / ? ) Now , my question is - without these two transitions can we design this pda ? ( as it is done in the given ans )
answered Jan 24, 2016 in Theory of Computation 658 views
0 votes
19
Can Anyone Explain clearly process { fork(); fork(); fork(); } what are the number of childs?
answered Jan 24, 2016 in Operating System 117 views
...