Register
Filter

Questions by Tesla!

14 votes
5 answers
92
ISI 2004 MIII
The number of permutation of $\{1,2,3,4,5\}$ that keep at least one integer fixed is. $81$ $76$ $120$ $60$
The number of permutation of $\{1,2,3,4,5\}$ that keep at least one integer fixed is.$81$$76$$120$$60$
0 votes
2 answers
93
Graph Theory
let G=(V,E) be an connected graph, let $\left | V \right |= n$ Find largest value of n such that i) G is complete & ii) G is bipartite with valid proof
let G=(V,E) be an connected graph, let $\left | V \right |= n$Find largest value of n such thati) G is complete &ii) G is bipartitewith valid proof
0 votes
1 answer
94
Set theory
Justify your answer with valid reason $\phi \epsilon \left \{ A \right \} \wedge \phi \subseteq \left \{ A \right \}$ Where A is an non empty set $\left | A \right | \neq 0$
Justify your answer with valid reason$\phi \epsilon \left \{ A \right \} \wedge \phi \subseteq \left \{ A \right \}$Where A is an non empty set $\left | A \right | \neq 0...
1 votes
2 answers
95
Tremblay Manohar
Write the set $\left \{ \phi ,\left \{ \phi \right \} \right \}-\phi$
Write the set$\left \{ \phi ,\left \{ \phi \right \} \right \}-\phi$
0 votes
0 answers
96
Tremblay Manohar
Write the set $\phi \cap \left \{ \phi \right \}$
Write the set$\phi \cap \left \{ \phi \right \}$
0 votes
1 answer
97
Set theory
Let S be a set of n elements and let p(S) be its power set. Then find total number of ordered pairs such that $s1 \cap s2 = \phi$ where s1 & s2 are subset of p(s)
Let S be a set of n elements and let p(S) be its power set. Then find total number of ordered pairs such that $s1 \cap s2 = \phi$ where s1 & s2 are subset of p(s)
3 votes
1 answer
98
#dbms #serializability
There exist an schedule which serializable but is neither view serializable nor conflict serializable ?
There exist an schedule which serializable but is neither view serializable nor conflict serializable ?
Page: