Register
Filter

Answers by Magma

0 votes
31
Normalisation
Difference between composite and compound key??
Difference between composite and compound key??
2 votes
33
Number of FAs DOUBT 2
The number of possible finite automaton with 2 states a0 and a1 where a0 is always initial state over the alphabet {p, q, r} which accept empty language is _______
The number of possible finite automaton with 2 states a0 and a1 where a0 is always initial state over the alphabet {p, q, r} which accept empty language is _______
1 votes
34
MADE EASY TEST SERIES QUESTION
1 votes
35
C output
void main() { char*s[]={"iceland","Greenland","Ireland","Switzerland"}; char **ptr[]={s+3,s+2,s+1,s}; char ***p=ptr; printf(\%s ",**++p); printf(\%s ",*(*++p+3); printf(\%s ",*p[-2]+3); printf(\%s ",p[-1][-1]+1); }
void main() { char*s[]={"iceland","Greenland","Ireland","Switzerland"}; char ptr[]={s+3,s+2,s+1,s}; char *p=ptr; printf(\%s ", ++p); printf(\%s ",*(*++p+3); printf(\%s ...
9 votes
36
GB DSA-Test 4-Question 17
If Radix sort is used to sort an array of n integers which are in the range , where d is some function of input size, the time taken would be? (A) (B) (C) (D)
If Radix sort is used to sort an array of n integers which are in the range ,where d is some function of input size, the time taken would be?(A) (B)(C) (D)
1 votes
37
graph theory
consider a complete bipartite graph K(3,3) The ratio of total number of possible vertex induced subgraphs to the total number of possible edge induced subgraph in given bipartite graph is x:y . then value of x+y is______.
consider a complete bipartite graph K(3,3)The ratio of total number of possible vertex induced subgraphs to the total number of possible edge induced subgraph in given bi...
1 votes
39
made easy test series
Consider a relation R(A,B,C,D,E) with the following functional dependencies. A→BC C→E B→D E→A The total number of super keys present in the relation are_______
Consider a relation R(A,B,C,D,E) with the following functional dependencies.A→BCC→EB→DE→AThe total number of super keys present in the relation are_______
2 votes
40
data base management systems
1 votes
42
Probability
Please explain how $P(A ∩ B) = P(A)P(B)$? If $A$ and $B$ are independent.
Please explain how $P(A ∩ B) = P(A)P(B)$? If $A$ and $B$ are independent.
0 votes
44
find the number of regions in a connected simple graph with 20 vertices each with a degree of 3 ?
find the number of regions in a connected simple graph with 20 vertices each with a degree of 3 ?
find the number of regions in a connected simple graph with 20 vertices each with a degree of 3 ?
1 votes
45
Degree Sequence
$<2, 2, 2, 1, 1>$ degree sequence is NOT graphic for simple graphs$?$
$<2, 2, 2, 1, 1>$ degree sequence is NOT graphic for simple graphs$?$
1 votes
47
self dout
why SJF scheduling algorithm frequently used in long term scheduling.
why SJF scheduling algorithm frequently used in long term scheduling.
2 votes
49
ME test series.
How 14? I am not able to understand. Why not 30.
How 14? I am not able to understand. Why not 30.
0 votes
50
Algorithms Questions
f(n)>=c1.n h(n)=c2.n then why answer cant be O(n),It is given as C
f(n)>=c1.nh(n)=c2.nthen why answer cant be O(n),It is given as C
0 votes
51
bookk
Solution of $T(n)=\sqrt{n}T(\sqrt{n})+n$
Solution of $T(n)=\sqrt{n}T(\sqrt{n})+n$
0 votes
52
transaction cascadeless
is this is cascadeless? r1(X),w2(X),w1(X), abort2, commit1
is this is cascadeless?r1(X),w2(X),w1(X), abort2, commit1
6 votes
53
Divide and conquer made easy
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
Is the answer to this solution is O( n2 log (n) ) or O( n log (n) )
0 votes
54
combinatory
How many ways are there for a horse race with 4 horses to finish if ties are possible?(any number of horses may tie)
How many ways are there for a horse race with 4 horses to finish if ties are possible?(any number of horses may tie)
2 votes
55
Test Series
0 votes
57
GATE CSE 2016 Set 2 | Question: 51
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$ ... is TRUE? $S$ is non-recoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$.$S= r_{2}\left(X\right); r_{1}\left(X\right); r_{2} \left(Y\right); w_{1} \left(X\right...
0 votes
58
ME TEST SERIES
HOW TO SOLVE THOSE TYPE OF QUESTION?
HOW TO SOLVE THOSE TYPE OF QUESTION?
0 votes
59
TESTBOOK TEST SERIES
IS THE GIVEN ANS RIGHT?
IS THE GIVEN ANS RIGHT?
0 votes
60
Doubt
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
Page: