Given the following relation S(SNO,SNAME,CITY) write a query to update the value of CITY to KANPUR for the supplier S1.
UPDATE S CITY = KANPUR WHERE SNO=S1
UPDATE S SET CITY = KANPUR FOR SNO=S1
UPDATE S SET CITY = KANPUR WHERE SNO=S1
UPDATE S RENAME CITY = KANPUR WHERE SNO=S1
Correct Answer :
C. UPDATE S SET CITY = KANPUR WHERE SNO=S1
Related Questions
Precedence graphs help to find a
Serializable schedule.
Recoverable schedule.
Deadlock free schedule.
Cascadeless schedule.
In SQL the word natural can be used with
inner join
full outer join
right outer join
all of the above
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.
The normal form that is not necessarily dependency preserving is
2NF
3NF
BCNF
4NF
Given the following relation S(SNO,SNAME,CITY) write a query to update the value of CITY to KANPUR for the supplier S1.
UPDATE S CITY = KANPUR WHERE SNO=S1
UPDATE S SET CITY = KANPUR FOR SNO=S1
UPDATE S SET CITY = KANPUR WHERE SNO=S1
UPDATE S RENAME CITY = KANPUR WHERE SNO=S1
A table can have only one
Secondary key
Alternate key
Unique key
Primary key
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 common column is eliminated in
theta join
outer join
natural join
composed join
The middleware databases in which the business rules act are applicable to _______ tier architectures
Single
Three
Two
None
In multiple granularity of locks SIX lock is compatible with
IX
IS
S
SIX
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
Shadow paging has
no redo
no undo
redo but no undo
neither redo nor undo
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
A relation is in attribute of other composite key. if an attribute of a composite key is dependent on an
2NF
3NF
BCNF
1NF
Relations produced from an E-R model will always be
First normal form.
Second normal form.
Third normal form.
Fourth normal form.
______ keyword is used to find the number of values in a column.
TOTAL
ADD
COUNT
SUM
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
As per equivalence rules for query transformation, selection operation distributes over
Union.
Set difference.
Intersection.
All of the above.
Immediate database modification technique uses
Both undo and redo.
Undo but no redo.
Redo but no undo.
Neither undo nor redo.
A _____ is a logical unit of database processing that includes one or more data access operations that can include insertion, deletion, modification or retrieval operations.
Database
Data
Transaction
Record
In an E-R, Y is the dominant entity and X is a subordinate entity. Then which of the following is incorrect :
Operationally, if Y is deleted, so is X
existence is dependent on Y.
Operationally, if X is deleted, so is Y.
Operationally, if X is deleted, & remains the same.
The concept of mapping of ______ entity types is the concept in which the for each strong entity type E in the ER schema, create a relation R that includes all the simple attributes of E.
Regular
Irregular
None
Weak
In SQL, testing whether a subquery is empty is done using
DISTINCT
UNIQUE
NULL
EXISTS
The _______ is a set of programs to use and / or modify this data.
DBMS
System
Program
Software
E-R Modeling is achieved by using ____ diagrams
DFD
Flowcharts
Gantt Charts
E-R
By ______ an area on disk in certain ways, one can make it represent a bit value of either zero (0) or one (1).
Vulcanizing
Galvanizing
Magnetizing
Passing UV rays
The ______ indexes are forced to store only record IDs in the data structure and require at least one additional I/O Operation to retrieve the actual record.
Clustered
Hashed
Un-clustered
Collision
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 is not a property of transactions?
Atomicity
Concurrency
Isolation
Durability
A transaction is in state after the final statement has been executed.
partially committed
active
committed
none of the above