My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Integrity Constraints and Normalization - Databases - Computer Science & Information Technology Previous Year Questions

Practice Integrity Constraints and Normalization - Databases - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

22Papers
12Years
34Questions
1Topics

Integrity Constraints and Normalization question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Integrity Constraints and Normalization. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 18 52.9%
Easy 15 44.1%
Hard 1 2.9%

Question type distribution

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

MCQ 19 55.9%
MSQ 10 29.4%
Numerical Answer Type (NAT) 5 14.7%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
34 Qs

Most asked topics

Top topics across the included previous year papers.

Databases
34 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Integrity Constraints and Normalization
34 Qs

Paper coverage

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

Computer Science and Information Technology (CS) 2026
3 Qs
Computer Science and Information Technology (CS) 2026
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
1 Qs

Included previous year papers

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

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620263View paper
Computer Science and Information Technology (CS) 202620261View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20251View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20251View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20242View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20241View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20222View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20211View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20212View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20201View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20191View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20181View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20171View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20162View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20162View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20141View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20141View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20132View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20132View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20132View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20131View paper

All Integrity Constraints and Normalization previous year questions

Practice every matching question in batches of 20, with every available option.

1
2013 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2013 [Session 1]
How many candidate keys does the relation R have?
Open complete paper
2
2013 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2013 [Session 1]

The relation R is

Open complete paper
3
2014 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider the relation scheme R = (E, F, G, H, I, J, K, L, M, N) and the set of functional dependencies {{E, F} → {G}, {F} → {I, J}, {E, H} → {K, L}, {K} → {M}, {L} → {N}} on R. What is the key for R?
Open complete paper
4
2014 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2014 [Session 1]
Given the following statements:

S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL.

S2: Given the table R(a, b, c) where a and b together form the primary key, the following is a valid table definition.
CREATE TABLE S ( a INTEGER, d INTEGER, e INTEGER, PRIMARY KEY (d), FOREIGN KEY (a) references R)
Which one of the following statements is CORRECT?
Open complete paper
5
2014 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2014 [Session 1]
Given the following two statements:
S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.
S2: AB→C, D→E, E→C is a minimal cover for the set of functional dependencies AB→C, D→E, AB→E, E→C.
Which one of the following is CORRECT?
Open complete paper
6
2014 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2014 [Session 2]
The maximum number of superkeys for the relation schema \(R(E, F, G, H)\) with \(E\) as the key is ____________.
Open complete paper
7
2014 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2014 [Session 3]
A prime attribute of a relation scheme R is an attribute that appears
Open complete paper
8
2016 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2016 [Session 1]
Which one of the following is NOT a part of the ACID properties of database transactions?
Open complete paper
9
2016 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2016 [Session 1]
A database of research articles in a journal uses the following schema.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)
The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE
(VOLUME, NUMBER) → YEAR
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICE
The database is redesigned to use the following schemas.
(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)
(VOLUME, NUMBER, YEAR)
Which is the weakest normal form that the new database satisfies, but the old one does not?
Open complete paper
10
2017 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2017 [Session 2]
Consider the following tables T1 and T2.
In table T1, P is the primary key and Q is the foreign key referencing R in table T2 with on-delete cascade and on-update cascade. In table T2, R is the primary key and S is the foreign key referencing P in table T1 with on-delete set NULL and on-update cascade. In order to delete record (3,8) from table T1, the number of additional records that need to be deleted from table T1 is ________.

Question diagram

Open complete paper
11
2018 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2018 [Session 2]
Consider the following four relational schemas. For each schema, all non-trivial functional dependencies are listed. The underlined attributes are the respective primary keys. Schema I: Registration (rollno, courses) Field 'courses' is a set-valued attribute containing the set of courses a student has registered for. Non-trivial functional dependency: rollno → courses Schema II: Registration (rollno, courseid, email) Non-trivial functional dependencies: rollno, courseid → email email → rollno Schema III: Registration (rollno, courseid, marks, grade) Non-trivial functional dependencies: rollno, courseid → marks, grade marks → grade Schema IV: Registration (rollno, courseid, credit) Non-trivial functional dependencies: rollno, courseid → credit courseid → credit Which one of the relational schemas above is in 3NF but not in BCNF?
Open complete paper
12
2019 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2019 [Session 2]
Let the set of functional dependencies F = {QR → S, R → P, S → Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS).
Consider the two statements given below.
I. Both Y and Z are in BCNF
II. Decomposition of X into Y and Z is dependency preserving and lossless
Which of the above statements is/are correct?
Open complete paper
13
2020 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2020 [Session 2]

Consider a relational table R that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?

Open complete paper
14
2021 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2021 [Session 1]
Consider the relation R(P, Q, S, T, X, Y, Z, W) with the following functional dependencies. PQ → X; P → YX; Q → Y; Y → ZW Consider the decomposition of the relation R into the constituent relations according to the following two decomposition schemes. D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)] D2 : R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)] Which one of the following options is correct?
Open complete paper
15
2021 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2021 [Session 2]

Suppose the following functional dependencies hold on a relation U with attributes \(P, Q, R, S\), and \(T\):

\[ P \rightarrow QR \]

\[ RS \rightarrow T \]

Which of the following functional dependencies can be inferred from the above functional dependencies?

Open complete paper
16
2021 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2021 [Session 2]
Consider the following statements S1 and S2 about the relational data model: S1: A relation scheme can have at most one foreign key. S2: A foreign key in a relation scheme R cannot be used to refer to tuples of R. Which one of the following choices is correct?
Open complete paper
17
2022 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2022 [Session 2]

In a relational data model, which one of the following statements is TRUE?

Open complete paper
18
2022 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2022 [Session 2]
Consider a relation \( R(A, B, C, D, E) \) with the following three functional dependencies.
\( AB \to C; \; BC \to D; \; C \to E; \)
The number of superkeys in the relation R is__________.
Open complete paper
19
2024 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2024 [Session 1]
Which of the following statements about a relation R in first normal form (1NF) is/are TRUE ?
Open complete paper
20
2024 · Computer Science & Information Technology · Databases · Integrity Constraints and Normalization
Computer Science & Information Technology (CS) 2024 [Session 1]
The symbol \( \rightarrow \) indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?
Open complete paper

Showing 20 of 27 questions