Register

Recent questions tagged goclasses2024-mockgate-13

858
views
2 answers
4 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 30
A university's mathematics department has $10$ professors and will offer $20$ different courses next semester. Each professor will be assigned to teach exactly $2$ of the courses, and each ... $10^{20}-2^{10}$ $\dfrac{20 ! 10 !}{2^{10}}$
User Avatar
582
views
1 answers
3 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 32
The order of a leaf node in a $\text{B tree}$ ... and a block pointer is $6$ bytes long, what is the order of the leaf node?
User Avatar
346
views
1 answers
3 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 33
Consider the following two schedules consisting to two transaction $\mathrm{T}_1$ and $\mathrm{T}_2$ :Which of the following is/are true about these ... $\mathrm{S}_2$ are neither conflict equivalent nor conflict serializable.
User Avatar
538
views
1 answers
2 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 34
In typical RISC ISA, delayed branch executes which instruction irrespective of whether the branch condition is true or false?Instruction immediately following ... to a different a subroutineIt waits till the branch condition is evaluated
User Avatar
787
views
1 answers
7 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 35
Consider a processor with an in-order five-stage pipeline (IF, ID, EX, MEM, and WB) with clock cycle time $10 \mathrm{~ns}$. This processor is ... branch is taken. What is the throughput (Million instructions per second) of the system?
User Avatar
490
views
1 answers
3 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 36
Let $\mathrm{T}$ be the smallest AVL tree of height $h$. How many nodes does it have, if the smallest AVL tree of height $h-2$ has $m$ nodes and the smallest AVL tree of height $h-3$ has $k$ nodes?$m+k+2$m+2 k$2 m+k$2 m+k+2$
User Avatar
566
views
2 answers
4 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 37
Consider the null-terminated linked list of four integers $\textsf{1->2->3->4->NULL},$ and the variable 'list' points to the head of the linked list. Upon running the ... ->next->next>next = list->next>next; LINE Y: list = list->next->next;
User Avatar
650
views
1 answers
3 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 38
Consider the syntax-directed translation given by the following grammar and semantic rules. Here, $S$ is the only non-terminal and $\Sigma=\{0,1,2\}$ is a ... The value computed by the translation scheme for the input string $201$ is $20.$
User Avatar
454
views
1 answers
4 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 39
Consider the following grammar$\begin{aligned}& A \rightarrow B B \\& B \rightarrow b\end{aligned}$Suppose we draw an $\operatorname{LR}(0)$ ... state with $2$ incoming transitionsThere is exactly one state with $3$ outgoing transitions
User Avatar
971
views
3 answers
7 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 40
You are given a complete binary tree (each level must be full except the last) on $n$ vertices. Each vertex $v$ is labeled by an integer value $x_v$. Say that a vertex is a ... $\theta(\sqrt{n})$\theta(\log n)$\theta(n \log n)$
User Avatar
431
views
1 answers
5 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 41
Consider the following weighted graph, where the weight of every edge is written on the edge itself.What is the number of possible minimum spanning trees for the above graph?
User Avatar
836
views
1 answers
11 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 42
Consider the following statements related to Huffman's algorithm:$\text{S1:}$ If there is exactly one symbol with a frequency of $1 / 3$, and all other symbols have frequencies ... , but $\mathrm{S} 2$ is true.S1 is false, and S2 is false.
User Avatar
600
views
2 answers
9 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 43
Let $A$ be a $2 \times 2$ matrix for which there is a constant $k$ such that the sum of the entries in each row and each column is $k$. Which of the following ... . I onlyII onlyIII onlyI and II only
User Avatar
542
views
1 answers
5 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 44
Football teams $T_1$ and $T_2$ ... of $P(X=Y)?$1 / 3$13 / 36$1 / 36$1 / 18$
User Avatar
993
views
2 answers
7 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 45
Imagine a computer with a $32$-bit virtual address space and $\text{1 KB}$ pages. It uses a two-level page table system, with page-sized chunks at the inner level(not at ... $2 \mathrm{~KB}$66 \mathrm{~KB}$16 \mathrm{MB}$
User Avatar
571
views
1 answers
7 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 46
Assume that for a given system, virtual addresses are $40$ bits long and physical addresses are $30$ bits long. The page size is $8$ KB. The Translation Look-aside Buffer ( ... $2^{20}$2^{13}$2^8$
User Avatar
404
views
1 answers
3 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 47
#include<stdio.h> #include<string.h> char upstr[50]; void putStar (int n,char str[]){ upstr[n] = str[n]; if(n == strlen(str)) return; else upstr[n+1] = '*'; putStar ... be the output of the given program?h*e*l*l*oh*e*l*l*o*h*e*l*l*hello
User Avatar
665
views
2 answers
8 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 48
#include <stdio.h> int main() { int i= 255; short int *s= (short int *)&i; printf("%d\n", *s); }What will be the output of the above program in little-endian and big- ... $65280,\; 0$0,\;0$0,\; 65280$
User Avatar
616
views
1 answers
6 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 49
We want to use semaphores to implement a shared critical section (CS) among three threads $\mathrm{T} 1$, $\mathrm{T} 2$, and $\mathrm{T} 3$.We ... What is the minimum number of binary semaphores we need in order to enforce this ordering?
User Avatar
457
views
1 answers
2 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 50
Consider a laptop trying to access a file via HTTP from a server. The laptop knows its own IP address and the server's IP address.Below list the following messages that appear on the Laptop's ... c, a, e, c$a, e, c, d, g, c, b, f, c$
User Avatar
1.2k
views
2 answers
8 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 51
A TCP connection has been established between hosts $\text{A}$ and $\text{B. A}$ receives a packet from $\text{B}$ with the following field values shown ... Sequence: $8001$Acknowledgment: $1053$Window size: $2000$[TCP Payload Size: $1000]$
User Avatar
1.1k
views
1 answers
8 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 52
Consider a sliding window protocol with a window size of $5$ using cumulative ACKs (and ACK is being sent for each segment).Retransmissions: retransmissions occur under two ... (expressed in terms of msec after $t=0 )?$23$42$43$102$
User Avatar
1.0k
views
2 answers
9 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 53
Suppose we use $\textsf{IEEE-754}$ single precision floating point format to represent the numbers in binary. What will be the hexadecimal representation ... $\textsf{0x80000008}$\textsf{0x80000010}$\textsf{0x80000002}$
User Avatar
881
views
1 answers
6 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 54
Assume a cache memory with the following properties:The cache size $\text{(C)}$ is 512 bytes (contains $512$ data bytes)The cache uses an LRU (least recently used) policy ... $\text{B}=8$ bytes$\text{B}=16$ bytesNone of the above.
User Avatar
629
views
1 answers
5 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 55
Recall that a Turing machine $\text{T}$ can be represented or 'coded' by an integer $m$. Let us write 'the $m$ th Turing machine' to mean the Turing machine coded ... $m$.The set of $n$ such that all Turing machines halt on the input $n$.
User Avatar
535
views
1 answers
7 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 56
For a string $x=x_1 \cdots x_n \in \Sigma^*$, where $\Sigma$ is any alphabet and $x_1, \ldots, x_n \in \Sigma$, we write $x^{\uparrow m}=x^m$ (that is, the usual ... in \Sigma^*\right\}$\left\{(a b c)^{\downarrow n} \mid n \geq 0\right\}$
User Avatar
700
views
1 answers
8 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 57
Consider a pushdown automaton (PDA) with two control states $Q=\{q 1, q 2\}$, start state $q 1$, input alphabet $\Sigma=\{a, b\}$, stack ... stack.)The number of strings of length $21$ accepted by the above pushdown automaton is _________.
User Avatar
528
views
1 answers
5 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 58
Your code is required to perform the function $(\text{M}\%16) \ast 3.$ What should you do to eliminate multiplication ($\ast$) and mod($\%$ ... the result, shift result left by $2,$ and add the saved result to current result.
User Avatar
658
views
3 answers
2 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 59
For the circuit in the figure below, if the current state $\text{Q}_3\text{Q}_2\text{Q}_1\text{Q}_0$ is $6$ ... the clock signal the new state will be (in decimal)? (the flip-flops are positive edge triggered)
User Avatar
626
views
2 answers
4 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 60
You are asked to implement the following four functions with half-adders: ... functions simultaneously? (You are not allowed to use any other logic element but half-adder)
User Avatar
Page: