Register
Filter

Answers by reboot

1 votes
1
P and C doubt
Given a 4 *4 grid points , how many Triangles with vertices on the grid can be formed?
Given a 4 *4 grid points , how many Triangles with vertices on the grid can be formed?
1 votes
4
GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows:$$\begin{array}{|c|c|c|c|} \hline \textbf{+} & \textbf{a}& \textbf{b} &\textbf{c...
2 votes
10
ARRAYS
Consider an array containing ‘n’ elements. The elements present in an array are in arithmetic progression, but one element is missing in that order. What is the time complexity to find the position of the missing element using divide and conquer?
Consider an array containing ‘n’ elements. The elements present in an array are in arithmetic progression, but one element is missing in that order. What is the time ...
0 votes
14
UGC NET CSE | October 2020 | Part 2 | Question: 2
How many ways are there to pack six copies of the same book into four identical boxes, where a box can contain as many as six books? $4$ $6$ $7$ $9$
How many ways are there to pack six copies of the same book into four identical boxes, where a box can contain as many as six books?$4$$6$$7$$9$
0 votes
15
Permutation with standard deck of cards
Given a standard deck of cards, there $52!$ are different permutations of the cards. Given two identical standard decks of cards, how many different permutations are there?
Given a standard deck of cards, there $52!$ are different permutations of the cards. Given two identical standard decks of cards, how many different permutations are ther...
2 votes
18
Probability - Gravner-74
Let X be a $N(\mu , \sigma^2)$ random variable and let $Y = \alpha X+\beta$, with $\alpha$ > $0$. How is $Y$ distributed?
Let X be a $N(\mu , \sigma^2)$ random variable and let $Y = \alpha X+\beta$, with $\alpha$ $0$. How is $Y$ distributed?
0 votes
19
Probability- Gravner- 75.a
What is the probability that a Normal random variable differs from its mean $\mu$ by more than $\sigma$ ?
What is the probability that a Normal random variable differs from its mean $\mu$ by more than $\sigma$ ?
0 votes
21
pda self doubt
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack. DPDA with empty stack accepts LR(0) grammar. Can someone explain in depth/or give good reference links?
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack.DPDA with empty stack accepts LR(0) grammar.Can someone explain in depth/...
10 votes
24
GATE IT 2008 | Question: 23
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday? $1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$ ... $\dfrac{365 \cdot 364 \dots (365-r+1)}{365^{r}}$
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday?$1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$$\dfrac{365...
0 votes
25
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.
2 votes
26
Probability - Gravner-35
Roll a die, then select at random, without replacement, as many cards from the deck as the number shown on the die. What is the probability that you get at least one Ace?
Roll a die, then select at random, without replacement, as many cards from the deck as the number shown on the die. What is the probability that you get at least one Ace?...
0 votes
30
Self doubt on sorting algorithm
What is the average case time complexity of the best sorting algorithm for an array having 2^n^2 elements . I know that the best sorting algorithm is no better than O(n log n).Please answer in terms of the asymptotic notation.
What is the average case time complexity of the best sorting algorithm for an array having 2^n^2 elements .I know that the best sorting algorithm is no better than O(n lo...
Page: