Databases - Computer Science & Information Technology Previous Year Questions
Practice Databases - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
29Papers
19Years
134Questions
1Topics
Databases question pattern
Every graph below is calculated only from this selection.
Questions by year
Compare question counts across years.
Difficulty distribution
How the classified questions are distributed by difficulty.
134questions
Medium84
62.7%
Easy45
33.6%
Hard5
3.7%
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
134questions
MCQ94
70.1%
Numerical Answer Type (NAT)21
15.7%
MSQ19
14.2%
Subject weightage
Top subjects by unique question coverage.
Computer Science & Information Technology
134 Qs
Most asked topics
Top topics across the included previous year papers.
Databases
134 Qs
Subtopic coverage
Top subtopics inside this exact selection.
Relational Models, Algebra and SQL
48 Qs
Storage, Indexing and Transactions
47 Qs
Integrity Constraints and Normalization
39 Qs
Paper coverage
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Computer Science and Information Technology (CS) 2026
4 Qs
Computer Science and Information Technology (CS) 2026
4 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
6 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
5 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2011
4 Qs
Computer Science & Information Technology (CS) 2010
5 Qs
Computer Science & Information Technology (CS) 2009
5 Qs
Computer Science & Information Technology (CS) 2008
8 Qs
Computer Science & Information Technology (CS) 2007
6 Qs
Browse by subtopics
Open a focused page built from the same verified paper data.
A varied preview from the papers represented in this selection, with every available option.
1
2007 · Computer Science & Information Technology · Databases · Relational Models, Algebra and SQL
Computer Science & Information Technology (CS) 2007
Information about a collection of students is given by the relation studInfo(studId, name, sex). The relation enroll(studId, courseId) gives which student has enrolled for (or taken) what course(s). Assume that every course is taken by at least one male and at least one female student. What does the following relational algebra expression represent? ΠCourseId((ΠstudId(σsex=‘female’(studInfo)) × ΠcourseId(enroll)) − enroll)
2008 · Computer Science & Information Technology · Databases · Relational Models, Algebra and SQL
Computer Science & Information Technology (CS) 2008
Which of the following tuple relational calculus expression(s) is/are equivalent to \(\forall t \in r (P(t))\)? I. \(\neg \exists t \in r (P(t))\) II. \(\exists t \in r (P(t))\) III. \(\neg \exists t \in r (\neg P(t))\) IV. \(\exists t \in r (\neg P(t))\)