2
Which of following statement is true ? S1. Any boolean function can be realized using decoder s2. One multiplexer can realize 1 function at a time a) S1 is true b) S2 is true 3) Both are true d) none of them
3
bhai integration is area only http://www.mathsisfun.com/calculus/integration-introduction.html
4
5
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}}$
6
C) P - iii, Q - i, R - iv, S - ii Ref: https://en.wikipedia.org/wiki/Software_testing
7
Is there any SQL command which belongs to both DDL and DML?
8
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 recursively enumerable and Recursively Enumerable set is closed under Union. So, $L_1' \cup L_2$ is recursively enumerable. ... $L_2$')' $= L_2$ is also recursive which is not the case here. So, $II$ is also false.
9
$\lim_{x\rightarrow \infty } x^{ \tfrac{1}{x}}$ is $\infty$ 0 1 Not defined
10
B. Worst case for quick sort happens when $1$ element is on one list and $n-1$ elements on another list.
11
Match the following: (P) Condition Coverage (i) Black-box testing (Q) Equivalence class partitioning (ii) System testing (R) Volume testing (iii) White-box testing (S) Alpha testing (iv) Performance testing P - ii, Q - iii, R - i, S - iv P - iii, Q - iv, R - ii, S - i P - iii, Q - i, R - iv, S - ii P - iii, Q - i, R - ii, S - iv
12
Option is D. $foo$ is printing the lowest digit. But the $printf$ inside it is after the recursive call. This forces the output to be in reverse order $2, 0, 4, 8$ The final value $sum$ printed will be $0$ as $C$ uses pass by value and hence the modified value inside $foo$ won't be visible inside $main$.
13
Let $G$ be a finite group. If $A$ and $B$ are subgroups of $G$ with orders 4 and 5 respectively, then $|A \cap B|$ = ______.
14
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 they cannot have a least upper bound<which is always unique for a pair for vertices>. In ... {f,g}. therefore it is not a join semilattice(every pair of element should have a least upper bound). henceforth it is also not a lattice
15
answer - C There are 2 decision points in this module 1. while condition and 2. if condition hence cyclomatic complexity = number of decision points + 1 = 3
16
Here bound of the loop are constants, therefore compiler will do the loop unrolling(If compiler won't then prefetcher will do) to increase the instruction level parallelism. And after loop unrolling $23$ cycles are required for execution. Therefore, correct answer would be (B). PS: We ...
17
The sequence &hellip;&hellip;&hellip;&hellip;&hellip; is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for &hellip;&hellip;&hellip;&hellip;&hellip;&hellip;&hellip; unit(s) of time. ---------------------------- Job Arrival_Time Burst_Time ------------------ ... (2,1,3},0 (c) {3,2,1),0 (d) {1,2,3},5 Ans: option (a) please explain why answer is a)....
18
The function terminates for all powers of $2$ (which is infinite), hence (i) is false and (ii) is TRUE. Let $n = 5.$ Now, recursive calls will go like $5 - 14 - 7 - 20 - 10 - 5 -$ And this goes into infinite recursion. And if we multiply $5$ with ... possible, there are infinite recursions possible (even considering this case only). So, (iv) is TRUE and (iii) is false. So, correct answer is (D).
19
SLR paper is more powerful than LALR . False . LALR parser is more powerful than Canonical LR parser . False . Canonical LR parser is more powerful than LALR parser. True. The parsers SLR, Canonical CR, and LALR have the same power. False. answer - C
20
21
no. It asks for "NOT" supported in HTML
22
I searched the paper of 1996 from internet, that question paper is having first option not same as given but the same diagram, and unfortunately option given in that paper also wrong.
23
Its not a difficult topic- but not highlighted in books. Most books tell what common students want. The fact that you asked this question shows that you are interested in learning and you should definitely go for MTech or MS.
26
A software project plan has identified ten tasks with each having dependencies as given in the following table: Task Depends On T1 - T2 T1 T3 T1 T4 T1 T5 T2 T6 T3 T7 T3, T4 T8 T4 T9 T5, T7, T8 T10 T6, T9 Answer the following questions: (Q1) What is the maximum number of tasks ... one time unit and there is no restriction on the number of tasks that can be done in parallel ? 5, 5 4, 4 4, 5 5, 4
27
Time without pipeline $=6 \text{ stages}=6 \text{ cycles}$ Time with pipeline $=1+\text{stall freqency}\times \text{stall cycle}$ $=1+.25\times 2$ $=1.5$ Speed up $=\dfrac{6}{1.5}=4$
28
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
29
Consider the following data path of a CPU. The ALU, the bus and all the registers in the data path are of identical size. All operations including incrementation of the PC and the GPRs are to be carried out in the ALU. Two clock cycles are needed for memory read operation - the ... <= R0 + R1. The minimum number of clock cycles needed for execution cycle of this instruction is: $2$ $3$ $4$ $5$
To see more, click for the full list of questions or popular tags.