1
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+2
-0

Consider the database transactions T 1 and T 2, and data items X and Y . Which of the schedule(s) is/are conflict serializable?

GATE CSE 2025 Set 2 Database Management System - Transactions and Concurrency Question 1 English

A
$\mathrm{R} 1(\mathrm{X}), \mathrm{W} 2(\mathrm{X}), \mathrm{W} 1(\mathrm{Y}), \mathrm{W} 2(\mathrm{Y}), \mathrm{R} 1(\mathrm{X}), \mathrm{W} 1(\mathrm{X}), \operatorname{COMMIT}(\mathrm{T} 2), \operatorname{COMMIT}(\mathrm{T} 1)$
B
$\mathrm{W} 2(\mathrm{X}), \mathrm{R} 1(\mathrm{X}), \mathrm{W} 2(\mathrm{Y}), \mathrm{W} 1(\mathrm{Y}), \mathrm{R} 1(\mathrm{X}), \mathrm{COMMIT}(\mathrm{T} 2), \mathrm{W} 1(\mathrm{X}), \operatorname{COMMIT}(\mathrm{T} 1)$
C
$\mathrm{R} 1(\mathrm{X}), \mathrm{W} 1(\mathrm{Y}), \mathrm{W} 2(\mathrm{X}), \mathrm{W} 2(\mathrm{Y}), \mathrm{R} 1(\mathrm{X}), \mathrm{W} 1(\mathrm{X}), \mathrm{COMMIT}(\mathrm{T} 1), \operatorname{COMMIT}(\mathrm{T} 2)$
D
$\mathrm{W} 2(\mathrm{X}), \mathrm{R} 1(\mathrm{X}), \mathrm{W} 1(\mathrm{Y}), \mathrm{W} 2(\mathrm{Y}), \mathrm{R} 1(\mathrm{X}), \mathrm{COMMIT}(\mathrm{T} 2), \mathrm{W} 1(\mathrm{X}), \operatorname{COMMIT}(\mathrm{T} 1)$
2
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+2
-0

Consider the following relational schema:

Students ($$\mathrm{\underline {rollno:integer}}$$, name: string, age: integer, cgpa: real)

Courses ($$\mathrm{\underline {courseno:integer}}$$, cname: string, credits: integer)

Enrolled ($$\mathrm{\underline {rollno:integer}}$$, $$\mathrm{\underline {courseno:integer}}$$, grade: string)

Which of the following options is/are correct SQL query/queries to retrieve the names of the students enrolled in course number (i.e., courseno) $1470 ?$

A
GATE CSE 2025 Set 2 Database Management System - Structured Query Language Question 1 English Option 1
B
GATE CSE 2025 Set 2 Database Management System - Structured Query Language Question 1 English Option 2
C
GATE CSE 2025 Set 2 Database Management System - Structured Query Language Question 1 English Option 3
D
GATE CSE 2025 Set 2 Database Management System - Structured Query Language Question 1 English Option 4
3
GATE CSE 2025 Set 2
Numerical
+2
-0

In a $\mathrm{B}^{+}$- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:

$$A=(49,77,83,-), B=(7,19,33,44), C=\left(20^*, 22^*, 25^*, 26^*\right)$$

The *-marked keys signify that these are data entries in a leaf.

Assume that a pointer between keys $k_1$ and $k_2$ points to a subtree containing keys in [ $k_1, k_2$ ], and that when a leaf is created, the smallest key in it is copied up into A record with key value 23 is inserted into the $\mathrm{B}^{+}$- tree.

The smallest key value in the parent of the leaf that contains $25^*$ is _________ . (Answer in integer)

Your input ____
4
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+1
-0

Consider the following logic circuit diagram.

GATE CSE 2025 Set 2 Digital Logic - Combinational Circuits Question 1 English

Which is/are the CORRECT option(s) for the output function?

A
$\overline{X Y}$
B
$\bar{X}+\bar{Y}+X \bar{Y}$
C
$\overline{X Y}+\bar{X}+X \bar{Y}$
D
$X+\bar{Y}$
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12