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-11
3
votes
1
answer
31
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 31
If $f, f^{\prime}$, and $f^{\prime \prime}$ are continuous and $f(2)=0, f^{\prime}(2)=2$, and $f^{\prime \prime}(2)=-3$, what can we say about the function $f(x)$ at $x=2?$ $f$ has a local minimum at $x=2$. $f$ has a local maximum at $x=2$. $f$ is increasing, at $x=2$ $f$ is decreasing, at $x=2$
GO Classes
asked
in
Calculus
Jan 13
by
GO Classes
480
views
goclasses2024-mockgate-11
goclasses
calculus
maxima-minima
1-mark
4
votes
1
answer
32
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 32
On a wireless link, the probability of successfully sending a packet is $0.1.$ A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be independent of ... is the expected number of packets that experience timeout to send one packet? (Timeout occurs on unsuccessful transmission)
GO Classes
asked
in
Computer Networks
Jan 13
by
GO Classes
526
views
goclasses2024-mockgate-11
goclasses
numerical-answers
computer-networks
stop-and-wait
1-mark
1
vote
1
answer
33
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 33
The "two-out-of-five" code comprises all possible binary words of length $5$ containing exactly two $1$'s. Which of the following statements is correct regarding error detection or correction for the "two-out- ... detect up to $1$ bit of error and cannot correct errors. The code cannot detect or correct any errors.
GO Classes
asked
in
Computer Networks
Jan 13
by
GO Classes
465
views
goclasses2024-mockgate-11
goclasses
computer-networks
error-detection
error-correction
1-mark
5
votes
1
answer
34
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 34
Which of the following is the best justification for using the middle bits of an address as the set index into a cache rather than the most significant bits? Indexing with the most significant bits would necessitate a smaller ... is likely to make more efficient use of the cache with middle-bit indexing than with high-bit indexing.
GO Classes
asked
in
CO and Architecture
Jan 13
by
GO Classes
425
views
goclasses2024-mockgate-11
goclasses
co-and-architecture
cache-memory
1-mark
5
votes
2
answers
35
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 35
Which one of the following context-free grammars is unambiguous? (Note that $a, b, c,(,),+$ are terminals, $S, X, Y$ are nonterminals, and the start symbol in each case is $S.)$ ... $S \rightarrow \epsilon|()|(S)$ $S \rightarrow \epsilon|(S)| S S$ $S \rightarrow \epsilon|(S)| S$
GO Classes
asked
in
Theory of Computation
Jan 13
by
GO Classes
625
views
goclasses2024-mockgate-11
goclasses
theory-of-computation
context-free-grammar
multiple-selects
1-mark
5
votes
1
answer
36
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 36
Consider the system $A \mathbf{x}=\mathbf{b}$, with coefficient matrix $A$ and augmented matrix $[A \mid b]$. The sizes of $\mathbf{b}, A$, and $[A \mid \mathbf{b}]$ are $m \times 1, m \times n$ ... $\operatorname{rank}[A]>$ $\operatorname{rank}[A \mid b]$.
GO Classes
asked
in
Linear Algebra
Jan 13
by
GO Classes
488
views
goclasses2024-mockgate-11
goclasses
linear-algebra
system-of-equations
multiple-selects
2-marks
2
votes
1
answer
37
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 37
If $b$ and $c$ are elements in a group $G$, and if $b^5=c^3=e$, where $e$ is the unit element of $G$, then the inverse of $b^2 c b^4 c^2$ must be $b^4 c^2 b^2 c$ $c^2 b^4 c b^2$ $c b^2 c^2 b^4$ $c b c^2 b^3$
GO Classes
asked
in
Set Theory & Algebra
Jan 13
by
GO Classes
403
views
goclasses2024-mockgate-11
goclasses
set-theory&algebra
group-theory
2-marks
8
votes
1
answer
38
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 38
A binary relation $\mathrm{R}$ over a set $\mathrm{A}$ is called a "GO Relation" if for all $\mathrm{x}, \mathrm{y}, \mathrm{z}$ $\in A$, if $x R y$ and $x R z$, then $y R z$. Which of the following ... is transitive. If $R$ is a GO relation then $R$ is reflexive. If $R$ is an equivalence relation then $R$ is a GO relation.
GO Classes
asked
in
Set Theory & Algebra
Jan 13
by
GO Classes
561
views
goclasses2024-mockgate-11
goclasses
set-theory&algebra
relations
multiple-selects
2-marks
2
votes
2
answers
39
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 39
The circuit shown below is designed using two multiplexers. This circuit is equivalent to: a positive edge triggered $\mathrm{T}$ flip flop a negative edge triggered $\mathrm{T}$ flip flop a negative edge triggered $\text{D}$ flip flop a positive edge triggered $\mathrm{D}$ flip flop
GO Classes
asked
in
Digital Logic
Jan 13
by
GO Classes
777
views
goclasses2024-mockgate-11
goclasses
digital-logic
sequential-circuit
flip-flop
2-marks
4
votes
1
answer
40
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 40
What is the output, $f(a,b,c,d),$ for the following circuit? $\Sigma(1,3,6,13,14,15)$ $\Sigma(1,3,6,9,10,14)$ $\Sigma(1,3,5,6,9,10,14)$ $\Sigma(1,3,5,6,9,10,12)$
GO Classes
asked
in
Digital Logic
Jan 13
by
GO Classes
518
views
goclasses2024-mockgate-11
goclasses
digital-logic
combinational-circuit
multiplexer
2-marks
8
votes
1
answer
41
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 41
A self-dual logic function is a function that is identical to its dual. An anti-self-dual logic function is a function whose dual is the same as the complement of the function. A boolean function $f$ on $n$ variables is called neutral if $f$ has ... on $\mathrm{n}$ variables is $\mathrm{C}\left(2^{n-1}\right., \left.2^ {n-2}\right)$.
GO Classes
asked
in
Digital Logic
Jan 13
by
GO Classes
730
views
goclasses2024-mockgate-11
goclasses
digital-logic
boolean-algebra
multiple-selects
2-marks
2
votes
1
answer
42
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 42
There are four chips each of $1024\:\text{bytes}$ connected to a $16\:\text{bit}$ address bus as shown in the figure below. $\textsf{RAMs}\: 1, 2, 3$ and $4$ ... $\textsf{0800H-0BFFH, 1800H-1BFFH, 2800H-2BFFH, 3800H-3BFFH}$
GO Classes
asked
in
CO and Architecture
Jan 13
by
GO Classes
406
views
goclasses2024-mockgate-11
goclasses
co-and-architecture
2-marks
5
votes
1
answer
43
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 43
Consider the following $6 \;\mathrm{I} / \mathrm{O}$ operations and their respective cylinder locations on disk. Seek time is $0.1$ milliseconds per cylinder traversed. The cylinders are numbered from $0$ to $99.$ ... total time we spend seeking is $\mathrm{Y}$ milliseconds. What is $10 \ast(\mathrm{X}-\mathrm{Y})?$
GO Classes
asked
in
CO and Architecture
Jan 13
by
GO Classes
557
views
goclasses2024-mockgate-11
goclasses
numerical-answers
co-and-architecture
disk-scheduling
2-marks
7
votes
2
answers
44
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 44
Acceptable input for a certain pocket calculator is a finite sequence of characters each of which is either a digit or a sign. The first character must be a digit, the last character must be a digit, and any character that is a sign must be followed by a digit. There ... by $N_k=a N _{k-1}+b N _{k-2}$, for $k \geq 3$. What is $a+ b?$
GO Classes
asked
in
Combinatory
Jan 13
by
GO Classes
534
views
goclasses2024-mockgate-11
goclasses
numerical-answers
combinatory
recurrence-relation
2-marks
4
votes
0
answers
45
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 45
Consider the scenario where $\text{L}$ is a shared variable which is a pointer to the head of a linked list originally containing three nodes with keys $3, 4,$ and $5.$ Consider the function List_Insert() which is being used by two concurrent threads $\text{T}1$ ... are separated by commas. $6,3,4,5$ $6,2,3,4,5$ $2,6,3,4,5$ $2,3,4,5$
GO Classes
asked
in
Operating System
Jan 13
by
GO Classes
343
views
goclasses2024-mockgate-11
goclasses
operating-system
process-synchronization
threads
multiple-selects
2-marks
5
votes
1
answer
46
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 46
The following table lists the arrival time and execution time of $5$ ... of $20$ units. If the Gantt chart starts at zero, what is the time at which $\mathrm{E}$ finishes its execution?
GO Classes
asked
in
Operating System
Jan 13
by
GO Classes
419
views
goclasses2024-mockgate-11
goclasses
numerical-answers
operating-system
process-scheduling
round-robin-scheduling
2-marks
3
votes
3
answers
47
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 47
What will be the output of the following program? #include<stdio.h> void swap(char **s1, char **s2){ char *tmp; tmp=*s1; *s1=*s2; *s2=tmp; } int main() { char *str[3]= {"orange", "apple", ... %s %s", strs[0], strs[1], strs[2]); } pear apple orange apple pear orange orange apple pear apple orange pea
GO Classes
asked
in
Programming in C
Jan 13
by
GO Classes
341
views
goclasses2024-mockgate-11
goclasses
programming
programming-in-c
array
array-of-pointers
2-marks
6
votes
1
answer
48
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 48
Consider the following pair of mutually recursive functions. What does $g(g(2))$ evaluate to? int f(int n){ if (n==0) return 0; return f(n-1)+g(n-1); } int g(int n){ if (n==0) return 1; return g(n-1) + f(n); }
GO Classes
asked
in
Programming in C
Jan 13
by
GO Classes
405
views
goclasses2024-mockgate-11
goclasses
numerical-answers
programming
programming-in-c
recursion
2-marks
8
votes
1
answer
49
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 49
An inversion in an array $a$ is a pair of array indices $(i, j)$ such that $i<j$ but $a[i]>a[j]$. What is the maximum number of inversions that can be eliminated by the following program fragment? tmp = a[5] ; a[5] = a[10] ; a[10]= tmp ; $5$ $6$ $9$ $20$
GO Classes
asked
in
Algorithms
Jan 13
by
GO Classes
556
views
goclasses2024-mockgate-11
goclasses
algorithms
sorting
2-marks
12
votes
2
answers
50
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 50
Given an unsorted array of $n$ distinct elements, you want to find this set of $\log n$ elements: those at positions $1,2,4,8,16, \ldots, n/2$ if array were sorted. In other words, find the largest element, the second largest element, the ... the subarray) $\Theta(\log n)$ $\Theta(n)$ $\Theta(n \log n)$ $\Theta\left(n^{2}\right)$
GO Classes
asked
in
Algorithms
Jan 13
by
GO Classes
962
views
goclasses2024-mockgate-11
goclasses
algorithms
merging
time-complexity
2-marks
6
votes
1
answer
51
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 51
Consider a directed graph $G$ with a source vertex $s, a$ destination $t$, and nonnegative edge lengths. Under what conditions is the shortest $s-t$ path guaranteed to be unique? When all edge lengths are distinct positive ... no directed cycles. When all edge lengths are distinct powers of $2.$ None of the other options are correct.
GO Classes
asked
in
Algorithms
Jan 13
by
GO Classes
417
views
goclasses2024-mockgate-11
goclasses
algorithms
graph-algorithm
shortest-path
2-marks
6
votes
0
answers
52
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 52
Consider the following binary heap – Suppose the last operation you performed in the binary heap above was inserting the key $x$. What are the possible values of $x?$ $20$ $8$ $13$ $11$
GO Classes
asked
in
DS
Jan 13
by
GO Classes
507
views
goclasses2024-mockgate-11
goclasses
data-structures
binary-heap
multiple-selects
2-marks
2
votes
1
answer
53
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 53
Consider the linked list initially having values $1, 2, 2, 8, 6, 2, 2,$ and let the head be the pointer to the first node of the linked list. Which of the following options correctly represents the final linked list after the function call ... LinkedList will be $1, 8, 6$ Final LinkedList will be $1, 8, 6, 2, 2$ None of the above
GO Classes
asked
in
DS
Jan 13
by
GO Classes
323
views
goclasses2024-mockgate-11
goclasses
data-structures
linked-list
2-marks
4
votes
1
answer
54
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 54
Consider the following grammar given below. ... the last character of the string: $a^* b($ $\operatorname{CC}($ $\mathrm{BC}($ $\mathrm{CB}$ $\mathrm{BB}$
GO Classes
asked
in
Compiler Design
Jan 13
by
GO Classes
741
views
goclasses2024-mockgate-11
goclasses
compiler-design
parsing
lr-parser
2-marks
8
votes
1
answer
55
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 55
Consider two hosts $A$ and $B$, connected to router $R$, creating two subnets: Subnet $1$ and Subnet $2,$ as shown in the figure. The interface IPs of Subnet $1$ are also depicted in the given diagram. Assume that, for every subnet, the all-zeros address ... $125.126 .11 .16 / 27$ $125.126 .11 .16 / 28$ $125.126 .11 .28 / 30$
GO Classes
asked
in
Computer Networks
Jan 13
by
GO Classes
762
views
goclasses2024-mockgate-11
goclasses
computer-networks
subnetting
2-marks
5
votes
1
answer
56
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 56
Host A has to inject' $30$ Mbits of data into a network via a token bucket regulator. The token bucket has a capacity of $15$ Mbits and is filled with tokens at the rate of $5$ Mbps. Data is buffered if it arrives ... enter the network, assuming that the host sends at a peak rate of $20$ Mbps and the token bucket is initially full?
GO Classes
asked
in
Computer Networks
Jan 13
by
GO Classes
547
views
goclasses2024-mockgate-11
goclasses
numerical-answers
computer-networks
token-bucket
2-marks
12
votes
1
answer
57
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 57
You are given a table named Alums that contains the names and personal information of all graduates of the college that you work for. It includes name and age attributes, and a state attribute specifying the state in which a person ... of the youngest graduate living in California (CA)? only II only III only I and II only II and III
GO Classes
asked
in
Databases
Jan 13
by
GO Classes
869
views
goclasses2024-mockgate-11
goclasses
databases
sql
2-marks
2
votes
1
answer
58
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 58
Consider the following notation for operations of transactions: ... above schedules is/are recoverable? Only $\text{S}_2$ Only $\text{S}_3$ Only $\text{S}_1, \text{S}_3$ None
GO Classes
asked
in
Databases
Jan 13
by
GO Classes
350
views
goclasses2024-mockgate-11
goclasses
databases
transaction-and-concurrency
2-marks
4
votes
0
answers
59
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 59
Which of the following statements is/are false? In a cascade-less schedule if a transaction $T_j$ read a data item written by transaction $T_i$ then the commit of $T_i$ has to be before this read operation of $T_j$ A ... $2 \mathrm{PL}$ (could have been produced using the $2 \mathrm{PL}$ locking protocol) is conflict-serializable.
GO Classes
asked
in
Databases
Jan 13
by
GO Classes
420
views
goclasses2024-mockgate-11
goclasses
databases
transaction-and-concurrency
conflict-serializable
multiple-selects
2-marks
8
votes
4
answers
60
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 60
In a relational database relation, we say a non-empty set of attributes $\mathrm{X}$ is closed (with respect to a given set of functional dependencies FD) if $X^{+}=X$ (where $X^{+}$is the closure of $X).$ ... $2.$ $R$ is in $2 N F$. $R$ is in $3 N F$.
GO Classes
asked
in
Databases
Jan 13
by
GO Classes
952
views
goclasses2024-mockgate-11
goclasses
databases
database-normalization
functional-dependency
multiple-selects
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-11
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:...