GATE CSE 1999 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then the maximum and minimum sizes of the join respectively are

m + n and 0

mn and 0

m + n and |m – n|

mn and m + n

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

The relational algebra expression equivalent to the following tuple calculus expression:

$$\left\{ {t|t \in r \wedge \left( {t\left[ A \right] = 10 \wedge t\left[ B \right] = 20} \right)} \right\}$$ is:

$${\sigma _{\left( {A = 10 \vee B = 20} \right)}}\left( r \right)$$

$${\sigma _{\left( {A = 10} \right)}}\left( r \right) \cup {\sigma _{\left( {B = 20} \right)}}\left( r \right)$$

$${\sigma _{\left( {A = 10} \right)}}\left( r \right) \cap {\sigma _{\left( {B = 20} \right)}}\left( r \right)$$

$${\sigma _{\left( {A = 10} \right)}}\left( r \right) - {\sigma _{\left( {B = 20} \right)}}\left( r \right)$$

GATE CSE 1999

MCQ (Single Correct Answer)

-0.6

For the schedule given below, which of the following is correct: GATE CSE 1999 Database Management System - Transactions and Concurrency Question 29 English

GATE CSE 1999 Database Management System - Transactions and Concurrency Question 29 English

This schedule is serialized and can occur in a scheme using 2PL protocol

This schedule is serializable but cannot occur in a scheme using 2PL protocol

This schedule is not serializable but can occur in a scheme using 2PL protocol

This schedule is not serializable and cannot occur in a scheme using 2PL protocol.

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Which of the following is correct?

B-trees are for storing data on disk and B⁺ trees are for main memory.

Range queries are faster on B⁺ trees.

B-trees are for primary indexes and B⁺ trees are for secondary indexes.

The height of a B⁺ tree is independent of the number of records.

PREVIOUS NEXT

GATE CSE Papers

2024