The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Jason GATE
User Jason GATE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Jason GATE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
Introduction to Automata and Compiler Design chapter1
I know this is trivial but verify !
asked
Feb 5, 2017
in
Theory of Computation

85
views
language
0
votes
1
answer
2
Introduction to Automata and Compiler Design Chapter 1
IF I TAKE L={a^p  where p is prime}......
asked
Feb 5, 2017
in
Theory of Computation

103
views
countable
language
+2
votes
2
answers
3
Euler Path
Which of the following Graph has Euler Path but is not an Euler Graph? A. K1,1 B.K2,10 C.K2,11 D.K10,11.
asked
Jan 31, 2017
in
Graph Theory

425
views
graphtheory
eulergraph
eulerpath
0
votes
1
answer
4
The Relation is ?
Suppose there is a set L ,set of lines and there is a Relation R, R={<L1,L2> ϵ R if L1  L2  L1,L2 ϵ L }. Relation R is, _______________. 1. Reflexive 2.Symmetric 3.Antisymmetric 4.Asymmetric 5.Transitive. Explanation in simple words with Example will be appreciated. Thanks.
asked
Jan 25, 2017
in
Set Theory & Algebra

240
views
discretemathematics
settheory&algebra
relations
0
votes
4
answers
5
GateForum Test Series: Graph Theory  Graph Coloring
The Chromatic Number of Cycle Graph with 7 vertices _____
asked
Jan 9, 2017
in
Graph Theory

403
views
gateforumtestseries
engineeringmathematics
discretemathematics
graphtheory
graph
graphcoloring
+3
votes
1
answer
6
AVL Tree
What are we suppose to take? LR  2 rotations. RL 2 rotations. OR LR  1 rotation. RL 1 rotation. Kindly Solve and Verify the Total Numbers of Rotations Performed.
asked
Jan 9, 2017
in
DS

176
views
avltree
datastructures
+2
votes
2
answers
7
Virtual Gate Test Series: Theory Of Computation  DFA
Number of states in the $\text{DFA}$ accepting the language $L=\{a^{n}b^{n}1\leq n\leq 3\}$ over $\sum=\{a,b\}.$
asked
Jan 8, 2017
in
Theory of Computation

136
views
theoryofcomputation
finiteautomata
numberofstates
virtualgatetestseries
0
votes
0
answers
8
Virtual Gate Test Series: Computer Networks  Round Trip Time
But I am getting 5.427 as Answer. And unfortunately that is given incorrect. Kindly Explain. Thnks.
asked
Jan 8, 2017
in
Computer Networks

116
views
computernetworks
roundtriptime
virtualgatetestseries
0
votes
1
answer
9
Virtual Gate Test Series: Databases  Sql query
asked
Jan 8, 2017
in
Databases

104
views
databases
sql
virtualgatetestseries
+2
votes
1
answer
10
Theory Of Computation
To complement the language , we complement the machine by altering final/nonfinal states. My question is , should that machine necessarily be a DFA? Can't we apply the same concept to NFA?
asked
Jun 25, 2016
in
Theory of Computation

523
views
theoryofcomputation
finiteautomata
50,741
questions
57,229
answers
197,978
comments
104,567
users