Register
Filter

Answers by yuyutsu

0 votes
2
GATE CSE 1999 | Question: 2.2
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves? $1638$ $2100$ $2640$ None of the above
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves?$1638$$2100$$2640$None of th...
0 votes
5
Finding the second element neither minimum nor maximum
How many comparisons are there for finding any second element that is neither minimum or maximum. 10 5 50 70 80 2 3
How many comparisons are there for finding any second element that is neither minimum or maximum.10 5 50 70 80 2 3
3 votes
7
GATE CSE 1988 | Question: 13ii
If the set $S$ has a finite number of elements, prove that if $f$ maps $S$ onto $S$, then $f$ is one-to-one.
If the set $S$ has a finite number of elements, prove that if $f$ maps $S$ onto $S$, then $f$ is one-to-one.
0 votes
8
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is$\Theta(n)$$\Theta(\log n)...
0 votes
11
GO Classes Weekly Quiz 13 | Discrete Mathematics | Combinatorics | Question: 3
Consider the following two combinatorial identities: For all $\mathrm{k}, \mathrm{n} \in \mathrm{N}$ with $\mathrm{k} \leq \mathrm{n}$ ... $1$ Only $2$ Both None
Consider the following two combinatorial identities:For all $\mathrm{k}, \mathrm{n} \in \mathrm{N}$ with $\mathrm{k} \leq \mathrm{n}$,$$\left(\begin{array}{l} n \\ 2 \end...
0 votes
12
For any language, if the union of both is regular, then are those languages regular languages as well?
For the following question if True show why, and if it’s False show why.)Question: For any language A1, A2, if $A1 \cup A2$ is regular, then A1 and A2 are regular langu...
0 votes
13
madeeasy work book
consider the following transactions T1:r1(A)w1(A)r1(B)w1(B) T2:r2(B)w2(B)r2(A)w2(A) a)how many schedules serializable as T1-->T2 what this question is asking??
consider the following transactionsT1:r1(A)w1(A)r1(B)w1(B)T2:r2(B)w2(B)r2(A)w2(A)a)how many schedules serializable asT1 >T2what this question is asking??
1 votes
14
Conflict serializable and 2pl schedule
Can someone write one example of a schedule which is conflict serializable but is not allowed by 2pl protocol. I have read that 2pl-> css, but css-> 2pl is not necessary?
Can someone write one example of a schedule which is conflict serializable but is not allowed by 2pl protocol. I have read that 2pl- css, but css- 2pl is not necessary?
0 votes
15
self doubt
Both euler path and euler circuit can be present in a graph ?
Both euler path and euler circuit can be present in a graph ?