The postfix expression $\text{AB} + \text{CD} - *$ can be evaluated using a
a.
stack
Correct Answer
b.
tree
c.
queue
d.
linked list
Step-by-Step AI Explanation
Verified Method
A stack is the standard data structure used to evaluate postfix expressions. Operands are pushed onto the stack, and when an operator is encountered, the required number of operands are popped, the operation is performed, and the result is pushed back onto the stack.
Q1mcq
Consider the following pseudocode segment :
\begin{align*}
&\text{K:=0} \\
&\quad \text{for } i_1 := 1 \text{ to } n \\
&\qquad \text{for } i_2 := 1 \text{ to } i_1 \\
&\qquad\quad \vdots \\
&\qquad\qquad \text{for } i_m := 1 \text{ to } i_{m-1} \\
&\qquad\qquad\quad \text{K:= K+1}
\end{align*}
The value of K after the execution of this code shall be
a.
$C(n + m - 1, m)$
Correct Answer
b.
$C(n - m + 1, m)$
c.
$C(n + m - 1, n)$
d.
$C(n - m + 1, n)$
Step-by-Step AI Explanation
Verified Method
The loops satisfy $1 \le i_m \le i_{m-1} \le \dots \le i_1 \le n$. This corresponds to choosing $m$ integers from the set $\{1, 2, \dots, n\}$ with repetition allowed (a multiset of size $m$ from $n$ elements). The number of such sequences is given by the stars and bars formula: $\binom{n + m - 1}{m} = C(n+m-1, m)$.
Q2mcq
The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.
a.
ABFCDE
b.
ADBFEC
c.
ABDECF
d.
None of the above
Correct Answer
Step-by-Step AI Explanation
Verified Method
A binary tree cannot be uniquely reconstructed using only its postorder traversal without knowing its inorder traversal (or without it being a specific type like a full binary tree or BST). Multiple binary trees can yield the postorder traversal DEBFCA, and these different trees would have different preorder traversals. Hence, the preorder traversal cannot be uniquely determined, making 'None of the above' the correct choice.
Q2mcq
In Delta Rule for error minimization
a.
weights are adjusted w.r.to change in the output
b.
weights are adjusted w.r.to difference between desired output and actual output
Correct Answer
c.
weights are adjusted w.r.to difference between input and output
d.
none of the above.
Step-by-Step AI Explanation
Verified Method
The Delta Rule (Widrow-Hoff learning rule) updates weights based on the gradient descent on the squared error. The weight update is proportional to the product of the input and the error, where the error is the difference between the target (desired) output and the actual output: $\Delta w_{ij} = \eta (t_j - y_j) x_i$.
Q3mcq
The branch logic that provides making capabilities in the control unit is know as
a.
Controlled transfer
b.
Conditional transfer
Correct Answer
c.
Unconditional transfer
d.
None of the above
Step-by-Step AI Explanation
Verified Method
The branch logic that provides decision-making capabilities (often misprinted as 'making capabilities' instead of 'decision-making capabilities') in the control unit is known as conditional transfer, where the branch occurs only if certain condition flags/status bits are met.
Q3mcq
The concept of pipelining is most effective in improving performance if the tasks being performed in different stages:
a.
require different amount of time
b.
require about the same amount of time
Correct Answer
c.
require different amount of time with time difference between any two tasks being same
d.
require different amount with time difference between any two tasks being different.
Step-by-Step AI Explanation
Verified Method
In an instruction pipeline, the clock cycle time is determined by the slowest stage (the bottleneck stage). Therefore, pipelining achieves maximum efficiency and throughput when all stages require approximately the same amount of time to execute.
Q4mcq
The number of colours required to properly colour the vertices of every planer graph is
a.
2
b.
3
c.
4
Correct Answer
d.
5
Step-by-Step AI Explanation
Verified Method
According to the Four Color Theorem, every planar graph can have its vertices colored using at most 4 colors such that no two adjacent vertices share the same color.
Q4mcq
What is Granularity ?
a.
The size of database
b.
The size of data item
Correct Answer
c.
The size of record
d.
The size of file
Step-by-Step AI Explanation
Verified Method
In database systems, concurrency control uses granularity to refer to the size of the data items chosen as the unit of locking/protection. Granularity can range from fine (e.g., an attribute or tuple) to coarse (e.g., a page, file, or whole database).
Q5mcq
Network that use different technologies can be connected by using
a.
Packets
b.
Switches
c.
Bridges
d.
Routers
Correct Answer
Step-by-Step AI Explanation
Verified Method
Routers operate at the Network layer (Layer 3) and are designed to interconnect networks that use different physical and data link technologies, protocols, and addressing schemes, enabling end-to-end communication across heterogeneous networks.
Q5mcq
Suppose that a given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl's law is
a.
4.22
b.
3.22
Correct Answer
c.
3.32
d.
3.52
Step-by-Step AI Explanation
Verified Method
According to Amdahl's Law, the speedup $S$ is given by:
$$S = \frac{1}{(1 - P) + \frac{P}{N}}$$
where $P = 0.70$ is the fraction of parallelized code and $N = 64$ is the number of processors.
$$S = \frac{1}{(1 - 0.70) + \frac{0.70}{64}} = \frac{1}{0.30 + 0.0109375} = \frac{1}{0.3109375} \approx 3.216 \approx 3.22$$
🎉 10 Free Sample Solutions Completed
Unlock All 125 Questions & Solutions
Sign up free in seconds to unlock step-by-step AI answers for the remaining 115 questions.
Both hosts and routers are TCP/IP protocol software. However, routers do not use protocol from all layers. The layer for which protocol software is not needed by a router is
a.
Layer-5 (Application)
b.
Layer-1 (Physical)
c.
Layer-3 (Internet)
d.
Layer-2 (Network Interface)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
If two fuzzy sets A and B are given with membership functions
$$\mu_A(x) = \{0.2, 0.4, 0.8, 0.5, 0.1\}$$
$$\mu_B(x) = \{0.1, 0.3, 0.6, 0.3, 0.2\}$$
Then the value of $\mu_{A \cap B}$ will be
a.
$\{0.9, 0.7, 0.4, 0.8, 0.9\}$
b.
$\{0.2, 0.4, 0.8, 0.5, 0.2\}$
c.
$\{0.1, 0.3, 0.6, 0.3, 0.1\}$
d.
$\{0.7, 0.3, 0.4, 0.2, 0.7\}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
In an image compression system 16384 bits are used to represent $256 \times 256$ image with 256 gray levels. What is the compression ratio for this system ?
a.
1
b.
2
c.
4
d.
8
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Given the following statements :
(i) The power of deterministic finite state machine and nondeterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.
Which of the above is the correct statement(s) ?
a.
Both (i) and (ii)
b.
Only (i)
c.
Only (ii)
d.
Neither (i) nor (ii)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $Q(x, y)$ denote "$x + y = 0$" and let there be two quantifications given as
(i) $\exists y \forall x \ Q(x, y)$
(ii) $\forall x \exists y \ Q(x, y)$
where $x$ & $y$ are real numbers. Then which of the following is valid ?
a.
(i) is true & (ii) is false.
b.
(i) is false & (ii) is true.
c.
(i) is false & (ii) is also false.
d.
both (i) & (ii) are true.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a schema $R(A, B, C, D)$ and functional dependencies $A \rightarrow B$ and $C \rightarrow D$. Then the decomposition $R_1(A, B)$ and $R_2(C, D)$ is
a.
Dependency preserving but not lossless join
b.
Dependency preserving and lossless join
c.
Lossless Join but not dependency preserving
d.
Lossless Join
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
$A^*$ algorithm uses $f' = g + h'$ to estimate the cost of getting from the initial state to the goal state, where $g$ is a measure of the cost of getting from initial state to the current node and the function $h'$ is an estimate of the cost of getting from the current node to the goal state.
To find a path involving the fewest number of steps, we should set
a.
$g = 1$
b.
$g = 0$
c.
$h' = 0$
d.
$h' = 1$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which is not the correct statement(s)?
(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.
a.
(i) is true, (ii) is false.
b.
(i) is true and (ii) is true.
c.
(i) is false, (ii) is false.
d.
(i) is false and (ii) is true.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A/$\text{B}^+$ tree index is to be built on the name attribute of the relation STUDENT. Assume that all students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given this scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the $\text{B}^+$ tree ?
a.
16
b.
42
c.
43
d.
44
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Identify the addressing modes of below instructions and match them:
(A) ADI (1) Immediate addressing
(B) STA (2) Direct addressing
(C) CMA (3) Implied addressing
(D) SUB (4) Register addressing
a.
(A) - 1, (B) - 2, (C) - 3, (D) - 4
b.
(A) - 2, (B) - 1, (C) - 4, (D) - 3
c.
(A) - 3, (B) - 2, (C) - 1, (D) - 4
d.
(A) - 4, (B) - 3, (C) - 2, (D) - 1
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Which one of the following is not a Greibach Normal form grammar ?
(i) $S \rightarrow a \mid bA \mid aA \mid bB$
$A \rightarrow a$
$B \rightarrow b$
(ii) $S \rightarrow a \mid aA \mid AB$
$A \rightarrow a$
$B \rightarrow b$
(iii) $S \rightarrow a \mid A \mid aA$
$A \rightarrow a$
a.
(i) and (ii)
b.
(i) and (iii)
c.
(ii) and (iii)
d.
(i), (ii) and (iii)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
While unit testing a module, it is found that for a set of test data, maximum $90\%$ of the code alone were tested with a probability of success $0.9$. The reliability of the module is
a.
atleast greater than $0.9$
b.
equal to $0.9$
c.
atmost $0.81$
d.
atleast $1/0.81$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Cached and interleaved memories are ways of speeding up memory access between CPU's and solver RAM. Which memory models are best suited (i.e., improve the performance most) for which programs ?
(i) Cached memory is best suited for small loops.
(ii) Interleaved memory is best suited for small loops
(iii) Interleaved memory is best suited for large sequential code.
(iv) Cached memory is best suited for large sequential code.
a.
(i) and (ii) are true
b.
(i) and (iii) are true
c.
(iv) and (ii) are ture
d.
(iv) and (iii) are true.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following page trace:
4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5
Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB $m = 4$ will be
a.
8
b.
9
c.
10
d.
12
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a weighted undirected graph with positive edge weights and let $(u, v)$ be an edge in the graph. It is known that the shortest path from source vertex $s$ to $u$ has weight $53$ and shortest path from $s$ to $v$ has weight $65$. Which statement is always true ?
a.
$\text{Weight }(u, v) \le 12$
b.
$\text{Weight }(u, v) = 12$
c.
$\text{Weight }(u, v) \ge 12$
d.
$\text{Weight }(u, v) > 12$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the regular expression $(a + b)(a + b) \dots (a + b)$ (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains
a.
$n$ states
b.
$n + 1$ states
c.
$n + 2$ states
d.
$2^n$ states
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The following postfix expression is evaluated using a stack $8 2 3 \wedge / 2 3 * + 5 1 * -$
The top two elements of the stack after first $*$ is evaluated
a.
6, 1
b.
5, 7
c.
3, 2
d.
1, 5
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The following CFG,
$S \rightarrow aB \mid bA, A \rightarrow a \mid aS \mid bAA, B \rightarrow b \mid bS \mid aBB$
generates strings of terminals that have
a.
odd number of a's and odd number of b's
b.
even number of a's and even number of b's
c.
equal number of a's and b's
d.
not equal number of a's and b's
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 :
(I) Recursive language are closed under complementation,
(II) Recursively enumerable languages are closed under union.
(III) Recursively enumerable languges are closed under complementation.
Which of the above statemensts are ture ?
a.
I only
b.
I and II
c.
I and III
d.
II and III
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A computer system supports 32 bit virtual address as well as 32 bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the following is true ?
a.
Efficient implementation of multiuser support is no longer possible.
b.
The processor cache can be made more efficient.
c.
Hardware support for memory management is not needed.
d.
CPU scheduling can be made more efficient.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The feasible region represented by the constraints $x_1 - x_2 \le 1$, $x_1 + x_2 \ge 3$, $x_1 \ge 0$, $x_2 \ge 0$ of the objective function $\text{Max } Z = 3x_1 + 2x_2$ is :
a.
A polygon
b.
Unbounded feasible region
c.
A point
d.
None of these
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The colour of an object is largely determined by its diffuse reflection coefficient. If $\text{K}_d = (0.8, 0.4, 0)$, then what shall be the colour of the object, if the light used is blue and magenta ?
a.
White and Red
b.
Red and Blue
c.
Black and White
d.
Black and Red
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
If an instruction takes 'i' microseconds and a page fault takes an additional 'j' microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is
a.
$i + j/k$
b.
$i + j * k$
c.
$(i + j)/k$
d.
$(i + j) * k$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the following with respect to java.util.* class methods :
\begin{tabular}{ll}
(A) Bit Set & (i) Time zone getTimezone( ) \\
(B) Calendar & (ii) int hashcode( ) \\
(C) Time zone & (iii) int nextInt( ) \\
(D) Random & (iv) Void setID (StringtzName)
\end{tabular}
a.
(A)-(ii), (B)-(i), (C)-(iv), (D)-(iii)
b.
(A)-(iii), (B)-(iv), (C)-(i), (D)-(ii)
c.
(A)-(iv), (B)-(iii), (C)-(ii), (D)-(i)
d.
(A)-(ii), (B)-(i), (C)-(iii), (D)-(iv)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A user level process in Unix traps the signal sent on a Ctrl + C input and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl + C input is given to this process, what is the mode in which the signal handling routine executes ?
a.
User mode
b.
Kernel mode
c.
Superuser mode
d.
Privileged mode
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Identify the devices given below with their IC numbers :
(i) USART (A) 8251
(ii) Micro controller (B) 8051
(iii) Interrupt controller (C) 8259
(iv) DMA controller (D) 8257
a.
(i)-(A), (ii)-(B), (iii)-(C), (iv)-(D)
b.
(i)-(B), (ii)-(A), (iii)-(D), (iv)-(C)
c.
(i)-(C), (ii)-(D), (iii)-(A), (iv)-(B)
d.
(i)-(D), (ii)-(A), (iii)-(B), (iv)-(C)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Match the following with link quality measurement and handoff initiation :
(A) Networked-Controlled Handoff (NCHO) (i) MS connect to BS
(B) Mobile-Assisted Handoff (MAHO) (ii) Process via channel the target BS
(C) Forward Handoff (iii) First Generation Analog Cellular System
(D) Hard Handoff (iv) Second Generation Digital Cellular System
a.
(A)-(iii), (B)-(iv), (C)-(ii), (D)-(i)
b.
(A)-(ii), (B)-(iii), (C)-(i), (D)-(iv)
c.
(A)-(ii), (B)-(i), (C)-(iv), (D)-(iii)
d.
(A)-(iv), (B)-(iii), (C)-(i), (D)-(ii)
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the methods used by processes P1 and P2 for accessing their critical sections. The initial values of shared Boolean variables S1 and S2 are randomly assigned,
P1
while (S1 == S2);
critical section
S1 = S2;
P2
while (S1 == S2);
critical section
S1 = S2;
Which one of the following statements describes the properties achieved ?
a.
Mutual exclusion but not progress
b.
Progress but not mutual exclusion
c.
Neither mutual exclusion nor progress
d.
Both mutual exclusion and progress
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Assume that we have constructor functions for both base class and derived class. Now consider the declaration in main( ). Base * P = New Derived; in what sequence will the constructor be called ?
a.
Derived class constructor followed by Base class constructor.
b.
Base class constructor followed by derived class constructor.
c.
Base class constructor will not be called.
d.
Derived class constructor will not be called.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy all the requests in the disk queue. Assume the last request service was at track 345 and the head is moving toward track 0. The queue in FIFO order contains requests for the following tracks:
123, 874, 692, 475, 105, 376
(Assume SCAN algorithm)
a.
2013
b.
1219
c.
1967
d.
1507
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
