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 oldDoctor
2
answers
1
GATE CSE 1994 | Question: 15
Use the patterns given to prove that $\sum\limits_{i=0}^{n-1} (2i+1) = n^2$ (You are not permitted to employ induction) Use the result obtained in (A) to prove that $\sum\limits_{i=1}^{n} i = \frac{n(n+1)}{2}$
Use the patterns given to prove that$\sum\limits_{i=0}^{n-1} (2i+1) = n^2$(You are not permitted to employ induction)Use the result obtained in (A) to prove that $\sum\li...
2.0k
views
commented
Oct 4, 2019
Combinatory
gate1994
combinatory
proof
summation
descriptive
+
–
8
answers
2
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$$S \rightarrow abScT \mid abcT$$$$T \rightarrow bT \mid ...
21.7k
views
commented
Sep 17, 2019
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
6
answers
3
GATE CSE 2018 | Question: 7
The set of all recursively enumerable languages is: closed under complementation closed under intersection a subset of the set of all recursive languages an uncountable set
The set of all recursively enumerable languages is:closed under complementationclosed under intersectiona subset of the set of all recursive languagesan uncountable set
11.5k
views
commented
Sep 17, 2019
Theory of Computation
gatecse-2018
theory-of-computation
closure-property
easy
1-mark
+
–
2
answers
4
GATE CSE 1988 | Question: 2ix
What is the type of the language $L$, where $L=\{a^n b^n \mid 0 < n < 327 \text{-th prime number} \}$
What is the type of the language $L$, where $L=\{a^n b^n \mid 0 < n < 327 \text{-th prime number} \}$
3.0k
views
commented
Sep 17, 2019
Theory of Computation
gate1988
normal
descriptive
theory-of-computation
identify-class-language
+
–
1
answer
5
GATE CSE 1996 | Question: 12
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively. Display the transition diagram for a machine that recognizes $L_1.L_2$, obtained from transition diagrams for $M_1$ ... $\varepsilon$ transitions and no new states. (Final states are enclosed in double circles).
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively.Display the transition diagram fo...
8.5k
views
commented
Sep 15, 2019
Theory of Computation
gate1996
theory-of-computation
finite-automata
normal
descriptive
+
–
9
answers
6
GATE CSE 2010 | Question: 41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automati...
23.9k
views
commented
Sep 14, 2019
Theory of Computation
gatecse-2010
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
2
answers
7
GATE CSE 1997 | Question: 70
Following is a state table for time finite state machine. ... . For example if states $X$ and $Y$ are equivalent then use $XY$ as the name for the equivalent state in the minimal machine).
Following is a state table for time finite state machine.$$\begin{array}{|l|ll|}\hline \textbf{Present State} & \textbf{Next State Output} \\ & \textbf{Input- 0} & \t...
7.8k
views
commented
Aug 7, 2019
Theory of Computation
gate1997
theory-of-computation
minimal-state-automata
descriptive
+
–
3
answers
8
TIFR CSE 2010 | Part B | Question: 25
Which of the following problems is decidable? (Here, CFG means context free grammar and CFL means context free language.) Given a CFG $G$, find whether $L(G) = R$, where $R$ is regular set. Given a CFG $G$, find whether $L(G) = \{\}$. Find whether ... whether CFG $G_1$ and CFG $G_2$ generate the same language, i.e, $L\left (G_1 \right ) = L\left (G_2 \right)$.
Which of the following problems is decidable? (Here, CFG means context free grammar and CFL means context free language.)Given a CFG $G$, find whether $L(G) = R$, where $...
4.8k
views
commented
Aug 4, 2019
Theory of Computation
tifr2010
theory-of-computation
context-free-language
decidability
+
–
2
answers
9
Self Doubt Process State
For a process the termination state lies in which memory? Main or Secondary memory?
For a process the termination state lies in which memory? Main or Secondary memory?
384
views
answered
Jun 27, 2019
Operating System
process-state
process
+
–
10
answers
10
GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....
34.2k
views
commented
Dec 11, 2018
Operating System
gatecse-2009
operating-system
resource-allocation
normal
+
–
1
answer
11
Transmission Protocol
Suppose, In Selective Repeat Protocol 10 packets are sent and every 4th packet is lost. Then, 1 2 3 4 4 5 6 7 7 8 9 10 10 {bold denote lost packets, so retransmitted!} Is this the right order of transmission of packet no.??
Suppose, In Selective Repeat Protocol 10 packets are sent and every 4th packet is lost. Then, 1 2 3 4 4 5 6 7 7 8 9 10 10 {bold denote lost packets, so retransmitted!} I...
1.4k
views
answered
May 9, 2018
Computer Networks
computer-networks
sliding-window
selective-repeat
+
–
2
answers
12
Sliding window protocol
Why sender and receiver window size are same in selective repeat?
Why sender and receiver window size are same in selective repeat?
744
views
answered
May 5, 2018
Computer Networks
selective-repeat
sliding-window
computer-networks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register