Relational Algebra is
Data Definition Language .
Meta Language
Procedural query Language
None of the above
Correct Answer :
C. Procedural query Language
Related Questions
Which normal form is considered adequate for normal relational database design?
2NF
5NF
4NF
3NF
The ______ key of a relation is the attribute (column) or collection of attributes, which uniquely identify a given tuple.
Primary
Foreign
Candidate
Alternate
______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
The values of the attribute describes a particular
Entity set
File
Entity instance
Organization
When an E-R diagram is mapped to tables, the representation is redundant for
weak entity sets
weak relationship sets
strong entity sets
strong relationship sets
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.
The set of all values that can be taken by the attribute is called as _______ of the attribute.
Tuple
Cardinality
Degree
Domain
Which of the following statement on the view concept in SQL is invalid?
All views are not updateable
The views may be referenced in an SQL statement whenever tables are referenced.
The views are instantiated at the time they are referenced and not when they are defined.
The definition of a view should not have GROUP BY clause in it.
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
_____is a full form of SQL.
Standard query language
Sequential query language
Structured query language
Server side query language
The middleware databases in which the business rules act are applicable to _______ tier architectures
Single
Three
Two
None
The collection of information stored in a database at a particular moment is called as ......
schema
instance of the database
data domain
independence
A transaction is in state after the final statement has been executed.
partially committed
active
committed
none of the above
_____clause is an additional filter that is applied to the result.
Select
Order by
Group-by
Having
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.
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
Union operator is a :
Unary Operator
Ternary Operator
Binary Operator
Not an operator
For using a specific database …………… command is used.
use database
database name use
Both A & B
None of them
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.
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 diagram the ___shape specifies the Attibute and a ____ shape specifies the primary key attribute.
Oval; An oval with an underlined attribute
Circle; A circle with bolded attribute inside it
Diamond; A bolded attribute
Square; An attribute within the square
Processed data is called _____
Raw data
Source
Information
Useful data
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.
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
Isolation of the transactions is ensured by
Transaction management
Application programmer
Concurrency control
Recovery management
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 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
Which is the best file organization when data is frequently added or deleted from a file?
Sequential
Direct
Index sequential
None of the above
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
Which of the following constitutes a basic set of operations for manipulating relational data?
Predicate calculus
Relational calculus
Relational algebra
SQL