Register
Filter

Recent activity by Geet

2 answers
5
Computer-network TCP-congestion-control
How is the initial slow-start threshold value (ssthresh) determined for the very first time of data transfer?
How is the initial slow-start threshold value (ssthresh) determined for the very first time of data transfer?
3 answers
6
Operating system context switch
Suppose time required to switch from user mode to kernel mode is t1 and from kernel mode to user mode is t2. which of the following is always true a) t1>t2 b) t1<t2 c) t1=t2 d) non-comparable
Suppose time required to switch from user mode to kernel mode is t1 and from kernel mode to user mode is t2. which of the following is always truea) t1>t2b) t1<t2c) t1=t2...
1 answer
7
Recurrence relation
Find a recurrence relation for the number of ternary strings of length n that do not contain two consecutive 0s or two consecutive 1s. Find the same for binary strings. Also write the initial conditions.
Find a recurrence relation for the number of ternary strings of length n that do not contain two consecutive 0s or two consecutive 1s.Find the same for binary strings.Als...
0 answers
9
Recurrence relation
How to determine asymptotic Lower bound, Upper bound and Tight bound for a recurrence relation. Explain with example.
How to determine asymptotic Lower bound, Upper bound and Tight bound for a recurrence relation.Explain with example.
1 answer
10
#recurrence relation
Find the recurrence relation for the number of binary strings not containing two consecutive zeros or two consecutive ones.
Find the recurrence relation for the number of binary strings not containing two consecutive zeros or two consecutive ones.
1 answer
12
Equivalency of diffetent automata
Write about the equivalency of different automata such as DFA, NFA, DPDA, NPDA, DTM, NTM. Which automata or machine can be converted to other machines and why? For example NFA can be converted to DFA, DPDA, NPDA, DTM, NTM.
Write about the equivalency of different automata such as DFA, NFA, DPDA, NPDA, DTM, NTM. Which automata or machine can be converted to other machines and why? For exampl...
3 answers
15
#algorithm
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
0 answers
16
#Algorithm #DFS
2 answers
17
what is the time complexity ?
sum=0; for(i=0;i<n;i++) for(j=0;j<i*i;j++) for(k=0;k<j;k++) sum++;
sum=0; for(i=0;i<n;i++) for(j=0;j<i*i;j++) for(k=0;k<j;k++) sum++;
8 answers
19
GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is$3...
1 answer
20
#minimized-dfa
Minimized DFA for a*b* + b*a* and a+b+ + b+a+
Minimized DFA for a*b* + b*a*anda+b+ + b+a+
1 answer
21
Theory of computation
Set of all strings over {0,1} containing at most one pair of consecutive 1's. Give regular expression and equivalent minimized DFA.
Set of all strings over {0,1} containing at most one pair of consecutive 1's.Give regular expression and equivalent minimized DFA.