DBI FE RETAKE

What data structure will be represented for the hierarchical data model?

• A. Array structure

• B. Table structure

• C. Tree structure

• D. Pointers structure

According to the technology deployed by the database management system, which of the following is correct?

• A. Locks are used to maintain transactional integrity and consistency.

• B. Cursors are used to maintain transactional integrity and consistency.

• C. Procedures are used to maintain transactional integrity and consistency.

• D. Functions are used to maintain transactional integrity and consistency.

What is the full form of DBMS?

• A. Data of Binary Management System

• B. Database Management System

• C. Database Management Service

• D. Data Backup Management System

Which of the following is the appropriate characteristic of a database?

• A. Because a database is created to suit the format of the data, it cannot respond flexibly to data format changes.

• B. The procedure for making backups is complicated.

• C. It is difficult to share data between operations due to an exclusive control function.

• D. It can be accessed by multiple users at the same time due to an exclusive control function.

What is a database?

• A. Organized collection of information that cannot be accessed, updated, and managed

• B. Collection of data or information without organizing

• C. Organized collection of data or information that can be accessed, updated, and managed

• D. Organized collection of data that cannot be updated

The ACID Properties of transactions refer to

• A. Atomicity, consistency, isolation, database

• B. Atomicity, consistency, isolation, durability

• C. Atomicity, consistency, inconsistent, durability

• D. Atomicity, concurrency, isolation, durability

What does an RDBMS consist of?

• A. Collection of Tables

• B. Collection of Records

• C. Collection of Keys

• D. Collection of Fields

Select the most correct answer

• A. An index is not a data structure used to speed access to tuples of a relation, given values of one or more attributes.

• B. The key to index cannot be any attribute or set of attributes, and need not be the key to the relation.

• C. We can think of the index as a binary search tree of (key, locations) pairs in which a key a is not
  associated with a set of locations of the tulips

• associated with a set of locations of the tulips.
  D. An index is a data structure used to speed access to tuples of a relation, given values of one or more attributes.

If there is more than one key for relation schema in DBMS then each key relation schema is classified as

• A. Prime key

• B. Super key

• C. Candidate key

• D. Primary key

To modify the schema of an existing relation use

• A. Create table

• B. Modify table

• C. Alter table

• D. Drop table