Database Management System Set 55

Computer Science Engineering (CSE),

Bachelor of Science in Computer Science FY (BSc CS),

Bachelor of Science in Computer Science SY (BSc CS),

Bachelor of Science in Information Technology SY (BSc IT),

Bachelor of Computer Applications (BCA),

Bachelor of Business Administration in Computer Applications (BBA [CA]),

Bachelor of Science in Information Technology (BSc IT),

Bachelor of Science in Computer Science (BSc CS),

Master of Business Administration (MBA)

Practice Mode Previous Next
On This Page

This set of DataBase Management System (DBMS) Multiple Choice Questions & Answers (MCQs) focuses on Database Management System Set 55

Q1 | Relations produced from an E-R model will always be in
  • First normal form
  • Second normal form
  • Third normal form
  • Fourth normal form
Answer: Third normal form
Q2 | Third normal form is inadequate in situation where the relation
  • Has multiple candidate keys
  • Has candidate keys that are composite
  • Has overlapped candidate keys
  • None of the above
Answer: Has multiple candidate keys
Q3 | If a relation scheme is in BCNF, then it is also in
  • First normal form
  • Second normal form
  • Third normal form
  • Fourth normal form
Answer: Third normal form
Q4 | A primary key when combined with a foreign key create
  • Parent child relationship between the tables that connect them.
  • Network model between the tables that connect them.
  • Many-to-many relationship between the tables that connect them.
  • None of the above.
Answer: Parent child relationship between the tables that connect them.
Q5 | The set of permitted value for each attribute is called its
  • Attribute set
  • Attentive range
  • Domain
  • Group
Answer: Domain
Q6 | The airline reservation system, the enables are date, flight number, place of departure, destination, type of plane & seats available. The primary key is
  • Flight number
  • Flight number + place of departure
  • Flight number+ date
  • Flight number + destination
Answer: Flight number+ date
Q7 | A functional dependency of the form X→Y is trivial if
  • YC= X
  • Y C X
  • X C =Y
  • X C Y and Y C X
Answer: YC= X
Q8 | The concept of locking can be used to solve the problem of
  • Lost update
  • Uncommitted dependency
  • Inconsistent data
  • Deadlock
Answer: Lost update
Q9 | Assume transaction A holds a shared lock R. If transaction B also requests for a sharedlock on R.
  • It will result in a deadlock situation.
  • It will immediately be granted.
  • It will immediately be reject
Answer: It will immediately be granted.
Q10 | A schedule S of n transactions is serializable if it is equivalent to some
  • Serial schedule of the same n transactions.
  • Non-serial schedule of the same n transactions.
  • Serial schedule of different n transactions.
  • Non-serial schedule of different n transactions.
Answer: Serial schedule of the same n transactions.
Q11 | In two-phase locking protocol.
  • All unlocking operations precede the first lock operation.
  • All locking operations precede the first unlock operation.
  • Locking and unlocking takes place simultaneously.
  • None of the above.
Answer: All locking operations precede the first unlock operation.
Q12 | Transaction timestamp is:
  • Not unique for each transaction
  • Larger for older transaction
  • Unique identifier assigned to each transaction.
  • None of the above.
Answer: Unique identifier assigned to each transaction.
Q13 | The granularity of a database item can be chosen to be
  • A whole file
  • A database record
  • The whole database
  • All of the above.
Answer: All of the above.
Q14 | If the complete execution of the transaction(s) takes the database from one consistentstate to the other then that property of transaction is called:
  • Isolation
  • Durability
  • Consistency preservation
  • None of the above
Answer: Consistency preservation
Q15 | Which of the following is not the state that the transaction undergoes?
  • Failed
  • Active
  • Partially committed
  • Non active
Answer: Non active
Q16 | Timestamp can be generated by:
  • Counter
  • Current date/time
  • None of the above
  • Both (a) and (b)
Answer: Both (a) and (b)
Q17 | Which of the following is the formal process for deciding which attributes should begrouped together in a relation?
  • Normalization
  • Performance Tuning
  • Optimization
  • None of the above
Answer: Normalization
Q18 | Who developed normalization process?
  • C.J. Date
  • E.F. Codd
  • Donald Chamberlain
  • Collin White
Answer: E.F. Codd
Q19 | Who developed the BCNF?
  • Boyd and Cromwell
  • Date and Codd
  • Date and White
  • Boyce and Codd
Answer: Boyce and Codd
Q20 | What is the expansion of BCNF?
  • Boyd-Cromwell Normal Form
  • Boyce-Codd Normal Form
  • Boyd-Codd Normal Form
  • All of the above
Answer: Boyce-Codd Normal Form
Q21 | Which of the following is the result of a transitive dependency?
  • Insertion anomaly
  • Modification anomaly
  • Deletion anomaly
  • All of the above
Answer: All of the above
Q22 | Which of the following is true?
  • Normalized data is the best representation of data.
  • Data stored non-redundantly will be accessed faster than data stored many times.
  • Normalized tables are the best way to store data.
  • All of the above
Answer: All of the above
Q23 | How many inference rules are there for functional dependencies?
  • 4
  • 5In t
  • 6
  • 7
Answer: 6
Q24 | Which property ensures that each functional dependency is represented in some individual relations resulting after decomposition?
  • Dependency preservation property
  • Fully Functional dependency
  • Lossless Join
  • None of the above
Answer: Dependency preservation property
Q25 | Every relation in BCNF is also in
  • 3NF
  • 2NF
  • 1NF
  • None of the above
Answer: 3NF
Previous Next