30 votes
2
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-d...
103 votes
4
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
2 votes
6
All Conflict serializable schedule are also view serializable but reverse is not true . True or False
7 votes
9
The probability that a given positive integer lying between $1$ and $100$ (both inclusive) is NOT divisible by $2$, $3$ or $5$ is ______ .
3 votes
13
The probability of three consecutive heads in four tosses of a fair coin is$\left(\dfrac{1}{4}\right)$$\left(\dfrac{1}{8}\right)$$\left(\dfrac{1}{16}\right)$$\left(\dfrac...
4 votes
14
An unbiased die is thrown $n$ times. The probability that the product of numbers would be even is$\dfrac{1}{(2n)}$$\dfrac{1}{[(6n)!]}$$1 - 6^{-n}$$6^{-n}$None of the abov...
1 votes
21
i missed uploading thumb impression in gate application form its not given in brochure i got the copy of application formshould i worry? I am giving gate 2nd time
1 votes
22
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
–3 votes
24
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$?$n$$n^2$$2^n$$\frac{n(n+1)}{2}$
0 votes
25
In how many ways can the letters of the word $\text{ABACUS}$ be rearranged such that the vowels always appear together?$\dfrac{(6+3)!}{2!}$ $\dfrac{6!}{2!}$ $\dfrac{3!3!}...
1 votes
26
Which book to follow for Group Theory ?
26 votes
27
A subset $S$ of set of numbers $\{2,3,4,5,6,7,8,9,10\}$ is said to be good if has exactly $4$ elements and their $gcd=1$, Then number of good subset is$126$$125$$123$$121...
3 votes
29
0 votes
30
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.