Database
MCQ questions and answers
- 4.5/5.0
- 1k Enrolled
- All levels
- Last updated 11/2023
- English
Database MCQ (51)
| 1. | _______ is a collection of interrelated data and a set of programs? |
| A | DBMS |
| B | Data structure |
| C | Class |
| D | Database |
| Answer: A | |
| 2. | Data redundancy is increase the cost of storage space and complexity of databases which is further lead to the ____________. |
| A | data isolation |
| B | data inconsistency |
| C | intergritity problem |
| D | atomicity |
| Answer: B | |
| 3. | ______is a lowest level of abstraction which describe the how data is stored? |
| A | Physical |
| B | Logical |
| C | View |
| D | Hardware. |
| Answer: A | |
| 4. | ______ is a highest level of an abstraction which is use to describe only the part of an entire database? |
| A | User |
| B | Physical |
| C | View |
| D | Logical |
| Answer: C | |
| 5. | Which type of abstration is used to define the data storage architecture along with relationship? |
| A | Physical |
| B | View |
| C | Logical |
| D | None |
| Answer: C | |
| 6. | The implementation of the simple structure of logical level may involve the complex physical level structure of data, whereas the user of the logical level does not need to be aware of this complexity which is known as ____________. |
| A | Logical data independence. |
| B | Physical data independence. |
| C | View level independence. |
| D | None of the above |
| Answer: B | |
| 7. | Physical schema describe the database design at the ____________ level. |
| A | logical |
| B | physical |
| C | view |
| D | hardware |
| Answer: B | |
| 8. | A database may also have several schema at the view level, its called as____________. |
| A | view schema |
| B | logical schema |
| C | sub schema |
| D | physical schema |
| Answer: C | |
| 9. | ______ model is used as a collection of tables which represent the data and relationship? |
| A | E-R model |
| B | Relational |
| C | Semistructured |
| D | Object based |
| Answer: B | |
| 10. | Table is also known as ____________. |
| A | attribute |
| B | tuple |
| C | view |
| D | relation |
| Answer: D | |
| 11. | ____________ is used as a world wide for represention of the semi-structured data. |
| A | XST |
| B | XML |
| C | WDXL |
| D | PL/SQL |
| Answer: B | |
| 12. | Which data model permits the specification of data whereas the individual data item of the same type may have a different sets of attributes? |
| A | E-R model |
| B | Semistructured |
| C | Object based |
| D | Relational |
| Answer: B | |
| 13. | ______ language is used to access or manipulate the data which is organized by the appropriate data model? |
| A | DML |
| B | DCL |
| C | DDL |
| D | none |
| Answer: A | |
| 14. | ____________ subsystem compile and execute the DDL and DML statements. |
| A | compiler |
| B | interpretter |
| C | query processor |
| D | query |
| Answer: C | |
| 15. | A person who has such central control over the system is called as ____________. |
| A | Application programmer |
| B | Database Administrator |
| C | Sophisticated user |
| D | Specialized user |
| Answer: B | |
| 16. | ____________uses the database query language or tools for the data analysis. |
| A | Sophisticated user |
| B | Novice user |
| C | Specialized user |
| D | DBA |
| Answer: A | |
| 17. | ____________ key is a set of one or more in the table and it allows us to identify the unique tuple in the table. |
| A | Candidate key |
| B | Foreign key |
| C | Super key |
| D | Surrogate key |
| Answer: C | |
| 18. | UML stands for |
| A | Unified Modeling Language. |
| B | Unified Modern Language. |
| C | Unique Model Library. |
| D | Universal Modeling Language. |
| Answer: A | |
| 19. | ____________ reduce the data redundancy and anomaly in the database. |
| A | Defragmentation |
| B | Normalization |
| C | Denormalization |
| D | Aggregation |
| Answer: B | |
| 20. | MTTF stands for |
| A | Mean Time Transaction Failure. |
| B | Mean Transaction Time Failure. |
| C | Mean Time To Failure. |
| D | Minimum Time Transaction Failure. |
| Answer: C | |
| 21. | Which RAID level is known as organization of memory style error correcting code(ECC)? |
| A | Zero |
| B | One |
| C | Three |
| D | Two |
| Answer: D | |
| 22. | A ____________ File is designed for the efficient processing of the records in a sorted order using search key. |
| A | sequential |
| B | clustering |
| C | heap |
| D | hash |
| Answer: A | |
| 23. | In which file organization the records of relationships are stored in the same file? |
| A | Sequential file organization |
| B | Hashing file organization |
| C | Multi-table clustering file organization |
| D | Heap file organization |
| Answer: C | |
| 24. | In which file organization the records are the randomly stored? |
| A | Cluster |
| B | Hashing |
| C | Sequential |
| D | Heap |
| Answer: D | |
| 25. | Relational schema and other metadata are stored in the structure known as____________. |
| A | Data dictionary |
| B | System catalog |
| C | Both A and B |
| D | Schema file |
| Answer: C | |
| 26. | ____________ is an index whose search key is also defined in a sequential order of the file. |
| A | Stack index |
| B | Clustering index |
| C | Hash index |
| D | Dense |
| Answer: B | |
| 27. | Clustering index is also called as ____________. |
| A | secondary index |
| B | primary index |
| C | hash index |
| D | sparse |
| Answer: B | |
| 28. | _____ index contains the search key and pointer of first data record? |
| A | Sparse |
| B | Cluster |
| C | Dense |
| D | Primary |
| Answer: C | |
| 29. | In which index, the entity appear for some of the search key values. |
| A | sparse |
| B | dense |
| C | primary |
| D | none |
| Answer: A | |
| 30. | In ____________the set of bucket addresses is fixed. |
| A | Closed hashing |
| B | Static hashing |
| C | Dynamic hashing |
| D | Bitmap hashing |
| Answer: B | |
| 31. | ____________ changes in database size by splitting and merging the buckets when the database size grows or shrink. |
| A | Closed hashing |
| B | Complete hashing |
| C | Extended hashing |
| D | Static hashing |
| Answer: C | |
| 32. | A relational algebra, the operation annotated with an instructions of the evaluation is called ____________. |
| A | evaluation primitive |
| B | query execution plan |
| C | query evaluation plan |
| D | query processing |
| Answer: A | |
| 33. | A sequence of a primitive operation that can be used to evaluate the query is known as ____________. |
| A | query execution plan |
| B | query evaluation plan |
| C | both A and B |
| D | evaluation primitive |
| Answer: C | |
| 34. | Which is refers to the collection of operations that forms a single logical unit of work? |
| A | Transaction |
| B | Query |
| C | Subroutine |
| D | None |
| Answer: A | |
| 35. | Which property of transaction is known as “all-or-none”? |
| A | Isolation |
| B | Durability |
| C | Atomicity |
| D | ACID |
| Answer: C | |
| 36. | Once a transaction is successfully executed and its effect must be persisted in the database, this type of property is known as ____________. |
| A | Durability |
| B | Consistency |
| C | Atomicity |
| D | Isolation |
| Answer: A | |
| 37. | Database system must provide a mechanism to isolate the transactions from the effect of other concurrent execution is known as ____________. |
| A | consistency |
| B | isolation |
| C | ACID |
| D | durability |
| Answer: B | |
| 38. | Execution of a transaction in an isolation which preserve ____________ of the database. |
| A | consistency |
| B | isolation |
| C | durability |
| D | atomicity |
| Answer: A | |
| 39. | Which lock is used by the transaction manager during the read operation? |
| A | Shared lock |
| B | Exclusive lock |
| C | Spin lock |
| D | None |
| Answer: A | |
| 40. | Which lock is used by the transaction manager during the write operation? |
| A | Shared lock |
| B | Write lock |
| C | Exclusive lock |
| D | Spin lock |
| Answer: C | |
| 41. | Which protocol is used to ensure serializability? |
| A | One phase |
| B | Two Phase |
| C | Snapshot |
| D | Coalescence |
| Answer: B | |
| 42. | A transaction may obtain the lock but may not release any lock is known as ____________. |
| A | Shrinking phase |
| B | Growing phase |
| C | Strict two phase |
| D | Rigorous |
| Answer: B | |
| 43. | A transaction may release a locks but may not obtain any new lock such phase is called as____________. |
| A | Shrinking phase |
| B | Partially committed phase |
| C | Two phase |
| D | Growing phase |
| Answer: A | |
| 44. | If transaction never completes its designated task, thus there is ____________. |
| A | Starvation |
| B | Lock |
| C | Granularity |
| D | Wound wait |
| Answer: A | |
| 45. | The multiple granularity locking protocol uses a lock mode to ensure ____________. |
| A | concurrency |
| B | serializability |
| C | deadlock |
| D | consistency |
| Answer: B | |
| 46. | Which protocol ensure that any conflicting read and write operations are executed in time-stamp order? |
| A | Two phase |
| B | Snapshot |
| C | Shared lock |
| D | Time stamp ordering |
| Answer: D | |
| 47. | _______ is a multi-version concurrency control protocol which is based on validation? |
| A | Two phase |
| B | Tree protocol |
| C | Snapshot isolation |
| D | Time-stamp ordering |
| Answer: C | |
| 48. | Which table contains a list of pages that are used to update in the database buffer? |
| A | Lookup table |
| B | Inode table |
| C | Dirty page table |
| D | Log record |
| Answer: C | |
| 49. | The read-only log records generated during the transaction rollback is called ____________. |
| A | Check point log record |
| B | Lookup table |
| C | Log sequence number |
| D | Compensation Log Records(CLR) |
| Answer: D | |
| 50. | Writing a buffered log to the disk is something reflected to as a ____________. |
| A | write ahead logging |
| B | log force |
| C | no force |
| D | undo phase |
| Answer: B | |
| 51. | In which phase system reply updated to all transactions by scanning the log from the checkpoint? |
| A | Redo phase |
| B | Undo phase |
| C | Partial committed |
| D | None |
| Answer: A |
Video Lectures of C Language
