0 votes
2
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n 2$.$2$$3$$n-1$ $n$
0 votes
6
How to find clique in a graph?
3 votes
8
Consider the problem of maximizing $x^{2}-2x+5$ such that $0< x< 2$. The value of $x$ at which the maximum is achieved is:$0.5$$1$$1.5$$1.75$None of the above
0 votes
14
Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L hasa)2b)5c)8d)3 explain!!
11 votes
15
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$$xy + yw$$(w + x) (\bar{w} + y) (\bar{x} + y)$None of t...
25 votes
16
The number of full and half-adders required to add $16$-bit numbers is$8$ half-adders, $8$ full-adders$1$ half-adder, $15$ full-adders$16$ half-adders, $0$ full-adders$4$...
11 votes
17
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders r...
3 votes
18
Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is $\bar{x} + y$$x$$0$$1$
6 votes
19
Let $r, s, t$ be regular expressions. Which of the following identities is correct?$(r + s)^* = r^*s^*$$r(s + t) = rs + t$$(r + s)^* = r^* + s^*$$(rs + r)^* r = r (sr + r...
0 votes
20
Find a recurrence relation for the number of bit stringsof length n that contain a pair of consecutive 0s.