Register
Filter

Questions by Geet

1 votes
2 answers
3
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?
2 votes
3 answers
4
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 votes
0 answers
5
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.
0 votes
1 answer
6
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 votes
1 answer
7
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...
6 votes
1 answer
8
#Algorithm # DFS
Let G be a graph with n vertices and m edges. a. True or false: All its DFS forests (for traversals starting at different vertices) will have the same number of trees? b. True or false: All its DFS forests will have the same number of tree edges and the same number of back edges?
Let G be a graph with n vertices and m edges.a. True or false: All its DFS forests (for traversals starting at different vertices) will have the same number of trees?b. T...
0 votes
0 answers
9
#Algorithm #DFS
2 votes
3 answers
10
#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 votes
1 answer
11
#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.
0 votes
1 answer
12
#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 votes
1 answer
13
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.