GATE DA 2025 Paper 1 — page 6

Questions 16–18 of 65. Imported answers require review unless explicitly marked reviewed.

If a relational decomposition is not dependency-preserving, which one of the following relational operators will be executed more frequently in order to maintain the dependencies?

Your answerChoose one option.

Selection

Projection

Join

Set union

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following three relations:

Car (model, year, serial, color)

Make (maker, model)

Own (owner, serial)

A tuple in Car represents a specific car of a given model, made in a given year, with a serial number and a color. A tuple in Make specifies that a maker company makes cars of a certain model. A tuple in Own specifies that an owner owns the car with a given serial number. Keys are underlined; (owner, serial) together form key for Own. (

denotes natural join)

Which one of the following options describes what the above expression computes?

Your answerChoose one option.

All owners of a red car, a car made by ABC, or a red car made by ABC

All owners of more than one car, where at least one car is red and made by ABC

All owners of a red car made by ABC

All red cars made by ABC

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a hash table of size 10 with indices

, with the hash function

where linear probing is used to handle collisions. The hash table is initially empty and the following sequence of keys is inserted into the hash table: 1, 4, 5, 6, 14, 15. The indices where the keys 14 and 15 are stored are, respectively

Your answerChoose one option.

2 and 5

2 and 6

4 and 5

4 and 6

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

2025 · Paper 1

Question 16

Question 17

Question 18