If a random sample of size 20 from a normal population with variance 225 has mean $\bar{x}=64.3$, then the 95% confidence interval for the population mean $\mu$ is (Given that $Z_{0.025}=1.96$).
While testing the independence of attributes using Chi-square distribution, suppose attribute $A$ is specified into three classes and attribute $B$ is classified into four classes, then the degree of freedom of Chi-square test is:
Let $p$ be the probability that a coin will fall head in a single toss in order to test
$H_0 : p = 1/2$ against $H_1 : p = 3/4$.
The coin is tossed 5 times and $H_0$ is rejected if more than 3 heads are obtained. Then the probability of Type-I error is:
Suppose that there are $K$ treatments and $n$ blocks in a randomized block design. In analysis of variance for this design, the error degrees of freedom is:
Thirty men and thirty women with knee pain were subjects in an experiment to determine the effectiveness of a new pain medication. Fifteen of the 30 men and 15 of the 30 women were chosen randomly to receive the new drug. The remaining 15 men and 15 women received a placebo. The decrease in pain was measured for each subject. Then the design of experiment is
If $\alpha, \beta, \gamma$ be the angles which a line subtends with the positive direction of coordinate axes, then
$\sin^2 \alpha + \sin^2 \beta + \sin^2 \gamma$ equals
If the centre of mass of three particles of masses 10, 20 and 30 gram be at the point $(1,-2,3)$, where should a fourth particle of 40 gram be placed so that the combined centre of mass may be $(1,1,1)$ ?
Consider a relation $R(A,B,C,D)$ with set of functional dependencies
$AB \rightarrow CD$ and $D \rightarrow A$.
Let $R_1(A,D)$ and $R_2(B,C,D)$ are two decompositions over $R$.
Which of the following statement is TRUE?
In which file, the records are organized in sequence and an index table is used to speed up access to the records without requiring a search of the entire file?
What is the output of the following program?
#include
int main()
{
int i = 100, j = 300, k;
j = i ^ j;
i = i ^ j;
j = i ^ j;
printf("The values of i and j are %d, %d", i, j);
return 0;
}
From the logic diagram:
Top gate gives $A\cdot B$
Lower combination gives $A\cdot C$ and $B\cdot C$
Final OR combines all three terms
So,
$Q = A\cdot B + A\cdot C + B\cdot C$
Consider a relation schema $R(A,B,C,D)$ with the following set of functional dependencies:
$FD={A\rightarrow BC,\ B\rightarrow C,\ A\rightarrow B,\ AB\rightarrow C,\ AC\rightarrow D}$.
Which of the following is irreducible set of the above defined FDs?
If we have six stack operations; pushing and popping each of $A$, $B$ and $C$ such that push$(A)$ must occur before push$(B)$ which must occur before push$(C)$, then $A,B,C$ is a possible order for the pop operations. Which one of the following orders could not be the order the pop operations are run, if we are to satisfy the requirements described above?
Push order: $A \rightarrow B \rightarrow C$
Valid pop orders must follow stack (LIFO) constraints.
BAC cannot occur under stack rules with given push order.