Database Concepts: CBSE Class 12 Computer Science Notes and Questions
Updated 14 October 2026 · Fact-checked
A database is an organised collection of related data managed by a DBMS, which removes the redundancy and inconsistency of plain files. In the relational model data sits in tables called relations: columns are attributes, rows are tuples, the column count is the degree and the row count is the cardinality. Keys (candidate, primary, alternate, foreign) identify and link rows.
What Database Concepts is about
Database Concepts opens Unit 3, Database Management, which carries 20 of the 70 theory marks with SQL and the Python-SQL interface. The chapter is short but its vocabulary runs through every SQL question: you cannot answer "identify the primary key", "what is the degree after this ALTER?" or "which column is the foreign key?" without it. In the 2026-27 sample paper such items appear as 1-mark MCQs and inside the 4-mark SQL questions.
The syllabus lists:
- introduction to database concepts and its need: the problems of keeping data in separate files and what a DBMS adds
- relational data model: relation, attribute, tuple, domain, degree, cardinality
- keys: candidate key, primary key, alternate key, foreign key
NCERT Chapter 7 (Understanding Data: collection, storage and statistical techniques) is not in the 2026-27 syllabus. The tables used on this page:
STUDENT
| RollNo | Name | Class | Phone | HouseID |
|---|---|---|---|---|
| 1 | Asha | 12A | 98100 11111 | H1 |
| 2 | Ravi | 12B | 98100 22222 | H2 |
| 3 | Meena | 12A | 98100 33333 | H1 |
| 4 | Joy | 12C | NULL | H3 |
HOUSE
| HouseID | HName | Captain |
|---|---|---|
| H1 | Ganga | Asha |
| H2 | Yamuna | Ravi |
| H3 | Kaveri | Joy |
Weightage: This chapter is part of Unit 3, Database Management, which carries 20 of the 70 theory marks together with Structured Query Language (SQL) and Interface of Python with an SQL Database.Source: CBSE Computer Science (083) syllabus 2026-27, distribution of marks, Unit 3 Database Management
Key concepts
- Why a database? Limitations of a file system
- NCERT section NCERT 8.2, 8.3
When each office keeps its own files (the fee clerk a fee file, the library a member file), problems appear. Data redundancy: the same data (a student's name and address) is stored many times, wasting space. Data inconsistency: when one copy is updated and another is not, the copies disagree. Data isolation: data is scattered in files of different formats, so combining it needs new programs. Data dependence: programs are tied to the file's structure, so changing the structure means changing every program. Controlled sharing is hard: giving different users different access to parts of a file is difficult. A database is an organised collection of related data, and a DBMS (Database Management System, e.g. MySQL, Oracle, PostgreSQL) is the software that creates, stores, updates, retrieves and protects it, so these problems are reduced: data is stored once, shared, and accessed through queries.
Worked example
A student's address is stored in both the fee file and the transport file. She moves house and only the fee file is updated. Name the two problems this shows and how a DBMS avoids them.
Try it first, then show the solutionSolution
- Storing the address twice is data redundancy.
- The two files now give different addresses: data inconsistency.
- In a database the address is stored once (in one table) and other tables refer to the student by a key, so one update is seen everywhere.
Answer: Redundancy and inconsistency; a DBMS stores the data once and links to it through keys.
- Relation, attribute, tuple and domain
- NCERT section NCERT 8.4, 8.4.1
In the relational data model (proposed by E. F. Codd), data is kept in tables. A relation is a table. An attribute is a column, with a name such as Name or Class. A tuple is a row: one record. The domain of an attribute is the set of values it may take, for example Class from {11A, ..., 12D} or Phone as 10-digit numbers. Properties of a relation: each attribute name is unique within the table; the order of rows and of columns does not matter; no two tuples are identical; each cell holds a single (atomic) value; a missing value is shown as NULL.
Worked example
In the STUDENT table, name (a) one attribute (b) the tuple of roll number 3 (c) a sensible domain for Class (d) the value of Phone for Joy.
Try it first, then show the solutionSolution
- (a) Any column heading, e.g. Name.
- (b) The whole row (3, Meena, 12A, 98100 33333, H1).
- (c) The set of valid class-section codes, such as 11A to 12D.
- (d) It is unknown, stored as NULL.
Answer: (a) Name (b) (3, Meena, 12A, 98100 33333, H1) (c) valid class codes such as 11A-12D (d) NULL
- Degree and cardinality
- NCERT section NCERT 8.4
The degree of a relation is its number of attributes (columns). The cardinality is its number of tuples (rows). Adding a column with ALTER TABLE raises the degree by 1; inserting a row raises the cardinality by 1; deleting rows lowers the cardinality; the header row is never counted. Degree changes rarely (the design changes), cardinality changes all the time (data changes).
Worked example
Find the degree and cardinality of STUDENT and HOUSE. What are they for STUDENT after two new students are added and a column Email is added?
Try it first, then show the solutionSolution
- STUDENT: 5 columns, 4 rows. HOUSE: 3 columns, 3 rows.
- Adding two rows: cardinality 4 + 2 = 6. Adding Email: degree 5 + 1 = 6.
Answer: STUDENT 5 and 4; HOUSE 3 and 3; afterwards STUDENT has degree 6 and cardinality 6.
- Candidate key, primary key and alternate key
- NCERT section NCERT 8.5.1-8.5.3
A candidate key is an attribute (or minimal set of attributes) whose values are unique for every tuple and never NULL, so it could identify each row. A table may have several: in STUDENT both RollNo and Phone are unique, but Phone has a NULL (Joy), so only RollNo qualifies. The primary key is the one candidate key chosen by the designer to identify tuples; it must be unique and not NULL. Every other candidate key is an alternate key. When no single column is unique, a combination can be the key (a composite primary key), such as (RollNo, Subject) in a marks table where each student has many subjects.
Worked example
A table BOOK has columns ISBN, AccessionNo, Title, Author. Every copy has a unique AccessionNo; every edition has a unique ISBN, but the library has two copies of some editions. Identify the candidate keys, a primary key and the alternate key(s).
Try it first, then show the solutionSolution
- ISBN repeats for two copies of the same edition, so it is not unique in this table: not a candidate key.
- AccessionNo is unique for every row and never empty: the only candidate key.
- So the primary key is AccessionNo, and there is no alternate key.
Answer: Candidate key: AccessionNo; primary key: AccessionNo; no alternate key (ISBN is not unique here).
- Foreign key and referential links
- NCERT section NCERT 8.5.4
A foreign key is an attribute in one table that refers to the primary key of another table (or the same table), linking the two. Its values must either match an existing primary-key value in the referenced table or be NULL; this rule is referential integrity. The table holding the foreign key is the referencing (child) table; the other is the referenced (parent) table. A foreign key may repeat (many students in one house) even though the primary key it refers to cannot.
Worked example
In STUDENT and HOUSE, which attribute is the foreign key and in which table? Can a new student be given HouseID H5?
Try it first, then show the solutionSolution
- HouseID is the primary key of HOUSE.
- STUDENT.HouseID refers to it, so HouseID in STUDENT is a foreign key.
- H5 does not exist in HOUSE, so referential integrity forbids it.
Answer: HouseID in STUDENT is the foreign key referring to HOUSE; H5 is not allowed until house H5 is added to HOUSE.
Database Concepts in real life
Each concept, met in an everyday situation. Read the situation, answer the question in your own words, then compare with the model answer. The one-line hook is what to remember.
Primary key
Suppose a coaching centre registers students by name, and two students named Rahul Sharma join the same batch.
Why is Name a poor primary key, and what should be used instead?
Try it first, then show the solutionSolution
- A primary key must be unique for every row; names can repeat.
- Give each student a unique registration number and make that the primary key.
Answer: Name is not unique; use a unique RegNo as the primary key.
Memory hook: A key must open exactly one lock: one value, one row.
Foreign key and referential integrity
Imagine an online store where every order row stores a CustomerID, and someone enters an order for customer C999, who does not exist.
Which rule is broken and which key enforces it?
Try it first, then show the solutionSolution
- ORDERS.CustomerID refers to CUSTOMER.CustomerID, the primary key of CUSTOMER, so it is a foreign key.
- Referential integrity says a foreign-key value must exist in the parent table (or be NULL); C999 does not.
Answer: Referential integrity is broken; the foreign key ORDERS.CustomerID enforces it.
Memory hook: A foreign key is a visitor's pass: it must name someone who actually lives there.
Redundancy and inconsistency
Suppose a school keeps teachers' phone numbers in the timetable file, the salary file and the transport file, and a teacher changes her number.
What can go wrong, and how does a database design fix it?
Try it first, then show the solutionSolution
- Three copies (redundancy) need three updates; if one is missed, the files disagree (inconsistency).
- Keep the phone number once in a TEACHER table and refer to teachers by TeacherID elsewhere.
Answer: Copies can disagree; store the number once and link by key.
Memory hook: Store once, link everywhere.
Topics in this chapter
- Relational Data Model TermsComing soon
- Candidate, Primary and Alternate KeysComing soon
- Foreign KeyComing soon
- Keys: Candidate, Primary, Alternate and Foreign Key
- Need for a Database: Limitations of the File System
- Relational Model: Relation, Attribute, Tuple, Domain, Degree, Cardinality
Database Concepts: syntax and key facts
- Relational terms
- relation = table; attribute = column; tuple = row; domain = set of allowed values of an attribute
- A missing value is NULL, which is not zero or a blank.
- Degree and cardinality
- degree = number of columns; cardinality = number of rows (header not counted)
- ALTER TABLE ... ADD changes degree; INSERT and DELETE change cardinality.
- Keys
- candidate key: unique and not NULL; primary key: the chosen candidate key; alternate key = candidate keys - primary key
- A primary key can be composite (two or more columns together).
- Foreign key rule
- foreign key value ∈ {primary-key values of the parent table} ∪ {NULL}
- This is referential integrity.
- File-system problems
- redundancy, inconsistency, isolation, dependence, difficult controlled sharing
- A DBMS reduces all of them.
How the board asks Database Concepts
The question patterns to expect, and the method that works for each.
| Question type | How it is asked | Method |
|---|---|---|
| Identify keys in a given table | Two related tables are shown; name the primary key, a candidate or alternate key, and the foreign key (1-2 marks, often inside a 4-mark SQL question). | Check each column for uniqueness and NULLs; the column that appears in another table as that table's primary key is the foreign key. |
| Degree and cardinality | State them for a table, or after some rows and columns are added or removed (1 mark). | Degree counts columns, cardinality counts rows; apply each change in turn. |
| Define and differentiate | Primary vs candidate key; degree vs cardinality; attribute vs tuple; primary vs foreign key (2 marks). | One-line definition each plus an example from a small table. |
| Need for a DBMS | Give two limitations of a file system or two advantages of a DBMS (2 marks). | Name the problem (redundancy, inconsistency) and show it in a one-line example. |
| Assertion-reason on keys | "A primary key can contain NULL" or "A foreign key value must be unique". | Primary key: unique and not NULL. Foreign key: may repeat; must match a parent key or be NULL. |
Tricks to remember Database Concepts
Short memory aids. Say each one aloud once, then use it on a question the same day.
Degree across, Cardinality counts the cards
Degree counts the column headings across the top; Cardinality counts the record Cards (rows) stacked below.
Use it when: Never swapping degree and cardinality.
CAP keys
Candidates apply, one becomes Principal (primary), the rest are Alternates.
Use it when: Candidate, primary and alternate keys.
Foreign key = passport
It is valid only if the home country (parent table) has issued that number.
Use it when: Referential integrity.
RIIDS
Redundancy, Inconsistency, Isolation, Dependence, Sharing problems.
Use it when: Listing file-system limitations.
Database Concepts: board-level solved questions
Ordered from board level to HOTS. Cover the solution, write your own, then compare step by step.
Example 1: Degree and cardinality after changes · 1 mark · Very short answerHarder board level
A table has degree 6 and cardinality 20. Two columns are dropped, 5 rows are deleted and 3 rows inserted. What are the new degree and cardinality?
Try it first, then show the solutionSolution
- Degree: 6 - 2 = 4.
- Cardinality: 20 - 5 + 3 = 18.
Answer: Degree 4, cardinality 18
Example 2: Spot the keys · 2 marks · Short answerBoard level
Table CUSTOMER(CustID, Name, Mobile, City). Every customer has a unique CustID and a unique, compulsory Mobile. Name and City repeat. Identify the candidate keys, a primary key and the alternate key.
Try it first, then show the solutionSolution
- Unique and not NULL: CustID and Mobile → candidate keys.
- Choose CustID as the primary key (short and stable).
- Mobile becomes the alternate key.
Answer: Candidate keys: CustID, Mobile; primary key: CustID; alternate key: Mobile.
Example 3: Assertion-reason on primary keys · 1 mark · Assertion-reasonHOTS / competency
Assertion (A): In STUDENT, Phone cannot be chosen as the primary key.
Reason (R): A primary key column cannot contain NULL values.
(a) Both true, R explains A (b) Both true, R does not explain A (c) A true, R false (d) A false, R true
Try it first, then show the solutionSolution
- Joy's Phone is NULL, so Phone cannot be the primary key: A is true.
- R is the rule that rules it out.
Answer: (a) Both A and R are true and R is the correct explanation of A.
Example 4: Foreign key insertions · 2 marks · Short answerHarder board level
Using STUDENT and HOUSE, say whether each action is allowed: (i) insert a student with HouseID H2 (ii) insert a student with HouseID H4 (iii) delete house H3 from HOUSE while Joy still refers to it (iv) insert a student with HouseID NULL.
Try it first, then show the solutionSolution
- (i) H2 exists in HOUSE: allowed.
- (ii) H4 does not exist: violates referential integrity.
- (iii) Joy's row would refer to a missing house: not allowed (unless Joy's HouseID is changed first).
- (iv) A foreign key may be NULL (house not yet allotted): allowed.
Answer: (i) yes (ii) no (iii) no (iv) yes
Example 5: Composite key · 2 marks · Short answerHOTS / competency
ISSUE(MemberID, BookID, IssueDate, ReturnDate) records each time a member borrows a book. A member may borrow the same book again on another day. Which minimal combination is a suitable primary key?
Try it first, then show the solutionSolution
- MemberID repeats (many books); BookID repeats (many members); (MemberID, BookID) repeats when the same book is borrowed again.
- Adding IssueDate makes each row unique (assuming one issue of a book per member per day).
- No smaller combination is unique, so it is minimal.
Answer: (MemberID, BookID, IssueDate)
Example 6: Relational terms MCQ · 1 mark · MCQBoard level
In a relation, a row is called a: (a) domain (b) attribute (c) tuple (d) degree
Try it first, then show the solutionSolution
- Columns are attributes; the set of allowed values is the domain; degree is a count.
- A row is a tuple.
Answer: (c) tuple
Example 7: Domain violation · 1 mark · Very short answerHarder board level
The domain of Class in STUDENT is {11A, 11B, 11C, 12A, 12B, 12C}. Which inserted value violates it: '12B', '13A', or NULL (if NULL is allowed)?
Try it first, then show the solutionSolution
- '12B' is in the set; NULL is allowed by the question.
- '13A' is not in the domain.
Answer: '13A'
Case-study practice (Section E style)
Read the situation, then answer every part. In the board paper this is a 4-mark question split into 1 + 1 + 2 marks.
School canteen database
Suppose a school canteen moves from paper registers to a database with two tables:
ITEM
| ItemCode | ItemName | Price |
|---|---|---|
| I1 | Samosa | 15 |
| I2 | Juice | 25 |
| I3 | Sandwich | 40 |
SALE
| BillNo | ItemCode | Qty |
|---|---|---|
| 101 | I1 | 2 |
| 101 | I2 | 1 |
| 102 | I1 | 3 |
| 103 | I3 | 1 |
(i) · 1 mark
What are the degree and cardinality of SALE?
Answer
Answer: Degree 3, cardinality 4.
Three columns, four data rows.
(ii) · 1 mark
Which attribute of SALE is a foreign key?
Answer
Answer: ItemCode, referring to ITEM.ItemCode.
It links each sale to an item in ITEM, whose primary key is ItemCode.
(iii) · 2 marks
Can BillNo alone be the primary key of SALE? If not, suggest one, and say whether a sale row with ItemCode I9 can be inserted.
Answer
Answer: No; (BillNo, ItemCode) is a suitable composite primary key. I9 cannot be inserted because it does not exist in ITEM.
BillNo 101 appears twice, so it is not unique; each item appears at most once per bill, so the pair is unique. Referential integrity blocks I9.
Where the marks are
How a typical answer is split into step marks. Show every step: a right final answer alone rarely earns full marks.
Differentiate between degree and cardinality with an example. [2 marks] (2 marks)
| Step | Marks |
|---|---|
| Degree: number of attributes; STUDENT has degree 5 | 1 |
| Cardinality: number of tuples; STUDENT has cardinality 4 | 1 |
With reference to STUDENT and HOUSE, identify the primary key of each table, one candidate key that is not a primary key (if any), and the foreign key. [3 marks] (3 marks)
| Step | Marks |
|---|---|
| STUDENT: RollNo; HOUSE: HouseID | 1 |
| HOUSE: HName (unique, not NULL) or Captain is an alternate key; STUDENT has none because Phone contains NULL | 1 |
| Foreign key: HouseID in STUDENT referring to HOUSE | 1 |
Explain any four limitations of a file system that a DBMS overcomes. [4 marks] (4 marks)
| Step | Marks |
|---|---|
| Data redundancy with an example | 1 |
| Data inconsistency with an example | 1 |
| Data isolation | 1 |
| Data dependence or controlled sharing | 1 |
A table EMP(EmpID, Name, Aadhaar, Email, DeptID) and DEPT(DeptID, DName). (a) Candidate keys of EMP (b) primary key (c) alternate keys (d) foreign key (e) degree of EMP after adding Salary. [5 marks] (5 marks)
| Step | Marks |
|---|---|
| (a) EmpID, Aadhaar, Email (each unique and not NULL) | 1 |
| (b) EmpID | 1 |
| (c) Aadhaar and Email | 1 |
| (d) DeptID in EMP referring to DEPT | 1 |
| (e) 5 + 1 = 6 | 1 |
Where students lose marks in Database Concepts
The slips examiners see most often, and what to write instead.
Mistake: Counting the header row in cardinality
The header holds attribute names, not data.
Wrong working
STUDENT has 5 rows including the header, so cardinality 5
Right working
STUDENT has 4 tuples, so cardinality 4
Do this: Count only data rows.
Usually costs: 1 mark
Mistake: Choosing a column with NULL or repeated values as the primary key
Primary keys must be unique and not NULL.
Wrong working
Primary key of STUDENT: Phone
Right working
Primary key of STUDENT: RollNo (Phone has a NULL for Joy)
Do this: Scan the column for duplicates and blanks before choosing.
Usually costs: 1 mark
Mistake: Saying a foreign key must be unique
Many child rows can refer to the same parent row (two students in house H1).
Do this: Foreign-key values may repeat; they must match a parent primary key (or be NULL).
Usually costs: 1 mark in an assertion-reason item
Mistake: Calling every unique column the primary key
There is only one primary key; other candidate keys are alternate keys.
Do this: List all candidate keys, choose one as primary, and call the rest alternate keys.
Usually costs: Half to 1 mark
NCERT exercise guide: Database Concepts
What each exercise in the NCERT chapter tests, how to approach it, and a question of the same kind solved step by step. Questions here are written in our own words.
NCERT Chapter 8 exercises: file system vs DBMS
What it tests: Limitations of file processing and the role of a DBMS.
How to approach it: Name each limitation and illustrate it with one school example.
Same kind as the file-system exercise
The library and the accounts office each keep a file of student names and classes. Give two problems and show how a database solves them.
Show the solutionSolution
- Redundancy: names and classes are stored twice.
- Inconsistency: when a student changes section, one file may not be updated.
- A database keeps one STUDENT table; the library and accounts tables store only RollNo as a foreign key.
Answer: Redundancy and inconsistency; solved by one STUDENT table referenced by RollNo.
NCERT Chapter 8 exercises: relational terms and keys
What it tests: Identifying attributes, tuples, degree, cardinality and keys in given tables.
How to approach it: Read every column for uniqueness and NULLs; look for a column shared with another table.
Same kind as the keys exercise
MARKS(RollNo, SubCode, Marks) holds one row per student per subject. RollNo refers to STUDENT and SubCode to SUBJECT. Find the primary key and the foreign keys.
Show the solutionSolution
- RollNo alone repeats (several subjects per student); SubCode alone repeats (several students per subject).
- The pair (RollNo, SubCode) is unique: a composite primary key.
- RollNo and SubCode are also foreign keys to STUDENT and SUBJECT.
Answer: Primary key (RollNo, SubCode); foreign keys RollNo and SubCode.
Practice questions on Database Concepts
Write each answer on paper first. Open the hint only if you are stuck, and the answer only when you have finished.
Q1 · 1 mark · MCQBoard level
The number of attributes in a relation is called its: (a) cardinality (b) degree (c) domain (d) tuple
Hint
Columns.
Answer
(b) degree
Q2 · 1 mark · Very short answerBoard level
Define a candidate key and give an example from a table of your choice.
Hint
Unique, not NULL.
Answer
An attribute or minimal set of attributes that uniquely identifies every tuple and is never NULL, e.g. AdmissionNo or Aadhaar in a STUDENT table.
Q3 · 1 mark · Very short answerHarder board level
A relation R has degree 4 and cardinality 7. A relation S has degree 3 and cardinality 5. (a) What is the total number of attribute values (cells) in R? (b) If two columns are added to S, what is its new degree?
Hint
Cells = rows × columns.
Answer
(a) 4 × 7 = 28 (b) 3 + 2 = 5
Q4 · 1 mark · Assertion-reasonHOTS / competency
Assertion (A): The values of a foreign key column must all be different.
Reason (R): A foreign key refers to the primary key of another table.Hint
Two students can be in the same house.
Answer
(d) A is false but R is true.
Q5 · 2 marks · Short answerHarder board level
TEACHER(TID, Name, Subject, Email) and CLASS(ClassID, Section, ClassTeacherTID). Identify the primary key of each table and the foreign key, and state what rule the foreign key enforces.
Hint
Which column names a teacher?
Answer
TEACHER: TID; CLASS: ClassID. Foreign key: ClassTeacherTID in CLASS referring to TEACHER.TID. It enforces referential integrity: every class teacher must be an existing teacher (or NULL).
Q6 · 2 marks · Short answerHOTS / competency
Why is the order of rows not important in a relation? Give one consequence for queries.
Hint
Sets of tuples.
Answer
A relation is a set of tuples, identified by key values, not by position. So a query cannot rely on 'the third row'; to get rows in an order you must ask for it (ORDER BY in SQL).
Q7 · 2 marks · Short answerBoard level
Give two advantages of a DBMS over a file system with examples.
Hint
Redundancy and sharing.
Answer
Reduced redundancy: a student's details are stored once and referred to by RollNo. Controlled sharing and security: the accounts clerk can be given access to fee data but not to marks.
Q8 · 2 marks · Short answerHOTS / competency
In the canteen tables, a sale row (104, NULL, 2) is inserted. Is it allowed by referential integrity? Is it sensible? Explain.
Hint
Foreign keys may be NULL; but is ItemCode part of the primary key?
Answer
A NULL foreign key is allowed by referential integrity in general, but here ItemCode is part of SALE's composite primary key (BillNo, ItemCode), and a primary key cannot contain NULL, so the row is rejected; it would also be meaningless, as a sale must be of some item.
Q9 · 1 mark · Very short answerBoard level
A relation has the attributes (RegNo, Name, DOB, Mobile, Email). RegNo, Mobile and Email are unique and compulsory. If RegNo is the primary key, list the alternate keys.
Hint
Candidates minus primary.
Answer
Mobile and Email.
Test your recall
Answer in your head or on paper first, then open the card. Pulling an answer out of memory makes it stick far better than re-reading.
1.What is a tuple?Show answer
A row of a relation (one record).
2.What is the degree of a relation?Show answer
The number of attributes (columns).
3.What is the cardinality of a relation?Show answer
The number of tuples (rows).
4.Define domain.Show answer
The set of permissible values for an attribute.
5.What is an alternate key?Show answer
A candidate key that is not chosen as the primary key.
6.Can a primary key have NULL values?Show answer
No; it must be unique and not NULL.
7.What does a foreign key refer to?Show answer
The primary key of another table (or of the same table).
8.Name two limitations of a file system.Show answer
Any two: data redundancy, data inconsistency, data isolation, data dependence, difficulty in controlled sharing.
Best order to study it
- Limitations of a file system and the need for a DBMS.
- Relational terms: relation, attribute, tuple, domain, NULL.
- Degree and cardinality, including after changes.
- Candidate, primary and alternate keys; composite keys.
- Foreign keys and referential integrity with two linked tables.
Quick revision checklist
The night before the exam: can you do each of these without looking?
- Database: organised collection of related data; DBMS: software to manage it (MySQL).
- File-system problems: redundancy, inconsistency, isolation, dependence, hard controlled sharing.
- Relation = table; attribute = column; tuple = row; domain = allowed values.
- Degree = number of columns; cardinality = number of rows.
- Candidate key: unique, not NULL. Primary key: the chosen one. Alternate: the rest.
- Foreign key refers to a primary key in another table; values may repeat; must exist in the parent or be NULL.
- Row order and column order do not matter in a relation; no duplicate tuples.
Database Concepts: frequently asked questions
What is the difference between a candidate key and a primary key?
A candidate key is any attribute (or minimal set) that can uniquely identify each row and is never NULL. The primary key is the one candidate key the designer chooses for this purpose; the others become alternate keys.
Is NCERT Chapter 7 (Understanding Data) in the 2026-27 syllabus?
No. The Database Management unit lists database concepts, the relational data model and keys, SQL, and the Python-SQL interface. Understanding Data is not included.
Can a table have more than one foreign key?
Yes. A MARKS table, for example, can have RollNo referring to STUDENT and SubjectCode referring to SUBJECT.
What does NULL mean in a table?
That the value is unknown or not applicable. It is not zero and not an empty string, and SQL tests it with IS NULL.
How many marks does Database Concepts carry?
No separate figure is given. It is part of Unit 3, Database Management, which carries 20 of the 70 theory marks along with SQL and the Python-SQL interface.
Based on: CBSE Computer Science (083) syllabus 2026-27; NCERT Computer Science, Textbook for Class XII (Reprint 2026-27)