Recent posts tagged interview-experience

61
No.$$\begin{array}{|c|c|c|} \hline \text {A} & \text {B} & \text {C} \\\hline\text {1} & \text {5} & \text {6} \\\hline\text {2} & \text {4} & \text {7}\\\hline \text {3...
62
R1,R2 has common attribute B. B is key in R2.so R1(AB) R2(BC) composed into R12(ABC)Between R12(ABC) and R3(CD) common attribute is C and C is key in R3. Hence the decomp...
64
Why we have considered without replacement here?Can't this be like ......1/3 * (4/12 * 3/12) / [1/3 * (4/12 * 3/12 ) + 1/3 * (2/4 * 1/4 ) + 1/3 * (1/6 * 3/6 )] ?
65
Which of the following describes the minimum condition for ambiguity in a grammar? a) Every derived word must have atleast 2 rightmost derivation b) some word must have m...
66
lets rename the attributesa)Let Bookid=A,subject-category-of-book=B,Name-of-author=C,Nationality-of-Author=DA is the Pkhence A+={BCD}F .D is A->BCDSince there is one att...
67
void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); push(s, i); } }
68
If r is a relation on a then it's xsitive closure = the smallest xsitive relation on a which contain r ...eg a={a,b,c} and r= {(a,c),(c,b)} then r* = { (a,c),(c,b),(a,b)}...
69
Lets consider options one by one.Option A $C\Rightarrow a$ or, $C \Rightarrow b $or, $C \Rightarrow aCb \Rightarrow aaCbb \Rightarrow aaaCbbb \ldots $ so on and at last...
70
A only. B is false as for a single tuple, dname cannot be both 'shoe' as well as 'toy' and hence this query returns {}.
71
If you put "Null" as introducer it will work. But by self introduction I mean "john" introducing himself- introducer will be "john" for customer "john". But I guess this ...
72
A machine needs a minimum of $100$ sec to sort $1000$ names by quick sort. The minimum time needed to sort $100$ names will be approximately$50.2$ sec$6.7$ sec$72.7$ sec$...
73
Answer: BRound Trip Time $= 80ms$Frame size $=32\times 8\text{ bits}$Bandwidth $=128\text{ kbps}$Transmission Time $=\dfrac{32\times 8}{128}\ ms = 2\ ms$Let $n$ be the wi...
75
77
starting with 001100110011 means alternative sequence of process P and Q..Process P should start execution so at W, P(s) where S=1..to get alternate sequence X and Y are...
79
Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the ...
80
Option A is correct because height $5$ means level $6$ so maximum node $= 2^l -1 =2^6 -1=63$and for minimum, at each level only single node so total $6$.
81
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
82
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...
84
If $g(x) = 1 - x$ and $h(x) = \frac{x}{x-1}$, then $\frac{g(h(x))}{h(g(x))}$ is:$\frac{h(x)}{g(x)}$$\frac{-1}{x}$$\frac{g(x)}{h(x)}$$\frac{x}{(1-x)^{2}}$
85
C) P - iii, Q - i, R - iv, S - iiRef: https://en.wikipedia.org/wiki/Software_testing
86
Is there any SQL command which belongs to both DDL and DML?
87
Answer is D.$L_1$ is context-free and hence recursive also. Recursive set being closed under complement, $L_1$' will be recursive.$L_1$' being recursive it is also recurs...
88
$\displaystyle \lim_{x\rightarrow \infty } x^{ \tfrac{1}{x}}$ is$\infty $$0$$1$Not defined
89
Correct Option: BWorst case for quick sort happens when $1$ element is on one list and $n-1$ elements on another list.
90
2 is correct answer. fig 2, b and c have {f,g} as upperbound. but for the graph to be a lattice it should have a least upper bound. Since b and c have two upper bounds th...