Precedence graphs help to find a
Serializable schedule.
Recoverable schedule.
Deadlock free schedule.
Cascadeless schedule.
Correct Answer :
A. Serializable schedule.
Related Questions
The collection of information stored in a database at a particular moment is called as ......
schema
instance of the database
data domain
independence
DFD stands for
Data Flow Document
Data File Diagram
Data Flow Diagram
Non of the above
Which of the following relational algebra operations do not require the participating tables to be union-compatible?
Union
Intersection
Difference
Join
A relation is in attribute of other composite key. if an attribute of a composite key is dependent on an
2NF
3NF
BCNF
1NF
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
_____clause is an additional filter that is applied to the result.
Select
Order by
Group-by
Having
In SQL, testing whether a subquery is empty is done using
DISTINCT
UNIQUE
NULL
EXISTS
Shadow paging has
no redo
no undo
redo but no undo
neither redo nor undo
The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more columns is
View
Order by
Group by
Having
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.
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
_____ 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
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
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
_____ command can be used to modify a column in a table
alter
update
set
create
The default level of consistency in SQL is
repeatable read
read committed
read uncommitted
serializable
operator is used to compare a value to a list of literals values that have been specified.
Like
COMPARE
BETWEEN
IN
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
Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
It will result in a deadlock situation.
It will immediately be rejected.
It will immediately be granted.
It will be granted as soon as it is released by A .
In 2NF
No functional dependencies (FDs) exist.
No multivalued dependencies (MVDs) exist.
No partial FDs exist.
No partial MVDs exist.
A table can have only one
Secondary key
Alternate key
Unique key
Primary key
It is an abstraction through which relationships are treated as higher level entities
Generalization.
Specialization.
Aggregation.
Inheritance.
Relational Algebra does not have
Selection operator.
Projection operator.
Aggregation operators.
Division operator.
The keyword to eliminate duplicate rows from the query result in SQL is
DISTINCT
NO DUPLICATE
UNIQUE
None of the above
_____ First proposed the process of normalization.
Edgar. W
Edward Stephen
Edgar F. Codd
Edward Codd
DROP is a statement in SQL.
Query
Embedded SQL
DDL
DCL
Which normal form is considered adequate for normal relational database design?
2NF
5NF
4NF
3NF
A transaction is in state after the final statement has been executed.
partially committed
active
committed
none of the above
Drop Table cannot be used to drop a table referenced by a ______ constraint.
Primary Key
Local Key
Foreign Key
Composite Key