Home
Current Affairs January 2024

What is the correct answer?

4

If an entity can belong to only one lower level entity then the constraint is

A. disjoint

B. partial

C. overlapping

D. single

Correct Answer :

B. partial


Related Questions

What is the correct answer?

4

E-R Modeling is achieved by using ____ diagrams

A. DFD

B. Flowcharts

C. Gantt Charts

D. E-R

What is the correct answer?

4

Which normal form is considered adequate for normal relational database design?

A. 2NF

B. 5NF

C. 4NF

D. 3NF

What is the correct answer?

4

In b-tree the number of keys in each node is than the number of its children.

A. one less

B. same

C. one more

D. half

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

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

The values of the attribute describes a particular

A. Entity set

B. File

C. Entity instance

D. Organization

What is the correct answer?

4

Which of the syntax is correct for insert statement?
i) insert into values
ii) insert into (column list) values

A. i-only

B. ii-only

C. Both of them

D. None of them

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

The relational model is based on the concept that data is organized and stored in two-dimensional tables called ______

A. Fields

B. Records

C. Relations

D. Keys

What is the correct answer?

4

If an entity can belong to only one lower level entity then the constraint is

A. disjoint

B. partial

C. overlapping

D. single

What is the correct answer?

4

_____ is a utility to capture a continuous record of server activity and provide auditing capability.

A. SQL server Profile

B. SQL server wizard.

C. SQL server service manager

D. SQL server setup

What is the correct answer?

4

Whenever two independent one-to-many relationships are mixed in the same relation, a __________ arises.

A. Functional dependency

B. Multi-valued dependency

C. Transitive dependency

D. Partial dependency

What is the correct answer?

4

The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more columns is

A. View

B. Order by

C. Group by

D. Having

What is the correct answer?

4

Consider the join of relation R with a relation S. If R has m tuples and S has n tuples, then the maximum and minimum size of the join respectively are

A. m+n and 0

B. m+n and |m-n|

C. mn and 0

D. mn and m+n

What is the correct answer?

4

In SQL, testing whether a subquery is empty is done using

A. DISTINCT

B. UNIQUE

C. NULL

D. EXISTS

What is the correct answer?

4

In SQL the word natural can be used with

A. inner join

B. full outer join

C. right outer join

D. all of the above

What is the correct answer?

4

A weak entity has an ______ dependency on its owner entity, which can be used for both ON UPDATE and ON DELETE.

A. Direct

B. Indirect

C. Existence

D. No

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

The size of a data item is called its _______, which can be a field of some record or may be a larger unit such as a record.

A. Similarity

B. Granularity

C. Dimensionality

D. Arity

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 constitutes a basic set of operations for manipulating relational data?

A. Predicate calculus

B. Relational calculus

C. Relational algebra

D. SQL

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

What are the desirable properties of a decomposition

A. Partition constraint.

B. Dependency preservation.

C. Redundancy.

D. Security.

What is the correct answer?

4

An advantage of the database management approach is

A. data redundancy increases

B. data is dependent on programs

C. data is integrated and can be accessed by multiple programs

D. none of the above

What is the correct answer?

4

In a multi-user database, if two users wish to update the same record at the same time, they are prevented from doing so by

A. jamming

B. password

C. documentation

D. record lock

What is the correct answer?

4

A list consists of last names, first names, addresses and pin codes. If all people in the list have the same last name and same pin code a useful key would be

A. the pin code

B. the last name

C. the compound key first name and last name

D. Tr from next page

What is the correct answer?

4

Which of the following relational algebra operations do not require the participating tables to be union-compatible?

A. Union

B. Intersection

C. Difference

D. Join

What is the correct answer?

4

In SQL the statement select * from R, S is equivalent to

A. Select * from R natural join S.

B. Select * from R cross join S.

C. Select * from R union join S.

D. Select * from R inner join S.

What is the correct answer?

4

A logical schema

A. is the entire database

B. Describes how data is actually stored on disk.

C. is a standard way of organizing information into accessible parts.

D. All of the above

What is the correct answer?

4

Immediate database modification technique uses

A. Both undo and redo.

B. Undo but no redo.

C. Redo but no undo.

D. Neither undo nor redo.