Register
Filter

Answers by sourav.

0 votes
1
Ace material
If a graph with 10 vertices having each vertex having degree >=5 find graph connected or disconnected
If a graph with 10 vertices having each vertex having degree >=5 find graph connected or disconnected
0 votes
2
logic and predicate
1 votes
3
Pipeline
A computer with a 5 stage pipeline deals with conditional branches by stalling for the next 3 cycle after hitting one. how much does stalling hurt the performance is 20% of all instructions are conditional branches.
A computer with a 5 stage pipeline deals with conditional branches by stalling for the next 3 cycle after hitting one. how much does stalling hurt the performance is 20% ...
1 votes
4
GATE CSE 1992 | Question: 02,viii
A non-planar graph with minimum number of vertices has $9$ edges, $6$ vertices $6$ edges, $4$ vertices $10$ edges, $5$ vertices $9$ edges, $5$ vertices
A non-planar graph with minimum number of vertices has$9$ edges, $6$ vertices$6$ edges, $4$ vertices$10$ edges, $5$ vertices$9$ edges, $5$ vertices
2 votes
7
Need derivation
What is the value of 1.111111111? Is it same as $\left (2-2^{-9} \right )$?
What is the value of 1.111111111? Is it same as $\left (2-2^{-9} \right )$?
9 votes
11
GATE CSE 1990 | Question: 5-b
Show with the help of a block diagram how the Boolean function : $f=AB+BC+CA$ can be realised using only a $4:1$ multiplexer.
Show with the help of a block diagram how the Boolean function :$f=AB+BC+CA$can be realised using only a $4:1$ multiplexer.
1 votes
14
gatebook
For this answer will be both S1 and S2 right??
For this answer will be both S1 and S2 right??
8 votes
17
Doubt
Need some clarification regarding this answer Do comment please:
Need some clarification regarding this answer Do comment please:
2 votes
18
How to make a minimal DFA
Draw a minimal DFA which accepts a language L over {a,b} 01 [ ((10) * + 111) * + 0 ] * 1
Draw a minimal DFA which accepts a language L over {a,b}01 [ ((10) * + 111) * + 0 ] * 1
1 votes
19
#output
#include<stdio.h> int main() { int i=4, j=8; printf("%d, %d, %d\n", i|j&j|i, i|j&j|i, i^j); return 0; } Please tell the approach. Ans is 12 12 12
#include<stdio.h int main() { int i=4, j=8; printf("%d, %d, %d\n", i|j&j|i, i|j&j|i, i^j); return 0; }Please tell the approach.Ans is 12 12 12
4 votes
20
AceTest Series: Algorithms - Time Complexity
for (i=n ; i>0 ; i--) { for ( j=1;j<n ; j=j*2) { for ( k=0;k<j ;k++) { } } } time complexity ?? how to find of inner and innermost loop?
for (i=n ; i>0 ; i ) { for ( j=1;j<n ; j=j*2) { for ( k=0;k<j ;k++) { } } }time complexity ??how to find of inner and innermost loop?
4 votes
21
CMI2012-A-02
Let $T$ be a tree on 100 vertices. Let $n_i$ be the number of vertices in $T$ which have exactly $i$ neighbors. Let $s= \Sigma_{i=1}^{100} i . n_i$ Which of the following is true? $s=99$ $s=198$ $99 \: < \: s \: < \: 198$ None of the above
Let $T$ be a tree on 100 vertices. Let $n_i$ be the number of vertices in $T$ which have exactly $i$ neighbors. Let $s= \Sigma_{i=1}^{100} i . n_i$ Which of the following...
5 votes
22
TCP CONGESTION
Can anyone confirm this i iam getting 2800 ms here ?
Can anyone confirm this i iam getting 2800 ms here ?
1 votes
24
analysis-of-algorithms
If f(n) = O(g(n)) then is it always true g(n) = (f(n)) ??? please explain.
If f(n) = O(g(n)) then is it always true g(n) = (f(n)) ??? please explain.
0 votes
25
Discrete
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above
3 votes
26
Algo: Time complexity
T(n) = 4T(n/2) + n2.$\sqrt{2}$ In thetha notation?
T(n) = 4T(n/2) + n2.$\sqrt{2}$In thetha notation?
6 votes
28
number of solutions
Number of non negative integer solutions such that $x + y + z = 17$ where $x>1,\ y>2,\ z>3$
Number of non negative integer solutions such that $x + y + z = 17$ where $x>1,\ y>2,\ z>3$
1 votes
30
Peter Linz CFL
Which of the following languages are CFL? $a) L=\{a{^n}ww{^R}a{^n} \ | n>=0, w\ \epsilon \{a,b\}{^*}\}$ $b) L=\{a{^n}b{^j}a{^j}b{^n} \ | n>=0, j>=0\}$ $c) L=\{a{^n}b{^j}a{^n}b{^j} \ | n>=0, j>=0\}$ $d) L=\{a{^n}b{^n}c{^j} \ | n<=j\}$
Which of the following languages are CFL?$a) L=\{a{^n}ww{^R}a{^n} \ | n>=0, w\ \epsilon \{a,b\}{^*}\}$$b) L=\{a{^n}b{^j}a{^j}b{^n} \ | n>=0, j>=0\}$$c) L=\{a{^n}b{^j}a{^n...
Page: