Database Management Systems MCQs (Set-3)

What is a functional dependency?

A A table references itself
B Attribute values determine other values
C A query filters rows
D Duplicate row storage

What does first normal form require?

A No foreign keys
B No composite candidate keys
C Atomic attribute values
D Every table has one row

What does second normal form remove?

A Partial dependency on candidate key
B Every transitive dependency
C All foreign keys
D Every multivalued dependency

What does third normal form address?

A Transitive dependency on key
B Duplicate indexes
C Null values everywhere
D Nonunique table names

What is the BCNF condition?

A Every table has one attribute
B No candidate keys
C All columns are nullable
D Every determinant is a superkey

Which anomaly can normalization reduce?

A Update anomaly
B Network collision
C Compiler warning
D Disk partition error

What is an insertion anomaly?

A Duplicate query column name
B Reads another value
C Cannot add fact alone
D A row is sorted incorrectly

What is a lossless decomposition?

A Each table has primary key
B No tables share attributes
C Join restores original relation exactly
D All dependencies disappear

What does dependency preservation mean?

A Every query uses an index
B Constraints enforceable without joining tables
C All columns are primary keys
D Rows remain sorted

What does fourth normal form address?

A Every primary key
B All join conditions
C Physical data layout
D Nontrivial multivalued dependencies

What is denormalization?

A Add redundancy for access performance
B Remove every duplicate value
C Convert rows to objects
D Encrypt a database

What is a transaction?

A One database column
B A permanent lock
C A query plan node
D Logical unit of database work

What does atomicity mean in ACID?

A Results survive every failure
B Concurrent work is isolated
C All or nothing execution
D Constraints always stay true

What does consistency mean in ACID?

A Run without locks
B Preserve database rules
C Use a sorted index
D Always finish immediately

What does isolation mean in ACID?

A Concurrent transactions avoid interference
B Committed data survives restart
C Transaction has one query
D All rows become private

What does durability mean in ACID?

A Queries never block
B No transaction can abort
C Committed changes survive failures
D Every read is repeatable

What is a dirty read?

A Read of uncommitted transaction data
B Read of an old schema
C Read from a sorted index
D Read after checkpoint

What is a nonrepeatable read?

A Duplicate result row
B Primary key disappears
C A query uses two indexes
D Row changes between reads

What is a phantom read?

A Same row value changes
B A table disappears after commit
C New matches appear on requery
D An index returns no matches

What is a serial schedule?

A Transactions run one after another
B Transactions share every write
C Queries run in parallel only
D A transaction has no reads

What does serializability guarantee?

A Every transaction finishes instantly
B No transaction can abort
C All queries use locks
D Equivalent to serial order

What does a shared lock usually permit?

A Concurrent writes
B Concurrent reads
C No other access
D Table deletion

What does an exclusive lock usually permit?

A Unlimited concurrent writes
B One writer access
C Only index reads
D No transaction access

What is a deadlock?

A A query returns zero rows
B Transactions wait cyclically for locks
C A database has no index
D Two keys have same value

What is timestamp ordering used for?

A Sort table output
B Generate unique file names
C Compress transaction logs
D Order conflicting transaction operations