Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged goclasses2024-mockgate-13
4
votes
1
answer
31
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 course will have exactly one professor assigned to teach it. If any ... $10^{20}-2^{10}$ $\dfrac{20 ! 10 !}{2^{10}}$
GO Classes
asked
in
Combinatory
Jan 28
by
GO Classes
515
views
goclasses2024-mockgate-13
goclasses
combinatory
counting
1-mark
3
votes
1
answer
32
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 32
The order of a leaf node in a $\text{B tree}$ is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1 \mathrm{~K}$ bytes, data record pointer is $7$ bytes long, the value field is $9$ bytes long and a block pointer is $6$ bytes long, what is the order of the leaf node?
GO Classes
asked
in
Databases
Jan 28
by
GO Classes
449
views
goclasses2024-mockgate-13
goclasses
numerical-answers
databases
b-tree
1-mark
3
votes
1
answer
33
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 schedules? Both $\mathrm{S}_1$ and $\mathrm{S}_2$ are ... and also conflict serializable. $\mathrm{S}_1$ and $\mathrm{S}_2$ are neither conflict equivalent nor conflict serializable.
GO Classes
asked
in
Databases
Jan 28
by
GO Classes
241
views
goclasses2024-mockgate-13
goclasses
databases
transaction-and-concurrency
conflict-serializable
1-mark
2
votes
1
answer
34
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 the branch condition Instruction immediately preceding the branch condition Instruction that belongs to a different a subroutine It waits till the branch condition is evaluated
GO Classes
asked
in
CO and Architecture
Jan 28
by
GO Classes
378
views
goclasses2024-mockgate-13
goclasses
co-and-architecture
branch-conditional-instructions
1-mark
7
votes
1
answer
35
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 executing a program in which $30 \%$ of the instructions are ... is always started and ignored if the branch is taken. What is the throughput (Million instructions per second) of the system?
GO Classes
asked
in
CO and Architecture
Jan 28
by
GO Classes
635
views
goclasses2024-mockgate-13
goclasses
co-and-architecture
pipelining
numerical-answers
1-mark
3
votes
1
answer
36
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$
GO Classes
asked
in
DS
Jan 28
by
GO Classes
351
views
goclasses2024-mockgate-13
goclasses
data-structures
avl-tree
2-marks
4
votes
2
answers
37
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 provided code, the linked list gets divided ... X:list->next->next>next = list->next>next; LINE Y: list = list->next->next;
GO Classes
asked
in
DS
Jan 28
by
GO Classes
401
views
goclasses2024-mockgate-13
goclasses
data-structures
linked-list
2-marks
3
votes
1
answer
38
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 set of terminals. $\text{S.val}$ denotes the synthesized attribute (a ... $3$ value. The value computed by the translation scheme for the input string $201$ is $20.$
GO Classes
asked
in
Compiler Design
Jan 28
by
GO Classes
489
views
goclasses2024-mockgate-13
goclasses
compiler-design
syntax-directed-translation
multiple-selects
2-marks
4
votes
1
answer
39
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)$ automatan for the given grammar then which of the ... transitions There is exactly one state with $2$ incoming transitions There is exactly one state with $3$ outgoing transitions
GO Classes
asked
in
Compiler Design
Jan 28
by
GO Classes
348
views
goclasses2024-mockgate-13
goclasses
compiler-design
lr-parser
multiple-selects
2-marks
7
votes
3
answers
40
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 local minimum if its label is less than the labels of each of its ... minimum in the tree? $\theta(n)$ $\theta(\sqrt{n})$ $\theta(\log n)$ $\theta(n \log n)$
GO Classes
asked
in
DS
Jan 28
by
GO Classes
739
views
goclasses2024-mockgate-13
goclasses
data-structures
binary-tree
time-complexity
2-marks
5
votes
1
answer
41
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?
GO Classes
asked
in
Algorithms
Jan 28
by
GO Classes
318
views
goclasses2024-mockgate-13
goclasses
numerical-answers
algorithms
graph-algorithms
minimum-spanning-tree
2-marks
11
votes
1
answer
42
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 strictly less than $1 / 3$, then Huffman's algorithm may ... $\mathrm{S} 1$ is false, but $\mathrm{S} 2$ is true. S1 is false, and S2 is false.
GO Classes
asked
in
Algorithms
Jan 28
by
GO Classes
651
views
goclasses2024-mockgate-13
goclasses
algorithms
greedy-algorithm
huffman-code
2-marks
9
votes
2
answers
43
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 must be an eigenvector of $A?$ ... $\left[\begin{array}{l}1 \\ 1\end{array}\right]$. I only II only III only I and II only
GO Classes
asked
in
Linear Algebra
Jan 28
by
GO Classes
477
views
goclasses2024-mockgate-13
goclasses
linear-algebra
eigen-vector
2-marks
4
votes
1
answer
44
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 44
Football teams $T_1$ and $T_2$ play two games against each other in the Premier League. It is assumed that the outcomes of the two games are independent of each other. The probabilities of $T_1$ winning, drawing and losing against $T_2$ ... What will be the value of $P(X=Y)?$ $1 / 3$ $13 / 36$ $1 / 36$ $1 / 18$
GO Classes
asked
in
Probability
Jan 28
by
GO Classes
447
views
goclasses2024-mockgate-13
goclasses
probability
conditional-probability
2-marks
6
votes
2
answers
45
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 the outer level). Suppose the code is located at address $0,$ and there are ... is $4$ Bytes.) $64 \mathrm{~KB}$ $2 \mathrm{~KB}$ $66 \mathrm{~KB}$ $16 \mathrm{MB}$
GO Classes
asked
in
Operating System
Jan 28
by
GO Classes
717
views
goclasses2024-mockgate-13
goclasses
operating-system
paging
multilevel-paging
2-marks
7
votes
1
answer
46
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 (TLB) in the address translation path has $128$ entries. At most ... distinct virtual addresses can be translated without any TLB miss? $2^7$ $2^{20}$ $2^{13}$ $2^8$
GO Classes
asked
in
Operating System
Jan 28
by
GO Classes
409
views
goclasses2024-mockgate-13
goclasses
operating-system
translation-lookaside-buffer
2-marks
3
votes
1
answer
47
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(n+1,str); } int main() { char str[] = " ... , upstr); } What will be the output of the given program? h*e*l*l*o h*e*l*l*o* h*e*l*l* hello
GO Classes
asked
in
Programming in C
Jan 28
by
GO Classes
306
views
goclasses2024-mockgate-13
goclasses
programming
programming-in-c
array
2-marks
8
votes
2
answers
48
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-endian, respectively? $(65280\text{ is } 255\times2^8)$ $255,\; 0$ $65280,\; 0$ $0,\;0$ $0,\; 65280$
GO Classes
asked
in
Programming in C
Jan 28
by
GO Classes
540
views
goclasses2024-mockgate-13
goclasses
programming
programming-in-c
little-endian-big-endian
output
2-marks
4
votes
1
answer
49
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$ ... What is the minimum number of binary semaphores we need in order to enforce this ordering?
GO Classes
asked
in
Operating System
Jan 28
by
GO Classes
386
views
goclasses2024-mockgate-13
goclasses
numerical-answers
operating-system
process-synchronization
semaphore
2-marks
2
votes
1
answer
50
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 network (in the order that they would occur), by listing the letter ... $a, e, c, d, g, c, b, f, c$
GO Classes
asked
in
Computer Networks
Jan 28
by
GO Classes
303
views
goclasses2024-mockgate-13
goclasses
computer-networks
http
2-marks
8
votes
2
answers
51
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 below: Sequence: $1001$ Acknowledgment: $5001$ Window size: $3000$ [ ... Payload Size: $1000]$ Sequence: $8001$ Acknowledgment: $1053$ Window size: $2000$ [TCP Payload Size: $1000]$
GO Classes
asked
in
Computer Networks
Jan 28
by
GO Classes
832
views
goclasses2024-mockgate-13
goclasses
computer-networks
tcp
multiple-selects
2-marks
7
votes
1
answer
52
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 conditions: Reception of three duplicate ACKs (that is, three identical ... first retransmitted (expressed in terms of msec after $t=0 )?$ $23$ $42$ $43$ $102$
GO Classes
asked
in
Computer Networks
Jan 28
by
GO Classes
847
views
goclasses2024-mockgate-13
goclasses
computer-networks
sliding-window
2-marks
9
votes
2
answers
53
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 of $-2^{-146}?$ $\textsf{0x80000004}$ $\textsf{0x80000008}$ $\textsf{0x80000010}$ $\textsf{0x80000002}$
GO Classes
asked
in
CO and Architecture
Jan 28
by
GO Classes
752
views
goclasses2024-mockgate-13
goclasses
co-and-architecture
number-representation
ieee-representation
2-marks
6
votes
1
answer
54
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 for eviction. The cache is initially empty. Suppose that for the following ... cache? $\text{B}=4$ bytes $\text{B}=8$ bytes $\text{B}=16$ bytes None of the above.
GO Classes
asked
in
CO and Architecture
Jan 28
by
GO Classes
717
views
goclasses2024-mockgate-13
goclasses
co-and-architecture
cache-memory
2-marks
5
votes
1
answer
55
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 by $m$. Which of the following sets is not ... machine halts on the input $m$. The set of $n$ such that all Turing machines halt on the input $n$.
GO Classes
asked
in
Theory of Computation
Jan 28
by
GO Classes
476
views
goclasses2024-mockgate-13
goclasses
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
2-marks
7
votes
1
answer
56
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 power of strings) and $x^{\downarrow m}=x_1^m \cdots x_n^m$. For empty ... $\left\{(a b c)^{\downarrow n} \mid n \geq 0\right\}$
GO Classes
asked
in
Theory of Computation
Jan 28
by
GO Classes
455
views
goclasses2024-mockgate-13
goclasses
numerical-answers
theory-of-computation
context-free-language
multiple-selects
2-marks
8
votes
1
answer
57
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 alphabet $\Gamma=\{\perp, a\}$ (where $\perp$ is the start symbol ... $21$ accepted by the above pushdown automaton is _________.
GO Classes
asked
in
Theory of Computation
Jan 28
by
GO Classes
545
views
goclasses2024-mockgate-13
goclasses
numerical-answers
theory-of-computation
pushdown-automata
2-marks
4
votes
1
answer
58
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($\%$), assuming $\mathrm{M}$ is $32$ bits wide? shift $\text{M}$ right by $4,$ ... $0000000 \mathrm{Fh}$, save the result, shift result left by $2,$ and add the saved result to current result.
GO Classes
asked
in
CO and Architecture
Jan 28
by
GO Classes
398
views
goclasses2024-mockgate-13
goclasses
co-and-architecture
number-representation
2-marks
2
votes
3
answers
59
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$ (in decimal) i.e. $\text{Q}_3\text{Q}_2\text{Q}_1\text{Q}_0=0110,$ then after the next positive edge of the clock signal the new state will be (in decimal)? (the flip-flops are positive edge triggered)
GO Classes
asked
in
Digital Logic
Jan 28
by
GO Classes
508
views
goclasses2024-mockgate-13
goclasses
numerical-answers
digital-logic
sequential-circuit
digital-counter
2-marks
4
votes
2
answers
60
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 60
You are asked to implement the following four functions with half-adders: ... of half-adders required to implement all four functions simultaneously? (You are not allowed to use any other logic element but half-adder)
GO Classes
asked
in
Digital Logic
Jan 28
by
GO Classes
462
views
goclasses2024-mockgate-13
goclasses
numerical-answers
digital-logic
combinational-circuit
adder
2-marks
Page:
« prev
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged goclasses2024-mockgate-13
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...