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
Filter
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Arjun
2
votes
1
answer
121
GATE CSE 2024 | Set 2 | Question: 35
The relation schema, Person (pid, city), describes the city of residence for every person uniquely identified by pid. The following relational algebra operators are available: selection, projection, cross product, and rename. To find the list of cities ... above operators, the minimum number of cross product operations that must be used is $1$ $2$ $3$ $4$
asked
in
Databases
Feb 16
1.9k
views
gatecse2024-set2
databases
1
vote
1
answer
122
GATE CSE 2024 | Set 2 | Question: 36
Consider a multi-threaded program with two threads $\mathrm{T} 1$ and $\mathrm{T} 2$. The threads share two semaphores: $s1$ (initialized to $1$) and $s2$ (initialized to $0$). The threads also share a global variable $\mathrm{x}$ ( ... not print anything (deadlock) $\mathrm{T} 2$ runs first and prints $1, \mathrm{~T} 1$ does not print anything (deadlock)
asked
in
Operating System
Feb 16
1.7k
views
gatecse2024-set2
operating-system
multiple-selects
2
votes
0
answers
123
GATE CSE 2024 | Set 2 | Question: 37
Let $A$ be an $n \times n$ matrix over the set of all real numbers $\mathbb{R}$. Let $B$ be a matrix obtained from $A$ by swapping two rows. Which of the following statements is/are TRUE? The determinant of $B$ is the negative of the ... If $A$ is symmetric, then $B$ is also symmetric If the trace of $A$ is zero, then the trace of $B$ is also zero
asked
in
Linear Algebra
Feb 16
1.8k
views
gatecse2024-set2
linear-algebra
multiple-selects
1
vote
1
answer
124
GATE CSE 2024 | Set 2 | Question: 38
Let $\mathrm{S} 1$ and $\mathrm{S} 2$ be two stacks. $\mathrm{S} 1$ has capacity of $4$ elements. $\mathrm{S} 2$ has capacity of $2$ elements. $\text{S1}$ already has $4$ elements: $100,200,300$, and $400$ ... output sequences can be generated by using the above operations? $100,200,400,300$ $200,300,400,100$ $400,200,100,300$ $300,200,400,100$
asked
in
DS
Feb 16
1.8k
views
gatecse2024-set2
data-structures
stack
multiple-selects
1
vote
1
answer
125
GATE CSE 2024 | Set 2 | Question: 39
Which of the following is/are EQUAL to $224$ in radix - $5$ (i.e., base - $5$) notation? $64$ in radix -10 $100$ in radix -8 $50$ in radix -16 $121$ in radix -7
asked
in
Digital Logic
Feb 16
1.6k
views
gatecse2024-set2
digital-logic
number-representation
multiple-selects
2
votes
1
answer
126
GATE CSE 2024 | Set 2 | Question: 40
Consider $4$-variable functions $f 1, f 2, f 3, f 4$ expressed in sum-of-minterms form as given below. \[ \begin{array}{l} f 1=\sum(0,2,3,5,7,8,11,13) \\ f 2=\sum(1,3,5,7,11,13,15) \\ f 3=\sum(0,1,4,11) \\ f 4=\sum(0,2,6,13) \end{array} \] With ... $\boldsymbol{Y}=\sum(0,1,2,3,4,5,6,7)$ $\boldsymbol{Y}=\Pi(8,9,10,11,12,13,14,15)$
asked
in
Digital Logic
Feb 16
1.6k
views
gatecse2024-set2
digital-logic
canonical-normal-form
multiple-selects
1
vote
2
answers
127
GATE CSE 2024 | Set 2 | Question: 41
Let $\text{G}$ be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in $\text{G}$ has even weight. Which of the following statements is/are TRUE for every such graph $\text{G}$ ... $\text{C}$ have even weight $\text{OR}$ all edges in $\text{C}$ have odd weight
asked
in
Algorithms
Feb 16
1.8k
views
gatecse2024-set2
algorithms
multiple-selects
2
votes
1
answer
128
GATE CSE 2024 | Set 2 | Question: 42
Consider a context-free grammar $\text{G}$ with the following $3$ rules. \[ S \rightarrow a S, S \rightarrow a S b S , S \rightarrow c \] Let $w \in L(G)$. Let $ n_{a}(w), n_{b}(w), n_{c}(w) $ denote the number of times $a, b, c$ occur in $w$, respectively. Which of ... $n_{a}(w)>n_{c}(w)-2$ $n_{c}(w)=n_{b}(w)+1$ $n_{c}(w)=n_{b}(w) * 2$
asked
in
Theory of Computation
Feb 16
1.6k
views
gatecse2024-set2
theory-of-computation
multiple-selects
1
vote
1
answer
129
GATE CSE 2024 | Set 2 | Question: 43
Consider a disk with the following specifications: rotation speed of $6000$ RPM, average seek time of $5$ milliseconds, $500$ sectors/track, $512$-byte sectors. A file has content stored in $3000$ sectors located randomly on the disk. Assuming ... total time (in seconds, rounded off to $2$ decimal places) to read the entire file from the disk is ______________.
asked
in
Operating System
Feb 16
1.5k
views
gatecse2024-set2
numerical-answers
operating-system
disk
1
vote
1
answer
130
GATE CSE 2024 | Set 2 | Question: 44
Consider a $\text{TCP}$ connection operating at a point of time with the congestion window of size $12$ $\text{MSS}$ (Maximum Segment Size), when a timeout occurs due to packet loss. Assuming that all the segments transmitted in the next ... Time) are acknowledged correctly, the congestion window size (in $MSS$) during the third $\text{RTT}$ will be __________.
asked
in
Computer Networks
Feb 16
1.5k
views
gatecse2024-set2
numerical-answers
computer-networks
2
votes
1
answer
131
GATE CSE 2024 | Set 2 | Question: 45
Consider an Ethernet segment with a transmission speed of $10^{8} \mathrm{bits} / \mathrm{sec}$ and a maximum segment length of $500$ meters. If the speed of propagation of the signal in the medium is $2 \times 10^{8} \mathrm{~meters} / \mathrm{sec}$, then the minimum frame size (in bits) required for collision detection is ___________.
asked
in
Computer Networks
Feb 16
1.3k
views
gatecse2024-set2
numerical-answers
computer-networks
1
vote
1
answer
132
GATE CSE 2024 | Set 2 | Question: 46
A functional dependency $F: X \rightarrow Y$ is termed as a useful functional dependency if and only if it satisfies all the following three conditions: $\text{X}$ is not the empty set. $\text{Y}$ is not the empty set. Intersection ... set. For a relation $\text{R}$ with $4$ attributes, the total number of possible useful functional dependencies is __________.
asked
in
Databases
Feb 16
1.5k
views
gatecse2024-set2
numerical-answers
databases
2
votes
1
answer
133
GATE CSE 2024 | Set 2 | Question: 47
A processor with $16$ general purpose registers uses a $32$-bit instruction format. The instruction format consists of an opcode field, an addressing mode field, two register operand fields, and a $16$-bit scalar field. If $8$ addressing modes are to be supported, the maximum number of unique opcodes possible for every addressing mode is ___________.
asked
in
CO and Architecture
Feb 16
1.5k
views
gatecse2024-set2
numerical-answers
co-and-architecture
2
votes
0
answers
134
GATE CSE 2024 | Set 2 | Question: 48
A non-pipelined instruction execution unit operating at $2 \mathrm{GHz}$ takes an average of $6$ cycles to execute an instruction of a program $\text{P}$. The unit is then redesigned to operate on a $5$ ... hazards. The speedup (rounded off to one decimal place) obtained by the pipelined design over the non-pipelined design is ____________.
asked
in
CO and Architecture
Feb 16
1.5k
views
gatecse2024-set2
numerical-answers
co-and-architecture
pipelining
1
vote
1
answer
135
GATE CSE 2024 | Set 2 | Question: 49
The number of distinct minimum-weight spanning trees of the following graph is
asked
in
Algorithms
Feb 16
1.6k
views
gatecse2024-set2
numerical-answers
algorithms
minimum-spanning-tree
1
vote
2
answers
136
GATE CSE 2024 | Set 2 | Question: 50
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
asked
in
Graph Theory
Feb 16
1.6k
views
gatecse2024-set2
graph-theory
numerical-answers
1
vote
1
answer
137
GATE CSE 2024 | Set 2 | Question: 51
A processor uses a $32$-bit instruction format and supports byte-addressable memory access. The $\text{ISA}$ of the processor has $150$ distinct instructions. The instructions are equally divided into two types, namely $\text{R}$ ... the number of bits used to encode the immediate value/address field. The value of $\text{X+2Y+Z}$ is __________.
asked
in
CO and Architecture
Feb 16
1.6k
views
gatecse2024-set2
numerical-answers
co-and-architecture
1
vote
3
answers
138
GATE CSE 2024 | Set 2 | Question: 52
Let $L_{1}$ be the language represented by the regular expression $b^{*} a b^{*}\left(a b^{*} a b^{*}\right)^{*}$ and $L_{2}=\left\{w \in(a+b)^{*}|| w \mid \leq 4\right\}$, where $|w|$ denotes the length of string $w$. The number of strings in $L_{2}$ which are also in $L_{1}$ is _________.
asked
in
Theory of Computation
Feb 16
1.7k
views
gatecse2024-set2
numerical-answers
theory-of-computation
2
votes
2
answers
139
GATE CSE 2024 | Set 2 | Question: 53
Let $Z_{n}$ be the group of integers $\{0,1,2, \ldots, n-1\}$ with addition modulo $n$ as the group operation. The number of elements in the group $Z_{2} \times Z_{3} \times Z_{4}$ that are their own inverses is ___________.
asked
in
Set Theory & Algebra
Feb 16
1.8k
views
gatecse2024-set2
numerical-answers
set-theory&algebra
group-theory
4
votes
2
answers
140
GATE CSE 2024 | Set 2 | Question: 54
Consider a $32$-bit system with $4 \mathrm{~KB}$ page size and page table entries of size $4$ bytes each. Assume $1 \mathrm{~KB}=2^{10}$ bytes. The OS uses a $2$-level page table for memory management, with the page table containing ... the maximum number of pages across the two levels of the page table of the process. The value of $\text{X+Y}$ is ___________.
asked
in
Operating System
Feb 16
2.2k
views
gatecse2024-set2
numerical-answers
operating-system
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
12
...
98
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 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:...