Register
Filter

Questions by Na462

0 votes
0 answers
1
State Diagram of Sequential circuit
0 votes
0 answers
2
Minimum number of NAND Gates
Minimum number of NAND Gates for the functions F = AC’ + ACE + ACE’ + A’CD’ + A’D’E’ F = (B’ + D’)(A’+C’+D)(A+B’+C’+D)(A’+B+C’+D’)
Minimum number of NAND Gates for the functionsF = AC’ + ACE + ACE’ + A’CD’ + A’D’E’ F = (B’ + D’)(A’+C’+D)(A+B’+C’+D)(A’+B+C’+D’)
0 votes
0 answers
3
Discrete random variable
0 votes
0 answers
4
Central limit theorem
(Central Limit Theorem) Let X1, X2, . . . , X81 be i.i.d., each with expected value µ = E(Xi) = 5, and variance σ2 = Var(Xi) = 4. Approximate P(X1 + X2 +· · · X81 > 369), using the central limit theorem.
(Central Limit Theorem)Let X1, X2, . . . , X81 be i.i.d., each with expected value µ = E(Xi) = 5, and variance σ2 = Var(Xi) = 4.Approximate P(X1 + X2 +· · · X81 369...
0 votes
0 answers
5
Probability mass function
Suppose that the cdf of X is given by: F(a) ={ 0 for a < 0 1/5 for 0 ≤ a < 2 2/5 for 2 ≤ a < 4 1 for a ≥ 4. } Determine the pmf of X.
Suppose that the cdf of X is given by:F(a) ={0 for a < 01/5 for 0 ≤ a < 22/5 for 2 ≤ a < 41 for a ≥ 4.}Determine the pmf of X.
1 votes
0 answers
6
Probability density function
Let R be the rate at which customers are served in a queue. Suppose that R is exponential with pdf f(r) = 2e^(−2r) on [0, ∞). Find the pdf of the waiting time per customer T = 1/R.
Let R be the rate at which customers are served in a queue. Suppose that R isexponential with pdf f(r) = 2e^(−2r) on [0, ∞).Find the pdf of the waiting time per custo...
0 votes
0 answers
7
Expectation
Suppose 100 people all toss a hat into a box and then proceed to randomly pick out a hat. What is the expected number of people to get their own hat back. Hint: express the number of people who get their own hat as a sum of random variables whose expected value is easy to compute.
Suppose 100 people all toss a hat into a box and then proceed to randomly pick out a hat. What is the expected number of people to get their own hat back.Hint: express th...
0 votes
3 answers
9
B+ Tree Records
3 votes
1 answer
13
Ace Test Series: DBMS - File Indexing
1 votes
1 answer
14
Ace Test Series: Compilers - Parsers
1 votes
1 answer
15
Ace Test Series: Compilers - Parser
1 votes
0 answers
19
Ace Test Series: Compiler - Parser Conflicts
Consider the following CFG. S → aSa|bSb|a|b Number of conflicts in LR(0) State Diagram? 2 8 10 4
Consider the following CFG.S → aSa|bSb|a|bNumber of conflicts in LR(0) State Diagram?28104
Page: