1. Define Database.

A database is a collection of organized data that can be easily accessed, managed, and
updated. It stores information systematically for efficient retrieval and manipulation.
2. What is data independence?
Data independence is the ability to change the database schema at one level without
affecting the schema at the next higher level. It ensures flexibility and reduces
application maintenance.
3. Define data model.
A data model is a conceptual framework that defines the structure, operations, and
constraints for storing and manipulating data in a database.
4. What is a relation?
A relation is a table in a database consisting of rows and columns, where each row
represents a record and each column represents an attribute.
5. What is a primary key?
A primary key is a unique attribute or a set of attributes that uniquely identifies each
record in a relation.
6. What is a foreign key?
A foreign key is an attribute in one table that refers to the primary key in another
table, establishing a link between the two tables.
7. Define normalization.
Normalization is the process of organizing data to minimize redundancy and
dependency by dividing tables and establishing relationships.
8. Define functional dependency.
Functional dependency occurs when one attribute uniquely determines another
attribute within a relation.
9. Define transaction.
A transaction is a sequence of database operations executed as a single logical unit,
ensuring atomicity, consistency, isolation, and durability (ACID).
10. What is a schedule in DBMS?
A schedule is the sequence or order in which database operations (like read/write)
from multiple transactions are executed.
11. Define serializability.
Serializability is the property of a schedule where its outcome is equivalent to some
serial execution of transactions.
12. What is a deadlock?
A deadlock occurs when two or more transactions are waiting indefinitely for
resources locked by each other.
13. What is indexing?
Indexing is a technique to speed up data retrieval by creating data structures that allow
quick search on database tables.
14. Define join operation.
A join operation combines rows from two or more tables based on a related column
between them.
15. What is a view?
A view is a virtual table derived from one or more base tables, representing a subset
of data without storing it physically.
16. Define query.
A query is a request to retrieve or manipulate data from a database.
17. What is DDL?
Data Definition Language (DDL) consists of commands to define and modify
database schema, like CREATE, ALTER, and DROP.
18. What is DML?
Data Manipulation Language (DML) includes commands to insert, update, delete, and
retrieve data from the database.
19. What is an entity?
An entity is a real-world object or concept represented in a database with distinct
existence.
20. What is an attribute?
An attribute is a property or characteristic of an entity.
21. Define weak entity.
A weak entity is an entity that cannot be uniquely identified by its attributes alone and
depends on a related strong entity.
22. What is generalization?
Generalization is the process of extracting common features from two or more entities
to form a generalized entity.
23. Define aggregation.
Aggregation is a concept where a relationship between entities is treated as a higher-
level entity.
24. What is a schema?
A schema is the overall logical structure or design of a database.
25. What is a super key?
A super key is a set of attributes that uniquely identifies a record in a table.
26. Define candidate key.
A candidate key is a minimal super key, meaning no subset of it can uniquely identify
records.
27. What is a composite key?
A composite key is a key consisting of two or more attributes that together uniquely
identify a record.
28. What is an alternate key?
An alternate key is a candidate key that is not chosen as the primary key.
29. Define 1NF.
First Normal Form (1NF) requires that all table attributes have atomic (indivisible)
values and each column contains only one value.
30. Define 2NF.
Second Normal Form (2NF) requires a table to be in 1NF and all non-key attributes to
be fully functionally dependent on the primary key.
31. Define 3NF.
Third Normal Form (3NF) requires a table to be in 2NF and no transitive dependency
between non-key attributes.
32. What is BCNF?
Boyce-Codd Normal Form (BCNF) is a stricter form of 3NF where every determinant
is a candidate key.
33. What is concurrency control?
Concurrency control manages simultaneous transaction execution to maintain
database consistency.
34. Define locking.
Locking is a technique to control access to data by allowing only one transaction to
modify data at a time.
35. What is a checkpoint?
A checkpoint is a point in time where the database system saves all its current state to
help recovery after failures.
36. Define recovery.
Recovery is the process of restoring the database to a correct state after a failure.
37. What is log-based recovery?
Log-based recovery uses a log of all changes to redo or undo transactions during
recovery.
38. Define file organization.
File organization is the way data is stored in files to optimize storage and access.
39. What is hashing?
Hashing is a technique that converts a search key into a hash value to quickly locate
data.
40. Define data dictionary.
A data dictionary is a repository that stores metadata about the database structure and
schema.