0 votes
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 ...
0 votes
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?
0 votes
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)$
3 votes
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?
0 votes
7
Draw the polygraph and explain whether it is view-serializable or not?
0 votes
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 votes
9
T(n)=0.5T(n/2)+n^3How to solve this using recurrence method?
0 votes
10
Solve thisT(n) = 0.5T(n/2)+1 ; T(1)=1
0 votes
12
0 votes
13
Say L1 and L2 are cfl , is L1 Ex-or L2 is cfl or not?
0 votes
14
Explain the outputMain(){ char *s= "%d\n"; s++; s++; printf(s-2,300);}
0 votes
16
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...
0 votes
18
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...
0 votes
19
0 votes
20
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...
0 votes
22
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
0 votes
23
what is minimum number of states of NFA which accepts language{abab^n|n>=0} U{aba^n|n>=0}
1 votes
24
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...
0 votes
25
1 votes
26
. Construct the minimal finite automata that accept all the strings of 0’s and 1’s where the integer equivalent of the binary string is congruent to 3 mod 6. What is ...
0 votes
27