# Questions by Jason GATE

1
I know this is trivial but verify !
2
IF I TAKE L={a^p | where p is prime}......
3
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.
4
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.
5
The Chromatic Number of Cycle Graph with 7 vertices _____
6
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.
Number of states in the $\text{DFA}$ accepting the language $L=\{a^{n}b^{n}|1\leq n\leq 3\}$ over $\sum=\{a,b\}.$