The middleware databases in which the business rules act are applicable to _______ tier architectures
Single
Three
Two
None
Correct Answer :
B. Three
Related Questions
SQL server stores index information in the _____system table
system indexes
syst indexes
sys indexes
sysind
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
Drop Table cannot be used to drop a table referenced by a ______ constraint.
Primary Key
Local Key
Foreign Key
Composite Key
Which of the following is not a consequence of non-normalized database?
Update Anomaly
Insertion Anomaly
Redundancy
Lost update problem
Between DRAM and magnetic disk storage another form of memory, called ______ memory is becoming common because it is non volatile.
RAM
Flash
Hard Disk
Secondary
Which of the following relational algebraic operations is not from set theory?
Union
Intersection
Cartesian Product
Select
What are the desirable properties of a decomposition
Partition constraint.
Dependency preservation.
Redundancy.
Security.
A ______ module is typically designed so that it will run on a user workstation or personal computer.
Software
Server
Program
Client
An outstanding functionality of SQL is its support for automatic_____ to the target data.
programming
navigation
functioning
notification
Grant and revoke are _____ statements.
TCL
DCL
DDL
DML
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
Which of the following is true for network structure?
It is a physical representation of the data.
It allows many to many relationship.
It is conceptually simple.
It will be the dominant database of the future.
Key to represent relationship between tables is called
primary key
secondary key
foreign key
none of the above
Use of UNIQUE while defining an attribute of a table in SQL means that the attribute values are
distinct values
cannot have NULL
both (A) & (B)
same as primary key
In an ER model,_____ is described in the database by storing its data.
Entity
Attribute
Relationship
Notation
Tree structures are used to store data in
Network model.
Relational model.
Hierarchical model.
File based system.
A relational database developer refers to a record as
an attribute
a tuple
a criteria
a relation
Which of the following is a reason to model data?
Understand each user's perspective of data
Understand the data itself irrespective of the physical representation
Understand the use of data across application areas
All of the above
If an entity can belong to only one lower level entity then the constraint is
disjoint
partial
overlapping
single
The data in the database at a particular moment of time is called the _______
Snapshot
Dynaset
Stateless
Stateful
______is a preferred method for enforcing data integrity
Constraints
Triggers
Stored procedure
Cursors
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
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
______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
Manager salary details are hidden from the employee .This is
Conceptual level data hiding.
External level data hiding.
Physical level data hiding.
None of these.
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 .
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.
The relational model is based on the concept that data is organized and stored in two-dimensional tables called ______
Fields
Records
Relations
Keys
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