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 Sanandan
2
answers
1
GATE Overflow Test Series | Mixed Subjects | Test 3 | Question: 4
A context-free grammar $G$ is ambiguous if and only if some string $w \in L(G)$ has different leftmost and rightmost derivations. some string $w \in L(G)$ has at least two different parse trees. every string $w \in L(G)$ has at least two different parse trees. some string $w \in L(G)$ has at least two different leftmost derivations.
A context-free grammar $G$ is ambiguous if and only ifsome string $w \in L(G)$ has different leftmost and rightmost derivations.some string $w \in L(G)$ has at least two ...
111
views
commented
Jan 1, 2021
Theory of Computation
go2025-mix-3
context-free-grammar
multiple-selects
+
–
1
answer
2
GATE Overflow Test Series | Algorithms | Test 2 | Question: 17
Which of the following statements is/are TRUE with respect to the time complexities of the graph algorithms to find Minimum Spanning Trees? (Mark all the appropriate choices) Kruskal's algorithm to find MST runs in ... in adjacency list form, Prim's algorithm to find MST runs in $\Theta(V^2)$ using binary min-heap
Which of the following statements is/are TRUE with respect to the time complexities of the graph algorithms to find Minimum Spanning Trees? (Mark all the appropriate choi...
312
views
commented
Dec 24, 2020
Algorithms
go2025-algorithms-2
minimum-spanning-tree
multiple-selects
+
–
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
answered
Oct 6, 2020
Theory of Computation
gatecse-2016-set1
theory-of-computation
context-free-language
normal
+
–
3
answers
4
GATE CSE 1987 | Question: 1-xii
A context-free grammar is ambiguous if: The grammar contains useless non-terminals. It produces more than one parse tree for some sentence. Some production has two non terminals side by side on the right-hand side. None of the above.
A context-free grammar is ambiguous if:The grammar contains useless non-terminals.It produces more than one parse tree for some sentence.Some production has two non termi...
12.6k
views
answered
Oct 6, 2020
Theory of Computation
gate1987
theory-of-computation
context-free-language
ambiguous-grammar
+
–
2
answers
5
TIFR CSE 2014 | Part B | Question: 14
Which the following is FALSE? Complement of a recursive language is recursive. A language recognized by a non-deterministic Turing machine can also be recognized by a deterministic Turing machine. Complement of a context free language can ... enumerable then it is recursive. Complement of a non-recursive language can never be recognized by any Turing machine.
Which the following is FALSE?Complement of a recursive language is recursive.A language recognized by a non-deterministic Turing machine can also be recognized by a deter...
7.6k
views
commented
Oct 6, 2020
Theory of Computation
tifr2014
theory-of-computation
closure-property
+
–
4
answers
6
TIFR CSE 2013 | Part B | Question: 11
Which of the following statements is FALSE? The intersection of a context free language with a regular language is context free. The intersection of two regular languages is regular. The intersection of two context free languages is context ... language is context free. The intersection of a regular language and the complement of a regular language is regular.
Which of the following statements is FALSE?The intersection of a context free language with a regular language is context free.The intersection of two regular languages i...
2.5k
views
answered
Oct 6, 2020
Theory of Computation
tifr2013
theory-of-computation
easy
closure-property
+
–
6
answers
7
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
answered
Oct 6, 2020
Theory of Computation
gatecse-2018
theory-of-computation
closure-property
easy
1-mark
+
–
6
answers
8
GATE CSE 2017 Set 2 | Question: 04
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT? $L_1 \cup L_2$ is context-free $\overline{L_1}$ is context-free $L_1 - R$ is context-free $L_1 \cap L_2$ is context-free I, II and IV only I and III only II and IV only I only
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT?$L_1 \cup L_2$ is context-free$\overline{L_1}...
11.7k
views
answered
Oct 6, 2020
Theory of Computation
gatecse-2017-set2
theory-of-computation
closure-property
+
–
2
answers
9
GATE CSE 2016 Set 2 | Question: 18
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Context-free, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are TRUE ? $\overline{L_{3}} \cup L_{4}$ ... is context-free. I only. I and III only. I and IV only. I, II and III only.
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Context-free, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are TRU...
12.1k
views
commented
Oct 6, 2020
Theory of Computation
gatecse-2016-set2
theory-of-computation
regular-language
context-free-language
closure-property
normal
+
–
6
answers
10
GATE CSE 2013 | Question: 17
Which of the following statements is/are FALSE? For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. Turing recognizable languages are closed under union and complementation. Turing decidable languages are closed under intersection and ... and intersection. $1$ and $4$ only $1$ and $3$ only $2$ only $3$ only
Which of the following statements is/are FALSE?For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.Turing recognizable lan...
21.0k
views
answered
Oct 6, 2020
Theory of Computation
gatecse-2013
theory-of-computation
normal
closure-property
+
–
6
answers
11
GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ isalways regularnever regularalways a deterministic context-free languagealways...
9.8k
views
commented
Oct 6, 2020
Theory of Computation
gateit-2006
theory-of-computation
closure-property
easy
+
–
5
answers
12
GATE CSE 2002 | Question: 2.14
Which of the following is true? The complement of a recursive language is recursive The complement of a recursively enumerable language is recursively enumerable The complement of a recursive language is either recursive or recursively enumerable The complement of a context-free language is context-free
Which of the following is true?The complement of a recursive language is recursiveThe complement of a recursively enumerable language is recursively enumerableThe complem...
11.4k
views
answered
Oct 6, 2020
Theory of Computation
gatecse-2002
theory-of-computation
easy
closure-property
+
–
8
answers
13
GATE CSE 1989 | Question: 3-ii
Context-free languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
Context-free languages and regular languages are both closed under the operation (s) of :UnionIntersectionConcatenationComplementation
12.0k
views
answered
Oct 6, 2020
Theory of Computation
gate1989
easy
theory-of-computation
closure-property
multiple-selects
+
–
3
answers
14
GATE CSE 2016 Set 2 | Question: 42
Consider the following two statements: If all states of an NFA are accepting states then the language accepted by the NFA is $\Sigma_{}^{*}$. There exists a regular language $A$ such that for all languages $B$, $A \cap B$ is regular. Which one of the following is CORRECT? Only I is true Only II is true Both I and II are true Both I and II are false
Consider the following two statements:If all states of an NFA are accepting states then the language accepted by the NFA is $\Sigma_{}^{*}$.There exists a regular languag...
25.6k
views
commented
Oct 5, 2020
Theory of Computation
gatecse-2016-set2
theory-of-computation
finite-automata
normal
+
–
1
answer
15
made easy theory of computation regular expression
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s? a. (b*abb*) (a+€) b. (b+ab)* (a+€) c. (b*abb*)*(a+€)+b* d. (b*ab*)*(a+€)+b*(a+€)
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s?a. (b*abb*) (a+€)b. (b+ab)* (a+€)c. (...
2.2k
views
commented
Oct 5, 2020
Theory of Computation
regular-expression
theory-of-computation
finite-automata
+
–
2
answers
16
Minimization of DFA
5.8k
views
commented
Oct 5, 2020
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
3
answers
17
Minimization of DFA
DFA for Every 'a' followed by 'b'. The second one is correct but I want to know if the first one is correct or not? If not please share an example.
DFA for Every 'a' followed by 'b'. The second one is correct but I want to know if the first one is correct or not? If not please share an example.
1.8k
views
commented
Oct 5, 2020
5
answers
18
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?A. 5B. 6C 31D 32
4.4k
views
commented
Oct 4, 2020
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
19
Finite automata
The application of finite automata include:- a)Lexical Analyzer b)Text Editor c)Operating System d)All of the above
The application of finite automata include:-a)Lexical Analyzerb)Text Editorc)Operating Systemd)All of the above
1.2k
views
answered
Oct 4, 2020
Compiler Design
compiler-design
finite-automata
lexical-analysis
+
–
1
answer
20
No of states in finite automata whose string length is divisible by 3 or 8 ?
No of states in finite automata whose string length is divisible by 3 or8?
No of states in finite automata whose string length is divisible by 3 or8?
5.0k
views
commented
Oct 4, 2020
Theory of Computation
finite-automata
theory-of-computation
+
–
4
answers
21
GATE CSE 2008 | Question: 56
In the slow start phase of the TCP congestion algorithm, the size of the congestion window: does not increase increase linearly increases quadratically increases exponentially
In the slow start phase of the TCP congestion algorithm, the size of the congestion window:does not increaseincrease linearlyincreases quadraticallyincreases exponentiall...
10.1k
views
answered
Oct 4, 2020
Computer Networks
gatecse-2008
computer-networks
congestion-control
normal
+
–
10
answers
22
GATE IT 2005 | Question: 73
On a TCP connection, current congestion window size is Congestion Window = $4$ KB. The window size advertised by the receiver is Advertise Window = $6$ KB. The last byte sent by the sender is LastByteSent = $10240$ and the last byte acknowledged by ... LastByteAcked = $8192$. The current window size at the sender is: $2048$ bytes $4096$ bytes $6144$ bytes $8192$ bytes
On a TCP connection, current congestion window size is Congestion Window = $4$ KB. The window size advertised by the receiver is Advertise Window = $6$ KB. The last byte ...
26.1k
views
commented
Oct 4, 2020
Computer Networks
gateit-2005
computer-networks
congestion-control
normal
+
–
8
answers
23
GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...
25.6k
views
commented
Oct 4, 2020
Computer Networks
gatecse-2012
computer-networks
communication
normal
+
–
6
answers
24
GATE IT 2007 | Question: 64
A broadcast channel has $10$ nodes and total capacity of $10$ Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of $80$ μs to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of $1000$ bytes. The maximum throughput of the broadcast channel is: $1$ Mbps $100/11$ Mbps $10$ Mbps $100$ Mbps
A broadcast channel has $10$ nodes and total capacity of $10$ Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of $80$...
10.8k
views
commented
Oct 4, 2020
Computer Networks
gateit-2007
computer-networks
communication
normal
+
–
10
answers
25
UGC NET CSE | January 2017 | Part 3 | Question: 26
Station $A$ uses $32$ byte packets t transmit messages to station $B$ using sliding window protocol. The round trip delay between $A$ and $B$ is $40$ milliseconds and the bottleneck bandwidth on the path between $A$ and $B$ is $64$ kbps. The optimal window size of $A$ is $20$ $10$ $30$ $40$
Station $A$ uses $32$ byte packets t transmit messages to station $B$ using sliding window protocol. The round trip delay between $A$ and $B$ is $40$ milliseconds and the...
4.1k
views
commented
Oct 4, 2020
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
sliding-window
+
–
2
answers
26
NIELIT 2017 DEC Scientific Assistant A - Section B: 43
When we use slow-start algorithm, the size of the congestion window increases _______ until it reaches a threshold. Additively Multiplicatively Exponentially None of the options
When we use slow-start algorithm, the size of the congestion window increases _______ until it reaches a threshold.AdditivelyMultiplicativelyExponentiallyNone of the opti...
2.2k
views
answered
Oct 4, 2020
Computer Networks
nielit2017dec-assistanta
computer-networks
congestion-control
sliding-window
+
–
1
answer
27
Find the no. of tokens
Find no of tokens in below program. #include<stdio.h> main() { int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5); }
Find no of tokens in below program.#include<stdio.h>main(){ int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5);}
5.3k
views
commented
Oct 3, 2020
Compiler Design
compiler-tokenization
lexical-analysis
+
–
7
answers
28
Lexical vs Syntax Error
3.5k
views
answered
Oct 3, 2020
Compiler Design
compiler-design
lexical-analysis
ace-test-series
+
–
1
answer
29
Lexical Analysis
Consider the following code $x = (y + 5) + (^*z) * 10 - x /3 $ Which of the following correctly identified by lexical analysis after scanning the above code? 5 Identifiers 3 literals 4 Identifiers 6 literals
Consider the following code$x = (y + 5) + (^*z) * 10 - x /3 $Which of the following correctly identified by lexical analysis after scanning the above code?5 Identifiers...
1.9k
views
commented
Oct 3, 2020
Compiler Design
compiler-design
lexical-analysis
+
–
5
answers
30
Lexical Analysis
What it the number of tokens in the following line? printf("%d numbers.", &x);
What it the number of tokens in the following line?printf("%d numbers.", &x);
1.8k
views
answered
Oct 3, 2020
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register