0

Relational DBMS

Description: RDBMS
Number of Questions: 15
Created by:
Tags: RDBMS Database
Attempted 0/15 Correct 0 Score 0

Which of the following forms of SQL is designed for use within general purpose programming languages such as PL/I, COBOL, Pascal and C?

  1. Data definition language

  2. Data manipulation language

  3. Transactional control

  4. Embedded DML

  5. View definition


Correct Option: D
Explanation:

This form of SQL is designed for use within general purpose programming languages such as PL/I, COBOL, Pascal and C.

Which of the following entity constraints in DBMS requires that an entity belongs to no more than one lower level entity set?

  1. Overlapping

  2. Disjoint

  3. Key constraint

  4. Not null constraint

  5. Condition defined


Correct Option: B
Explanation:

This type of entity constraint in DBMS requires that an entity belongs to no more than one lower level entity set.

Which of the following is a procedural query language that consists of a set of operations that takes one or two relations as input and produces a new relation as their result?

  1. Query language

  2. Relational algebra

  3. Tuple relational calculus

  4. DML precompiler

  5. DBA


Correct Option: B
Explanation:

This is a procedural query language that consists of a set of operations that takes one or two relations as input and produces a new relation as their result.

The file organisation in DBMS in which any record can be placed anywhere in the file where there is space for the record is called _________ file organisation.

  1. sequential

  2. heap

  3. index

  4. clustering

  5. direct


Correct Option: B
Explanation:

This type of file organisation in DBMS is the one in which any record can be placed anywhere in the file where there is space for the record.

Which of the following is a binary operation that allows us to combine certain selections and a cartesian product into one operation?

  1. Cartesian product

  2. Set difference

  3. Project

  4. Natural join

  5. Union


Correct Option: D
Explanation:

This operation allows us to combine certain selections and a cartesian product into one operation.

In _____________ mode/phase, the transaction only wants to read the data item.

  1. exclusive

  2. shared

  3. growing

  4. shrinking

  5. deadlock


Correct Option: B
Explanation:

In this mode, the transaction only wants to read the data item.

Which of the following properties of transaction in distributed database guarantees that when the transaction is committed, the results of operations will never be lost, independent of subsequent failures?

  1. Atomicity

  2. Commit

  3. Isolation

  4. Durability

  5. Serialisability


Correct Option: D
Explanation:

This property of transaction in distributed database guarantees that when the transaction is committed, the results of operations will never be lost, independent of subsequent failures.

Which of the following terms in database refers to the number of tuples or records that it contains in a relation?

  1. Attribute

  2. Cardinality

  3. Degree

  4. Relation

  5. Tuple


Correct Option: B
Explanation:

The number of tuples or records contained in a relation is called cardinality.

In a database relation, when one or more fields serve as primary key, then such a key is called

  1. alternate key

  2. foreign key

  3. composite key

  4. secondary key

  5. attribute key


Correct Option: C
Explanation:

In a database relation, when one or more fields serve as primary key, then such a key is called composite key.

Which of the following operations in relation algebra requires two relations having the same number of attributes?

  1. Cartesian product

  2. Intersection

  3. Union

  4. Set difference

  5. Select


Correct Option: C
Explanation:

This operation requires two relations having the same number of attributes.

In which of the following data models in DBMS, the relationship between records is represented by a relation that contains a key for each record involved in the relationship?

  1. Hierarchical data model

  2. Relational data model

  3. Network data model

  4. Relational algebra

  5. Project


Correct Option: B
Explanation:

The relationship between records is represented by a relation that contains a key for each record involved in the relationship.

Which of the following objects in SQL is a predicate expressing a condition that we wish the database always to satisfy?

  1. Triggers

  2. Cursor

  3. Assertion

  4. Alerts

  5. Primary key


Correct Option: C
Explanation:

This object in SQL is a predicate expressing a condition that we wish the database always to satisfy.

Which of the following languages includes a query language based on both the relational algebra and the tuple relational calculus?

  1. Embedded DML

  2. DDL

  3. DML

  4. TCL

  5. Assembly language


Correct Option: C
Explanation:

This language includes a query language based on both the relational algebra and the tuple relational calculus.

______ is the time taken to find a particular data item or a set of items using the technique in a database query.

  1. Insertion time

  2. Deletion time

  3. Access time

  4. Space overhead

  5. Access types


Correct Option: C
Explanation:

This is the time taken to find a particular data item or a set of items using the technique in a database query.

Which of the following structures in oracle database consists of datafiles, redo log files and control files?

  1. Database blocks

  2. Schema

  3. Physical structure

  4. Extent

  5. Segment


Correct Option: C
Explanation:

The physical structure in oracle database consists of datafiles, redo log files and control files.

- Hide questions