Register
Filter

Questions by VS

1 votes
0 answers
42
Graph theory
What type of graph is STAR? A. Bipartite B. Tripartite C. Mutipartite PS : I know a star graph is bipartite but can't we say that a bipartite graph is also tripartite . I. E. It can be partitioned into 3 independent sets. Similarly , it is mutipartite as well.
What type of graph is STAR?A. BipartiteB. TripartiteC. MutipartitePS : I know a star graph is bipartite but can't we say that a bipartite graph is also tripartite . I. E...
2 votes
0 answers
43
Complete lattice and Bounded lattice
Is every Bounded lattice Complete ? Eg : ( { x : 0<=x<= 1} , <= ) This lattice is bounded , but is it complete ? (I have a doubt ; what if we consider irrational no.s as well)
Is every Bounded lattice Complete ?Eg : ( { x : 0<=x<= 1} , <= )This lattice is bounded , but is it complete ?(I have a doubt ; what if we consider irrational no.s as...
1 votes
1 answer
44
Compiler
Out of LL(2) and LR(1) which is more powerful?
Out of LL(2) and LR(1) which is more powerful?
1 votes
2 answers
45
Asymptotic notations
g(n)=Ώ(n) h(n)=O(n) g(n) . h(n) =?
g(n)=Ώ(n)h(n)=O(n)g(n) . h(n) =?
1 votes
1 answer
46
CFL or not
L={ wε(a+b)* | #a - #b <=10 } CFL or Reg ?
L={ wε(a+b)* | #a - #b <=10 }CFL or Reg ?
3 votes
2 answers
47
Regular or CFL
L={w| length of w is odd and its middle symbol is 0, wε{0,1}* } Reg or CFL?
L={w| length of w is odd and its middle symbol is 0, wε{0,1}* }Reg or CFL?
1 votes
2 answers
48
Mapping Reducible
A={<M,w> M is a TM that accepts w} B=Ʃ* Is A Mapping reducible to B? http://theory.stanford.edu/~trevisan/cs154-12/reductions3.pdf
A={<M,w M is a TM that accepts w}B=Ʃ*Is A Mapping reducible to B?http://theory.stanford.edu/~trevisan/cs154-12/reductions3.pdf
0 votes
0 answers
49
Left linear regular grammar to machine
Can we directly convert a given Left linear regular grammar to machine ? or First convert Left linear regular grammar to Right linear regular grammar and then to machine . http://scanftree.com/automata/conversion-of-left-linear-grammar-to-finite-automata
Can we directly convert a given Left linear regular grammar to machine ?orFirst convert Left linear regular grammar to Right linear regular grammar and then to machine .h...
2 votes
1 answer
50
TOC-DFA
Design a NFA and DFA for the following :: 1) Accepting all substrings of the string abab. 2) Accepting all prefixes of the string abab. 3) Accepting all suffixes of the string abab.
Design a NFA and DFA for the following ::1) Accepting all substrings of the string abab.2) Accepting all prefixes of the string abab.3) Accepting all suffixes of the stri...
2 votes
1 answer
51
TOC-reg
Complement of : {anbn | n>=0} ? Also tell if it is CFL or CSL?
Complement of : {anbn | n>=0} ?Also tell if it is CFL or CSL?
0 votes
1 answer
52
toc-reg
{ambncp|m+n+p>=10} Reg or not ?
{ambncp|m+n+p>=10} Reg or not ?
1 votes
0 answers
57
others
I have this doubt that the Two pass assembler,Macro,linker and related topics,are they still included in gate syllabus.Because there have been no questions from these topics since years.
I have this doubt that the Two pass assembler,Macro,linker and related topics,are they still included in gate syllabus.Because there have been no questions from these top...
0 votes
1 answer
58
cil-2017 AQ24
0 votes
2 answers
59
cil-2017 AQ17
0 votes
2 answers
60
cil-2017 AQ11
Page: