The figure shows two 4-tile patterns. Either one or both of the patterns can be used any number of times and in any orientation to construct a new pattern. Which one of the options below cannot be constructed by using only these two 4-tile patterns assuming there are no overlaps among them?
a.
b.
c.
Correct Answer
d.
No explanation saved for this question yet.
Q3mcq
Consider a knock-out women’s badminton singles tournament where there are no ties. The loser in each game is eliminated from the tournament. Every player plays until she is defeated or remains the last undefeated player. The last undefeated player is declared the winner of the tournament. If there are 64 players in the beginning of the tournament, how many games should be played in total to declare the winner of the tournament?
a.
127
b.
64
c.
63
Correct Answer
d.
32
No explanation saved for this question yet.
Q4mcq
A student needs to enroll for a minimum of 60 credits. A student cannot enroll for more than 70 credits. The credits are divided amongst project and three distinct sets of courses namely, core courses, specialization courses, and elective courses. It is compulsory for a student to enroll for exactly 15 credits of core courses and exactly 20 credits of project. In addition, a student has to enroll for a minimum of 10 credits of specialization courses. The maximum credits of elective courses that a student can enroll for is ______
a.
10
b.
15
c.
20
d.
25
Correct Answer
No explanation saved for this question yet.
Q5mcq
‘When the teacher is in the room, all students stand silently.’ If the above statement is true, which one of the following statements is not necessarily true?
a.
If any student is not standing silently, then the teacher is not in the room.
b.
When the teacher is in the room, all students are silent.
c.
If all students are standing, then the teacher is in the room.
Correct Answer
d.
When the teacher is in the room, all students are standing.
No explanation saved for this question yet.
Q6mcq
Combinatorics deals with problems involving counting. For example, “How many distinct arrangements of N distinct objects in M spaces on a circle are possible?” is a typical problem in combinatorics. This kind of counting is sometimes used in the modeling of several physical phenomena. Often, in such models, the different combinatorial possibilities are assigned probability values. Assigning probabilities enables the computation of the average values of physical quantities. Consider the following statements: P: Combinatorics is always invoked in the modeling of physical phenomena. Q: Modeling some physical phenomena involves assigning probabilities to combinatorial possibilities in order to compute average values of physical quantities. Based on the passage above, what can be inferred about statements P and Q?
a.
P is False and Q is False
b.
P is False and Q is True
Correct Answer
c.
P is True and Q is False
d.
P is True and Q is True
No explanation saved for this question yet.
Q7mcq
In Panel I of the figure below, the front view and top view of a structure are shown. Which one of the 3D structures shown in Panel II possesses the views shown in Panel I?
a.
(i)
b.
(ii)
c.
(iii)
d.
(iv)
Correct Answer
No explanation saved for this question yet.
Q8mcq
For positive real numbers $S$ and $K,$ the function $H K (S)$ is defined as: $H K (S)$ = $max(S$ - $K,$ 0). The max function is defined as:
$max(a, b)$ = {
$a,$ when $a$ > $b$
$b,$ when $a \le b$ The graph below shows the plot of a function $N(S)$ versus $S.$ $N(S)$ can be expressed as _____.
a.
$H$ 10 $(S)$ - $H$ 20 $(S)$
Correct Answer
b.
$H$ 10 $(S)$ - $2H$ 20 $(S)$
c.
$-H$ 10 $(S)$ + $H$ 20 $(S)$
d.
$H$ 15 $(S)$ - $H$ 20 $(S)$
No explanation saved for this question yet.
Q9mcq
In the 2020 summer Olympics’ Javelin throw finals, Neeraj Chopra exhibited a spectacular performance to win the gold medal. The silver medal was won by Jakub Vadlejch and the bronze medal was won by Vitezlav Vesely. There were six rounds of throws with each athlete having one throw per round. The best of all the throws of each athlete is considered for the medal. Following were the observations about the throws: i. The first and second rounds were dominated by Neeraj Chopra with a gold
medal performance in his second throw, while the other two athletes did
not have any medal winning throws in these rounds. ii. The throws in the last round by both Jakub Vadlejch and Vitezlav Vesely
were fouls and were not considered for scoring. iii. After four rounds, Vitezlav Vesely was in the second position and could
not improve upon his best throw in the succeeding rounds. iv. In the fourth round, the throw by Jakub Vadlejch was the best in that
round. In which round did Vitezlav Vesely have his best throw?
a.
Third
Correct Answer
b.
Fourth
c.
Fifth
d.
Sixth
No explanation saved for this question yet.
Q10mcq
An unbiased six-faced dice whose faces are marked with numbers 1, 2, 3, 4, 5, and 6 is rolled twice in succession and the number on the top face is recorded each time. The probability that the number appearing in the second roll is an integer multiple of the number appearing in the first roll is __________
a.
1 6
b.
5 18
c.
7 18
Correct Answer
d.
5 6
No explanation saved for this question yet.
🎉 10 Free Sample Solutions Completed
Unlock All 65 Questions & Solutions
Sign up free in seconds to unlock step-by-step AI answers for the remaining 55 questions.
An urn contains one red ball and one blue ball. At each step, a ball is picked uniformly at random from the urn, and this ball together with another ball of the same color is put back in the urn. The probability that there are equal number of red and blue balls after two steps is
a.
1/4
b.
1/3
c.
1/2
d.
2/3
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider 4 $\times$ 4 matrices with their elements from ${0, 1}.$ The number of such matrices with even number of $1s$ in every row and every column is
a.
512
b.
1025
c.
1023
d.
255
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a processor P whose instruction set architecture is the load-store architecture. The instruction format is such that the first operand of any instruction is the destination operand. Which one of the following sequences of instructions corresponds to the high-level language statement Z = X + Y ? Note: X, Y, and Z are memory operands. R0, R1, and R2 are registers.
a.
ADD Z, X, Y
b.
LOAD R0, X ADD Z, R0, Y
c.
ADD R0, X, Y STORE Z, R0
d.
LOAD R0, X LOAD R1, Y ADD R2, R0, R1 STORE Z, R2
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following recurrence relations: For all $n$ > 1,
$n$
$T$ 1 $(n)$ = $4T$ 1 () + $T$ 2 $(n)$
2
$n$
$T$ 2 $(n)$ = $5T$ 2 () + Θ(log $n)$
2 4 Assume that for all $n \le$ 1, $T$ 1 $(n)$ = 1 and $T$ 2 $(n)$ = 1. Which one of the following options is correct?
a.
$T$ 1 $(n)$ = $Θ(n$ 2)
b.
$T$ 1 $(n)$ = $Θ(n$ 2 log $n)$
2
c.
$T (n)$ = $Θ(n$ log4 5) 1
d.
$T (n)$ = $Θ(n$ log4 5 log $n)$ 1 2
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $n$ > 1. Consider an $n \times n$ matrix $M$ with its elements from ℝ. Let the vector (0, 1, 0, 0, …, 0) ∈ ℝ $n$ be in the null space of $M.$ Which of the following options is/are always correct?
a.
Determinant of $M$ is 1
b.
Determinant of $M$ is 0
c.
Rank of $M$ is 1
d.
There are at least two non-zero vectors in the null space of $M$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following Boolean expression of a function F:
$F(P, Q)$ = $(P̅$ + $Q)$ ⊕ $(P̅Q)$ Which of the following expressions is/are equivalent to F ?
a.
̅̅̅̅̅̅̅̅ $P⊕Q$
b.
$P⊕Q$
c.
$P̅$ ⊕ $Q$
d.
$P̅$ ⊕ $Q̅$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the 8-bit signed integers $X, Y$ and $Z$ represented using the sign-magnitude form. The binary representations of $X$ and $Y$ are as follows:
$X:$ 10110100 $Y:$ 01001100 Which of the following operations to compute $Z$ result(s) in an arithmetic overflow?
a.
$Z =X+Y$
b.
$Z =X-Y$
c.
$Z$ = $-X$ + $Y$
d.
$Z$ = $-X$ - $Y$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $n$ be an odd number greater than 100. Consider a binary minheap with $n$ elements stored in an array $P$ whose index starts from 1. Which of the following indices of $P$ do/does NOT correspond to any leaf node of the minheap?
a.
$n+1$ 2
b.
$n-1$ 2
c.
$n-3$ 2
d.
$n$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a hash table $P[0,$ 1, …, 10] that is initially empty. The hash table is maintained using open addressing with linear probing. The hash function used is $h(x)$ = $(x$ + 7) mod 11. Consider the following sequence of insertions performed on $P:$
1, 13, 22, 15, 11, 24 Which of the following positions in the hash table is/are empty after these insertions are performed?
a.
0
b.
10
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.
Consider the following grammar where $S$ is the start symbol, and $a$ and $b$ are terminal symbols.
$S \to aSbS$ ∣ $bS$ ∣ ϵ Which of the following statements is/are true?
a.
The grammar is ambiguous
b.
The string $abb$ has two distinct derivations in this grammar
c.
The string $abab$ has only one rightmost derivation
d.
The language generated by the grammar is undecidable
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be the number of states in the minimal deterministic finite automaton (DFA) that is equivalent to $M$ ?
a.
32
b.
65
c.
1
d.
128
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 */ int *str3 = "Hello"; /* Statement S3 */ Which of the following options is/are correct?
a.
S1 and S2 have syntactic errors
b.
S2 has a lexical error and S3 has a syntactic error
c.
S1 has a lexical error and S3 has a semantic error
d.
S1 has a syntactic error and S3 has a semantic error
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $P, Q, R$ and $S$ be the attributes of a relation in a relational schema. Let $X$ ⟶ $Y$ indicate functional dependency in the context of a relational database, where $X, Y$ ⊆ ${P, Q, R, S}.$ Which of the following options is/are always true?
a.
If (${P, Q}$ ⟶ ${R}$ and ${P}$ ⟶ ${R}$), then ${Q}$ ⟶ ${R}$
b.
If ${P, Q}$ ⟶ ${R},$ then (${P}$ ⟶ ${R}$ or ${Q}$ ⟶ ${R}$)
c.
If (${P}$ ⟶ ${R}$ and ${Q}$ ⟶ ${S}$), then ${P, Q}$ ⟶ ${R, S}$
d.
If ${P}$ ⟶ ${R},$ then ${P, Q}$ ⟶ ${R}$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the function $f:$ ℝ $\to$ ℝ defined as follows:
1
$x c e$ - $c$ log (), if $x$ > 0
1 2 e $f(x)$ = { $x$
3 otherwise where $c$ 1, $c$ 2 ∈ ℝ. If $f$ is continuous at $x$ = 0, then $c$ 1 + $c$ 2 = _________. (answer in integer)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes is _________. (answer in integer)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following program in C:
#include <stdio.h>
void func(int i, int j) {
if(i < j) {
int i = 0;
while (i < 10) {
j += 2;
i++;
}
}
printf("%d", i);
}
int main() {
int i = 9, j = 10;
func(i, j);
return 0;
} The output of the program is _________. (answer in integer) Note: Assume that the program compiles and runs successfully.
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a system consisting of $k$ instances of a resource $R,$ being shared by 5 processes. Assume that each process requires a maximum of two instances of resource $R$ and a process can request or release only one instance at a time. Further, a process can request the second instance of the resource only after acquiring the first instance. The minimum value of $k$ for the system to be deadlock-free is ________. (answer in integer)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the real valued variables X, Y and Z represented using the IEEE 754 single- precision floating-point format. The binary representations of X and Y in hexadecimal notation are as follows:
X: 35C00000 Y: 34A00000 Let $Z$ = $X$ + $Y.$ Which one of the following is the binary representation of $Z,$ in hexadecimal notation?
a.
35C80000
b.
35CC0000
c.
35E80000
d.
35EC0000
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a 2-bit saturating up/down counter that performs the saturating up count when the input P is 0, and the saturating down count when P is 1. The Next State table of the counter is as shown. The counter is built as a synchronous sequential circuit using D flip-flops.
Input
Current
Next
State
State
$P$
$Q$
$Q$
$Q$ 1+
$Q$ 0+
1
0
0
0
0
0
1
0
0
1
1
0
0
1
0
1
1
0
1
1
1
1
1
0
0
0
0
1
0
1
0
0
1
1
0
0
1
1
1
1
1
0
Which one of the following options corresponds to the expressions for the inputs of the D flip-flops, $D$ 1 and $D$ 0 ?
The size of the physical address space of a processor is 2 32 bytes. The capacity of a cache memory unit is 2 23 bytes. The cache block size is 128 bytes. The cache memory unit can be built as a direct mapped cache or as a $K-way$ set-associative cache, where $K$ = 2 $L$ and $L$ ∈ {1, 2, 3}. Let the length of the TAG field be $M$ bits for the direct mapped cache, and $N$ bits for the set-associative cache. Which one of the following options is true?
a.
$N =M+L$
b.
$N =M-L$
c.
$N =M+K$
d.
$N =M-K$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to by the pointer variable head.
struct node{
int elt;
struct node *next;
};
int getListSize (struct node *head)
{
if(E1) return 1;
return E2;
} Which one of the following options gives the correct replacements for the expressions E1 and E2?
Let $P$ be the set of all integers from 1 to 15. Consider any order of insertion of the elements of $P$ into a binary search tree that creates a complete binary tree. Which one of the following elements can NEVER be the third element that is inserted?
a.
4
b.
2
c.
10
d.
5
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $G(V, E)$ be an undirected, edge-weighted graph with integer weights. The weight of a path is the sum of the weights of the edges in that path. The length of a path is the number of edges in that path. Let $s$ ∈ $V$ be a vertex in $G.$ For every $u$ ∈ $V$ and for every $k \ge$ 0, let $d k (u)$ denote the weight of a shortest path (in terms of weight) from $s$ to $u$ of length at most $k.$ If there is no path from $s$ to $u$ of length at most $k,$ then $d k (u)$ = $\infty.$ Consider the statements: S1: For every $k \ge$ 0 and $u$ ∈ $V, d k+1 (u) \le d k (u).$ S2: For every $(u, v)$ ∈ $E,$ if $(u, v)$ is part of a shortest path (in terms of
weight) from $s$ to $v,$ then for every $k \ge$ 0, $d k (u) \le d k (v).$ Which one of the following options is correct?
a.
Only S1 is true
b.
Only S2 is true
c.
Both S1 and S2 are true
d.
Neither S1 nor S2 is true
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the control flow graph shown in the figure. Which one of the following options correctly lists the set of redundant expressions (common subexpressions) in the basic blocks B4 and B5? Note: All the variables are integers.
a.
B4: { $b$ + $i$ } B5: { $c$ + $m$ }
b.
B4: { $g$ ∗ $k$ } B5: { $c$ + $m$ }
c.
B4: { $g$ ∗ $k, b$ + $i$ } B5: { }
d.
B4: { $g$ ∗ $k$ } B5: { }
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a relational database schema with two relations $R(P, Q)$ and $S(X, Y).$ Let $E$ = ${⟨u⟩$ ∣ $∃v ∃w ⟨u, v⟩$ ∈ $R$ ∧ $⟨v, w⟩$ ∈ $S}$ be a tuple relational calculus expression. Which one of the following relational algebraic expressions is equivalent to $E$ ?
a.
$Π (R$ ⋈ $S)$ $P R.P=S.X$
b.
$Π (S$ ⋈ $R)$ $P S.X=R.Q$
c.
$Π (R$ ⋈ $S)$ $P R.P=S.Y$
d.
$Π (S$ ⋈ $R)$ $P S.Y=R.Q$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
A TCP sender successfully establishes a connection with a TCP receiver and starts the transmission of segments. The TCP congestion control mechanism’s slow-start threshold is set to 10000 segments. Assume that the round-trip time is fixed at 1 millisecond. Assume that the sender always has data to send, the segments are numbered from 1, and no segment is lost. Let $t$ denote the time (in milliseconds) at which the transmission of segment number 2000 starts. Which one of the following options is correct?
a.
9 $\le t$ < 10
b.
10 $\le t$ < 11
c.
11 $\le t$ < 12
d.
12 $\le t$ < 13
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the implementation of sliding window protocol over a lossless link, with a window size of $W$ frames, where each frame is of size 1000 bits (including header). The bandwidth of the link is 100 kbps (1k = 10 3) and the one-way propagation delay is 100 milliseconds. Assume that processing times at the sender and receiver are zero and the transmission time of acknowledgements is also zero. Which one of the following options gives the minimum size of $W$ (in number of frames) required to achieve 100% link utilization?
a.
10
b.
21
c.
20
d.
11
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $G(V, E)$ be a simple, undirected graph. A vertex cover of $G$ is a subset $V$ ′ ⊆ $V$ such that for every $(u, v)$ ∈ $E, u$ ∈ $V$ ′ or $v$ ∈ $V$ ′. Let the size of the smallest vertex cover in $G$ be $k.$ Let $S$ be any vertex cover of size $k.$ For a vertex $v$ ∈ $V,$ which of the following constraints will always ensure that $v∈S$ ?
a.
The degree of $v$ is at least $k$ + 1
b.
The vertex $v$ is on a path of length $k$ + 1
c.
The vertex $v$ is on a cycle of length $k$ + 1
d.
The vertex $v$ is a part of a clique of size $k$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a Boolean function F with the following minterm expression:
$F(P, Q, R, S)$ = ∑ $m$ (1, 2, 3, 4, 5, 7, 10, 12, 13, 14) Which of the following options is/are the minimal sum-of-products expression(s) of F ?
a.
$P̅S$ + $QR̅$ + $P̅Q̅ R$ + $Q̅ RS̅$
b.
$P̅S$ + $QR̅$ + $P̅Q̅ R$ + $PRS̅$
c.
$P̅S$ + $QR̅$ + $PQS̅$ + $PRS̅$
d.
$P̅S$ + $QR̅$ + $PQS̅$ + $Q̅ RS̅$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $G(V, E)$ be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the minimum spanning trees (MST) of $G$ is/are true?
a.
In every cycle $C$ of $G,$ the edge with the largest weight in $C$ is not in any MST
b.
In every cycle $C$ of $G,$ the edge with the smallest weight in $C$ is in every MST
c.
For every vertex $v$ ∈ $V,$ the edge with the largest weight incident on $v$ is not in any MST
d.
For every vertex $v$ ∈ $V,$ the edge with the smallest weight incident on $v$ is in every MST
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following pseudocode for depth-first search (DFS) algorithm which takes a directed graph $G(V, E)$ as input, where $d[v]$ and $f[v]$ are the discovery time and finishing time, respectively, of the vertex $v$ ∈ $V.$
$DFS(G):$
$v, t):$
$unmark$
$all$
$v$ ∈
$v$
$t$
←0
$t ←t+1$
$for$
$each$
$v$ ∈
$V$
$d[v]$
←
$t$
$if$
$is unmarked$
$for$
$each$
$(v,$
$t$ ← $Explore(G,$
$if$
$w is unmarked$
$end$
$if$
$t$ ←
$end$
$for$
$end$
$if$
$end for$ $t ←t$ + 1 $f[v]$ ← $t$ $return t$ Suppose that the input directed graph $G(V, E)$ is a directed acyclic graph (DAG). For an edge $(u, v)$ ∈ $E,$ which of the following options will NEVER be correct?
a.
$d[u]$ < $d[v]$ < $f[v]$ < $f[u]$
b.
$d[v]$ < $d[u]$ < $f[u]$ < $f[v]$
c.
$d[v]$ < $f[v]$ < $d[u]$ < $f[u]$
d.
$d[u]$ < $d[v]$ < $f[u]$ < $f[v]$
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $L$ 1 and $L$ 2 be two languages over a finite alphabet, such that $L$ 1 ∩ $L$ 2 and $L$ 2 are regular languages. Which of the following statements is/are always true?
a.
$L$ 1 is regular
b.
$L$ 1 ∪ $L$ 2 is regular
c.
$L$ 2 is context-free
d.
$L$ 1 is context-free
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following context-free grammar $G.$
$S \to abaABAbba$
$A \to aaBBAb$ | $bBabaa$
$B \to aBb$ | $ab$ In the above grammar, $S$ is the start symbol, $a$ and $b$ are terminal symbols, and $A$ and $B$ are non-terminal symbols. Let $L(G)$ be the language generated by the grammar $G.$ For a string $s$ ∈ $L(G),$ let $n$ 1 $(s)$ be the number of $a’s$ in $s$ and $n$ 2 $(s)$ be the number of $b’s$ in $s.$ Which of the following statements is/are true?
a.
There is a string $s$ ∈ $L(G)$ such that $n$ 1 $(s)$ < $n$ 2 $(s)$
b.
For every string $s$ ∈ $L(G), n$ 1 $(s) \ge n$ 2 $(s)$
c.
There is a string $s$ ∈ $L(G)$ such that $n$ 1 $(s)$ > $2n$ 2 $(s)$
d.
For every string $s$ ∈ $L(G), n$ 1 $(s) \le 2n$ 2 $(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 two syntax-directed definitions SDD1 and SDD2 for type declarations.
SDD1 SDD2 Grammar Semantic Rules Grammar Semantic Rules
(G1) (G2) $D \toT V D. type$ = $T. type D \to D$ 1 $id D. type$ = $D$ 1. $type$
$V. type$ = $T. type put(id. entry, D$ 1. $type)$
$T \to$
$int$
$T. type$
= $int$
$D \to$
$T id$
$D. type$
= $T.$
$type$
$T \to$
$float$
$T. type$
= $float$
$put(id.$
$entry,$
$T. type)$
$V \to$
$V id$
$V$. $type$
= $V.$
$type$
1
$put(id.$ 1
$entry,$
$V.$
$T \to$
$int$
$T. type$
= $int$
$V \to$
$id$
$put(id.$
$entry,$
$V.$
$T \to$
$float$
$T. type$
= $float$
$D$ is the start symbol, and $int$, $float$ and $id$ are the three terminals. The non-terminal $V$ 1 is the same as $V$ and the non-terminal $D$ 1 is the same as $D.$ Here, the subscript is used to differentiate the grammar symbols on the two sides of a production. The function $put$ updates the symbol table with the type information for an identifier. Let P and Q be the languages specified by grammars G1 and G2, respectively. Which of the following statements is/are true?
a.
The languages P and Q are the same
b.
SDD2 is S-attributed and contains only synthesized attributes
c.
SDD1 is L-attributed and contains only inherited attributes
d.
The specifications of SDD1 and SDD2 are such that the same entries get added to the symbol table
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a physical address. The MMU has a translation lookaside buffer (TLB). Assume that when a page is evicted from the main memory, the corresponding blocks in the cache are marked as invalid. For a given memory reference, which of the following sequences of events can NEVER happen?
a.
TLB miss, Page table hit, Cache hit
b.
TLB hit, Page table miss, Cache hit
c.
TLB miss, Page table miss, Cache hit
d.
TLB miss, Page table miss, Cache miss
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
An undirected, unweighted, simple graph $G(V, E)$ is said to be 2-colorable if there exists a function $c: V \to$ {0, 1} such that for every $(u, v)$ ∈ $E, c(u) ≠ c(v).$ Which of the following statements about 2-colorable graphs is/are true?
a.
If $G$ is 2-colorable, then $G$ may contain cycles of odd length
b.
If $G$ is 2-colorable, then $G$ may contain cycles of even length
c.
An optimal algorithm for testing whether $G$ is 2-colorable runs in time $Θ(|V|$ + $|E|),$ if $G$ is represented as an adjacency list
d.
An optimal algorithm for testing whether $G$ is 2-colorable runs in time $Θ(|E|$ log $|V|),$ if $G$ is represented as an adjacency list
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
An ISP having an address block 202.16.0.0/15 assigns a block of 6000 IP addresses to a client, using the classless internet domain routing (CIDR) super-netting approach. Which of the following address blocks can be assigned by the ISP?
a.
202.16.0.0/19
b.
202.17.64.0/19
c.
202.16.32.0/19
d.
202.17.24.0/19
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Let $X$ be a random variable which takes values in the set {1, 2, 3, 4, 5, 6, 7, 8}.
1 Further, $Pr(X$ = 1) = $Pr(X$ = 2) = $Pr(X$ = 5) = $Pr(X$ = 7) = and
6
1 $Pr(X$ = 3) = $Pr(X$ = 4) = $Pr(X$ = 6) = $Pr(X$ = 8) =.
12 The expected value of $X,$ denoted by $E[X],$ is equal to ___________. (rounded off to two decimal places)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a hard disk with a rotational speed of 15000 rpm. The time to move the read/write head from a track to its adjacent track is 1 millisecond. Initially, the head is on track 0. The number of sectors per track is 400. The sector size is 1024 bytes. It is necessary to transfer data from 10 randomly located sectors in each of the following tracks in the order: 5, 12 and 7. The total time for the data transfer (in milliseconds) from the hard disk is _________. (rounded off to one decimal place)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The EX stage of a pipelined processor performs the memory read operations for LOAD instructions, and the operations for the arithmetic and logic instructions. Let $t EX$ denote the time taken by the EX stage to perform the operation for an instruction. For each instruction type, the values of $t EX$ and M (the number of instructions of that type in a sequence of 100 instructions for a program P), are given in the table below. The duration of the pipeline clock cycle is 1 nanosecond. Assume that the latch time for the interstage buffers in the pipeline is negligible.
Instruction $t EX$ in $M$
nanoseconds
LOAD
1.8
15
IMUL
1.5
10
IDIV
2.5
5
FADD
1.7
10
FSUB
1.7
5
FMUL
2.8
15
FDIV
3.2
5
All
than
35
instructions
1.0
When program P is executed, the number of clock cycles for which the pipeline is stalled due to structural hazards in the EX stage is ______. (answer in integer)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the recursive functions represented by the following code segment:
int bar(int n){
if (n == 1) return 0;
else return 1 + bar(n/2);
}
int foo(int n){
if (n == 1) return 1;
else return 1 + foo(bar(n));
} The smallest positive integer n for which foo(n) returns 5 is ______. (answer in integer) Note: Ignore syntax errors (if any) in the function.
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
The following sequence corresponds to the preorder traversal of a binary search tree $T:$
50, 25, 13, 40, 30, 47, 75, 60, 70, 80, 77 The position of the element 60 in the postorder traversal of $T$ is ______. (answer in integer) Note: The position begins with 1.
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the fork() system call is always successful in creating a process.
int main () {
int i;
for (i = 0; i < 3; i++){
if (fork() == 0){
continue;
}
break;
}
printf("Hello!");
return 0;
} The total number of times that the printf statement gets executed is ________. (answer in integer)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst of 8 seconds. A new process of type A arrives at time $t$ = 10, 20, 30, 40, and 50 (in seconds). Similarly, a new process of type C arrives at time $t$ = 11, 22, 33, 44, and 55 (in seconds). The CPU scheduling policy is First Come First Serve (FCFS). The first process of type A starts running at $t$ = 10 seconds. The average waiting time (in seconds) for the 10 processes is ___________. (rounded off to one decimal place)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
Consider a relational database schema with a relation $R(A, B, C, D).$ If ${A, B}$ and ${A, C}$ are the only two candidate keys of the relation $R,$ then the number of superkeys of relation $R$ is ______. (answer in integer)
Numerical answer locked.
Correct Answer & Step-by-Step Solution Locked
Sign in free to reveal the correct answer and AI explanation for this question.
