0

RDBMS (UGC/NET)

Description: DBMS
Number of Questions: 15
Created by:
Tags: DBMS Data Base Management Systems
Attempted 0/15 Correct 0 Score 0

The ____________ data model in DBMS makes use of a set of tables to show data as well as the relationship between the data.

  1. hierarchical

  2. relational

  3. network

  4. distributed

  5. IMS


Correct Option: B
Explanation:

This data model in DBMS makes use of a set of tables to show data as well as the relationship between the data.

Which of the following techniques is used for denormalisation in which the records are summarised in some summary columns and the number of records stored in a table is reduced?

  1. Vertical fragmentation

  2. Horizontal partitioning

  3. Summary data

  4. Duplicate data

  5. Functional dependency


Correct Option: C
Explanation:

This is the technique used for denormalisation in which the records are summarised in some summary columns. It reduces the number of records stored in a table.

Which of the following transparencies in distributed DBMS permits a transaction to be executed either completely or not at all?

  1. Distribution

  2. Transaction

  3. Failure

  4. Heterogeneity

  5. Homogeneity


Correct Option: B
Explanation:

This type of transparency in distributed DBMS permits a transaction to be executed either completely or not at all.

Which of the following models is a specialised adaption of the relational model used to represent data in a data warehouse in a way that data can be easily summarised using OLAP queries?

  1. Object database

  2. Dimensional

  3. Post-relational database

  4. Network data

  5. Hierarchical data


Correct Option: B
Explanation:

This model is a specialised adaption of the relational model. It is used to represent data in a data warehouse in a way that data can be easily summarised using OLAP queries.

Which of the following operations on database can be acquired by dividing a table into a number of sub-tables having disjointed columns?

  1. Mixed fragmentation

  2. Horizontal fragmentation

  3. Vertical fragmentation

  4. Data processor

  5. Distributed data storage


Correct Option: C
Explanation:

This type of operation on database can be acquired by dividing a table into a number of sub-tables having disjointed columns.

_____________ is a condition in a relation where an attribute is functionally dependent on another non-key attribute.

  1. Denormalisation

  2. Normalisation

  3. Schema

  4. Transitive dependency

  5. BCNF


Correct Option: D
Explanation:

This is a condition in a relation where an attribute is functionally dependent on another non-key attribute.

Which of the following languages is a standard relational database language used for creation, deletion and modification of database tables?

  1. DML

  2. DDL

  3. SQL

  4. QBE

  5. ISBL


Correct Option: C
Explanation:

This language is a standard relational database language used for creation, deletion and modification of database tables.

______________ rule followed by database software states that two simultaneous transactions cannot interfere with one another and intermediate results within a transaction are not visible to other transactions.

  1. Atomicity

  2. Consistency

  3. Isolation

  4. Durability

  5. Reliability


Correct Option: C
Explanation:

In computer science, ACID (Atomicity Consistency Isolation Durability) is a set of properties of database transactions. Isolation states that two simultaneous transactions cannot interfere with each other and intermediate results within a transaction are not visible to other transactions.

In which of the following do two or more replicas sync with each other via a transaction identifier?

  1. Multimaster

  2. Master/Slave replication

  3. Quorum

  4. Primary key

  5. Foreign key


Correct Option: A
Explanation:

This is the replication type in which two or more replicas sync each other via a transaction identifier.

Which of the following is a markup language that defines a set of rules for encoding documents in a format that is both human readable and machine readable?

  1. DDL

  2. HTML

  3. DML

  4. XML

  5. C


Correct Option: D
Explanation:

This is a markup language that defines a set of rules for encoding documents in a format that is both human readable and machine readable.

In which of the following transaction control commands in SQL is every change performed since the preceding COMMIT statement rejected?

  1. SELECT

  2. UPDATE

  3. ROLLBACK

  4. COMMIT

  5. DROP


Correct Option: C
Explanation:

In this type of transaction control command in SQL, every change performed since the preceding COMMIT statement is rejected.

In which of the following locks in DBMS is only one user permitted to update a specific part of data?

  1. Shared locks

  2. Update locks

  3. Exclusive locks

  4. Upgrading locks

  5. Increment locks


Correct Option: C
Explanation:

In these locks in DBMS, only one user is permitted to update a specific part of data.

______________ normal form in database system states that the left hand side of every non-trivial function or multi-valued dependency is a super key.

  1. 1 NF

  2. 2 NF

  3. 3 NF

  4. BCNF

  5. 4 NF


Correct Option: E
Explanation:

This normal form in database system states that the left hand side of every non-trivial function or multi-valued dependency is a super key.

In which of the following classes in parallel machines does every processor have its own memory not accessible directly from other processors?

  1. Shared memory

  2. Shared disk

  3. Shared nothing

  4. Cache memory

  5. Shared everything


Correct Option: B
Explanation:

In this type of class in parallel machines, every processor has its own memory which is not accessible directly from other processors.

__________ is an operation in which data from the operand relations is read into main memory and processed data is read again from the disk to complete the operation.

  1. Table scan

  2. Two-pass algorithm

  3. Data redundancy

  4. Shared disk

  5. NUMA


Correct Option: B
Explanation:

This is the operation in graph theory in which the data from the operand relations is read into main memory and processed data is read again from the disk to complete the operation.

- Hide questions