Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by kittuD⭐
3
answers
1
GATE CSE 2002 | Question: 2.5
The finite state machine described by the following state diagram with $A$ as starting state, where an arc label is $x/y,$ and $x$ stands for $1$-bit input and $y$ stands for $2$-bit output outputs the sum of the present and the ... the input outputs $01$ whenever the input sequence contains $11$ outputs $00$ whenever the input sequence contains $10$ none of the above
The finite state machine described by the following state diagram with $A$ as starting state, where an arc label is $x/y,$ and $x$ stands for $1$-bit input and $y$ stands...
11.4k
views
answered
Aug 9, 2019
Theory of Computation
gatecse-2002
theory-of-computation
normal
finite-automata
+
–
9
answers
2
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
35.2k
views
commented
Nov 8, 2017
Graph Theory
gatecse-2012
graph-theory
normal
marks-to-all
counting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register