Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Sanandan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Sanandan
5
answers
1
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\}^*$
answered
in
Theory of Computation
Oct 6, 2020
9.5k
views
gatecse-2016-set1
theory-of-computation
context-free-language
normal
2
answers
2
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.
answered
in
Theory of Computation
Oct 6, 2020
10.9k
views
gate1987
theory-of-computation
context-free-language
ambiguous-grammar
2
answers
3
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.
commented
in
Theory of Computation
Oct 6, 2020
6.4k
views
tifr2014
theory-of-computation
closure-property
4
answers
4
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.
answered
in
Theory of Computation
Oct 6, 2020
2.1k
views
tifr2013
theory-of-computation
closure-property
6
answers
5
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
answered
in
Theory of Computation
Oct 6, 2020
9.2k
views
gatecse-2018
theory-of-computation
closure-property
easy
1-mark
6
answers
6
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
answered
in
Theory of Computation
Oct 6, 2020
9.8k
views
gatecse-2017-set2
theory-of-computation
closure-property
2
answers
7
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.
commented
in
Theory of Computation
Oct 6, 2020
9.7k
views
gatecse-2016-set2
theory-of-computation
regular-language
context-free-language
closure-property
normal
6
answers
8
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
answered
in
Theory of Computation
Oct 6, 2020
18.8k
views
gatecse-2013
theory-of-computation
normal
closure-property
6
answers
9
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
commented
in
Theory of Computation
Oct 6, 2020
7.5k
views
gateit-2006
theory-of-computation
closure-property
easy
4
answers
10
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
answered
in
Theory of Computation
Oct 6, 2020
9.6k
views
gatecse-2002
theory-of-computation
easy
closure-property
7
answers
11
GATE CSE 1989 | Question: 3-ii
Context-free languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
answered
in
Theory of Computation
Oct 6, 2020
9.9k
views
gate1989
easy
theory-of-computation
closure-property
multiple-selects
3
answers
12
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
commented
in
Theory of Computation
Oct 5, 2020
18.5k
views
gatecse-2016-set2
theory-of-computation
finite-automata
normal
1
answer
13
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+€)
commented
in
Theory of Computation
Oct 5, 2020
2.0k
views
regular-expression
theory-of-computation
finite-automata
2
answers
14
Minimization of DFA
commented
in
Theory of Computation
Oct 5, 2020
3.7k
views
theory-of-computation
minimal-state-automata
finite-automata
3
answers
15
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.
commented
in
Theory of Computation
Oct 5, 2020
1.2k
views
5
answers
16
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
commented
in
Theory of Computation
Oct 4, 2020
3.5k
views
theory-of-computation
finite-automata
2
answers
17
Finite automata
The application of finite automata include:- a)Lexical Analyzer b)Text Editor c)Operating System d)All of the above
answered
in
Compiler Design
Oct 4, 2020
824
views
compiler-design
finite-automata
lexical-analysis
1
answer
18
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?
commented
in
Theory of Computation
Oct 4, 2020
4.1k
views
finite-automata
theory-of-computation
4
answers
19
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
answered
in
Computer Networks
Oct 4, 2020
8.2k
views
gatecse-2008
computer-networks
congestion-control
normal
9
answers
20
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
commented
in
Computer Networks
Oct 4, 2020
21.5k
views
gateit-2005
computer-networks
congestion-control
normal
8
answers
21
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}$
commented
in
Computer Networks
Oct 4, 2020
18.6k
views
gatecse-2012
computer-networks
communication
normal
6
answers
22
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
commented
in
Computer Networks
Oct 4, 2020
8.0k
views
gateit-2007
computer-networks
communication
normal
10
answers
23
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$
commented
in
Computer Networks
Oct 4, 2020
1.7k
views
ugcnetcse-jan2017-paper3
computer-networks
sliding-window
2
answers
24
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
answered
in
Computer Networks
Oct 4, 2020
1.5k
views
nielit2017dec-assistanta
computer-networks
congestion-control
sliding-window
1
answer
25
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); }
commented
in
Compiler Design
Oct 3, 2020
3.7k
views
compiler-tokenization
lexical-analysis
6
answers
26
Lexical vs Syntax Error
answered
in
Compiler Design
Oct 3, 2020
2.6k
views
compiler-design
lexical-analysis
test-series
1
answer
27
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
commented
in
Compiler Design
Oct 3, 2020
1.0k
views
compiler-design
lexical-analysis
5
answers
28
Lexical Analysis
What it the number of tokens in the following line? printf("%d numbers.", &x);
answered
in
Compiler Design
Oct 3, 2020
1.3k
views
compiler-design
lexical-analysis
compiler-tokenization
2
answers
29
Geeks for geeks gate 2016 mock
In the Lexical Analysis, regular expression can be used to model A) the structures of lexemes with fixed length identifier excluded B) the structure of tokens C) the structure of tokens but not lexemes D) the structure of lexemes with variable length identifier included
answered
in
Compiler Design
Oct 3, 2020
1.8k
views
compiler-design
lexical-analysis
3
answers
30
Self doubt
How many tokens in this a>>=1; and a! , Will >>= and a! be treated as a single token ?
commented
in
Compiler Design
Oct 3, 2020
1.0k
views
compiler-design
lexical-analysis
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man
Diagonalization of a MatrixIf there is an...
"i applied to amazon for 6 times,flipkart 2...