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 Aishik
3
answers
1
Token Bucket
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second. Tokens arrive at a rate to sustain output at a rate of 10 mega ... of data. If the system is initially idle for 2 seconds, then the minimum time required to transmit the data is ____________ seconds.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega byte...
2.6k
views
commented
Jan 12, 2018
3
answers
2
minimum number of NAND and NOR gates
Is there any systematic approach to find the minimum number of two input NAND gates and two input NOR gates to be used to impelement a binary expression? If there then please elaborate it for the function Y = A'B+B'C+CD' .
Is there any systematic approach to find the minimum number of two input NAND gates and two input NOR gates to be used to impelement a binary expression?If there then ple...
34.2k
views
answer edited
May 31, 2017
Digital Logic
digital-logic
min-no-gates
+
–
3
answers
3
data structure
678
views
answered
May 9, 2017
3
answers
4
Data Structures AVL Tree
Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 b) 5 4 3 2 1 c) 3 2 4 1 5 d) 4 3 1 2 5
Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 ...
802
views
answered
May 8, 2017
Programming in C
avl-tree
data-structures
+
–
1
answer
5
keneth r rosen
how to find / what will be the DNF(Disjunctive normal form) of :
how to find / what will be the DNF(Disjunctive normal form) of :
391
views
answered
May 7, 2017
Mathematical Logic
boolean-algebra
+
–
2
answers
6
keneth r rosen
how to solve this using rules of boolean algebra:
how to solve this using rules of boolean algebra:
760
views
answered
May 7, 2017
Mathematical Logic
boolean-algebra
+
–
1
answer
7
Regular expression describe the same set of string as Grammar
Consider the following Grammar S -> Ax/By A->By/Cw B->x/Bw which of the regular expression describe the same set of strings as the grammar? The option are: (a) xw* y + xw* yx +ywx (b) xwy + xw* xy +ywx (c) xw* y + xw X yx +ywx (d) xw xy + xww* y +ywx
Consider the following GrammarS - Ax/ByA->By/CwB->x/Bwwhich of the regular expression describe the same set of strings as the grammar? The option are:(a) xw* y + xw* yx +...
2.5k
views
commented
May 7, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
8
Turing machine
Design a turing machine that accept the language of odd integer written in binary
Design a turing machine that accept the language of odd integer written in binary
2.5k
views
answered
May 5, 2017
Theory of Computation
theory-of-computation
turing-machine
+
–
1
answer
9
Thegate book
If $n$ number of variables how many 'dual' expression is possible?
If $n$ number of variables how many 'dual' expression is possible?
423
views
commented
May 4, 2017
Digital Logic
digital-logic
+
–
2
answers
10
GATE CSE 2014 Set 3 | Question: 36
Consider the following languages over the alphabet $\sum = \{0, 1, c\}$ $L_1 = \left\{0^n1^n\mid n \geq 0\right\}$ $L_2 = \left\{wcw^r \mid w \in \{0,1\}^*\right\}$ ... the string $w$. Which of these languages are deterministic Context-free languages? None of the languages Only $L_1$ Only $L_1$ and $L_2$ All the three languages
Consider the following languages over the alphabet $\sum = \{0, 1, c\}$$L_1 = \left\{0^n1^n\mid n \geq 0\right\}$$L_2 = \left\{wcw^r \mid w \in \{0,1\}^*\right\}$$L_3 = ...
9.9k
views
commented
May 4, 2017
Theory of Computation
gatecse-2014-set3
theory-of-computation
identify-class-language
context-free-language
normal
+
–
4
answers
11
Recursive languages.
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
2.1k
views
answer edited
May 3, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register