Home
Current Affairs January 2024

What is the correct answer?

4

Cascading rollback is avoided in all protocol except

A. strict two-phase locking protocol.

B. tree locking protocol

C. two-phase locking protocol

D. validation based protocol.

Correct Answer :

D. validation based protocol.


Related Questions

What is the correct answer?

4

Relationships among relationships can be represented in an-E-R model using

A. Aggregation

B. Association

C. Weak entity sets

D. Weak relationship sets

What is the correct answer?

4

Which one is true statement :

A. With finer degree of granularity of locking a high degree of concurrency is possible.

B. Locking prevents non-serializable schedules.

C. Locking cannot take place at field level.

D. An exclusive lock on data item X is granted even if a shared lock is already held on X.

What is the correct answer?

4

A relation is in attribute of other composite key. if an attribute of a composite key is dependent on an

A. 2NF

B. 3NF

C. BCNF

D. 1NF

What is the correct answer?

4

Which of the following is not a logical database structure?

A. Chain

B. Network

C. Tree

D. Relational

What is the correct answer?

4

Processed data is called _____

A. Raw data

B. Source

C. Information

D. Useful data

What is the correct answer?

4

Dependency preservation is not guaranteed in

A. BCNF

B. 3NF

C. PJNF

D. DKNF

What is the correct answer?

4

As per equivalence rules for query transformation, selection operation distributes over

A. Union.

B. Set difference.

C. Intersection.

D. All of the above.

What is the correct answer?

4

What will be the number of columns and rows respectively obtained for the operation, A- B, if A B are Base union compatible and all the rows of a are common to B? Assume A has 4 columns and 10 rows; and B has 4 columns and 15 rows

A. 4,0

B. 0,0

C. 4,5

D. 8,5

What is the correct answer?

4

_____is a full form of SQL.

A. Standard query language

B. Sequential query language

C. Structured query language

D. Server side query language

What is the correct answer?

4

Which of the following relational algebraic operations is not from set theory?

A. Union

B. Intersection

C. Cartesian Product

D. Select

What is the correct answer?

4

The clause alter table in SQL can be used to

A. add an attribute

B. delete an attribute

C. alter the default values of an attribute

D. all of the above

What is the correct answer?

4

Grant and revoke are _____ statements.

A. TCL

B. DCL

C. DDL

D. DML

What is the correct answer?

4

Manager salary details are hidden from the employee .This is

A. Conceptual level data hiding.

B. External level data hiding.

C. Physical level data hiding.

D. None of these.

What is the correct answer?

4

Which of the following is not a recovery technique?

A. Deferred update

B. Immediate update

C. Two-phase commit

D. Shadow paging

What is the correct answer?

4

If a transaction T has obtained an exclusive lock on item Q, then T can

A. read Q

B. write Q

C. both read and write Q

D. write Q but not read Q

What is the correct answer?

4

What is a disjoint less constraint?

A. It requires that an entity belongs to no more than one level entity set.

B. The same entity may belong to more than one level.

C. The database must contain an unmatched foreign key value.

D. An entity can be joined with another entity in the same level entity set.

What is the correct answer?

4

The set of all values that can be taken by the attribute is called as _______ of the attribute.

A. Tuple

B. Cardinality

C. Degree

D. Domain

What is the correct answer?

4

In multiple granularity of locks SIX lock is compatible with

A. IX

B. IS

C. S

D. SIX

What is the correct answer?

4

In a relational schema, each tuple is divided into fields called

A. Relations

B. Queries

C. Domains

D. All of the above

What is the correct answer?

4

Which is the best file organization when data is frequently added or deleted from a file?

A. Sequential

B. Direct

C. Index sequential

D. None of the above

What is the correct answer?

4

The common column is eliminated in

A. theta join

B. outer join

C. natural join

D. composed join

What is the correct answer?

4

………………… approach reduces time and effort required for design and lesser risk in database management.

A. Single global database

B. Multiple databases

C. Top-down approach

D. None of the above

What is the correct answer?

4

The drawback of shadow paging technique are

A. Commit overhead

B. Data fragmentation

C. Garbage collection

D. All of these

What is the correct answer?

4

A DBMS is a ____ user if at most one user can use the system and is mostly restricted to personal computer systems.

A. None

B. Multi

C. Single

D. Concurrent

What is the correct answer?

4

Which of the following is true for network structure?

A. It is a physical representation of the data.

B. It allows many to many relationship.

C. It is conceptually simple.

D. It will be the dominant database of the future.

What is the correct answer?

4

Given the following relation S(SNO,SNAME,CITY) write a query to update the value of CITY to KANPUR for the supplier S1.

A. UPDATE S CITY = KANPUR WHERE SNO=S1

B. UPDATE S SET CITY = KANPUR FOR SNO=S1

C. UPDATE S SET CITY = KANPUR WHERE SNO=S1

D. UPDATE S RENAME CITY = KANPUR WHERE SNO=S1

What is the correct answer?

4

What is data integrity?

A. It is the data contained in database that is non redundant.

B. It is the data contained in database that is accurate and consistent.

C. It is the data contained in database that is secured.

D. It is the data contained in database that is shared.

What is the correct answer?

4

______is a preferred method for enforcing data integrity

A. Constraints

B. Triggers

C. Stored procedure

D. Cursors

What is the correct answer?

4

______contains information that defines valid values that are stored in a column or data type.

A. Default

B. Index

C. Rule

D. View

What is the correct answer?

4

When an E-R diagram is mapped to tables, the representation is redundant for

A. weak entity sets

B. weak relationship sets

C. strong entity sets

D. strong relationship sets