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
Answers by Sanandan
0
votes
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.6k
views
gatecse-2016-set1
theory-of-computation
context-free-language
normal
0
votes
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
0
votes
3
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
0
votes
4
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.3k
views
gatecse-2018
theory-of-computation
closure-property
easy
1-mark
0
votes
5
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
0
votes
6
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
0
votes
7
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.7k
views
gatecse-2002
theory-of-computation
easy
closure-property
0
votes
8
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
0
votes
9
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
837
views
compiler-design
finite-automata
lexical-analysis
0
votes
10
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.3k
views
gatecse-2008
computer-networks
congestion-control
normal
0
votes
11
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
0
votes
12
Lexical vs Syntax Error
answered
in
Compiler Design
Oct 3, 2020
2.6k
views
compiler-design
lexical-analysis
test-series
0
votes
13
Lexical Analysis
What it the number of tokens in the following line? printf("%d numbers.", &x);
answered
in
Compiler Design
Oct 3, 2020
1.4k
views
compiler-design
lexical-analysis
compiler-tokenization
0
votes
14
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
0
votes
15
UGC NET CSE | January 2017 | Part 2 | Question: 33
Consider the following statements related to compiler construction: Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? Only I Only II Both I and II Neither I nor II
answered
in
Compiler Design
Oct 3, 2020
1.8k
views
ugcnetjan2017ii
compiler-design
lexical-analysis
0
votes
16
NIELIT 2017 July Scientist B (CS) - Section B: 49
In a compiler, keywords of a language are recognized during parsing of the program the code generation the lexical analysis of the program dataflow analysis
answered
in
Compiler Design
Oct 3, 2020
1.1k
views
nielit2017july-scientistb-cs
compiler-design
lexical-analysis
0
votes
17
NIELIT 2016 DEC Scientist B (CS) - Section B: 57
The output of lexical analyzer is: A set of regular expressions Strings of character Syntax tree Set of tokens
answered
in
Compiler Design
Oct 3, 2020
1.1k
views
nielit2016dec-scientistb-cs
compiler-design
lexical-analysis
0
votes
18
UGC NET CSE | January 2017 | Part 3 | Question: 62
Which of the following pairs have different expressive power? Single-tape-turing machine and multi-dimensional turing machine Multi-tape-turing machine and multi-dimensional turing machine Deterministic push down automata and non-deterministic push down automata Deterministic finite automata and non-deterministic finite automata
answered
in
Theory of Computation
Oct 3, 2020
709
views
ugcnetcse-jan2017-paper3
theory-of-computation
turing-machine
0
votes
19
NIELIT 2017 DEC Scientist B - Section B: 57
Which machine is equally powerful in both deterministic and non-deterministic form? Push Down Automata Turing machine Linear Bounded Automata None of the options
answered
in
Theory of Computation
Oct 3, 2020
1.1k
views
nielit2017dec-scientistb
pushdown-automata
turing-machine
1
vote
20
NIELIT 2017 DEC Scientist B - Section B: 37
Which of the following statement is true? $S1$: The power of a multi-tape Turing machine is greater than the power of a single tape Turing machine. $S2$: Every non-deterministic Turing machine has an equivalent deterministic Turing machine. $S1$ $S2$ Both $S1$ and $S2$ None of the options
answered
in
Theory of Computation
Oct 3, 2020
2.4k
views
nielit2017dec-scientistb
theory-of-computation
turing-machine
0
votes
21
NIELIT 2016 DEC Scientist B (CS) - Section B: 6
Which of the following is wrong? Turing machine is a simple mathematical model of general purpose computer Turing machine is more powerful than finite automata Turing Machine can be simulated by a general purpose computer All of these
answered
in
Theory of Computation
Oct 3, 2020
7.6k
views
nielit2016dec-scientistb-cs
theory-of-computation
turing-machine
0
votes
22
Peter Linz Edition 4 Exercise 8.1 Question 1 (Page No. 212)
Show that the language $L=${$a^nb^nc^m,n\neq m$} is not context-free.
answered
in
Theory of Computation
Oct 3, 2020
394
views
peter-linz
peter-linz-edition4
theory-of-computation
pumping-lemma
context-free-language
0
votes
23
ISRO2020-37
Context free languages are closed under union, intersection union, kleene closure intersection, complement complement, kleene closure
answered
in
Theory of Computation
Oct 3, 2020
2.1k
views
isro-2020
theory-of-computation
context-free-language
easy
0
votes
24
TIFR CSE 2020 | Part B | Question: 2
Consider the following statements. The intersection of two context-free languages is always context-free The super-set of a context-free languages is never regular The subset of a decidable language is always decidable Let $\Sigma = \{a,b,c\}.$ Let $L\subseteq \Sigma$ be the language of ... Only $(1),(2)$ and $(3)$ Only $(4)$ None of $(1),(2),(3),(4)$ are true.
answered
in
Theory of Computation
Oct 3, 2020
1.2k
views
tifr2020
theory-of-computation
context-free-language
decidability
0
votes
25
UGC NET CSE | January 2017 | Part 3 | Question: 23
Given the following two languages: $L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$ $L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$ Which of the following options is correct ... context free language $L_1$ is context free language, $L_2$ is not context free language $L_1$ is not context free language, $L_2$ is context free language
answered
in
Theory of Computation
Oct 3, 2020
3.5k
views
ugcnetcse-jan2017-paper3
theory-of-computation
context-free-language
0
votes
26
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 31
Which of the following definitions generates the same languages as $L,$ where $L = \{x^{n}y^{n},n \geq 1\}$ $E \rightarrow xEy \mid xy$ $xy \mid x^{+}xyy^{+}$ $x^{+}y^{+}$ $(i)$ $(i)$ and $(ii)$ only $(ii)$ and $(iii)$ only $(ii)$ only
answered
in
Theory of Computation
Oct 3, 2020
339
views
nielit2017oct-assistanta-cs
theory-of-computation
context-free-language
0
votes
27
Peter Linz Edition 4 Exercise 4.3 Question 23 (Page No. 124)
Is the family of regular languages closed under infinite intersection?
answered
in
Theory of Computation
Oct 3, 2020
225
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
closure-property
0
votes
28
Peter Linz Edition 4 Exercise 4.3 Question 24 (Page No. 124)
Suppose that we know that $L_1 ∪ L_2$ and $L_1$ are regular. Can we conclude from this that $L_2$ is regular?
answered
in
Theory of Computation
Oct 3, 2020
262
views
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
closure-property
0
votes
29
ISRO2020-38
Which of the following is true? Every subset of a regular set is regular Every finite subset of non-regular set is regular The union of two non regular set is not regular Infinite union of finite set is regular
answered
in
Theory of Computation
Oct 3, 2020
1.4k
views
isro-2020
theory-of-computation
regular-language
easy
0
votes
30
UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... ) and (b) are true (a) is true, (b) is false (a) is false, (b) is true
answered
in
Theory of Computation
Oct 3, 2020
1.4k
views
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
Page:
1
2
3
4
5
next »
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
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.7k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2