Recent questions tagged goclasses2024-mockgate-12

525
views
1 answers
2 votes
How many binary trees with $3$ nodes, $\text{A, B},$ and $\text{C}$ when traversed in post-order will give the sequence $\text{A, B, C}?$ (It is NOT a search tree)
542
views
2 answers
4 votes
The in-order traversal of a binary tree is $\textsf{HFIEJGZ},$ and the post-order traversal of the same tree is $\textsf{HIFJZGE}.$ What will be the total number of nodes in the left sub-tree of the given tree? (It is NOT a search tree)
563
views
1 answers
2 votes
Consider the following grammar:$\begin{aligned}& S \rightarrow a S^{\prime} \\& S^{\prime} \rightarrow b S^{\prime} \mid \epsilon\end{aligned}$Which of the following is/are ... $bS'$a S^{\prime} b$bbS$
547
views
1 answers
5 votes
$\begin{aligned}& S \rightarrow S1 \;T \\& S 1 \rightarrow a \mid(S S) \\& T \rightarrow \varepsilon \mid b \;T\end{aligned}$In the $\text{LL(1)}$ ... \{T \rightarrow \varepsilon\}$\{S 1 \rightarrow a\}$ and $\{T \rightarrow \varepsilon\}$
823
views
1 answers
6 votes
Consider two TCP connections $\text{A}$ and $\text{B}:$The RTT for connection $\text{A}$ is $100$ ms while the RTT for connection $\text{B}$ is $200$ ms. ... packets than connection $\text{A}$ in interval $[\text{T}, \text{T}+1]$ seconds.
1.0k
views
1 answers
6 votes
Let $A, B, C$ be events such that $P(A)=P(B)=P(C)=0.5, P(A \cap B)=0.3, P(A \cap C)=0$.Which of the following is/are true?$P(A \cup B)=0.75$P(A \cup C)=1$P(B \cap C)=0.23$P(B \cup C)=0.9$
803
views
2 answers
4 votes
Which of the following is/are TRUE?There is a differentiable function $f(x)$ with the property that $f(1)=-2$ and $f(5)=14$ and $f^{\prime}(x)\lt 3$ for ... $f$ is differentiable at the number $x$, then it is continuous at $x$.
853
views
2 answers
4 votes
Consider the following jobs along with their arrival and execution time. ... these processes with the preemptive shortest remaining processing time first (SRPT) algorithm?
940
views
1 answers
9 votes
Consider a $\text{TCP}$ flow sending three segments, namely $1,2,$ and $3.$ Due to congestion, the $\text{TCP}$ flow experiences exactly two losses. Only segments ... $\text{5 RTTs}$\text{6 RTTs}$\text{8 RTTs}$
1.0k
views
2 answers
10 votes
Consider a network with two links.Node $\text{A}$ is trying to send packets to node $\text{C}.$Let $p 1$ ... $\dfrac{1}{\left(1-p_1\right)\left(1-p_2\right)}$
1.1k
views
2 answers
6 votes
Assume the following code is compiled and run on a modern Linux machine.Assuming $\textsf{fork()}$ never fails, how many times will the message $\textsf{ Hello }$ will be ... $3$4$6$
596
views
1 answers
2 votes
Consider the following context-free language: $L_1=\left\{a^m b^n c^n \mid n, m \geq 0\right\}$. Which of the following choices of language $L_2$ ... $L_2=\left\{a^k b^{2 k} c^{2 k} \mid k \geq 0\right\}$
772
views
1 answers
8 votes
Let $\text{D}$ be a DFA with $n$ states $\& \;\text{N}$ be an NFA with $n$ states. Which of the following is/are true?If $\text{D}$ accepts some ... $n-1$, then the language of $\mathrm{N}$ is infinite.
624
views
2 answers
3 votes
Which of the following statements is/are false?Let $\text{A}$ and $\text{B}$ be sets of languages over some fixed alphabet $\Sigma$, with $\text{A} \subseteq \text{B}$. ... $\subseteq \mathrm{L} 1$, then $\mathrm{L} 2$ is decidable.)
782
views
1 answers
11 votes
Below is a drawing(graph representation) of a binary relation $\text{R}$ over a set $\text{P}$ of elements $\{ \text{A, B, C, D, E, F}\}:$Which of the following first-order logic ... \in P . x R y)$\forall x \in P . \exists y \in P . x R y$
784
views
1 answers
4 votes
Assume the following graph is a labeled graph i.e. every vertex has a unique label.In how many ways can we color the following labeled graph $\mathrm{G}$ with ... such that no two adjacent vertices are assigned the same color?
516
views
1 answers
6 votes
An involution is a function $f: A \rightarrow A$ where $f(f(x))=x$.A fixed point of any function $f: A \rightarrow A$ ... an involution.Every involution $f: \mathrm{A} \rightarrow \mathrm{A}$ is a bijective function.
759
views
3 answers
7 votes
Consider a processor with a branch-if-equal instruction that is $32$ bits long$\textsf{: BEQ R12, R11, X.}$ $6$ bits are used to encode the opcode, ... away (the number of instructions) from the $\textsf{BEQ}$ instruction could we reach?
1.2k
views
1 answers
7 votes
Consider the following code fragment:Identify all data dependencies (potential data hazards) in the given code snippet within one loop iteration. Let the number of true data dependencies ... .What is $\mathrm{X}+2 \mathrm{Y}+3 \mathrm{Z}?$
1.0k
views
1 answers
8 votes
A computer has a $32$-bit address bus with a direct mapped cache, using $4$ bits for block offset, $16$ tag bits, and $12$ index bits.Which of the following address ... $\textsf{2233 445 5}$ and $\textsf{2233 445 C}$
559
views
1 answers
2 votes
We would like to use a $\text{T}$ flip-flop and design a circuit that works like a $\text{J-K}$ flip-flop. The simplified input to the $\text{T}$ ... $\text{T}=\text{JQ}+\text{KQ}'$
761
views
1 answers
3 votes
Consider the sequential circuit shown below.Consider the following state assignment: $\text{A}$ stands for $\text{Q = 0, B}$ stands for $\text{Q = 1}.$ The state transition diagram for the circuit above is shown in:abcd
838
views
2 answers
5 votes
Consider the following $4$-bit adder circuit.Note, $\text{C}_0$ is carry in and $\text{C}_4$ is carry out for the $4$ ... $\text{S}=1$
1.1k
views
3 answers
3 votes
Of the following, which gives the best upper bound for the value of $f(N)$ where $f$ is a solution to the recurrence$f(2 N+1)=f(2 N)=f(N)+\log N \text { for } N \geq 1,$with $f(1)=0?$O(\log N)$O(N \log N)$O\left((\log N)^2\right)$O(N)$
938
views
2 answers
8 votes
Consider the following partial schedule for several data items for transactions $T_i$ with timestamp $i:$ How many transactions are Aborted by the timestamp scheduler?
729
views
1 answers
6 votes
630
views
1 answers
6 votes
If $n$ is a positive integer, the notation $n!$ (read " $n$ factorial") is used to represent the product of the integers from $1$ to $n$ ... $\dfrac{(20 !)(19 !)}{5}$
529
views
2 answers
3 votes
Kathy owns more cats than Alice and more dogs than Bruce. Alice owns more dogs than Kathy and fewer cats than Bruce. Which of the statements must be true?Bruce ... .Bruce owns the most cats.Kathy owns the most cats.Alice owns the most dogs.
486
views
2 answers
4 votes
Each of $a, b, c$, and $d$ is a positive integer and is greater than $3.$ If$\frac{1}{a-2}=\frac{1}{b+2}=\frac{1}{c+1}=\frac{1}{d-3}$then which ordering of these four numbers ... lt c\lt d$c\lt b\lt a\lt d$b\lt a\lt c\lt d$b\lt c\lt a\lt d$
839
views
1 answers
3 votes
I don't know the time _______at which the accident happenedthe accident happenedwhen the accident happenedwhen the accident had happened