According to Dempster-Shafer theory for uncertainty management,
Where $Bel(A)$ denotes Belief of event $A$.
a.
$Bel(A) + Bel(\neg A) \le 1$
Correct Answer
b.
$Bel(A) + Bel(\neg A) \ge 1$
c.
$Bel(A) + Bel(\neg A) = 1$
d.
$Bel(A) + Bel(\neg A) = 0$
Step-by-Step AI Explanation
Verified Method
In Dempster-Shafer theory of evidence, the belief function $Bel$ satisfies the property that $Bel(A) + Bel(
eg A) \le 1$. The difference $1 - (Bel(A) + Bel(\neg A))$ represents the measure of ignorance or uncertainty regarding the proposition $A$.
Q2mcq
Match List-I and List-II
| List-I | List-II |
| :--- | :--- |
| (A) Isolated I/O | (i) Same set of control signal for I/O and memory communication. |
| (B) Memory mapped I/O | (ii) Separate instructions for I/O and memory communication. |
| (C) I/O interface | (iii) Requires control signals to be transmitted between the communicating units. |
| (D) Asynchronous data transfer | (iv) Resolve the differences in central computer and peripherals. |
Matching the terms from computer architecture:
- **(A) Isolated I/O:** Uses distinct/separate instructions (like IN and OUT) for I/O and memory communication $\to$ **(ii)**.
- **(B) Memory mapped I/O:** Uses the same set of instructions and control signals (like read and write) for both memory and I/O devices $\to$ **(i)**.
- **(C) I/O interface:** Resolves differences in operating characteristics, speed, and format between the central computer and external peripherals $\to$ **(iv)**.
- **(D) Asynchronous data transfer:** Requires control/strobe/handshaking signals to be transmitted between communicating units to coordinate data transfer $\to$ **(iii)**.
Thus, the correct mapping is (A)-(ii), (B)-(i), (C)-(iv), (D)-(iii).
Q3mcq
Piconet is a basic unit of a bluetooth system consisting of ________ master node and up to ________ active slave nodes.
a.
one, five
b.
one, seven
Correct Answer
c.
two, eight
d.
one, eight
Step-by-Step AI Explanation
Verified Method
A Bluetooth Piconet consists of one master node and up to seven active slave nodes (plus up to 255 parked or standby nodes).
Q4mcq
Let $P$ be the set of all people. Let $R$ be a binary relation on $P$ such that $(a, b)$ is in $R$ if $a$ is a brother of $b$. Is $R$ symmetric, transitive, an equivalence relation, a partial order relation?
a.
NO, NO, NO, NO
Correct Answer
b.
NO, NO, YES, NO
c.
NO, YES, NO, NO
d.
NO, YES, YES, NO
Step-by-Step AI Explanation
Verified Method
Let $R$ be defined on the set of all people $P$ as $(a, b) \in R$ if $a$ is a brother of $b$.
1. **Symmetric:** If $a$ is a brother of $b$ and $b$ is female (a sister), then $b$ is not a brother of $a$. Hence, $R$ is not symmetric.
2. **Transitive:** While usually brother of a brother is a brother, a person is typically not considered their own brother (a person cannot be a brother of himself: $(a, a) \notin R$). If $a$ is a brother of $b$, then $b$ is also a brother of $a$ (assuming both are male). If $R$ were transitive, $(a, b) \in R$ and $(b, a) \in R$ would imply $(a, a) \in R$, which is false. Thus, $R$ is not transitive.
3. **Equivalence / Partial order:** Since it is neither reflexive nor symmetric/transitive, it is neither an equivalence relation nor a partial order relation.
Therefore, the answer is NO, NO, NO, NO.
Q5mcq
The Boolean expression $AB + A\overline{B} + \overline{A}C + AC$ is unaffected by the value of the Boolean variable ________.
a.
$A$
b.
$B$
Correct Answer
c.
$C$
d.
$A$, $B$ and $C$
Step-by-Step AI Explanation
Verified Method
Simplifying the given Boolean expression:
$$AB + A\overline{B} + \overline{A}C + AC = A(B + \overline{B}) + (\overline{A} + A)C$$
Since $B + \overline{B} = 1$ and $\overline{A} + A = 1$:
$$= A(1) + (1)C = A + C$$
The simplified expression is $A + C$, which is completely independent of the variable $B$. Thus, the expression is unaffected by the value of $B$.
Q6mcq
Consider the following grammars:-
$G_1 : S \to aSb \mid bSa \mid aa$
$G_2 : S \to aSb \mid bSa \mid SS \mid \lambda$
$G_3 : S \to aSb \mid bSa \mid SS \mid a$
$G_4 : S \to aSb \mid bSa \mid SS \mid SSS \mid \lambda$
Which of the following is correct w.r.t. the above grammars?
a.
$G_1$ and $G_3$ are equivalent
b.
$G_2$ and $G_3$ are equivalent
c.
$G_2$ and $G_4$ are equivalent
Correct Answer
d.
$G_3$ and $G_4$ are equivalent
Step-by-Step AI Explanation
Verified Method
Both $G_2$ and $G_4$ generate the language of all strings over $\{a, b\}$ with an equal number of $a$'s and $b$'s ($N_a(w) = N_b(w)$):
- In $G_2$: $S \to aSb \mid bSa \mid SS \mid \lambda$ is the classic standard context-free grammar generating all strings with an equal count of $a$'s and $b$'s.
- In $G_4$: The rule $S \to SSS$ is redundant because $S \to SS$ already allows generating any sequence of blocks generated by $S$ (by applying $S \to SS \to SSS$). Hence, $L(G_4) = L(G_2)$.
Therefore, $G_2$ and $G_4$ are equivalent.
Q7mcq
The time complexity to multiply two polynomials of degree $n$ using Fast Fourier transform method is:
a.
$\theta(n\lg n)$
Correct Answer
b.
$\theta(n^2)$
c.
$\theta(n)$
d.
$\theta(1\text{gn})$
Step-by-Step AI Explanation
Verified Method
Using the Fast Fourier Transform (FFT), two polynomials of degree $n$ can be multiplied by:
1. Evaluating both polynomials at $2n$ points using FFT in $\Theta(n \lg n)$ time.
2. Multiplying their point-value representations pointwise in $\Theta(n)$ time.
3. Interpolating the resulting values back to coefficient form using Inverse FFT in $\Theta(n \lg n)$ time.
Thus, the overall time complexity is $\Theta(n \lg n)$.
Q8mcq
Let $W_{ij}$ represents weight between node $i$ at layer $k$ and node $j$ at layer $(k-1)$ of a given multilayer perception. The weight updation using gradient descent method is given by
(Where $\alpha$ and $E$ represents learning rate and Error in the output respectively)
In gradient descent optimization, parameters are updated in the direction opposite to the gradient of the error function with respect to that weight to minimize the error:
$$W_{ij}(t+1) = W_{ij}(t) - \alpha \frac{\partial E}{\partial W_{ij}}$$
where $\alpha$ is the learning rate ($0 \le \alpha \le 1$).
Q9mcq
Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength of fitness of a chromosomes in decimal form, $x$, is given by
$$S f(x) = \frac{f(x)}{\sum f(x)} \text{ where } f(x) = x^2$$
The population is given by $P$ where: $P = \{(01101), (11000), (01000), (10011)\}$
The strength of fitness of chromosome (11000) is _______.
a.
24
b.
576
c.
14.4
d.
49.2
Correct Answer
Step-by-Step AI Explanation
Verified Method
Convert each chromosome from binary to decimal:
- $(01101)_2 = 13 \implies f(13) = 13^2 = 169$
- $(11000)_2 = 24 \implies f(24) = 24^2 = 576$
- $(01000)_2 = 8 \implies f(8) = 8^2 = 64$
- $(10011)_2 = 19 \implies f(19) = 19^2 = 361$
The sum of fitness values is:
$$\sum f(x) = 169 + 576 + 64 + 361 = 1170$$
The strength of fitness of chromosome $(11000)$ is:
$$Sf(24) = \frac{576}{1170} \approx 0.4923 = 49.2\%$$
Q10mcq
How many reflexive relations are there on a set with 4 elements?
a.
$2^4$
b.
$2^{12}$
Correct Answer
c.
$4^2$
d.
2
Step-by-Step AI Explanation
Verified Method
A relation $R$ on a set with $n$ elements is reflexive if $(a, a) \in R$ for every element $a$. There are $n$ reflexive pairs $(a, a)$, each of which must be present. The remaining $n^2 - n$ pairs $(a, b)$ with $a \neq b$ can either be included or excluded independently. Therefore, the total number of reflexive relations is $2^{n^2 - n}$. For $n = 4$, this gives $2^{4^2 - 4} = 2^{16 - 4} = 2^{12}$.
🎉 10 Free Sample Solutions Completed
Unlock All 100 Questions & Solutions
Sign up free in seconds to unlock step-by-step AI answers for the remaining 90 questions.
Consider the following statements with respects to the language $L = \{a^n b^n \mid n \ge 0\}$
S1 : $L^2$ is context free language
S2 : $L^k$ is context free language for any given $k \ge 1$
S3 : $\overline{L}$ and $L^*$ are context free language
Which one of the following is correct?
a.
S1 and S2 only
b.
S1 and S3 only
c.
S2 and S3 only
d.
S1, S2 and S3
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a weighted directed graph. The current shortest distance from $S$ to nodes $x$ is represented by $d[x]$. Let $d[v] = 29$, $d(u) = 15$, $w[u, v] = 12$. What is the updated value of $d[v]$ based on current information?
a.
29
b.
27
c.
25
d.
17
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following are legal statements in C programming language?
(1) int * P = &44;
(2) int * P = &r;
(3) int P = &a;
(4) int P = a;
Choose the correct option
a.
(1) and (2)
b.
(2) and (3)
c.
(2) and (4)
d.
(1) and (4)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In a B-Tree, each node represents a disk block. Suppose one block holds 8192 bytes. Each key uses 32 bytes, In a B-tree of order M there are $\text{M} - 1$ keys Since each branch is on another disk block. we assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is
a.
$32\text{ M} - 32$
b.
$36\text{ M} - 32$
c.
$36\text{ M} - 36$
d.
$32\text{ M} - 36$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following Linear programming problem (LPP):
Maximize $z = x_1 + x_2$
Subject to the constraints
$x_1 + 2x_2 \le 2000$
$x_1 + x_2 \le 1500$
$x_2 \le 600$
and $x_1, x_2 \ge 0$
The solution of the LPP is:
a.
$x_1 = 750$, $x_2 = 750$, $z = 1500$
b.
$x_1 = 500$, $x_2 = 1000$, $z = 1500$
c.
$x_1 = 1000$, $x_2 = 500$, $z = 1500$
d.
$x_1 = 900$, $x_2 = 600$, $z = 1500$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
What is the output of following C program?
# include <stdio.h>
main ( )
{
int i, j, x = 0;
for (i = 0; i < 5; ++i)
for (j = 0; j < 5; ++j)
{
x += (i + j - 1);
break;
}
printf ("%d", x);
}
a.
6
b.
5
c.
4
d.
3
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A rectangle is bound by the lines $x = 0; y = 0; x = 5$ and $y = 3$. The line segment joining $(-1,0)$ and $(4,5)$, if clipped against this window will connect the points _______.
a.
$(0,1)$ and $(3,3)$
b.
$(0,1)$ and $(2,3)$
c.
$(0,1)$ and $(4,5)$
d.
$(0,1)$ and $(3,5)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the Agile Process models with the task performed during the model:
List-I
(A) Scrum
(B) Adaptive software development
(C) Extreme programming
(D) Feature-driven development
List-II
(i) CRC cards
(ii) Sprint backlog
(iii) <action> the <resul> <by/for/of/to> $a(n)$ <object>
(iv) Time box release plan
Choose the correct option from those given below:
a.
(A)-(ii), (B)-(iv), (C)-(i), (D)-(iii)
b.
(A)-(i), (B)-(iii), (C)-(ii), (D)-(iv)
c.
(A)-(ii), (B)-(i), (C)-(iv), (D)-(iii)
d.
(A)-(i), (B)-(iv), (C)-(ii), (D)-(iii)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate. if basic feasible solution contains exactly ________ number of individual allocation in ________ positions.
a.
$m + n + 1$, independent
b.
$m + n - 1$, independent
c.
$m + n - 1$, appropriate
d.
$m - n + 1$, independent
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A computer uses a memory unit of 512 K words of 32 bits each. A binary instruction code is stored in one word of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addressing mode (direct and indirect), an operation code, a register code part to specify one of the 256 registers and an address part. How many bits are there in addressing mode part, opcode part, register code part and the address part?
a.
1,3,9,19
b.
1,4,9,18
c.
1,4,8,19
d.
1,3,8,20
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Java Virtual Machine (JVM) is used to executive architectural neutral byte code. Which of the following is needed by the JVM for execution of Java code?
a.
Class loaded only
b.
Class loader and Java Interpreter
c.
Class loader, Java Interpreter and API
d.
Java Interpreter only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following models:
M1: Mamdani model
M2: Takagi–Sugeno–Kang model
M3: Kosko's additive model (SAM)
Which of the following option contains examples of additive rule model?
a.
M1 and M2 only
b.
M2 and M3 only
c.
M1 and M3 only
d.
M1, M2 and M3
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match List-I with List-II
\begin{tabular}{ll}
List-I & List-II \\
(A) Frame attribute & (i) to create link in HTML \\
(B) <tr> tab & (ii) for vertical alignment of content in cell \\
(C) Valign attribute & (iii) to enclose each row in table \\
(D) <a> tag & (iv) to specify the side of the table frame that display border
\end{tabular}
Choose the correct option from those given below:
a.
(A)-(i), (B)-(ii), (C)-(iii), (D)-(iv)
b.
(A)-(ii), (B)-(i), (C)-(iii), (D)-(iv)
c.
(A)-(iv), (B)-(iii), (C)-(ii), (D)-(i)
d.
(A)-(iii), (B)-(iv), (C)-(ii), (D)-(i)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a paging system where translation look aside buffer (TLB) a special type of associative memory is used with hit ratio of $80\%$.
Assume that memory reference takes $80\text{ nanoseconds}$ and reference time to TLB is $20\text{ nanoseconds}$.
What will be the effective memory access time given $80\%$ hit ratio?
a.
110 nanoseconds
b.
116 nanoseconds
c.
200 nanoseconds
d.
100 nanoseconds
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following language families:
$L_1 \equiv$ The context -- free languages
$L_2 \equiv$ The context -- sensitive languages
$L_3 \equiv$ The recursively enumerable languages
$L_4 \equiv$ The recursive languages
Which one of the following options is correct?
a.
$L_1 \subseteq L_2 \subseteq L_3 \subseteq L_4$
b.
$L_2 \subseteq L_1 \subseteq L_3 \subseteq L_4$
c.
$L_1 \subseteq L_2 \subseteq L_4 \subseteq L_3$
d.
$L_2 \subseteq L_1 \subseteq L_4 \subseteq L_3$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements:
(1) Fiber optic cable is much lighter than copper cable.
(2) Fiber optic cable is not affected by power surges or electromagnetic interference.
(3) Optical transmission is inherently bidirectional
Which of the statements is (are) correct?
a.
(1) and (2) only
b.
(1) and (3) only
c.
(2) and (3) only
d.
(1), (2) and (3)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements:
S1: If a group $(G, *)$ is of order $n$, and $a \in G$ is such that $a^m = e$ for some integer $m \le n$, then $m$, must divide $n$.
S2: If a group $(G, *)$ is of even order, then there must be an element $a \in G$ such that $a \ne e$ and $a * a = e$.
Which of the statements is (are) correct?
a.
S1 only
b.
S2 only
c.
Both S1 and S2
d.
Neither S1 nor S2
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the game tree given below :
Here $\square$ and $\bigcirc$ reresent MIN and MAX nodes respectively, The value of the root node of the game tree is:
a.
14
b.
17
c.
111
d.
112
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
An _____ chart is a project schedule representation that presents projects plan as a directed graph. The critical path is the _____ sequence of _____ tasks and it defines project _____.
a.
Activity, Shortest, Independent, Cost
b.
Activity, Longest, Dependent, Duration
c.
Activity, Longest, Independent, Duration
d.
Activity, Shortest, Dependent, Duration
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements:
(1) The running time of dynamic programming algorithm is always $\theta(\rho)$ where $\rho$ is number of subproblems.
(2) When a recurrence relation has cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct dynamic program.
(3) For a dynamic programming algorithm, computing all values in a bottom-up fashion is asymptotically faster than using recursion and memorization.
(4) If a problem $X$ can be reduced to a known NP-hard problem, then $X$ must be NP-hard.
Which of the statement(s) is (are) true?
a.
(1) and (2) only
b.
(2) only
c.
(2) and (3) only
d.
(2) and (4) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all insertions can be accomodated.
a.
$\theta(1), \theta(n)$
b.
$\theta(n), \theta(1)$
c.
$\theta(1), \theta(1)$
d.
$\theta(n), \theta(n)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements:
$\text{S}_1$: $\forall x P(x) \vee \forall x Q(x)$ and $\forall x (P(x) \vee Q(x))$ are not logically equivalent.
$\text{S}_2$: $\exists x P(x) \wedge \exists x Q(x)$ and $\exists x (P(x) \wedge Q(x))$ are not logically equivalent.
Which of the following statements is/are correct?
a.
$\text{S}_1$ only
b.
$\text{S}_2$ only
c.
$\text{S}_1$ and $\text{S}_2$ both
d.
Neither $\text{S}_1$ nor $\text{S}_2$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A fuzzy conjunction operations, $t(x, y)$, and a fuzzy disjunction operator, $s(x, y)$, from a pair if they satisfy:
$$t(x, y) = 1 - s(1-x, 1-y).$$
if $t(x, y) = \frac{xy}{(x + y - xy)}$ then $s(x, y)$ is given by
a.
$\frac{x+y}{1-xy}$
b.
$\frac{x+y-2xy}{1-xy}$
c.
$\frac{x+y-xy}{1-xy}$
d.
$\frac{x+y-xy}{1+xy}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match List-I and List-II:
\begin{tabular}{ll}
\textbf{List-I} & \textbf{List-II} \\
(A) Physical layer & (i) Provide token management service \\
(B) Transport layer & (ii) Concerned with transmitting raw bits over a communication channel \\
(C) Session layer & (iii) Concerned with the syntax and semantics of the information transmitted \\
(D) Presentation layer & (iv) True end-to-end layer from source to destination
\end{tabular}
a.
(A)-(ii), (B)-(iv), (C)-(iii), (D)-(i)
b.
(A)-(iv), (B)-(iii), (C)-(ii), (D)-(i)
c.
(A)-(ii), (B)-(iv), (C)-(i), (D)-(iii)
d.
(A)-(iv), (B)-(ii), (C)-(i), (D)-(iii)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A network with bandwidth of $10\text{ Mbps}$ can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughtput of this network?
a.
1,000,000 bps
b.
2,000,000 bps
c.
12,000,000 bps
d.
1,200,00,000 bps
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Two concurrent executing transactions $T_1$ and $T_2$ are allowed to update same stock item say 'A' in an uncontrolled manner. In such scenario, following problems may occur:
(1) Dirty read problem
(2) Lost update problem
(3) Transaction failure
(4) Inconsistent database state
a.
(1), (2) and (3) only
b.
(3) and (4) only
c.
(1) and (2) only
d.
(1), (2) and (4) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider $\Sigma = \{w, x\}$ and $T = \{x, y, z\}$. Define homomorphism $h$ by :
$$h(x) = xzy, \quad h(w) = zxyy$$
If $L$ is the regular language denoted by $r = (w + x^*)(ww)^*$, then the regular language $h(L)$ is given by
a.
$(zxyy + xzy)(zxyy)$
b.
$(zxyy + (xzy)^*)(zxyyzxyy)^*$
c.
$(zxyy + zxzy)(zxyy)^*$
d.
$(zxyy + (xzy)^*)(zxyyzxyy)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
If we want to resize a $1024 \times 768$ pixels image to one that is $640$ pixels wide with the same aspect ratio, what would be the height of the resized image?
a.
420 pixels
b.
460 pixels
c.
480 pixels
d.
540 pixels
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $A = \{001, 0011, 11, 101\}$ and $B = \{01, 111, 111, 010\}$.
Similarly, let $C = \{00, 001, 1000\}$ and $D = \{0, 11, 011\}$.
Which have the following pairs have a post-correspondence solution?
a.
Only pair $(A, B)$
b.
Only pair $(C, D)$
c.
Both $(A, B)$ and $(C, D)$
d.
Neither $(A, B)$ nor $(C, D)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements with respect to duality in LPP:
(1) The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself.
(2) If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal solution.
(3) If either problem has an unbounded optimum solution, then the other problem has no feasible solution at all.
Which of the statements is (are) correct?
a.
(1) and (2) only
b.
(1) and (3) only
c.
(2) and (3) only
d.
(1), (2) and (3) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given two table $R1(x, y)$ and $R2(y, z)$ with 50 and 30 number of tuples respectively. Find maximum number of tuples in the output of natural join between table $R1$ and $R2$ i.e. $R1 * R2$? ($*$ – Natural Join)
a.
30
b.
20
c.
50
d.
1500
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given two tables EMPLOYEE (\underline{EID}, ENAME, DEPTNO)
DEPARTMENT (\underline{DEPTNO}, DEPTNAME)
Find the most appropriate statement of the given query:
Select count (*) ‘total’
From EMPLOYEE
where DEPTNO (D1. D2)
group by DEPTNO
having count (*) >5
a.
Total number of employees in each department D1 and D2
b.
Total number of employees of department D1 and D2 if their total is >5
c.
Display total number of employees in both departments D1 and D2
d.
The output of the query must have atlest two rows
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements with respect to network security:
(1) Message confidentiality means that the sender and the receiver expect privacy.
(2) Message integrity means that the data must arrive at the receiver exactly as they were sent.
(3) Message authentication means the receiver is ensured that the message is coming from the intended sender.
Which of the statements is (are) correct?
a.
(1) and (2) only
b.
(1) and (3) only
c.
(2) and (3) only
d.
(1), (2) and (3) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The sequence diagram given in Figure-1 for the Weather Information System takes place when an external system requests the summarized data from the weather station. The increasing order of lifeline for the objects in the system are:
a.
Sat comms $\rightarrow$ Weather station $\rightarrow$ Commslink $\rightarrow$ Weather data
b.
Sat comms $\rightarrow$ Comms link $\rightarrow$ Weather station $\rightarrow$ Weather data
c.
Weather data $\rightarrow$ Comms link $\rightarrow$ Weather station $\rightarrow$ Sat comms
d.
Weather data $\rightarrow$ Weather station $\rightarrow$ Common link $\rightarrow$ Sat comms
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given CPU time slice 2ms and following list of processes.
\begin{tabular}{|c|c|c|}
\hline
Process & Brust time (ms) & Arrival time \\
\hline
$\text{P}_1$ & 3 & 0 \\
$\text{P}_2$ & 4 & 2 \\
$\text{P}_3$ & 5 & 5 \\
\hline
\end{tabular}
Find average turnaround time and average waiting time using round robin CPU scheduling?
a.
4, 0
b.
5.66, 1.66
c.
5.66, 0
d.
7, 2
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A non-pipelined system takes 30ns to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of 10 ns. Determine the speed up of the pipeline for 100 tasks.
a.
3
b.
4
c.
3.91
d.
2.91
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The following multithreaded algorithm computer transpose of a matrix in parallel:
p Trans $(X, Y, N)$
if $N = 1$
then $Y[1, 1] \leftarrow X[1, 1]$
else partition $X$ into four $(N/2) \times (N/2)$ submatrices $X_{11}, X_{12}, X_{21}, X_{22}$
partition $Y$ into four $(N/2) \times (N/2)$ submatrices $Y_{11}, Y_{12}, Y_{21}, Y_{22}$
spawn p Trans $(X_{11}, Y_{11}, N/12)$
spawn p Trans $(X_{12}, Y_{12}, N/12)$
spawn p Trans $(X_{21}, Y_{21}, N/12)$
spawn p Trans $(X_{22}, Y_{22}, N/12)$
What is the asymptotic parallelism of the algorithm?
a.
$T_1 / T_\infty$ or $\theta(N^2 / \lg N)$
b.
$T_1 / T_\infty$ or $\theta(N^2 / \lg N)$
c.
$T_1 / T_\infty$ or $\theta(\lg N / N^2)$
d.
$T_1 / T_\infty$ or $\theta(\lg N / N)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Conisder the following learning algorithms:
(1) Logistic repression
(2) Back propogation
(3) Linear repression
Which of the following option represents classification algorithms?
a.
(1) and (2) only
b.
(1) and (3) only
c.
(2) and (3) only
d.
(1), (2) and (3) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $G = (V, T, S, P)$ be any context-free grammar without any $\lambda-$productions or unit productions. Let $K$ be the maximum number of symbols on the right of any production in $P$. The maximum number of production rules for any equivalent grammer in Chomsky normal form is given by:
a.
$(K - 4|P| + |T| - 1)$
b.
$(K - 1)|P| + |T|$
c.
$K|P| + |T| - 1$
d.
$K|P| + |T|$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Accordings to the ISO - 9126 Standard Quality Model, match the attributes given in List-I with their definitions in List-II:
**List-I**
(A) Funcionality
(B) Reliability
(C) Efficiency
(D) Maintainability
**List-II**
(i) Relationship between level of performance and amount of resources
(ii) Characteristics related with achievement of purpose
(iii) Effort needed to make for improvement
(iv) Capability of software to maintain performance of software
Choose the correct option from the ones given below :
a.
(A)-(i), (B)-(ii), (C)-(iii), (D)-(iv)
b.
(A)-(ii), (B)-(i), (C)-(iv), (D)-(iii)
c.
(A)-(ii), (B)-(iv), (C)-(i), (D)-(iii)
d.
(A)-(i), (B)-(ii), (C)-(iv), (D)-(iii)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match List-I with List-II
**List-I**
(A) Micro operation
(B) Micro programmed control unit
(C) Interrupts
(D) Micro instruction
**List-II**
(i) Specify micro operations
(ii) Improve CPU utilization
(iii) Control Memory
(iv) Elementary operation performed on data stored in registers
Choose the correct option from those given below :
a.
(A)-(iv), (B)-(iii), (C)-(ii), (D)-(i)
b.
(A)-(iv), (B)-(iii), (C)-(i), (D)-(ii)
c.
(A)-(iii), (B)-(iv), (C)-(i), (D)-(ii)
d.
(A)-(iii), (B)-(vi), (C)-(ii), (D)-(i)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
What are the greatest lower bound (GLB) and the least upper bound (LUB) of the sets $A = \{3,9,12\}$ and $B = \{1,2,4,5,10\}$ if they exist in poset $(z^+,/)$?
a.
$A(GLB - 3, LUB - 36); B(GLB - 1, LUB - 20)$
b.
$A(GLB - 3, LUB - 12); B(GLB - 1, LUB - 10)$
c.
$A(GLB - 1, LUB - 36); B(GLB - 2, LUB - 20)$
d.
$A(GLB - 1, LUB - 12); B(GLB - 2, LUB - 10)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the component module of DBMS does rearrangement and possible ordering of operations eleminate redundancy in query and use efficient algorithms and indexes during the execution of a query?
a.
Query compiler
b.
Query optimizer
c.
Stored data manager
d.
Database processor
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Identify the circumstances under which pre-emptive CPU scheduling is used:
(1) A process switches from Running state to Ready state
(2) A process switches from Waiting state Ready state
(3) A process completes its execution
(4) A process switches from Ready to Waiting state
Choose the correct option:
a.
(1) and (2) only
b.
(1) and (4) only
c.
(3) and (4) only
d.
(1), (2) and (3) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In a system for a restaurant, the main scenario for placing order is given below:
(1) Customer reads menu
(2) Customer places order
(3) Order is sent to kitchen for preparation
(4) Ordered items are served
(5) Customer request for a bill for the order
(6) Bill is prepared for this order
(7) Customer is given the bill
(8) Customer pays the bill
A sequence diagram for the scenario will have atleast how many objects among whome the messages will be exchanged.
a.
3
b.
4
c.
5
d.
6
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements:
S1: These exists no algorithm for deciding if any two Turning machines $M_1$ and $M_2$ accept the same language.
S2: Let $M_1$ and $M_2$ be arbitrary Turning machines. The problem to determine $L(M_1) \subseteq L(M_2)$ is undecidable.
Which of the statements is (are) correct?
a.
S1 Only
b.
S2 only
c.
Both S1 and S2
d.
Neither S1 nor S2
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $a^{2c} \bmod n = \left(a^c\right)^2 \bmod n$ and $a^{2c+1} \bmod n = a \cdot \left(a^c\right)^2 \bmod n$. For $a = 7, b = 17$ and $n = 561$.
What is the value of $a^b \pmod n$?
a.
160
b.
166
c.
157
d.
67
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Suppose a system has 12 magnetic tape drives and at time $t_0$, three proceses are alloted tape drives out of their need as given below:
\begin{tabular}{ccc}
& \textbf{Maximum Need} & \textbf{Current Allocation} \\
$\text{p}_0$ & 10 & 5 \\
$\text{p}_1$ & 4 & 2 \\
$\text{p}_2$ & 9 & 2
\end{tabular}
At time $t_0$, the system is in safe state. Which of the following is safe sequence so that deadlock is avoided?
a.
$\langle p_0, p_1, p_2 \rangle$
b.
$\langle p_1, p_0, p_2 \rangle$
c.
$\langle p_2, p_1, p_0 \rangle$
d.
$\langle p_0, p_2, p_1 \rangle$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a subnet with 720 routers. If a three-level hierarchy is chosen, with eight clusters, each containing 9 regions of 10 routers, then total number of entries in hierarchical table of each router is
a.
25
b.
27
c.
53
d.
72
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The following program is stored in the memory unit of the basic computer. Give the content of accumulator register in hexadecimal after the execution of the program:
\begin{tabular}{|c|c|}
\hline
Location & Instruction \\
\hline
010 & CLA \\
\hline
011 & ADD 016 \\
\hline
012 & BUN 014 \\
\hline
013 & HLT \\
\hline
014 & AND 017 \\
\hline
015 & BUN 013 \\
\hline
016 & C1A5 \\
\hline
017 & 93C \\
\hline
\end{tabular}
a.
A1B4
b.
81B4
c.
A184
d.
8184
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The Reduced Instruction Set Computer (RISC) characteristics are:
(1) Single cycle instruction execution
(2) Variable length instruciton formats
(3) Instructions that manipulates operands in memory
(4) Efficient instruction pipeline
Choose the correct characteristics from the options given below:
a.
(1) and (2)
b.
(2) and (3)
c.
(1) and (4)
d.
(3) and (4)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following:
(1) Trapping at local maxima
(2) Reaching a plateau
(3) Traversal along the ridge
Which of the following option represents shortcomings of hill climbing algorithm?
a.
(1) and (2) only
b.
(1) and (3) only
c.
(2) and (3) only
d.
(1), (2) and (3)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A micro instruction format has microoperation field which is divided into 2 subfields F1 and F2, each having 15 distinct microoperations, condition field CD for four status bits, branch field BR having four options used in conjunction with address field AD. The address space is of 128 memory words. The size of micro instructionis:
a.
19
b.
18
c.
17
d.
20
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements with respect to approaches to fill area on rester systems:
P: To determine the overlap intervals for scan lines that cross the area.
Q: To start from a given interior position and paint outward from this point until we encounter the specified boundary conditions.
Select the correct answer from the options given below:
a.
P only
b.
Q only
c.
Both P and Q
d.
Neither P nor Q
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following statements:
(1) Window Azure is a cloud-operating system.
(2) Google App Engine is an integrated set of online services for consumers to communicate and share with others.
(3) Amzon Cloud Front is a web service for content delivery
Which of the statements is (are) correct?
a.
(1) and (2) only
b.
(1) and (3) only
c.
(2) and (3) only
d.
(1), (2) and (3)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following grammar:
$$S \rightarrow 0A | 0BB$$
$$A \rightarrow 00A | \lambda$$
$$B \rightarrow 1B | 11C$$
$$C \rightarrow B$$
Which language does this grammar generate?
a.
$L((00)^*0 + (11)^*1)$
b.
$L(0(11)^* + 1(00)^*)$
c.
$L((00)^*0)$
d.
$L(0(11)^*1)$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
An instruction is stored at location 500 with its address field at location 501. The address field has the value 400. A processor register $\text{R}_1$ contains the number 200. Match the addressing mode (List-I) given below with effective address (List-II) for the given instruction:
List-I
(A) Direct
(B) Register indirect
(C) Index with $\text{R}_1$ as the index register
(D) Relative
List-II
(i) 200
(ii) 902
(iii) 400
(iv) 600
Choose the correct option from those given below:
a.
(A)-(iii), (B)-(i), (C)-(iv), (D)-(ii)
b.
(A)-(i), (B)-(ii), (C)-(iii), (D)-(iv)
c.
(A)-(iv), (B)-(ii), (C)-(iii), (D)-(i)
d.
(A)-(iv), (B)-(iii), (C)-(ii), (D)-(i)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which of the following statements are true regarding C++?
(1) Overloading gives the capability to an existing operator to operate on other data types
(2) Inheritance in object oriented programming provides support to reusability
(3) When object of a derived class is defined, first the constructor of derived class is executed then constructor of a base class is executed.
(4) Overloading is a type of polymorphism.
Choose the correct option form those given below:
a.
(1) and (2) only
b.
(1), (2) and (3) only
c.
(1), (2) and (4) only
d.
(2), (3) and (4) only
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following languages:
$$L_1 = \{a^n b^n c^m\} \cup \{a^n b^m c^m\}, n, m \ge 0$$
$$L_2 = \{w w^R \mid w \in \{a, b\}^*\}$$, where $R$ represents reversible operations.
Which one of the following is (are) inherently ambigous language(s)?
a.
only $L_1$
b.
only $L_2$
c.
both $L_1$ and $L_2$
d.
neither $L_1$ nor $L_2$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Answer the following question (91-95) based on flow graph F.
A flow graph F with entry nod (1) and exit nod (11) is shown below:
How many regions are there in flowgraph F?
a.
2
b.
3
c.
4
d.
5
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Assume that given table $R$ is decomposed in two tables
$R_1(A, B, C)$ with functional dependency set $F_1 = \{A \to B, A \to C\}$ and
$R_2(A, D, E)$ with $FD$ set $F_2 = \{A \to D, D \to E\}$.
Which of the following option is true w.r.t. given decompositions?
a.
Dependency preservation property is followed
b.
$R_1$ and $R_2$ are both in $2NF$
c.
$R_2$ is in $2NF$ and $R_3$ is in $3NF$
d.
$R_1$ is in $3NF$ and $R_2$ is in $2NF$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
