My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Database Management and Warehousing - Data Science & Artificial Intelligence Previous Year Questions

Practice Database Management and Warehousing - Data Science & Artificial Intelligence previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

3Papers
3Years
22Questions
1Topics

Database Management and Warehousing question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Database Management and Warehousing. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 14 63.6%
Easy 7 31.8%
Hard 1 4.5%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 10 45.5%
Numerical Answer Type (NAT) 7 31.8%
MSQ 5 22.7%

Subject weightage

Top subjects by unique question coverage.

Data Science & Artificial Intelligence
22 Qs

Most asked topics

Top topics across the included previous year papers.

Database Management and Warehousing
22 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Relational Databases and SQL
11 Qs
Normalization, Storage and Indexing
8 Qs
Data Transformation and Warehousing
3 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Data Science and Artificial Intelligence (DA) 2026
11 Qs
Data Science & Artificial Intelligence (DA) 2025
7 Qs
Data Science & Artificial Intelligence (DA) 2024
4 Qs

Browse by subtopics

Open a focused page built from the same verified paper data.

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Data Science and Artificial Intelligence (DA) 2026202611View paper
Data Science & Artificial Intelligence (DA) 202520257View paper
Data Science & Artificial Intelligence (DA) 202420244View paper

Sample previous year questions

A varied preview from the papers represented in this selection, with every available option.

1
2024 · Data Science & Artificial Intelligence · Database Management and Warehousing · Relational Databases and SQL
Data Science & Artificial Intelligence (DA) 2024
Consider a database that includes the following relations:
Defender(name, rating, side, goals)
Forward(name, rating, assists, goals)
Team(name, club, price)
Which ONE of the following relational algebra expressions checks that every name occurring in Team appears in either Defender or Forward, where \(\phi\) denotes the empty set?
Open complete paper
2
2025 · Data Science & Artificial Intelligence · Database Management and Warehousing · Normalization, Storage and Indexing
Data Science & Artificial Intelligence (DA) 2025
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?
Open complete paper
3
2026 · Data Science & Artificial Intelligence · Database Management and Warehousing · Normalization, Storage and Indexing
Data Science and Artificial Intelligence (DA) 2026
Let R(A, B, C, D, E) be a relational schema with functional dependency set F={A→BC, CD→E, E→A}.

Which of the following statements is correct?
Open complete paper
4
2024 · Data Science & Artificial Intelligence · Database Management and Warehousing · Relational Databases and SQL
Data Science & Artificial Intelligence (DA) 2024
Consider the following two tables named Raider and Team in a relational database maintained by a Kabaddi league. The attribute ID in table Team references the primary key of the Raider table, ID.
Raider
IDNameRaidsRaidPoints
1Arjun200250
2Ankush190219
3Sunil150200
4Reza150190
5Prathem175220
6Gopal193215

Team
CityIDBidPoints
Jaipur2200
Patna3195
Hyderabad5175
Jaipur1250
Patna4200
Jaipur6200

The SQL query described below is executed on this database:
SELECT *
FROM Raider, Team
WHERE Raider.ID=Team.ID AND City=”Jaipur” AND RaidPoints > 200;
The number of rows returned by this query is ______.

Question diagram

Open complete paper
5
2025 · Data Science & Artificial Intelligence · Database Management and Warehousing · Relational Databases and SQL
Data Science & Artificial Intelligence (DA) 2025
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)
\(\pi_{owner}(\text{Own} \bowtie (\sigma_{color='red'}(\text{Car}) \bowtie (\sigma_{maker='ABC'}(\text{Make}))))\)
Which one of the following options describes what the above expression computes?
Open complete paper
6
2026 · Data Science & Artificial Intelligence · Database Management and Warehousing · Data Transformation and Warehousing
Data Science and Artificial Intelligence (DA) 2026
Consider that the visualization of a 3-dimensional data cube is showing Sales Quantity for each combination of the attributes Product Type, Month and Country.

From this, if we want to further visualize the Sales Quantity for each combination of Product Type, Month and State, which of the following OLAP operations should be performed?
Open complete paper