Dark Mode

Recent activity by Chandrashis Mazumdar

3 answers

1

TIFR CSE 2016 | Part A | Question: 14
A $diagonal$ in a polygon is a straight line segment that connects two non-adjacent vertices, and is contained in the interior of the polygon (except for its points). Two such diagonals are said to cross if they have a point in common in the interior of the polygon. In one such ... the information given $\frac{n}{2}-2$ $\frac{n}{4}-1$ $n-4$ $n^2 - 9.5 n +22$

answer edited in Graph Theory Jan 29, 2017

554 views

2 answers

2

TIFR CSE 2017 | Part B | Question: 13
For an undirected graph $G=(V, E)$, the line graph $G'=(V', E')$ is obtained by replacing each edge in $E$ by a vertex, and adding an edge between two vertices in $V'$ if the corresponding edges in $G$ are incident on the ... any vertex in the line graph is at most the maximum degree in the original graph each vertex in the line graph has degree one or two

commented in Graph Theory Jan 29, 2017

2.0k views

3 answers

3

TIFR CSE 2016 | Part A | Question: 4
There are $n$ balls $b_1, \dots ,b_n$ and $n$ boxes. Each ball is placed in box chosen independently and uniformly at random. We say that $(b_i, b_j)$ is a $\textit{colliding pair}$ if $i<j$, and $b_i$ and $b_j$ are placed in the same box. What is the ... $\frac{n-1}{2}$ $0$ $1$ $\frac{n}{4}$ $\begin{pmatrix} n \\ 2 \end{pmatrix}$

commented in Probability Jan 26, 2017

1.3k views

5 answers

4

TIFR CSE 2016 | Part A | Question: 2
Consider the graph shown below: The following experiment is performed using this graph. First, an edge $e =\{i,j\}$ of the graph is chosen uniformly at random from the set of $9$ possibilities. Next, a common neighbour $k$ of $i$ and $j$ is chosen, again uniformly from the set of ... $\frac{1}{6}$ $\frac{1}{4}$ $\frac{1}{3}$ $\frac{2}{3}$ $\frac{5}{6}$

answered in Graph Theory Jan 26, 2017

671 views

3 answers

5

TIFR CSE 2015 | Part B | Question: 6
Let $B$ consist of all binary strings beginning with a $1$ whose value when converted to decimal is divisible by $7$. $B$ can be recognized by a deterministic finite state automaton. $B$ can be recognized by a non-deterministic ... not by a deterministic push-down automaton. $B$ cannot be recognized by any push down automaton, deterministic or non-deterministic.

commented in Theory of Computation Jun 12, 2016

1.6k views

2 answers

6

no of states in minimal dfa
Q no. of states in minimal DFA built for: accepts all strings over the alphabet {0,1} interpreted as a binary number is congruent to zero modulo n has a)n states b)n-1 states c)n+1 states d)None of the above basically, i didn't get what they are trying to say in this question?(correct answer is option A)

commented in Theory of Computation Feb 24, 2016

3.9k views

3 answers

7

UGC NET CSE | December 2015 | Part 3 | Question: 27
There are exactly ____ different finite automata with three states $x$, $y$ and $z$ over the alphabet $\{a,b\}$ where $x$ is always the start state $64$ $256$ $1024$ $5832$

answered in Theory of Computation Feb 24, 2016

6.0k views