NCERT Solutions Class 12 Computer Science Chapter 8 Database Concepts

Step-by-Step Textbook Solutions for Class 12 Computer Science Chapter 8 Database Concepts

Review structured textbook solutions for Class 12 Computer Science Chapter 8 Database Concepts. Built according to NCERT guidelines for the 2026-27 academic year, these downloadable answers support daily revision and problem-solving accuracy.

Download Chapter 8 Database Concepts Textbook Solutions PDF

View or download the dedicated Chapter 8 Database Concepts solution resource below. Engaging with these textbook answers under focused study conditions ensures continuous academic progress and mastery of the 2026-27 curriculum for Computer Science.


Chapter - Database Concepts

Question 1: What is relation? Define the relational data model.
Answer:
A relation is a table having atomic values, unique row and unordered rows and columns. The relational mode represent data and relationship among data by a collection of tables known as relation, each of which has a number of columns with unique names.

Question 2: What are all the domain names possible in gender ?
Answer: Male and Female.

Question 3: Give a suitable example of a table with sample data and illustrate Primary and Candidate Keys in it.
Answer: A table may have more than one such attribute/ group of attribute that identifies a row/tuple uniquely, all such attribute(s) are known as Candidate Keys. Out of the Candidate keys, one is selected as Primary Key,

Question 4: Differentiate between cardinality and degree of a table with the help of an example.
Answer: Cardinality is defined as the number of rows in table. Degree is the number of columns in a table, eg: Consider the following tables 
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-1
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-2

(1 Mark for writing suitable example/correct definition of a table)
(½ Mark for correct illustration/definition of Candidate Keys)
(½ Mark for correct illustration/definition of Primary Key)
Cardinality of Account table is : 3
Degree of Account table is : 2
[½ mark each for definition of cardinality and degree]
[1 mark for correct demonstration using example]

Question 5: Observe the following table carefully and write the names of the most appropriate columns, which can be considered as (i) candidate keys and (ii) primary key.
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-3

Answer:
Candidate keys : Id, Product
Primary keys: Id
(1 Mark for writing correct Candidate keys)
(1 Mark for writing correct Primary key)
Note : No marks to be deducted for mentioning Price and/or Transaction Date as additional candidate keys.

Question 6: Observe the following table carefully and write the names of the most appropriate columns,which can be considered as (i) candidate keys and (ii) primary key :
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-4

Answer:
Candidate keys : Code, Item Primary keys : Code
(1 Mark for writing correct Candidate keys)
(1 Mark for writing correct Primary key)
Note : No marks to be deducted for mentioning Price and/or Transaction Date as additional candidate keys.

Question 7: Define degree and cardinality. Based upon given table write degree and cardinality.
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-5

Answer:
Degree is the number of attributes or columns present in a table.
Cardinality is the number of tuples or rows present in a table.
Patients Degree = 4
[½ mark for each correct definition]
Cardinality = 5
[ ½ mark for each correct answer]

Question 8: Differentiate between the Primary key and Alternate key of a table with the help of an example.
Answer:
Primary Key – A primary key is a value that can be used to identify a unique row in a table .
Alternate Key – An alternate key is any candidate key which is not selected to be the primary key.
Example:
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-6

So, (Bank Account Number, Aadhaar Number) is a candidate key for the table.
Aadhaar Number ” Primary key
Bank Account Number ” Alternate Key

Question 9: Explain the concept of candidate keys with the help of an appropriate example.
Answer:
Candidate key is a column or set of columns that can help in identifying records uniquely.
Example, consider a Table STUDENT
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-7

Here, AdminN0 & Roll N0 define Table uniquely.
Hence, they are candidate keys.

Question 10: A table ‘customer’ has 10 columns but no row. Later, 10 new rows are inserted and 3 rows are deleted in the table. What is the degree and cardinality of the table customer
Answer:
Degree = 10[no. of cols]
Cardinality = 10-3=7[no. of rows]

Question 11: A table ‘student’ has 3 columns and 10 rows and another table ‘student 2’ has the same number of columns and 15 rows. 5 rows are common in both the tables. If we take union,what is the degree and cardinality of the resultant table ?
Answer:
Degree-3
Cardinality – 30 = (20 + 15-5)

Question 12: A table ‘student’ has 4 columns and 10 rows and table ‘student 2’ has 5 columns and 5 rows.
If we take Cartesian product of these two tables, what is the degree and cardinally of the resultant table?
Answer:
Degree-4 ×5=20[no. of columns]
Cardinally – 10×5 = 50 [no. of rows]

Question 13: Observe the following table and answer the parts (i) and (ii) :
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-8

1. In the above table, can we have Qty as primary key.[Answer as yes/no]. Justify your answer.
2. What is the cardinality and degree of the above table ?
Answer:
1. We cannot use Qty as primary key because there is duplication of values and primary key value cannot be duplicate.
2. Degree = 4
[1/2 mark for each correct definition]
Cardinity = 5
[1/2 mark for each correct definition]

Question 14: What do you understand by Union & Cartesian product in the relational algebra ?
Answer:
Union of R and S : The Union of two relations is a relation that includes all the tuples that are either in R or in S or in both R and S. Duplicate tuples are eliminated.
Cartesian Product: The Cartesian Product is an operator which works on two sets. It combines the tuples of one relation with all the tuples of the other relation.
Example: Cartesian Product
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-9

Question 15: Explain the concept of union between two tables, with the help of appropriate example.
Answer: The union operation denoted by ‘U’ combines two or more relations. The resultant of union operation contain tuples that are in either of the table or in both tables.
For example :
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-10

Question 16: In the following 2 tables, find the union value of Student 1 and Student 2.
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-11

Question 17: Observe the table ‘Club’ given below :
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-12

1. What is the cardinality and degree of the above given table ?
2. If a new column contact no has been added and three more members have joined the club then how these changes will affect the degree and cardinality of the above given table.
Answer:
cardinality: 4
Degree: 5
(1/2 Mark for each correct answer)
2. Cardinality: 7
Degree: 6
(1/2 Mark for each correct answer)

Question 18: In which situation can we apply union operation of two table ?
Answer:
Each table in the UNION
1. should have the same number of columns
2. similar data types
3. columns must be in the same order [2]


Short Answer Type Questions – II

Question 1: Observe the following STUDENTS and EVENTS tables carefully and write the name of the RDBMS operation which will be used to produce the output as shown in LIST. Also, find the Degree and Cardinality of the LIST.
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-13

Answer:
Cartesian Product
Degree = 4
Cardinality = 6

Question 2: Observe the following PARTICIPANTS and EVENTS tables carefully and write the name of the RDBMS operation which will be used to produce the output as shown in RESULT. Also, find the Degree and Cardinality of the
NCERT-Solutions-Class-12-Computer-Science -Database-Concepts-14

Answer:
Degree = no of columns = 4
Cartesian Product
Cardinality = no. of rows = 6

Step-by-Step Textbook Answers: Class 12 Computer Science Chapter 8 Database Concepts

Chapter Exercise Answers for Class 12 Computer Science

Explore reliable textbook solutions for Chapter 8 Database Concepts tailored for Class 12 learners. Utilizing these complete exercise answers ensures your preparation aligns exactly with official NCERT standards for Computer Science.

Detailed Answer Guides for Chapter 8 Database Concepts

Clear, methodical explanations accompany every challenging problem within the Class 12 Computer Science text. Engaging with these detailed answers lays a solid foundation for advanced learning and improves foundational clarity for upcoming assessments.

Complete Preparation Kit for Class 12 Exams

Frequent review of these structured answers builds strong analytical capabilities and response efficiency. Maximize your academic readiness by combining these textbook solutions with our curated study materials and mock evaluations for Class 12 Computer Science.

FAQs

Where can I find the latest NCERT Solutions Class 12 Computer Science Chapter 8 Database Concepts for the 2026-27 session?

The complete and updated NCERT Solutions Class 12 Computer Science Chapter 8 Database Concepts is available for free on StudiesToday.com. These solutions for Class 12 Computer Science are as per latest NCERT curriculum.

Are the Computer Science NCERT solutions for Class 12 updated for the new 50% competency-based exam pattern?

Yes, our experts have revised the NCERT Solutions Class 12 Computer Science Chapter 8 Database Concepts as per 2026 exam pattern. All textbook exercises have been solved and have added explanation about how the Computer Science concepts are applied in case-study and assertion-reasoning questions.

How do these Class 12 NCERT solutions help in scoring 90% plus marks?

Toppers recommend using NCERT language because NCERT marking schemes are strictly based on textbook definitions. Our NCERT Solutions Class 12 Computer Science Chapter 8 Database Concepts will help students to get full marks in the theory paper.

Do you offer NCERT Solutions Class 12 Computer Science Chapter 8 Database Concepts in multiple languages like Hindi and English?

Yes, we provide bilingual support for Class 12 Computer Science. You can access NCERT Solutions Class 12 Computer Science Chapter 8 Database Concepts in both English and Hindi medium.

Is it possible to download the Computer Science NCERT solutions for Class 12 as a PDF?

Yes, you can download the entire NCERT Solutions Class 12 Computer Science Chapter 8 Database Concepts in printable PDF format for offline study on any device.