A weak entity has an ______ dependency on its owner entity, which can be used for both ON UPDATE and ON DELETE.
Direct
Indirect
Existence
No
Correct Answer :
C. Existence
Related Questions
The metadata is created by the
DML compiler
DML pre-processor
DDL interpreter
Query interpreter
______is a preferred method for enforcing data integrity
Constraints
Triggers
Stored procedure
Cursors
The fact that all employees of a particular organization should not have salaries more than $10000 is a _____ constraint.
Schema
Tuple
Domain
Relational
The _____ category includes storage media that can be operated on directly by the computers central processing unit.
Primary storage
Secondary Storage
All
Tertiary Storage
______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
Which of the following relational algebraic operations is not from set theory?
Union
Intersection
Cartesian Product
Select
The common column is eliminated in
theta join
outer join
natural join
composed join
DROP is a statement in SQL.
Query
Embedded SQL
DDL
DCL
Which two files are used during operation of the DBMS?
Query languages and utilities
DML and query language
Data dictionary and transaction log
Data dictionary and query language
Which of the following is not a characteristic of a relational database model?
Table
Tree like structure
Complex logical relationship
Records
What is a disjoint less constraint?
It requires that an entity belongs to no more than one level entity set.
The same entity may belong to more than one level.
The database must contain an unmatched foreign key value.
An entity can be joined with another entity in the same level entity set.
A relational database developer refers to a record as
an attribute
a tuple
a criteria
a relation
Union operator is a :
Unary Operator
Ternary Operator
Binary Operator
Not an operator
The graphical representation of a query is .
B-Tree
graph
Query Tree
directed graph
A data type or format is specified for each _________
Relation
Tuple
Database
Domain
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
Key to represent relationship between tables is called
primary key
secondary key
foreign key
none of the above
A relation is in attribute of other composite key. if an attribute of a composite key is dependent on an
2NF
3NF
BCNF
1NF
For using a specific database …………… command is used.
use database
database name use
Both A & B
None of them
Employees in a company are each assigned their own office, i.e. for each employee there exists a unique office and for each office there exists a unique employee; This statement is an example of ____ type of relation.
1:1
1: Many
Many: One
Many : Many
_____ database is used to provide statistical information or summaries of values based on various criteria.
Statistical
Mathematical
Normalized
Un normalized
A top-to-bottom relationship among the items in a database is established by a
Hierarchical schema
Network schema
Relational Schema
All of the above
In E-R Diagram total participation is represented by
Double lines
Single line
Dashed lines
Triangle
Which of the following ensures the atomicity of the transaction?
Transaction management component of DBMS
Application Programmer
Concurrency control component of DBMS
Recovery management component of DBMS
The division operator divides a dividend A of degree m+n by a divisor relation B of degree n and produces a result of degree
m - 1
m + 1
m * m
m
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 .
The default level of consistency in SQL is
repeatable read
read committed
read uncommitted
serializable
Relations produced from an E-R model will always be
First normal form.
Second normal form.
Third normal form.
Fourth normal form.
Which of the following is not a recovery technique?
Deferred update
Immediate update
Two-phase commit
Shadow paging
Relational Algebra is
Data Definition Language .
Meta Language
Procedural query Language
None of the above