DBMS Basics — Set 1

Correct Answer: A. Database Management System

• **Database Management System (DBMS)** = software that provides a systematic interface to create, store, retrieve, update, and delete data in a database. It acts as a middleman between end-users or applications and the underlying data storage, removing the need to manage raw files directly. • **Core functions** — a DBMS handles concurrent access by multiple users, enforces security, and maintains data integrity through built-in constraints and transaction management. • Popular DBMS software includes MySQL, Oracle, Microsoft SQL Server, and PostgreSQL, all widely used in government and banking sectors. • 💡 Option B (Data Business Management System) is wrong because no such standard term exists; Option C (Digital Base Management System) is wrong because 'digital base' has no recognised computing meaning; Option D (Direct Backup Management System) is wrong because DBMS has nothing to do with backup labelling.

Correct Answer: D. Database

• **Database** = a collection of related data with an implicit meaning, organised so it can be accessed, managed, and updated efficiently. It is distinct from random or unstructured data because the relationships between items are intentional and predefined. • **Implicit meaning** — even without additional labels, the structure of a database (tables, rows, columns) carries inherent context, making the data interpretable by both humans and applications. • A database can range from a simple spreadsheet to a massive distributed system holding billions of records for railway or banking systems. • 💡 Option A (Software) is wrong because software is a program, not a data collection; Option B (Operating System) is wrong because it manages hardware resources, not data records; Option C (Hardware) is wrong because hardware refers to the physical components of a computer.

Correct Answer: A. Tuple

• **Tuple** = a single horizontal row in a relational table representing one complete, unique record — for example, all details of one employee in an Employee table. Each tuple holds one value for every attribute (column) defined in that relation. • **Formal terminology** — in relational theory derived from E.F. Codd's work, rows are called tuples and tables are called relations; 'row' and 'column' are the informal SQL equivalents used in everyday practice. • A table with 500 employees contains exactly 500 tuples; adding a new employee means inserting a new tuple. • 💡 Option B (Field) is wrong because a field is an individual data cell within a row, not the row itself; Option C (Attribute) is wrong because an attribute corresponds to a column, not a row; Option D (Column) is wrong because a column is a vertical data category shared across all rows.

Correct Answer: D. Consistency

• **Consistency** = the ACID property that guarantees every transaction moves the database from one valid state to another, respecting all predefined rules such as data types, foreign-key constraints, and business logic. Any transaction that would violate a rule is aborted entirely. • **Consistency vs. other ACID properties** — Atomicity ensures all-or-nothing execution, Isolation prevents inter-transaction interference, and Durability persists committed data; only Consistency specifically enforces correctness of data at every state transition. • Example: if a bank rule says a balance cannot go below zero, Consistency ensures no transfer can leave an account with a negative balance. • 💡 Option A (Durability) is wrong because Durability ensures committed changes survive crashes, not that rules are enforced; Option B (Isolation) is wrong because Isolation deals with concurrent transaction visibility; Option C (Atomicity) is wrong because Atomicity ensures complete execution, not constraint satisfaction.

Correct Answer: A. To uniquely identify each record in a table

• **Primary Key** = a column or combination of columns that uniquely identifies every row in a table. Because no two rows can share the same primary key value and the key can never be NULL, every record can be located without ambiguity. • **Enforcement** — the DBMS automatically rejects any INSERT or UPDATE that would create a duplicate or NULL primary key value, making it the strongest form of row-level uniqueness constraint in a relational table. • In practice, primary keys are often auto-incremented integers (employee_id = 1, 2, 3…) so the system generates them without manual input. • 💡 Option B (To store encrypted passwords) is wrong because password storage is handled by application logic, not primary keys; Option C (To link two different databases) is wrong because cross-table linking is the role of foreign keys; Option D (To allow duplicate values) is wrong because the primary key's entire purpose is to prohibit duplicates.

Correct Answer: D. Physical Level

• **Physical Level** = the lowest tier of the three-tier database abstraction model, describing exactly how data is stored on disk — including file formats, block sizes, index structures, and storage allocation. Database administrators and storage engineers work at this level. • **Why hidden from users** — exposing physical storage details would force application developers to rewrite code every time storage media or file formats change; abstraction shields them from such volatility. • Above the physical level sit the Logical (Conceptual) Level — what data is stored and how it relates — and the View Level — user-specific subsets of data presented through virtual tables. • 💡 Option A (Logical Level) is wrong because it describes the overall structure and relationships of the whole database, not storage mechanics; Option B (View Level) is wrong because it shows customised data subsets to specific users; Option C (Conceptual Level) is wrong because it is another name for the logical level, dealing with data relationships rather than physical storage.

Correct Answer: A. A column

• **Attribute** = a named property or characteristic of an entity, represented as a column in a relational table. In a Student table, for instance, Name, Age, and Roll_Number are each attributes that describe a property of the Student entity. • **Domain of an attribute** — every attribute has a domain, which is the set of permissible values it can hold (e.g., Age must be a positive integer; a Status column might only allow 'Active' or 'Inactive'). • Choosing the right attributes during schema design is critical: well-chosen attributes capture all necessary information without introducing redundant or overlapping data. • 💡 Option B (A table) is wrong because a table is called a relation and contains multiple attributes; Option C (A row) is wrong because a row is a tuple representing one complete record; Option D (A query) is wrong because a query is a command used to retrieve or manipulate data, not a structural component of the schema.

Correct Answer: D. SQL

• **SQL (Structured Query Language)** = the standardised language used to interact with Relational Database Management Systems. It covers data querying (SELECT), manipulation (INSERT/UPDATE/DELETE), definition (CREATE/ALTER/DROP), and access control (GRANT/REVOKE) in one unified language. • **Why SQL dominates** — SQL has been an ISO/ANSI standard since 1986, and virtually every major RDBMS — MySQL, PostgreSQL, Oracle, Microsoft SQL Server — implements it, making SQL skills universally transferable across different database systems. • SQL is declarative: you specify what data you want, and the query optimiser decides how to retrieve it most efficiently without needing explicit step-by-step instructions. • 💡 Option A (HTML) is wrong because HTML is a markup language for structuring web pages, not a database language; Option B (Java) is wrong because Java is a general-purpose programming language that can connect to databases via JDBC but is not itself a database language; Option C (Python) is wrong because Python uses database driver libraries to interact with RDBMS but is not the standard database query language.

Correct Answer: A. Atomicity

• **Atomicity** = the ACID property that treats an entire transaction as a single, indivisible unit. If every operation within the transaction succeeds, all changes are committed together; if even one operation fails, every change made so far is rolled back, leaving the database exactly as it was before. • **Practical importance** — in a bank transfer, deducting money from one account and crediting another are two separate operations. Atomicity ensures both happen together or neither happens, preventing money from vanishing mid-transaction. • The database engine uses an undo log to reverse partial changes whenever a transaction is rolled back, restoring the prior consistent state. • 💡 Option B (Accuracy) is wrong because accuracy is not a formal ACID term; Option C (Availability) is wrong because availability belongs to the CAP theorem of distributed systems, not ACID properties; Option D (Aggregation) is wrong because aggregation refers to combining data with functions like SUM or COUNT, unrelated to transaction behaviour.

Correct Answer: C. Foreign Key

• **Foreign Key** = a column in one table that references the Primary Key of another table, establishing a parent-child relationship between the two. The DBMS enforces referential integrity through this link, ensuring no orphan records can exist in the child table. • **Referential integrity in action** — if an Orders table has a foreign key pointing to the Customers table, you cannot insert an order for a non-existent customer, and you cannot delete a customer who still has existing orders unless cascading rules are configured. • Foreign keys are the backbone of normalisation: they allow related information to be split across tables while preserving the logical connection between records. • 💡 Option A (Unique Key) is wrong because a unique key enforces distinct values within a single table and does not link tables together; Option B (Super Key) is wrong because a super key is any attribute set that can uniquely identify rows within one table, not a cross-table connector; Option D (Candidate Key) is wrong because a candidate key is a minimal super key eligible to become the primary key, not a relationship mechanism.