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 ad140
5
answers
1
MadeEasy Test Series: Theory Of Computation - Finite Automata
Let L = {(aP)*⎪P is a prime number} and Σ={a}. The minimum number of states in NFA that accepts the language L are ________. i don't think it is even a regular language. then how can NFA be generated?
Let L = {(aP)*⎪P is a prime number} and Σ={a}. The minimum number of states in NFA that accepts the language L are ________.i don't think it is even a regular language...
2.2k
views
answered
Nov 1, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
12
answers
2
GATE CSE 2014 Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size u...
37.9k
views
commented
Oct 1, 2018
Computer Networks
gatecse-2014-set1
computer-networks
tcp
congestion-control
numerical-answers
normal
+
–
5
answers
3
GATE CSE 2016 Set 1 | Question: 16
Which of the following languages is generated by the given grammar? $S \rightarrow aS \mid bS \mid \varepsilon$ $\{ a^nb^m \mid n,m \geq 0\}$ $\{ w \in \{ a,b\}^* \mid w\text{ has equal number of a's and b's}\}$ $\{a^n \mid n \geq 0 \} \cup \{b^n \mid n \geq 0\} \cup \{a^n b^n \mid n \geq 0\}$ $\{ a,b\}^*$
Which of the following languages is generated by the given grammar?$$S \rightarrow aS \mid bS \mid \varepsilon$$$\{ a^nb^m \mid n,m \geq 0\}$$\{ w \in \{ a,b\}^* \mid w\t...
12.1k
views
commented
Sep 30, 2018
Theory of Computation
gatecse-2016-set1
theory-of-computation
context-free-language
normal
+
–
0
answers
4
CFG-Doubt
$L=a^mb^nc^pd^q | m+p=n+q, m,n,p,q>=0$ is the language CFG or CFL?
$L=a^mb^nc^pd^q | m+p=n+q, m,n,p,q>=0$is the language CFG or CFL?
329
views
commented
Sep 26, 2018
Theory of Computation
context-free-language
+
–
0
answers
5
MADE EASY TEST SERIES
Consider the following transactions: T₁= w(A);w(B);r(C);Commit T₂= w(B);r(B);Commit The number of schedules of T1 and T2 that are recoverable are_________?
Consider the following transactions:T₁= w(A);w(B);r(C);CommitT₂= w(B);r(B);CommitThe number of schedules of T1 and T2 that are recoverable are_________?
346
views
commented
Sep 14, 2018
1
answer
6
geeksforgeeks site
Consider the Deterministic Finite Automaton for input alphabets Σ = {a, b} L = The number of final state(s) will be (A) 2 (B) 1 (C) 3 (D) 6
Consider the Deterministic Finite Automaton for input alphabets Σ = {a, b}L = The number of final state(s) will be(A) 2(B) 1(C) 3(D) 6
959
views
answered
Sep 14, 2018
Theory of Computation
theory-of-computation
+
–
1
answer
7
Minimal DFA
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 > 1 and x >= 0 }.
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 1 and x >= 0 }.
995
views
commented
Sep 10, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
number-of-states
+
–
1
answer
8
Test series
T(n) = T(root(n)) + n where n>=2 Time complexity ?
T(n) = T(root(n)) + n where n>=2Time complexity ?
642
views
commented
Sep 10, 2018
Algorithms
algorithms
test-series
recurrence-relation
+
–
2
answers
9
probability of selecting an n-bit string in which there is a substring of length at least k in which each bit is a 1
An n-bit binary string is selected uniformly at random.For a k $\geq$ 1,what is the probability of selecting an n-bit string in which there is a substring of length at le...
986
views
commented
Sep 9, 2018
Probability
probability
+
–
2
answers
10
Linked list
What are sequential access structures? Are arrays or linked list the sequential access structures?
What are sequential access structures? Are arrays or linked list the sequential access structures?
3.3k
views
commented
Aug 30, 2018
Programming in C
data-structures
+
–
4
answers
11
MADE EASY TEST SERIES
Consider the following schedules involving two transactions. $S_1 : R_1(x), W_2(y),R_2(x),W_1(y), \ commit_1, \ commit_2$ $S_2 : R_1(x), R_2(y),W_1(z), \ commit_1,R_3(y), R_3(z), W_2(y), W_3(x), commit_2, commit_3$ Which of the following ... S2 are allowed under 2PL B) only S1 is allowed under 2PL C) only S2 is allowed under 2PL D) neither S1 nor S2 is allowed under 2PL
Consider the following schedules involving two transactions.$S_1 : R_1(x), W_2(y),R_2(x),W_1(y), \ commit_1, \ commit_2$$S_2 : R_1(x), R_2(y),W_1(z), \ commit_1,R_3(y), R...
3.5k
views
answered
Aug 30, 2018
Databases
transaction-and-concurrency
+
–
3
answers
12
Made Easy Computer Networks
A supernet has first address of 205.16.32.0 and a supernet mask of 255.255.248.0. How many blocks are in this supernet and what is the range of addresses?
A supernet has first address of 205.16.32.0 and a supernet mask of 255.255.248.0. How many blocks are in this supernet and what is the range of addresses?
3.6k
views
answered
Aug 30, 2018
Computer Networks
computer-networks
supernetting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register