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
Correct Answer :
C. mn and 0
Related Questions
The drawback of shadow paging technique are
Commit overhead
Data fragmentation
Garbage collection
All of these
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
the pin code
the last name
the compound key first name and last name
Tr from next page
DFD stands for
Data Flow Document
Data File Diagram
Data Flow Diagram
Non of the above
Cascading rollback is avoided in all protocol except
strict two-phase locking protocol.
tree locking protocol
two-phase locking protocol
validation based protocol.
Which of the following relational algebraic operations is not from set theory?
Union
Intersection
Cartesian Product
Select
Drop Table cannot be used to drop a table referenced by a ______ constraint.
Primary Key
Local Key
Foreign Key
Composite Key
_____is a full form of SQL.
Standard query language
Sequential query language
Structured query language
Server side query language
The transactions like adding an employee, enrolling a student in a course are examples of _______
Logical
Physical
None
Theoretical
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 concurrency control schemes is not based on the serializability property?
Two - phase locking
Graph-based locking
Time-stamp based locking
None of these .
………………… approach reduces time and effort required for design and lesser risk in database management.
Single global database
Multiple databases
Top-down approach
None of the above
For correct behaviour during recovery, undo and redo operation must be
Commutative
Associative
idempotent
distributive
Maximum height of a B+ tree of order m with n key values is
Logm(n)
(m+n)/2
Logm/2(m+n)
None of these
A transaction is in state after the final statement has been executed.
partially committed
active
committed
none of the above
E-R Modeling is achieved by using ____ diagrams
DFD
Flowcharts
Gantt Charts
E-R
Relational Algebra does not have
Selection operator.
Projection operator.
Aggregation operators.
Division operator.
Whenever two independent one-to-many relationships are mixed in the same relation, a __________ arises.
Functional dependency
Multi-valued dependency
Transitive dependency
Partial dependency
If an entity can belong to only one lower level entity then the constraint is
disjoint
partial
overlapping
single
Which of the following is not a consequence of non-normalized database?
Update Anomaly
Insertion Anomaly
Redundancy
Lost update problem
_____ is a utility to capture a continuous record of server activity and provide auditing capability.
SQL server Profile
SQL server wizard.
SQL server service manager
SQL server setup
Which of the following is not a logical database structure?
Chain
Network
Tree
Relational
Which of the following is not comparison operator?
<>
<
=<
>=
The ____ operator joins two or more conditions and displays rows only if that rows data satisfies all conditions specified.
OR
AND
NOT
ALL
Which of the following constitutes a basic set of operations for manipulating relational data?
Predicate calculus
Relational calculus
Relational algebra
SQL
In 2NF
No functional dependencies (FDs) exist.
No multivalued dependencies (MVDs) exist.
No partial FDs exist.
No partial MVDs exist.
Which of the following addressing modes permits relocation without any change over in the code?
Indirect addressing
Indexed addressing
PC relative addressing
Base register addressing
In E-R Diagram total participation is represented by
Double lines
Single line
Dashed lines
Triangle
A ____ key specifies a uniqueness constraint that no two distinct tuples in any state r of relation R can have the same value for super key.
Sub
Parent
Candidate
Super
An advantage of views is
Data security
Derived columns
Hiding of complex queries
All of the above