Register
Filter

Recent activity by Gangani_Son

2 answers
1
GATE IT 2008 | Question: 9
What Boolean function does the circuit below realize? $xz + \bar{x}\bar{z}$ $x\bar{z} + \bar{x}{z}$ $\bar{x}\bar{y} + {y}{z}$ $xy + \bar{y}\bar{z}$
What Boolean function does the circuit below realize?$xz + \bar{x}\bar{z}$$x\bar{z} + \bar{x}{z}$$\bar{x}\bar{y} + {y}{z}$$xy + \bar{y}\bar{z}$
4 answers
2
ISRO2008-25
In the expression $\overline{\text{A}}(\overline{\text{A}}+\overline{\text{B}})$ by writing the first term $\text{A}$ as $\text{A + 0}$, the expression is best simplified as $\text{A+AB}$ $\text{AB}$ $\text{A}$ $\text{A+B}$
In the expression $\overline{\text{A}}(\overline{\text{A}}+\overline{\text{B}})$ by writing the first term $\text{A}$ as $\text{A + 0}$, the expression is best simplified...
6 answers
8
GATE CSE 1998 | Question: 2.12
What value would the following function return for the input $x=95$? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End; $89$ $90$ $91$ $92$
What value would the following function return for the input $x=95$?Function fun (x:integer):integer; Begin If x 100 then fun = x – 10 Else fun = fun(fun (x+11)) End;$...
5 answers
9
GATE IT 2005 | Question: 51
Let $T(n)$ be a function defined by the recurrence $T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and $T(1) = 1$ Which of the following statements is TRUE? $T(n) = \Theta(\log n)$ $T(n) = \Theta(\sqrt n)$ $T(n) = \Theta(n)$ $T(n) = \Theta(n \log n)$
Let $T(n)$ be a function defined by the recurrence$T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and$T(1) = 1$Which of the following statements is TRUE?$T(n) = \Theta(\log n)$...
1 answer
11
#geeksfoegeeks #gate #2017 #mocktest
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____. (A) 8 and 20 (B) 8 and 19 (C) 7 and 19 (D) 7 and 20 Answer is (C) but i think also possible (B). anyone explain?
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____.(A) 8 and 20(B) 8 and 19(C) ...
1 answer
12
graph
You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of the best known algorithm to find out whether the graph is bipartite or not is ? A O(m+n) B O(1) C O(mn) D O(n2 plz explain this question
You are given a graph containing n vertices and m edges and given that the graph doesn’t contain cycle of odd length. Time Complexity of the best known algorithm to fin...