2 answers
1
For which values of $m$ and $n$ does the complete bipartite graph $k_{m,n}$ have a Hamiltonian circuit ?$m\neq n,\ \ m,n \geq 2$$m\neq n,\ \ m,n \geq 3$$m=n,\ \ m,n \geq ...
2 answers
3
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2is this the case of repetitive roots?
2 answers
4
Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $$O(n^{2})$$O(logn)$$O(nlogn)$$O(n^{2}logn)$
1 answer
6
I think percentage of processor time consumed should be $\frac{ \,ISR\,time}{ISR\,time+\,Data\,Transfer\,Time}=\frac{100}{100+122}$.Is it correct?
2 answers
7
Draw the polygraph and explain whether it is view-serializable or not?
3 answers
8
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)....
0 answers
9
https://gateoverflow.in/1841/gate2006-63-ugcnet-june2012-iii-45WHAT SHOULD BE THE CORRECT ANSWER A OR C ???
1 answer
10
T(n)=0.5T(n/2)+n^3How to solve this using recurrence method?
2 answers
11
Solve thisT(n) = 0.5T(n/2)+1 ; T(1)=1
3 answers
14
1 answer
15
Say L1 and L2 are cfl , is L1 Ex-or L2 is cfl or not?
1 answer
16
Which of the following is not a subset of $P(P(P(\phi)))$?$A)$ {$\phi$}$B)$ { {$\phi$} }$C)$ { {$\phi$} , { {$\phi$} } }$D)$ { { { {$\phi$} } } }
2 answers
17
LB = { < M | M is a valid Turing Machine } is decidable or undecidable.
1 answer
18
Explain the outputMain(){ char *s= "%d\n"; s++; s++; printf(s-2,300);}
0 answers
19
the output of the following problem?main(){ int a=1,b=2,c=4; printf("%d",a+=(a+=4,10,a));} Explain?
1 answer
21
From CLRS the complexity of radix sort is theta(d(n+k)) where d is # of digits , k is range and n is numbers . So how option C is right . Plz solve it on the basis of min...
3 answers
23
Keys $9,19,29,39,49,59,69$ are inserted into a hash Table of size $10$ $(0-9)$ using the hash function $H = k mod 10$ and Quadratic Probing is used for collision resoluti...
1 answer
24
1 answer
25
Anti- dependency will not ALWAYS create stall because we can use register renaming to remove stall.Please confirm below statement:Anti-dependency MAY create stall (True/F...
2 answers
27
Consider the Minimal Finite Automata that accept all the strings of a’s & b’s where no. of a’s is congruent to 2 mod 3. The no. of states in this automata is
1 answer
28
what is minimum number of states of NFA which accepts language{abab^n|n>=0} U{aba^n|n>=0}
1 answer
29
Both the questions may be having same concepts and I need a good explanation considering both so asked simultaneously. Please consider both of them.Its confusing to appro...
1 answer
30