The set of all values that can be taken by the attribute is called as _______ of the attribute.
Tuple
Cardinality
Degree
Domain
Correct Answer :
D. Domain
Related Questions
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
m+n and 0
m+n and |m-n|
mn and 0
mn and m+n
_____ database is used to provide statistical information or summaries of values based on various criteria.
Statistical
Mathematical
Normalized
Un normalized
The normal form that is not necessarily dependency preserving is
2NF
3NF
BCNF
4NF
_____clause is an additional filter that is applied to the result.
Select
Order by
Group-by
Having
Which of the following constitutes a basic set of operations for manipulating relational data?
Predicate calculus
Relational calculus
Relational algebra
SQL
In SQL the word natural can be used with
inner join
full outer join
right outer join
all of the above
A logical schema
is the entire database
Describes how data is actually stored on disk.
is a standard way of organizing information into accessible parts.
All of the above
In a relational schema, each tuple is divided into fields called
Relations
Queries
Domains
All of the above
Relations produced from an E-R model will always be
First normal form.
Second normal form.
Third normal form.
Fourth normal form.
If both the functional dependencies : X�Y and Y�X hold for two attributes X and Y then the relationship between X and Y is
M:N
M:1
1:M
If the closure of an attribute set is the entire relation then the attribute set is a
superkey
candidate key
primary key
not a key
If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
left outer join
right outer join
full outer join
inner join
The ______ language consists of SQL statements for operating on the data (insert, Modify, Delete) in tables that already exist.
Data Manipulation
Data Definition
Data Control
None
operator is used to compare a value to a list of literals values that have been specified.
Like
COMPARE
BETWEEN
IN
Precedence graphs help to find a
Serializable schedule.
Recoverable schedule.
Deadlock free schedule.
Cascadeless schedule.
The language that requires a user to specify the data to be retrieved without specifying exactly how to get it is
Procedural DML.
Non-Procedural DML.
Procedural DDL.
Non-Procedural DDL.
Which one is true statement :
With finer degree of granularity of locking a high degree of concurrency is possible.
Locking prevents non-serializable schedules.
Locking cannot take place at field level.
An exclusive lock on data item X is granted even if a shared lock is already held on X.
Which of the following relational algebraic operations is not from set theory?
Union
Intersection
Cartesian Product
Select
______is a special type of integrity constraint that relates two relations & maintains consistency across the relations.
Domain Integrity Constraints
Referential Integrity Constraints
Domain Constraints
Entity Integrity Constraints
E-R Modeling is achieved by using ____ diagrams
DFD
Flowcharts
Gantt Charts
E-R
Tree structures are used to store data in
Network model.
Relational model.
Hierarchical model.
File based system.
An outstanding functionality of SQL is its support for automatic_____ to the target data.
programming
navigation
functioning
notification
Given the following relation S(SNO,SNAME,CITY) write a query to update the value of CITY to KANPUR for the supplier S1.
UPDATE S CITY = KANPUR WHERE SNO=S1
UPDATE S SET CITY = KANPUR FOR SNO=S1
UPDATE S SET CITY = KANPUR WHERE SNO=S1
UPDATE S RENAME CITY = KANPUR WHERE SNO=S1
In an E-R, Y is the dominant entity and X is a subordinate entity. Then which of the following is incorrect :
Operationally, if Y is deleted, so is X
existence is dependent on Y.
Operationally, if X is deleted, so is Y.
Operationally, if X is deleted, & remains the same.
The rule that a value of a foreign key must appear as a value of some specific table is called a
Referential constraint.
Index.
Integrity constraint.
Functional dependency.
Data independence means
data is defined separately and not included in programs.
programs are not dependent on the physical attributes of data
programs are not dependent on the logical attributes of data
both B and C
Isolation of the transactions is ensured by
Transaction management
Application programmer
Concurrency control
Recovery management
The full form of GUI is _________
Government Union Internet
Graphical Unit Interface
Graphical User Interface
Graphical University Interface
If a transaction T has obtained an exclusive lock on item Q, then T can
read Q
write Q
both read and write Q
write Q but not read Q
What is data integrity?
It is the data contained in database that is non redundant.
It is the data contained in database that is accurate and consistent.
It is the data contained in database that is secured.
It is the data contained in database that is shared.