DATA BASE MANAGEMENT SYSYTEM

DATA BASE MANAGEMENT SYSYTEM

dbms
(QNO1). A relation with redundancy can be refined by ----------- using with smaller relations
that contain the same information but without redundancy
A. Decomposing it
B. Updating it
C. Inserting it
D. Deletion it
The solution is : a
(QNO2). Which of the following one is not an example of integrity constraints
A. Functional dependency
B. Multivalued dependency
C. Join dependency
D. Multilevel dependency
The solution is : d
(QNO3). Which of the following one is not caused by redundancy problems
A. Redundant storage
B. Update anomalies
C. Insertion anomalies
D. Multivalued dependency
The solution is : d
(QNO4). In a FD the right side contains only attributes that also appear on the left side is Called
________
A. Functional FD
B. Trival FD
C. Non functional FD
D. Non trival
The solution is : b
(QNO5). ________ is more than one place within a database can occur
A. Consistency
B. Redundancy
C. Durability
D. Isolation
The solution is : b
(QNO6). Some information is stored repeatedly is called
A. Update anomalies
B. Redundant storage
C. Insertion anomalies
D. Deletion anomalies
The solution is : b
(QNO7). If one copy of such repeated data is updates, an inconsistency is created unless all
copies are similarly updated is called
A. Redundant storage
B. Insertion anomalies
C. Deletion anomalies
D. Update anomalies
The solution is : d
(QNO8). It may not be possible to store certain information unless some other, unrelated
information is stored as well is called
A. Redundant storage
B. Insertion anomalies
C. Deletion anomalies
D. Update anomalies
The solution is : b
(QNO9). It may not be possible to delete certain information without losing some other,
unrelated information as well is called
A. Redundant storage
B. Insertion anomalies
C. Update anomalies
D. Deletion anomalies
The solution is : d
(QNO10). Which of the following one is example of a integrity constraints
A. Multilevel dependency
B. Insertion dependency
C. Multivalued dependency
D. Deletion dependency
The solution is : c
(QNO11). If X’ YZ then X’ Y, and X’ Z are called _______
A. Decomposition
B. Union
C. Augmentation
D. Transitivity
The solution is : a
(QNO12). If X→ YZ then X→ Y, and X→ Z are called _______
A. Decomposition
B. Union
C. Augmentation
D. Transitivity
The solution is : a
(QNO13). which rule we can used to generate trival dependencies
A. Union
B. Decomposition
C. Reflexivity
D. Augmentation
The solution is : c
(QNO14). A relation consists of replacing the relation schema by two or more relation schemas
is called
A. Decomposition of a relation schema
B. Deletion of a relation schema
C. Insertion of a relation schema
D. Redundancy of a relation schema
The solution is : a
(QNO15). If X→ Y holds, where y is the set of all attributes, and there is some subset V of X
such that V→ Y holds then X is a _______________
A. Primary key
B. Candidate key
C. Super key
D. Not a key
The solution is : c
(QNO16). _________ is a property of the meaning or semantics of the attributes in a relation
A. Multilevel dependency
B. Multivalued dependency
C. Functional dependency
D. Lossless join
The solution is : c
(QNO17). 12. If X Y, then X→ Y is called _______
A. Augmentation rule
B. Transitivity rule
C. Durability
D. Reflexivity rule
The solution is : d
(QNO18). The notation t1 .x to refers to __________
A. The projection of the tuple x onto the attribute in t1
B. The projection of the tuple t1 onto the attribute in x
C. The projection of the tuple x onto the attribute in x
D. The projection of the tuple t1 onto the attribute in t1
The solution is : a
DATA BASE MANAGEMENT SYSYTEM
(QNO19). An FD X→ Y essentially says that ______________
A. If two tuples agree on the values in attributes X they must also agree on the values in attribute
Y.
B. If two tuples agree on the values in attributes Y they must also agree on the values in attribute
X.
C. There is no relation among the attribute X and attribute Y
D. If two tuples agree on the values in attributes X they not also agree on the values in attribute
Y
The solution is : a
(QNO20). Which of the following of a given relation schema can help us to decide whether or
not to decompose it further
A. Dependency
B. Isolation
C. Normal forms
D. Durability
The solution is : c
(QNO21). If X→ Y then XZ→ YZ for any Z is called __________
A. Augmentation rule
B. Reflexivity rule
C. Transitivity rule
D. Decomposition
The solution is : a
(QNO22). If X→ Y and Y→ Z, then X→ Z __________
A. Reflexivity rule
B. Augmentation rule
C. Transitivity rule
D. Union
The solution is : c
(QNO23). Which property enables us to recover any instance of the decomposed relation from
corresponding instances of the smaller relations
A. Decomposition
B. Functional dependency
C. Lossless join
D. Multilevel dependency
The solution is : c
(QNO24). Which property enables us to enforce any constraint on the original relation by simply
enforcing some constraints on each of the smaller relations
A. Decomposition
B. Dependency preserving
C. Lossless join
D. Functional dependency
The solution is : b
(QNO25). Which one is a kind of integrity constraint that generalizes the concept of the key
A. Multilevel dependency
B. Multivalued dependency
C. Lossless join
D. Functional dependency
The solution is : d
(QNO26). X→ Y means-----------
A. X functionally determines Y
B. Y functionally determines X
C. X not functionally determines Y
D. X functionally determines X
The solution is : a
(QNO27). In some situations decomposition could actually improve _________
A. Dependency
B. Performance
C. Flexibility
D. Durability
The solution is : b
(QNO28). The set of all FD's implied by a given set F of FD's is called the _________
A. Decomposition
B. Dependency
C. Closure of F
D. Lossless join
The solution is : c
(QNO29). In ______ normal form contain one of the following statements is true
X→ A
A ε X: that is, it is trival FD or
X is a super key
A. First normal form
B. Second normal form
C. 3rd normal form
D. BCNF
The solution is : d
(QNO30). In _________ normal form contain one of the following statements is true
X→ A
A ε X: that is, it is trival FD or
X is a super key Or
A is part of some key for R
A. First normal form
B. Second normal form
C. BCNF
D. 3rd normal form
The solution is : d
(QNO31). _______ is a process of grouping attributes into well structured relations
A. Functional dependency
B. Normalization
C. Decomposition
D. Multivalued dependency
The solution is : b
(QNO32). A relation is in first normal form if every field contains only _____________
A. Multiple values
B. Duplicate values
C. Atomic values
D. Lists
The solution is : c
(QNO33). A table is said to be 2NF it is most be free from ____________
A. Functional dependencies
B. Partial dependencies
C. Transitive dependencies
D. Multivalued dependency
The solution is : b
(QNO34). The 3rd normal form must be free from ___________
A. Join dependency
B. Functional dependency
C. Transitive dependency
D. Multivalued dependency
The solution is : c
(QNO35). The 4th normal from must be free from
A. Multivalued dependencies
B. Loss less join
C. Functional dependency
D. Non functional dependency
The solution is : a
(QNO36). Normalization is a formal technique for analyzing relations based on their
______________
A. Primary key and FDs
B. Super key and FDs
C. Candidate key and FDs
D. Only foreign key
The solution is : a
(QNO37). First normal form to fifth normal form the redundancy will be ____________
A. Increased
B. Reduced
C. Moderate
D. No change
The solution is : b
(QNO38). ------------ is a constraint according to which the presence of certain rows in a table
implies the presence of certain other rows
A. Full Functional dependency
B. Multivalued dependency
C. Transitive dependency
D. Join dependency
The solution is : d
(QNO39). If an FD X→ Y holds over a relation R and X ) Y is empty, the decomposition of R
into R-Y and XY is __________
A. Loss less join
B. Loosely join
C. Multivalued dependency
D. Functional dependency
The solution is : a
(QNO40). ------------ allows us to enforce all FDs by examine a single relation instance on each
insertion or modification of a tuple
A. Loosely join
B. Dependency preserving decomposition
C. Decomposition
D. Multivalued dependency
The solution is : b
(QNO41). The decomposition of relation schema R with FDs F into schemas with attribute sets
X and Y is ____________ if (Fx ∪ Fy)+ = F+
A. Dependency preserving
B. Decomposition
C. Functional dependency
D. Loss less join
The solution is : a
(QNO42). If X →→ Y then X→→R-XY is called
A. MVD Complementation
B. MVD Augmentation
C. MVD Transitivity
D. Replication
The solution is : a
(QNO43). which rule we can used to get the nontrivial dependencies
A. Union
B. Decomposition
C. Reflexivity
D. Transitivity
The solution is : d
(QNO44). A decomposition of R into two schemas with attribute sets X and Y is said to be a
_________
A. Functional dependency
B. Trival dependency
C. Lossless join decomposition with respect to F
D. Multivalued dependency with respect to F
The solution is : c
(QNO45). -------------- dependency is an indirect functional dependency one in which X→ Z
only by virtue of X→ Z and Y→ Z
A. Full Functional dependency
B. Trival Functional dependency
C. Transitive dependency
D. Multivalued dependency
The solution is : c
(QNO46). The 4th and 5th normal forms deals specifically with the representation of __________
relationships among attributes
A. Many to Many and One to Many
B. Many to One and One to One
C. One to One and Many to Many
D. No relationship
The solution is : a
(QNO47). a composition of R into two schemas with attribute set X and Y is said to be a
__________
A. functional dependency
B. trival dependency
C. loss less join decomposition with respect to F
D. multi valued dependency with respect to F
The solution is : c
(QNO48). There must be no trival join dependencies that do not allow from the key constraints
A. 4th NF
B. BCNF
C. 5th NF
D. Domain key normal form
The solution is : c
(QNO49). . If X→ Y and X→ Z, then X→ YZ ___________
A. Reflexivity rule
B. Augmentation rule
C. Transitivity rule
D. Union
The solution is : d
(QNO50). Armstrong inference rules are _________
A. Sound, complete
B. Incomplete, sound
C. Complete, no sound
D. Incomplete, no sound
The solution is : a
(QNO51). If you can have two phone number values and two email address values, then you
Should not have them in the same table, which normal form it contains
A. 1st NF
B. 2nd NF
C. 3rdNF
D. 4th NF
The solution is : c
(QNO52). If a relation schema is in BCNF and at least one of its keys consists of a single
attribute, it is also in ------------ normal form
A. 3rd normal from
B. BCNF
C. 4th normal from
D. 5thnormal form
The solution is : c
(QNO53). Consider a relation schema ABCD and suppose that the FD A→ BCD and the MVD
B→→ C is given. Find which normal form it can be contained
A. BCNF
B. 4th normal form
C. 5th normal form
D. Not a BCNF
The solution is : a
(QNO54). Join dependency (JD) {R1,R2,__________Rn} is a ______________
A. Trival JD
B. Non trival JD
C. Multi valued JD
D. Multi level JD
The solution is : a
(QNO55). X→→ Y is a -------------- MVD if Y X R or XY=R
A. Trival MVD
B. Non trival MVD
C. Replication
D. Decomposition
The solution is : a
(QNO56). if X→→Y and there is a W such that W)Y is empty, W→ Z, and Y Z then X → Y
is called
A. MVD Complementation
B. Replication
C. Coalescence
D. MVD augmentation
The solution is : c
(QNO57). If X→→ Y and W Z, then WX →→ XZ it is called
A. MVD Complementation
B. MVD Transitivity
C. Replication
D. MVD augmentation
The solution is : d
(QNO58). If X→→ Y and Y →→ Z then X→→ (Z-Y) it is called
A. MVD Complementation
B. MVD Transitivity
C. Replication
D. MVD augmentation
The solution is : b
(QNO59). If X → Y then X→→ Y is called
A. MVD Complementation
B. MVD Transitivity
C. Replication
D. MVD augmentation
The solution is : c
(QNO60). A join dependency is a further generalization of ____________
A. Multi valued dependencies
B. Multilevel dependencies
C. Functional dependencies
D. Lossless join
The solution is : a
(QNO61). Which of the following are not contain set of sound and complete interface rules for
join dependencies
A. Functional dependencies
B. Multilevel dependencies
C. Join dependencies
D. Multivalued dependencies
The solution is : c
(QNO62). Each transaction run by itself with no concurrent execution of other transactions. This
property is called.
A. Atomicity
B. Consistency
C. Isolation
D. Durability
The solution is : b
(QNO63). Users should be able to understand a transaction with out considering the effect of
other concurrently executing transactions even if the DBMS interleaves the actions of several
transactions. This property is called.
A. Atomicity
B. Consistency
C. Isolation
D. Durability
The solution is : c
(QNO64). After a transaction completes successfully the changes it has made to the data base
persist, even if there are system failures. This property is called _____________
A. Atomicity
B. Consistency
C. Isolation
D. Durability
The solution is : d
DATA BASE MANAGEMENT SYSYTEM
(QNO65). ___________is a logical unit of data base processing that includes one or more
database access Operations.
A. Serializabity
B. Recoverability
C. Transaction
D. Normalization
The solution is : c
(QNO66). Which of the following is not an ACID property?
A. Atomicity
B. Consistency
C. Durability
D. Serializability
The solution is : d
(QNO67). Either all actions are carried out none are called ____________
A. Atomicity
B. Consistency
C. Isolation
D. Durability
The solution is : a
(QNO68). Which state contains signal unsuccessful end of transaction changes applied to
database must be Undone.
A. Commit-Transaction
B. Roll back
C. End transaction
D. Begin transaction
The solution is : b
(QNO69). Which state contain signals successful end of transaction changes can be committed
to database.
A. Commit-transaction
B. Roll back
C. End transaction
D. Begin transaction
The solution is : a
(QNO70). Which state contain marks start of transaction?
A. Commit-transaction
B. Roll back
C. Begin transaction
D. End transaction
The solution is : c
(QNO71). Which state contains marks the end of the read or write operations start checking
whether every thing went according to plan.
A. End transaction
B. Begin transaction
C. Roll back
D. Commit-transaction
The solution is : a
(QNO72). Which schedule contains the operations from a set of concurrent transactions are inter
leaved .
A. Serial schedule
B. Non serial schedule
C. Recoverable schedule
D. Non recoverable schedule
The solution is : d
(QNO73). . If a schedule consists of a two transactions, if transaction t2 could read a database
about object A that has been modified by another transaction which has not yet committed which
anomalies can be occur.
A. WR conflict
B. RW conflict
C. WW conflict
D. RR conflict
The solution is : a
(QNO74). When transactions are executing concurrently in an interleaved fashion then the order
of execution of operations from the various transactions is known as ____________
A. Serializability
B. Concurrency
C. Schedule
D. Dependency
The solution is : c
(QNO75). Which schedule contain the operations of each transaction are executed consecutively
with out any inter leaved operations from other transactions.
A. Serial schedule
B. Non serial schedule
C. Recoverable schedule
D. Non recoverable schedule
The solution is : a
(QNO76). Average time taken to complete a transaction is called.
A. Response time
B. Execution time
C. System throughput
D. Delay time
The solution is : a
(QNO77). The DBMS which can be used to ensures the executed schedule though not it self
serializable is equivalent to same serializable schedule.
A. Recovery method
B. Concurrency control
C. Transaction
D. Durability
The solution is : b
(QNO78). The RW conflict also called as _______________.
A. Repeatable read
B. Un repeatable read
C. Repeatable write
D. Directly read
The solution is : b
(QNO79). A schedule that contains either an abort or a commit for each transaction whose
actions are listed in it is called as_________ .
A. Concurrent schedule
B. Serial schedule
C. Non serial schedule
D. Complete schedule
The solution is : d
(QNO80). The average number of transactions completed in a given time is called.
A. Response time
B. Execution time
C. System throughput
D. Delay time
The solution is : c
(QNO81). WW conflict also called as _________.
A. Dirty read
B. Repeatable read
C. Blind write
D. Repeatable write
The solution is : c
(QNO82). What are the possible violations of an application program that uses isolation level
'read uncommitted'
A. Dirty read problem
B. Non repeatable read problem
C. Phantom phenomenon
D. Blind read
The solution is : c
(QNO83). A schedule is having only commits read operations only and a value written by
Transaction t' cannot be over written by other transaction until 't' either aborts or commits then
the schedule is called as.
A. Cascade less schedule
B. Serializable schedule
C. Strict schedule
D. Recoverable schedule
The solution is : c
(QNO84). In which type of locking, no lock is released until after abort or commit.
A. Basis 2PL
B. Strict 2PL
C. Conservative 2PL
D. Rigorous 2PL
The solution is : d
(QNO85). In which locking protocol is deadlock tree formed but not very realistic.
A. Basic 2PL
B. Conservative 2PL
C. Strict 2PL
D. Rigorous 2PL
The solution is : b
(QNO86). A schedule consists of two transactions if transaction t2 read a data item value that can
already written by transaction t1.if transaction t2 is committed before t1 committed then
transaction t1 is aborted. Then it is called.
A. Recoverable
B. Un recoverable
C. Serializable
D. Non serializable
The solution is : b
(QNO87). Which graph can be useful to capture all potential conflicts between the transactions
in a schedule.
A. Precedence graph
B. Directed graph
C. In directed graph
D. Cyclic graph
The solution is : a
(QNO88). Precedence graph also called as ___________
A. Non serializability graph
B. Serializability graph
C. Recoverability graph
D. Non recoverability gra
The solution is : b
(QNO89). Which of the following is not conflict operation.
A. Reads and write from same transaction
B. Reads from different transactions
C. Reads and write from different transactions on different data items
D. Reads and writes from different transactions on same data item
The solution is : d
(QNO90). If inter leaved schedule produces the same result as that of the serial schedule then the
inter leaved schedule is said to be called _______________
A. Serializability
B. Result serializability
C. Recoverability
D. View serializability
The solution is : a
(QNO91). In a schedule's' consists of a two transactions t1, t2.t2 read a data item value that can
produced by T1, T2 is committed after the T1 is committed then it is called
A. Unrecoverable
B. Recoverable
C. Conflict
D. Nonserializable
The solution is : b
DATA BASE MANAGEMENT SYSYTEM
(QNO92). If two schedules involve the action of the same transactions and they order every pair
of conflicting actions of two committed transactions in the same way then the two schedules are
said to be ________.
A. View equivalent
B. Conflict equivalent
C. Non conflict
D. Result conflict
The solution is : b
(QNO93). The strict 2PL protocol allows only ____________ schedules.
A. Conflict serializable
B. Non conflict serializable
C. Recoverable
D. Non recoverable
The solution is : a
(QNO94). Which of the following ensures atomicity property.
A. Transaction manager
B. User
C. Concurrency control system
D. Recovery manager
The solution is : d
(QNO95). In which type of locking, no lock is released until after abort or commit
A. Basis 2PL
B. Strict 2PL
C. Conservative 2PL
D. Rigorous 2PL
The solution is : d
(QNO96). In which locking protocol is deadlock tree formed but not very realistic
A. Basic 2PL
B. Conservative 2PL
C. Strict 2PL
D. Rigorous 2PL
The solution is : b
(QNO97). The most widely used locking protocol is called
A. Basis 2PL
B. Strict 2PL
C. Conservative 2PL
D. Rigorous 2PL
The solution is : b
(QNO98). ______ is a database object that is frequently accessed and modified and causes a lot
of blocking delays
A. Thrashes
B. Hotspots
C. Deadlocks
D. Save points
The solution is : b
(QNO99). In which locking protocol, locking all items needed before execution begins by pre
declaring its read and write set
A. Basic 2PL
B. Conservative 2PL
C. Strict 2PL
D. Rigorous 2PL
The solution is : b
(QNO100). __________ is a small book keeping object associated with a database object
A. Protocol
B. Lock
C. Transactions
D. Query
The solution is : b
(QNO101). ________ is a set of rules to be followed by each transaction to ensure that, even
though actions or several transactions might be interleaved
A. Locking protocol
B. Deadlock
C. Recoverable
D. Non recoverable
The solution is : a
(QNO102). In which locking protocol transaction does not release it's write locks until after
aborts or commit
A. Basis 2PL
B. Strict 2PL
C. Conservative 2PL
D. Rigorous 2PL
The solution is : b
(QNO103). Transaction T1 sets an exclusive lock on object A, T2 sets an exclusive lock on B. T1
requests an exclusive lock on B and is queued and T2 requests an exclusive lock on A and is
queued. Now T1 is waiting for T2 to release its lock and T2 is waiting for T1 to release its lock.
Then it is called ___________
A. Deadlock
B. Deadlock tree
C. 2PL
D. Recoverable
The solution is : a
(QNO104). Which method can be used to identify the deadlocks?
A. Cyclic graph
B. Directed graph
C. Undirected graph
D. Partial ordered graph
The solution is : a
(QNO105). In which condition, the read operation is executed and R-timestamp (Q) is set to the
maximum of R-timestamp (Q) and Ts (Ti)?
A. Ts (Ti) >= W-Timestamp (Q)
B. Ts (Ti) < W-Timestamp (Q)
C. Ts (Ti) < R-Timestamp (Q)
D. Ts (Ti) > R-Timestamp (Q)
The solution is : a
(QNO106). What is the condition ignore absolute write rule?
A. Ts (Ti) >= W-Timestamp (Q)
B. Ts (Ti) < W-Timestamp (Q)
C. Ts (Ti) < R-Timestamp (Q)
D. Ts (Ti) > R-Timestamp (Q)
The solution is : b
(QNO107). Which one ensures that any conflicting read and write operations are executed in
timestamp order?
A. Timestamp ordering protocol
B. Lock based protocol
C. Graph based protoco
D. Validation based protocol
The solution is : a
(QNO108). In which protocol, deadlock cannot be occurred?
A. Lock based protocol
B. Timestamp ordering protocol
C. Graph-based protocol
D. Validation-based protocol
The solution is : b
(QNO109). Which of the following one is non primitive?
A. Wait-die
B. Wound-wait
C. Deadlock
D. Conflict can occur
The solution is : a
(QNO110). With each transaction T1 in the system, a unit timestamp is assigned and it is
denoted by Ts (Ti) when a new transaction Tj enters the system then, the timestamp ordering
schema is called
A. Ts (Tj) < Ts (Ti)
B. Ts (Ti) > Ts (Tj)
C. Ts (Ti) < Ts (Tj)
D. Ts (Tj) > Ts (Ti)
The solution is : c
(QNO111). Concurrency can be increased by the introduction of which lock
A. Update lock
B. Exclusive lock
C. Shared lock
D. Add lock
The solution is : a
(QNO112). If a transaction, Ti requests a lock and transaction Tj holds a conflicting lock, if Ti
has higher priority than Tj, it is allowed to wait otherwise it is aborted, then it is called
A. wait-die
B. wound-wait
C. Deadlock
D. Conflict can occur
The solution is : a
(QNO113). If a transaction, Ti requests a lock and transaction Tj holds a conflicting lock if Ti has
higher priority, abort Tj otherwise if Ti waits then it is called
A. Wait-die
B. Wound-wait
C. Deadlock
D. Conflict can occur
The solution is : b
(QNO114). Which of the following one is non primitive?
A. Wait-die
B. Wound-wait
C. Deadlock
D. Conflict can occur
The solution is : b
(QNO115). Intention exclusive lock conflicts with __________________
A. Shared and exclusive lock
B. Shared and intention exclusive lock
C. Exclusive and intention shared lock
D. Intention exclusive and intention shared lock
The solution is : a
(QNO116). Which of the following protocols always ensures recoverable schedules?
A. Timestamp ordering protocol
B. Multiple granularity protocol
C. Strict timestamp protocol
D. Timestamp protocol with Thomas Write rule
The solution is : c
(QNO117). Intention shared lock conflicts only with ____________
A. Exclusive lock
B. Intention sharing
C. Shared lock
D. Extension Exclusive
The solution is : a
(QNO118). A transaction needs to read an entire file and modify a few of the records in it which
it can be read.
A. Shared and exclusive lock
B. Shared and intention exclusive lock
C. Exclusive and intention shared lock
D. Intention exclusive and intention shared lock
The solution is : b
(QNO119). After the transaction requests a certain number of locks, at that granularity so that
obtaining locks at the next higher granularity in which procedure is called
A. Granularity locking
B. Lock escalation
C. Lock intention
D. Predicate locking
The solution is : b
(QNO120). Which locking allows us to efficiently set locks on objects that contain other
objects?
A. Multiple granularity
B. Timestamp based locking
C. Graph based locking
D. Validation based locking
The solution is : a
(QNO121). Multiple granularity locking must be used with _______ to ensure serializability.
A. Concurrency control
B. Tree-based protocol
C. Two-phase locking protocol
D. Graph-based protocol
The solution is : c
(QNO122). Which of the following lock is not contained in multiple granularity locking?
A. Exclusive lock
B. Intention sharing
C. Shared lock
D. Extension Exclusive
The solution is : d
(QNO123). To lock a node in shared mode, a transaction must first lock all its ancestors in
_______________
A. Shared
B. Exclusive
C. Intention shared
D. Intention exclusive
The solution is : c
(QNO124). In multiple granularity protocol, at a particular data item, transaction Ti is holding
shared intention exclusive lock. At the same data item, transaction Tj is allowed to request which
of the following locks?
A. Intention exclusive lock
B. Intention shared lock
C. Shared lock
D. Shared intention exclusive lock
The solution is : b
(QNO125). To lock a node in exclusive mode, a transaction must first lock all its ancestors in
_____________
A. Shared mode
B. Exclusive mode
C. Intention shared mode
D. Intention exclusive mode
The solution is : d
(QNO126). All log records for a given transaction are organized in a ____________
A. Stacks
DATA BASE MANAGEMENT SYSYTEM
B. Queues
C. Linked list
D. Trees
The solution is : c
(QNO127). In a schedule consists of a 2 transactions Ti, Tj. Transaction Tj reads a data item
values that can already written by Ti, transaction Tj is committed before transaction Ti commits,
and then it is called _____________
A. Serial schedule
B. Recoverable schedule
C. Non recoverable schedule
D. Non serial schedule
The solution is : c
(QNO128). Which of the following phase not contained in recovery algorithm
A. Analysis phase
B. Design phase
C. Redo phase
D. Undo phase
The solution is : b
(QNO129). In which phase recovery algorithm identifies dirty paged in the buffer pool and
active transactions at the time of the crash
A. Redo phase
B. Undo phase
C. Analysis phase
D. Design phase
The solution is : c
(QNO130). Which one maintains some information during normal execution of transactions to
enable it to perform its task in the event of a failure
A. Recovery manager
B. Transaction manager
C. Log file
D. Concurrency control
The solution is : a
(QNO131). A log of all modifications to the database is saved on ___________
A. Stable storage
B. Concurrency control
C. Recovery manager
D. Log file
The solution is : a
(QNO132). Which one enables the recovery manager to undo the actions of aborted and
incomplete transactions and redo the actions of committed transactions
A. Stable storage
B. Log
C. Rollback
D. Cascading
The solution is : b
(QNO133). Which one saves information about active transactions and dirty buffer pool pages
Also helps reduce the time taken to recover from a crash
A. Log
B. Cross pointing
C. Check pointing
D. Recovery manager
The solution is : c
(QNO134). To recover the system which command can be used
A. Recovery
B. Rollback
C. Abort
D. Commit
The solution is : b
(QNO135). Which of the following one is a recovery algorithm
A. Wait for graph
B. ARIES
C. Strict 2PL
D. Regorious 2PL
The solution is : b
(QNO136). Computer storage that is not lost when the power is turned off then the storage is
called
A. nonvolatile stroge
B. volatile stroge
C. stable stroge
D. main momery
The solution is : a
(QNO137). Which of the following one is not a nonvolatile memory
A. Flash memory
B. Magnetic bubble memory
C. Hard disk
D. Main memory.
The solution is : d
(QNO138). Any change to a database is first recorded in the log then it is called
A. Stable storage
B. Recovery
C. Write ahead logging
D. Compensation storage
The solution is : c
(QNO139). Every page in the database contains the LSN of the most recent log record that
describes a change to this page. This log sequence number is called _____________
A. Log sequence
B. PageLSN
C. RecordLSN
D. DatabseLSN
The solution is : b
(QNO140). Which h0 of the following field is not contain in log record
A. PrevLSN
B. PageLSN
C. End
D. Type
The solution is : c
(QNO141). Which one can be used to written just before the change recorded in an update log
record is undone
A. Log record
B. Compensation
C. Log tail
D. Write ahead logging
The solution is : b
(QNO142). Most remote backup services will use a ________________ bit encryption
A. 128-448
B. 126-440
C. 256-280
D. 259-512
The solution is : a
(QNO143). Log sequence number simply be the address of _________________
A. Last byte of the log record
B. First byte of the log record
C. First bit of the log record
D. Last bit of the log record
The solution is : b
(QNO144). Which of the following action is not written in log record
A. Undoing on update
B. Redo an update
C. Updating a page
D. End
The solution is : b
(QNO145). The most recent portion of the log is called
A. List
B. Recovery
C. Log head
D. Log tail
The solution is : d
(QNO146). Every log record is given a unique id called
A. Sequence number
B. Unique number
C. Log sequence number
D. Log record number
The solution is : c
(QNO147). Which of the field is common to all log records
A. Before image
B. Offset
C. Type
D. Length
The solution is : c
(QNO148). Which of the following field for update log records
A. PrevLSN
B. TransID
C. Type
D. Offset
The solution is : d
(QNO149). Which following one not contained in Buffer pool information table
A. Offset
B. Pageid
C. Frame no
D. Dirty
The solution is : b
(QNO150). Space on disk is managed by
A. Disk space manager
B. Memory manager
C. Record space manager
D. Record space manager
The solution is : a
(QNO151). Data is read into memory for processing and written to disk for persistent storage by
A. Storage manager
B. Buffer manager
C. Record manager
D. File manager
The solution is : b
(QNO152). The disk space manager keeps track of the pages in use by the _____________
A. Record layer
B. File layer
C. Physical layer
D. Logical layer
The solution is : b
(QNO153). The file layer stores the records in a file in a collection of __________
A. Disk manager
B. Record pages
C. Memory pages
D. File pages
The solution is : a
(QNO154). The unit of information read from or written to disk is called
A. File
B. Data
C. Program
D. Page
The solution is : d
(QNO155). Disks are most important of_________ devices
A. Internal storage
B. External storage
C. Unit storage
D. Random storage
The solution is : b
(QNO156). Tapes are which type of devices
A. Sequential access
B. Random access
C. Physical data access
D. Logical data access
The solution is : a
(QNO157). Each record in a file has a unique identifier called
A. Record name
B. Record number
C. Record ID
D. File name
The solution is : c
(QNO158). How can we identify the disk address of the page containing the record
A. Pid
B. Rid
C. Fid
D. Rnumber
The solution is : b
DATA BASE MANAGEMENT SYSYTEM
(QNO159). _________ is an important abstraction in DBMS
A. Record of files
B. File of records
C. Files
D. Records
The solution is : b
(QNO160). Which are allows us to efficiently retrieve all records that satisfy search conditions
on the search key fields of the index
A. Record
B. Search key
C. Heap file
D. Index
The solution is : d
(QNO161). Which operation allows us to step through all the records in the file one at a time
A. Index
B. Scan
C. Heap
D. Search key
The solution is : b
(QNO162). The file layer stores the records in a file in a collection of _________
A. Random file
B. Sequential file
C. Heap file
D. Disk file
The solution is : c
(QNO163). Records stored in an index file is teamed as _________
A. Record entry
B. Key entry
C. File entry
D. Data entry
The solution is : d
(QNO164). Which one can be used instead of a stored file or an unordered file of records
A. Heap file organization
B. Indexed file organization
C. Search key
D. Hash file organization
The solution is : b
(QNO165). Records in a heap file are stored in
A. Contiguous order
B. Random order
C. Sequential order
D. Head order
The solution is : b
(QNO166). An index is a _____________
A. Storage area
B. Array of records
C. Data structures
D. Collection of records
The solution is : b
(QNO167). Which key is used for finding records _________
A. Search key
B. Find key
C. Key
D. Record key
The solution is : a
(QNO168). Which data structure organizes data records on disk to optimize certain kinds of
retrieval operations.
A. record
B. index
C. file
D. directory
The solution is : b
(QNO169). Which one must keep track of the pages allocated for the file
A. Heap file
B. File manager
C. Index file
D. File of records
The solution is : b
(QNO170). Which one is an important abstraction in a DBMS and is implemented by the files
and access methods layer of the code
A. index file
B. heap file
C. file of records
D. file manager
The solution is : c
(QNO171). A relation is typically stored as a _________
A. File of records
B. Index
C. Disk pages
D. Directories
The solution is : a
(QNO172). If two data entries are containing the same value for the search key field Associated
with the index then it is called
A. Identical data
B. Duplicate data
C. Error data
D. Unequal data
The solution is : b
(QNO173). Which one contains the data file
A. Data records
B. Data entries
C. Index entries
D. Both data records and data entries
The solution is : a
(QNO174). When a file is organized so that the ordering of data records is the same as or close
to the ordering of data entries in some index, then it is called
A. Clustered
B. Indexed
C. Heapified
D. Uncluttered
The solution is : a
(QNO175). When a file is organized so that the ordering of data records is not same as can not
close to the ordering of data entries in some index then it is called as
A. clustered
B. uncluttered
C. semi clustered
D. Fully clustered
The solution is : b
(QNO176). Which are based on the cost of using an index to answer a range search queues Can
vary tremendously
A. search key
B. the index is clustered
C. the index is uncluttered
D. file organization
The solution is : b
(QNO177). An index on a set of fields that not includes the primary key then it is called.
A. Secondary index
B. Index
C. Primary key
D. Ternary index
The solution is : c
(QNO178). An index on a set of fields that not includes the primary key then it is called.
A. Secondary index
B. Index
C. Primary key
D. Ternary index
The solution is : a
DATA BASE MANAGEMENT SYSYTEM
(QNO179). Which index contains the duplicates
A. Secondary index
B. Primary index
C. Ternary index
D. Both primary and secondary
The solution is : a
(QNO180). If we know that no duplicates exists in data, that is we know that the search key
contains some candidate key then we call the index is ----------.
A. unique index
B. duplicate index
C. error index
D. equal index
The solution is : a
(QNO181). The index file consist of a ___________
A. Only index entries
B. Only data entries
C. Only data records
D. Both index and data entries
The solution is : d
(QNO182). Which key can be used to fields that uniquely identify a record
A. Search key
B. Super key
C. Candidate key
D. Hash key
The solution is : c
(QNO183). To facilitate retrieval of such qualifying entries during search all leaf pages are
maintained in a _____________
A. stacks
B. queues
C. linked lists
D. double linked lists
The solution is : d
(QNO184). Which function can be used to determine the bucket to which a record belongs
A. Index function
B. Hash function
C. Binary function
D. Heap function
The solution is : b
(QNO185). Which structure can be adjusts gracefully to inserts and deletes and allow us to
retrieve the page containing a record in one to two I/O's are known as
A. Hash-based index structure
B. Tree- based index structure
C. Graph- based index structure
D. Graphical- based index structure
The solution is : a
(QNO186). Which pages contain node pointers separated by search key values
A. Only root pages
B. Leaf pages
C. Non leaf pages
D. Only middle level parents
The solution is : c
(QNO187). Which one is an index structure that ensures that all paths from the root to a leaf in a
given tree are of the same length, i.e., the structure is always balanced in height
A. binary tree
B. tree indexing
C. B+ tree
D. B tree
The solution is : c
(QNO188). Which technique can be used to organize records to quickly find records that have a
given search key value
A. Hashing
B. Indexing
C. File ordering
D. Heap
The solution is : a
(QNO189). In hash based indexing the records in a file are grouped then it is called
A. Hashing
B. Indexing
C. Buckets
D. Tree
The solution is : c
(QNO190). Where a bucket consists of a ______________
A. Primary page
B. Secondary page
C. Index
D. Error page
The solution is : a
(QNO191). Which one can be used to a hash based index structure allows us to retrieve the
primary page for the bucket in one or two disk i/o's
A. Page number
B. Index number
C. Bucket number
D. Record number
The solution is : b
(QNO192). In tree based indexing which level contains the data entries
A. Root level
B. All the parent nodes contains
C. Leaf level
D. Middle level
The solution is : c
(QNO193). The average number of children for a non leaf node is called the_______ of the tree
A. balance
B. fun in
C. fun out
D. height
The solution is : c
(QNO194). Search with range selection cost includes the
A. Cost of search only
B. Cost of retrieving the set of records only
C. Cost of deleting the set of records only
D. Cost of search plus the cost of retrieving the cost of records
The solution is : d
(QNO195). Which file has good storage efficiency and supports fast scanning and insertion of
Records
A. Hash file
B. Heap file
C. Index file
D. Clustered files
The solution is : b
(QNO196). In hash file organization which function can be used to map a record into a range of
Numbers
A. Search key
B. Hash function
C. Index function
D. Structure function
The solution is : b
(QNO197). In search with range selection the cost of the search includes the____________
A. The cost of retrieving the set of records
B. The cost of fetching the first page containing qualifying un matching records
C. The cost of fetching the first page containing qualifying matching records
D. The cost of removing the set of records
The solution is : c
(QNO198). If records to be deleted are specified by an equality or range condition, if the
condition is specified on the sort field, the first qualifying record can be located
using_____________
A. Linear search
B. Binary search
C. Random search
D. Sequential search
The solution is : b
(QNO199). Which of the following operation is not a file organization operation
A. Search with equality selection
B. Search with add selection
C. Insert a record
D. Delete a record
The solution is : b
(QNO200). Which operation can be used to fetch all records that satisfy an equality selection
A. Scan with equality selection
B. Scan with range selection
C. Scan
D. Insert a record
The solution is : a
(QNO201). Disk systems allow us to read a block of contiguous pages in a single I/O request
then it is called
A. Indexing
B. Hashing
C. Blocked access
D. Fun out
The solution is : c
(QNO202). If records to be deleted are specified by an equality or range condition, the cost of
deletion depends ____________
A. The number of pages
B. The number undeleted records
C. The number of qualifying records
D. The number of un qualifying records
The solution is : c
(QNO203). The number of leaf pages in an index depends on______________
A. Index size
B. Non leaf nodes
C. The size of a data entry
D. Heap file
The solution is : c
(QNO204). Index only evaluation on which it works equally, efficiently
A. Clustered indexes
B. Un clustered indexes
C. Hashing
D. B +trees
The solution is : b
DATA BASE MANAGEMENT SYSYTEM
(QNO205). A composite index is also likely to be larger than a_______________ search key
index
A. Multi attribute
B. Single attribute
C. Composite
D. Range
The solution is : b
(QNO206). The search key for an index contain several fields then such keys are called.
A. Search key
B. Heap key
C. Composite search key
D. Decomposite search key
The solution is : c
(QNO207). In which data entries contain more information about data record, he opportunities
for index only evaluation strategies are increased
A. Range index
B. Equality index
C. Composite index
D. Selection index
The solution is : c
(QNO208). Hash based indexing techniques are optimizes only for ____________________
selections
A. Optimal selection
B. Equality selection
C. Range selection
D. Un equality selection
The solution is : b
(QNO209). The tree based indexing techniques which kinds of selection conditions supports
efficiently
A. Only range selection
B. Optimal selection
C. Un equality selection
D. Both equality and range selection
The solution is : d
(QNO210). Indexed sequential access method which one alters
A. Random access files
B. Benefits of sequential allocation of leaf pages
C. Sequential allocation of root page
D. Sequential allocation of non-leaf pages
The solution is : b
(QNO211). Which can be used to speed up certain queries, if we recognize that the DBMS will
exploit.
A. Uncluttered indexes
B. Clustered indexes
C. Hashing indexes
D. Heap files
The solution is : a
(QNO212). If the search key is composite, in which each field in the search key is bound to a
constant
A. Range query
B. Equality query
C. Composite query
D. Selection query
The solution is : b
(QNO213). If the search key is composite, in which, not all fields in the search key bound to
constants
A. Range query
B. Equality query
C. Composite query
D. Selection query
The solution is : a
(QNO214). how much space occupancy maintained by B+ trees
A. 50%
B. 60%
C. 65%
D. 67%
The solution is : c
(QNO215). A binary search of the index file is much faster than______________
A. Binary search of header file
B. Binary search of root file
C. Binary search of index file
D. Binary search of data file
The solution is : d
(QNO216). In which data entries are in the leaf pages of the tree and additional overflow
A. Clustered index
B. Un clustered index
C. ISAM index
D. Tree index
The solution is : c
(QNO217). Each tree index page contains__________
A. One pointer more than number of keys
B. One pointer not more than number of keys
C. One pointer not more than number of indexes
D. One pointer more than number of indexes
The solution is : a
(QNO218). What mean by ISAM
A. Indexed symmetric access method
B. Indexed sequential access method
C. Indexed sequential assign method
D. Indexed symmetric assign method
The solution is : b
(QNO219). To modify a page in tree, it must be locked in_____________
A. Shared mode
B. Exclusive mode
C. Write mode
D. No lock is need
The solution is : b
(QNO220). __________ is a balanced tree in which the internal nodes direct the search and the
leaf nodes contain the data entries
A. B trees
B. B+ trees
C. R tree
D. AVL tree
The solution is : b
(QNO221). In B + tree the index file contains _______________
A. Index entries and data entries
B. Only index entries
C. Only data entries
D. Information about root node
The solution is : a
(QNO222). In B + tree every node contains m entries, where d is_____________
A. d
B. d>=m<=2d
C. d>=m>=2d
D. d<=m<=2d
The solution is : d
(QNO223). In B+ trees non leaf nodes with m index entries, how many pointers it can contain
A. m-1
B. m-2
C. m+1
D. m-3
The solution is : c
DATA BASE MANAGEMENT SYSYTEM

DBMS ONLINE BITS

 DBMS ONLINE BITS

DBMS
(QNO1). Keeping organizational information in a file-processing system has a number of major
disadvantages. Which one of the following is a major disadvantage?
A. Data consistency
B. Efficient data access
C. Data isolation
D. Concurrent access
The solution is : c
(QNO2). In file processing system, only one mechanism can be implemented for security, That
is _______________.
A. Password
B. Privilege list
C. Authorization graphs
D. Authentication
The solution is : a
(QNO3). Management of data involves _____________.
A. Defining storage structures for information
B. Providing mechanism for updation of information
C. Providing mechanisms for manipulation of information
D. Defining structure for storage of information and providing mechanisms for manipulation of
information
The solution is : d
(QNO4). File system suffers with integrity problems. Integrity problems are due to
A. Consistency constraints
B. Data redundancy
C. Data consistency
D. Data isolation
The solution is : a
(QNO5). Since data are scattered in various files, writing a new application programs to retrieve
the appropriate data is difficult. It is known as problems of ________.
A. Data isolation
B. Data redundancy
C. Data inconsistency
D. Atomic problems
The solution is : a
(QNO6). The collection of data-containing information relevant to an enterprise is referred as
______________.
A. Data
B. Database
C. Data warehouse
D. Database management system
The solution is : b
(QNO7). The primary goal of a DBMS is to provide an efficient and convenient way to
__________ data base information.
A. Store
B. Retrieve
C. Update
D. Store and retrieve
The solution is : d
(QNO8). In file system, the same information may be duplicated in several places. It is known
as_________
A. Data redundancy
B. Data inconsistency
C. Data isolation
D. Data integrity
The solution is : a
(QNO9). Data redundancy leads to higher storage and access cost. In addition it may lead
to___________.
A. Data inconsistency
B. Data isolation
C. Data atomicity
D. Data consistency
The solution is : a
(QNO10). In file system, developers enforce constraints through appropriate code in application
Programs. When new constraints are added, it is difficult to change the programs to enforce
them. This disadvantage is known as _________.
A. Integrity problem
B. Data inconsistency
C. Concurrent Access Problem
D. Security problem
The solution is : a
DBMS ONLINE BITS
(QNO11). Application programs need not be rewritten if the physical schema changes. This
property is known as ________.
A. Physical data independence
B. Logical data independence
C. Conceptual data independence
D. Internal independence
The solution is : a
(QNO12). What does physical level describe?
A. Complex low-level data structures
B. Complex high-level data structures
C. Simple low-level data structures
D. Simple high-level data structures
The solution is : a
(QNO13). What does logical level describe?
A. Complex low-level data structures
B. Simple data structures
C. Simple high-level data structures
D. Part of the entire database
The solution is : b
(QNO14). Database systems have several schemas. It can have _________ physical schema and
________ sub schemas.
A. One, many
B. One, one
C. Many, one
D. Many, many
The solution is : a
(QNO15). Which level of abstraction describes how the data are actually stored?
A. Physical level
B. Logical level
C. View level
D. External level
The solution is : a
(QNO16). Which level of abstraction describes what data are stored in the data base and what
relationships exist among those data?
A. Physical level
B. Logical level
C. View level
D. External level
The solution is : b
(QNO17). Which level describes part of the entire database?
A. Internal level
B. Logical level
C. Conceptual level
D. View level
The solution is : d
(QNO18). What does view level describe?
A. Complex low-level data structures
B. Simple data structures
C. Simple high-level data structures
D. Part of the entire database
The solution is : d
(QNO19). The collection of information stored in the database at a particular moment is called
_______
A. Instance
B. Schema
C. Subschem
D. Data model
The solution is : a
(QNO20). The over all design of the database is called the _________.
A. Instance
B. Schema
C. Subschema
D. Data model
The solution is : b
(QNO21). Which of the following is widely used to represent the semi structured data?
A. HTML
B. WHL
C. DHTML
D. XML
The solution is : d
(QNO22). Which data model is based on a perception of a real world?
A. Entity - Relationship Model
B. Relational model
C. Network data model
D. Hierarchical data model
The solution is : a
(QNO23). Which constraint expresses the number of entities to which another entity can be
associated via a relationship set.
A. Key constraint
B. Integrity constraint
C. Mapping constraint
D. Mapping cardinalities
The solution is : d
(QNO24). Object-relational data model combines features of ----------- and -------------- data
models
A. ER and relational
B. ER and object orientedal
C. Object oriented and relation
D. Object based and relational
The solution is : c
(QNO25). Which of the following model preceded the relational data model?
A. Network model
B. Object oriented model
C. Object relational model
D. Semi structured data models
The solution is : a
(QNO26). Data model is -----------------------
A. Overall design of the data base
B. Collection of conceptual tools for describing data
C. Information in the database at a moment
D. Part of the entire database
The solution is : b
(QNO27). The ER Model and the relational model provide a way to describe the design of a
database at ------------------
A. Physical level
B. Logical level
C. View level
D. External level
The solution is : b
DBMS ONLINE BITS
(QNO28). The relational model uses a collection of -------------------- to represent both data and
relationships among those data.
A. Tables
B. Tools
C. Schema
D. Instances
The solution is : a
(QNO29). Which model can be seen as extending the ER Model with notions of encapsulation
methods and object identity.
A. Object oriented data model
B. Object-relational data model
C. Network data model
D. Hierarchical data model
The solution is : a
(QNO30). Which of the following is a record-based model
A. Relational model
B. Entity relation ship model
C. Object oriented model
D. Object relational model
The solution is : a
(QNO31). Application programmers use --------------- Tools to construct forms and reports with
out writing programs
A. CASE Tools
B. Rapid application development tools
C. Program developer tools
D. Report generator tools
The solution is : b
(QNO32). -------------------- require a user to specify what data are needed and how to get that
data
A. Procedural DML
B. Non procedural DML
C. Declarative DML
D. Definite DML
The solution is : a
(QNO33). ---------------------- require a user to specify what data are needed with out specifying
how to get that data
A. Procedural DML
B. Declarative DML
C. Definitive DML
D. Coding DML
The solution is : b
(QNO34). ----------------- users form their requests in data base query
A. Naïve users
B. Application programmers
C. Sophisticated users
D. Specialized users
The solution is : c
(QNO35). Which of the following is not a database administrators routine maintenance activity?
A. Back up
B. Upgrade disk space
C. Schema definition
D. Monitoring jobs
The solution is : c
(QNO36). ----------------- language is used to specify the database schema
A. Data definition
B. Data storage
C. Data manipulation
D. Data coding
The solution is : a
(QNO37). Data definition language is used to specify ------------------
A. Data model
B. Database
C. Schema
D. Instance
The solution is : c
(QNO38). ---------------language enables users to access or manipulate data as organized by the
data model
A. Data definition
B. Data storage
C. Data manipulation
D. Data coding
The solution is : c
(QNO39). --------------------- users interact with the system by invoking one of the application
programs that have been written previously
A. Naïve users
B. Application programmers
C. Sophisticated users
D. Specialized users
The solution is : a
(QNO40). ------------------Users write specialized database application s that do not fit into the
traditional data-processing frame work.
A. Naïve users
B. Application programmers
C. Sophisticated users
D. Specialized users
The solution is : d
(QNO41). Who has central control over the data base system?
A. Data base administrator
B. Analyst
C. Data base designer
D. Application programmer
The solution is : a
(QNO42). What is the functionality of DML Compiler
A. Interprets DDL statements
B. Translates DML statements into an evaluation plan
C. Executes DML statements
D. Executes low level instructions
The solution is : b
(QNO43). Transaction performs --------------------- in a database application
A. Single logical function
B. Single physical function
C. Multiple logical functions
D. Multiple physical functions
The solution is : a
(QNO44). ---------------- executes low level instructions generated by the DML Compiler
A. Query optimizer
B. Query parser
C. Query evaluation engine
D. Query processor
The solution is : c
(QNO45). DDL interpreter records the definitions in the ----------------
A. DBMS
B. Query processor
C. Storage file
D. Data dictionary
The solution is : d
(QNO46). --------------- is a program module that provides interface between the low level data
stored in the data base and the queries submitted to the system.
A. Data base management
B. Database administrator
C. Storage manager
D. Query processor
The solution is : c
(QNO47). The storage manager implements several data structures as part of the physical system
implementation. Which of the following is not one among them?
A. Data files
B. Data dictionary
C. Indices
D. Authorization
The solution is : d
(QNO48). -------------------ensures that the data base remains in a consistent state despite system
failures.
A. Authorization and integrity manager
B. Transaction manager
C. File manager
D. Buffer manager
The solution is : b
(QNO49). --------------tests for the satisfaction of integrity constraints
A. Authorization and integrity manager
B. Transaction manager
C. File manager
D. Buffer manager
The solution is : a
DBMS ONLINE BITS
(QNO50). ----------------manages the allocation of space on disk storage
A. Authorization and integrity manager
B. Transaction manager
C. File manager
D. Buffer manager
The solution is : c
(QNO51). ----------------- is responsible for fetching data from disk storage into mainmemory
A. Authorization and integrity manager
B. Transaction manager
C. File manager
D. Buffer manager
The solution is : d
(QNO52). The set of all possible values of an attribute is the --------------
A. Attribute
B. Entity set
C. Relationship set
D. Attribute domain
The solution is : d
(QNO53). A widely used semantic data model called -------------
A. Multidimensional model
B. Relational model
C. Entity relational model
D. Binary relational model
The solution is : c
(QNO54). An entity is described using a set of --------
A. Entity set
B. Attributes
C. Tuples
D. Domain
The solution is : b
(QNO55). ER modeling technique is a -------------
A. Top down approach
B. Bottom-up approach
C. Left-right approach
D. Right-left approach
The solution is : a
(QNO56). In ER Diagram Ellipses represent.
A. Entity set
B. Relationship among entity sets
C. Attributes
D. Link between attributes and entity sets
The solution is : c
(QNO57). The set of permitted values for each attribute is called its ------
A. Attribute set
B. Attribute range
C. Domain
D. Group
The solution is : c
(QNO58). In ER diagram rectangle represents.
A. Attribute
B. Tuples
C. Entity set
D. Derived attribute
The solution is : c
(QNO59). In an ER diagram double line indicates.
A. Cardinality
B. Total participation
C. Partial participation
D. Dependency
The solution is : b
(QNO60). This ER diagram indicates
A. Strong entity set
B. Weak entity set
C. Entity set
D. Multivalued attribute
The solution is : b
(QNO61). This ER diagram indicates.
A. Attribute
B. Multivalued attribute
C. Primary key
D. Discriminating attribute of weak entity set
The solution is : c
(QNO62). In an entity relationship, y is the dominant entity and x is a subordinate entity. Which
of the following is correct?
A. Operationally, if y is deleted, so is x.
B. x is existence dependent on y.
C. Operationally, if x is deleted, so is y.
D. Operationally, if y is deleted, x remains the same.
The solution is : c
(QNO63). Each department has offices in several locations and we want to record the locations
at which each employee works. This relationship is ------------------
A. unary
B. binary
C. ternary
D. N nary
The solution is : c
(QNO64). The relationship between owner entity set and the weak entity set is.
A. Many to Many relationship
B. One to Many relationship
C. Many to One relationship
D. One to One relationship
The solution is : b
(QNO65). This ER diagram indicates.
A. Each employee has an employment history.
B. Each employee not has an employment history.
C. Each employee may or may not have an employment history.
D. Each Employeement history and Employee doesn't have any relation
The solution is : c
(QNO66). Descriptive attributes are used to ---------------
A. Record information about participating entities.
B. Record information about relationships.
C. Record information about data.
D. Record information about attribute.
The solution is : b
(QNO67). Student and courses enrolled is an example of ---------
A. One to One relationship
B. One to Many relationship
C. Many to Many relationship
D. Many to One relationship
The solution is : c
(QNO68). A--------- indicates the purpose of an entity in a relationship.
A. Entity name
B. Attribute name
C. Domain name
D. Role name
The solution is : d
(QNO69). A ------------- is an association among two or more entities.
A. Domain
B. Aggregation
C. Relationship
D. Generalization
The solution is : c
(QNO70). What is a relation?
A. a set of atomic values
B. a set of tuples
C. a collection of attributes
D. a collection of objects which contain no duplicates
The solution is : b
(QNO71). -------------- of a relationship set is a set of relationships.
A. Schema
B. Instance
C. Domain
D. aggregation
The solution is : b
(QNO72). Owner entity set and the weak entity set must participate in a One to many
relationships set. This relation ship set is called the --------------
A. Identifying relationship set of the weak entity set.
B. Identifying relationship set of the strong entity set.
C. Identifying the partial relationships.
D. Identifying strong entity set.
The solution is : a
(QNO73). Minimum cardinality of zero specifies.
A. No participation
B. Partial participation
C. Total participation
D. Zero participation
The solution is : b
DBMS ONLINE BITS
(QNO74). Participation constraints can't be represented for -------------
A. Uninary relationships
B. Binary relationships
C. Ternary relationship
D. N nary relationship
The solution is : c
(QNO75). What is not true about weak entity?
A. They do not have key attributes.
B. They are the example of attribute of existence dependency.
C. Every existence dependency results in a weak entity.
D. Weak entity will have always discriminator attributes.
The solution is : c
(QNO76). Owner entity set and the weak entity set must participate in a------------
A. One to many relationship
B. One to one relationship
C. Many to one relationship
D. Many to many relationship
The solution is : a
(QNO77). A participation that is not total is said to be.
A. Complete
B. Partial
C. Total participation
D. Incomplete
The solution is : b
(QNO78). A weak entity set always participated in a -----------
A. One to one binary relationship
B. One to many binary relationship
C. Many to one binary relationship
D. No Relationship
The solution is : b
(QNO79). Weak entity should always have --------------
A. Partial participation
B. Total participation
C. No participation
D. Zero participation
The solution is : b
(QNO80). Employee dependents is an example of a --------------------
A. Strong entity set
B. Weak entity set
C. Entity set
D. Participation entity set
The solution is : b
(QNO81). An attribute of one table matching the primary key of another table is called as
_______
A. Foreign key
B. Super key
C. Candidate key
D. Composite key
The solution is : a
(QNO82). Give the cardinality constraint on the relationship runs, where each team may have
many drag experiment runs.
A. 1:1
B. 1:N
C. N:M
D. 0:1
The solution is : b
(QNO83). Whether two subclasses are allowed to contain the same entity. It is determined by
A. Covering constraints
B. Uncovering constraints
C. Overlap constraints
D. Unoverlap constraints
The solution is : c
(QNO84). ---------- allows us to indicate that a relationship set participates in another
relationship set.
A. Generalization
B. Aggregation
C. Association
D. Dependency
The solution is : b
(QNO85). When should we use aggregation?
A. When we need to express a relationship among the attribute.
B. When we need to express a relationship among the entities.
C. When we need to express a relationship among the relationships.
D. When we need to express a relationship among the constraints
The solution is : c
(QNO86). What are the two kinds of constraints with respect to ISA hierarchies?
A. Overlap & unoverlap constraints
B. Overlap & covering constraints
C. Overlap & uncovering constraints
D. Unoverlap & covering constraints
The solution is : b
(QNO87). Whether the entities in the subclasses collectively include all entities in the super
class. It is determined by?
A. Uncovering constraints
B. Integrity constraints
C. Covering constraints
D. Overlap constraints
The solution is : c
(QNO88). A relationship set is having association with entity sets is called --------
A. Generalization
B. Aggregation
C. Association
D. Dependency
The solution is : b
(QNO89). ----------- describes the maximum number of possible relation ship occurrences for an
entity participating in a given relationship type.
A. Participation
B. Cardinality
C. Total participation
D. Partial participation
The solution is : b
(QNO90). which determines whether all are only some entity occurrences participating in a
relationship?
A. Participation
B. Cardinality
C. Total participation
D. Partial participation
The solution is : a
(QNO91). ---------------- attribute has multiple components, each of which is atomic or
composite.
A. Simple Attribute
B. Compound Attribute
C. Derived Attribute
D. Composite Attribute
The solution is : d
(QNO92). ER model is used in --------------
A. Logical design
B. Conceptual design
C. Physical design
D. View design
The solution is : b
(QNO93). -------- is a key that is a composite of several attributes.
A. Compound key
B. Super key
C. Composite key
D. Candidate key
The solution is : c
(QNO94). This ER diagram indicates.
A. Derived attribute
B. Key attribute
C. Multivalued attribute
D. Composite attribute
The solution is : a
(QNO95). The weak entity has only --------------------
A. Primary keys
B. Partial keys
C. Super keys
D. Candidate keys
The solution is : b
(QNO96). A constraint in deferred mode is checked at ----------------------
A. Runtime
B. Creation time
C. Commit time
D. Insertion time
The solution is : c
(QNO97). Translate an ER Diagram into a collection of tables with associated constraints is
called
A. Relation database
B. Multidimensional database
C. Database Schema
D. Relational database schema
The solution is : d
(QNO98). A constraint showing the maximum number of entities that can occur on a inside of a
relationship is called the -------------
A. Degree
B. Maximum Cardinality
C. Instance
D. Schema
The solution is : b
(QNO99). A relation consists of a --------------
A. Fields and Domain
B. Relation Instances and Relation schema
C. Relation Domain and Relation Instances
D. Relation schema and Relation Domain
The solution is : c
(QNO100). The relation schema describes the -------------------
A. Column heads for the table
B. Table name
C. Rows of the table
D. Group of attribute
The solution is : c
(QNO101). Cardinality of a relation Instances describes the ----------------
A. No.f columns in the table
B. No.f rows in the table
C. No.f Tables in the table
D. No.f identical rows in the table
The solution is : b
(QNO102). A set of fields that uniquely identifies a tuple according to a key constraint is called
a
A. Super key
B. Primary key
C. Foreign key
D. Candidate key
The solution is : d
(QNO103). An instance of a relation is a set of tuples also called -------------
A. Files
B. Records
C. Tables
D. Tables
The solution is : b
(QNO104). The null values are not allowed to appear in a --------------- field
A. Foreign key
B. Candidate key
C. Primary key
D. Super key
The solution is : c
(QNO105). SQL provides several alternative ways to handle foreign key violations. Which of
the following is not present among them?
A. Delete all foreign key table rows that refer to the deleted primary key table row.
B. Disallow the deletion of primary key table tuple.
C. Insert command directly on foreign key table is rejected.
D. Update command directly on foreign key table is rejected.
The solution is : d
(QNO106). SQL allows a constraint to be in -------- or ----------- mode.
A. Deferred, Immediate
B. Immediate, Postponed
C. Urgent, Deferred
D. Urgent, Postponed
The solution is : a
(QNO107). Referential integrity constraint considers------------------- key
A. Primary
B. Candidate
C. Foreign
D. Super
The solution is : c
(QNO108). . Referential integrity is synonymous to ------------------ constraint
A. Primary key
B. Domain
C. Unique
D. Foreign key
The solution is : D
(QNO109). SQL provides several alternative ways to handle foreign key violations. Which of
the following is one among them?
A. Insert command directly on foreign key table is rejected.
B. Insert command directly on foreign key table is allowed.
C. Insert command directly on primary key table is rejected.
D. Insert command directly on primary key table is allowed
The solution is : a
(QNO110). A constraint in ------------- mode is checked at statement level execution.
A. Deferred
B. Immediate
C. Write
D. Block
The solution is : b
(QNO111). Every potential integrity constraint violation is generally checked at the----------
A. Start of each SQL statement execution.
B. End of each SQL statement execution.
C. End of the Transaction.
D. Start of the transaction.
The solution is : b

 DBMS ONLINE BITS

(QNO112). Which operation does not cause a violation of domain, primary key or unique
constraints? [ D ]
A. Insertion
B. Updation
C. Updation
D. Deletion
The solution is : d
(QNO113). Deletion operation could cause violation of ----------- constraint?
A. Primary key
B. Domain
C. foreign key
D. Unique
The solution is : c
(QNO114). A constraint in deferred mode is checked at ----------
A. Compile time
B. Execution time
C. Runtime
D. Commit time
The solution is : d
(QNO115). Which of the following sentences is true with respect to translating unary
relationship set
A. Need to explicitly name the referenced field
B. Need to have domain constraints
C. Need to have unique constraints
D. Need to have a super key
The solution is : a
(QNO116). In translating weak entity set in to table, the attributes included would be ------
A. Attributes of weak entity sets only
B. Attributes of weak entity set, identifying relationship
C. Attributes of weak entity set, descriptive attributes of identifying relationship
D. Attributes of weak entity set, primary key of identifying owner
The solution is : d
DBMS ONLINE BITS
(QNO117). Translating ER Diagrams with aggregation includes --------- as attributes in the table
A. Key attributes of all entity sets
B. Key attributes of all entity sets, descriptive attributes of all relationship sets
C. Key attributes of relationship sets
D. Key attributes of an entity set, key attributes of a relationship set, descriptive attributes of
another relationship set
The solution is : d
(QNO118). Relationship set when mapped to a relation in the relational model the attributes of
the relation includes:
A. Primary keys of participating entities
B. Descriptive attributes
C. Derived attributes
D. Primary keys of participating entities, Descriptive attributes
The solution is : d
(QNO119). Overlap and covering constraints can be expressed in SQL only by using -------
A. Create table statement
B. Create table statement
C. General constraints
D. Assertions
The solution is : d
(QNO120). Logical database design includes translating ----------- model to ----------model
A. ER Model to OO Model
B. ER Model to relational model
C. Relational model to ER model
D. Relational model to physical model
The solution is : b
(QNO121). Translating ER Model into relational database schema is performed in ----------phase
of data base design
A. Conceptual design
B. Logical design
C. Physical design
D. Internal design
The solution is : b
(QNO122). Descriptive attributes are placed in --------------- table
A. Entity set
B. Attribute
C. Relationship set
D. Weak entity set
The solution is : c
(QNO123). Translating class hierarchies includes a relation for every specialized entity sets.
That relation include:
A. Attributes of specialized class
B. Attributes of specialized class & generalized class
C. Attributes of specialized class, keys of generalized class
D. Keys of specialized class ,keys of generalized class
The solution is : c
(QNO124). Which is the tabular format of given ER diagram?
A. create table Emp(ssn,name,lot,primarykey(ssn));
B. create tableEmployees(ssn,name,lot,primary key(ssn));
C. create table Employees(ssn char(11),name char(30),lot integer,primary key(name));
D. create table Employees(ssn char(11),name char(30),lot integer,primary key(ssn));
The solution is : d
(QNO125). Relational calculus languages are based on ------------
A. First order predicate calculus
B. Second order predicate calculus
C. Propositional logic
D. Partial order logic
The solution is : a
(QNO126). An expression of the domain calculus is of the form
A. { x1,x2,....,xn)| cond ( x1,x2,...xn,xn+1,xn+2 ,...,xn+m)}
B. { x1,x2,....,xn | cond (xn+1,xn+2,...,xn+m )}
C. {t| cond(t)}
D. cond(xn+1,xn+2,...,xn+m )| { x1,x2,...,xn)
The solution is : a
(QNO127). Find the names of sailors who have reserved all boats.
A. {P|∃ S∈ Sailors ∀ B∈ Boats ( ∃R ∈ Reserves (S.sid= R.sid R.bid = B.id
P.sname=S.sname))}
B. {P| ∃ S∈ Sailors ∀ B ∈ Boats (∃ R ∈ Reserves (S.sid= R.sid R.bid = B.id
P.sname=S.sname))}
C. {P|∃ S ∈ Sailors ∀ B ∈ Boats (∃ R &isin: Reserves (S.sid= R.sid R.bid = B.id
P.sname=S.sname))}
D. {P| ∃ S ∈ Sailors ∀ B ∈ Boats (∃ R ∈ Reserves (S.sid= R.sid R.bid = B.id
P.sname=S.sname))}
The solution is : a
(QNO128). Find the sailors with a rating above 7. Choose the TRC expression.
A. {S/S ∈ sailors U rating >7}
B. {S/S ∈∩, ) S.rating > 7}
C. {S/ S ∈ sailors > 7
D. {S/S ∈ S.rating >7)
The solution is : b
(QNO129). Domain relational calculus is closer to---------------
A. First order logic
B. Partial order logic
C. Second order logic
D. Domain logic
The solution is : a
(QNO130). A parameterized proposition is called a
A. Propositional logic
B. Predicate logic
C. Relational calculus
D. Partial order logic
The solution is : b
(QNO131). An expression of the tuple calculus is of the form
A. { x1,x2,....,xn)| cond ( x1,x2,...xn,xn+1,xn+2,...,xn+m)}
B. {t| cond(t)}
C. {cond (t)|t}
D. cond(xn+1,xn+2,...,xn+m )| { x1,x2,....,xn)
The solution is : b
(QNO132). Find the names of sailors who have reserved boat 103. Chook the correct TRC
Expression.
A. {P|∃ S ∈ Sailors ∃R ∈ Reserves (R.sid =S.sid ∧ R.bid = 103 ∧ P.sname= S.sname)}
B. {P|∃ S ∈ Sailors ∃R ∈ Reserves (R.sid =S.sid ∧ R.bid = 103 ∨ P.sname= S.sname)}
C. {P|∃ S ∈ Sailors ∃R ∈ Reserves (R.sid =S.sid ∨ R.bid = 103 ∨ P.sname= S.sname)}
D. {P|∃ S ∈ Sailors ∃R ∉ Reserves (R.sid =S.sid ∨ R.bid = 103 ∧ P.sname= S.sname)}
The solution is : a
(QNO133). ------------ is a variable that takes on tuples of a particular relation schema as values
A. Domain variable
B. Tuple variable
C. Relational schema
D. Relational algebra
The solution is : b
(QNO134). ----------- is a variable that ranges over the values in the domain of some attribute.
A. Domain variable
B. Tuple variable
C. Relational variable
D. Calculus variable
The solution is : a
(QNO135). Tuple relational Calculus is a -----------
A. Nonprocedural language
B. Procedural language
C. Formal language
D. Informal language
The solution is : a
(QNO136). Domain relational Calculus is a -----------
A. Nonprocedural language
B. Procedural language
C. Formal language
D. Informal language
The solution is : a
(QNO137). Cartesian product operations cardinality is
A. Card ( R ) * card ( S ) = card ( T )
B. Card ( R )> = card ( T )
C. Card ( R ) * card ( S ) >= card ( T )
D. Card ( R ) * card ( S ) < = card ( T )
The solution is : a
(QNO138). Find the name of sailors who have reserved boat 103.
A. Π name ((σbid = 103 reserves ) sailors)
B. (σname ((Π bid =103 reserves) sailors)
C. Π name (( Π bid =103 reserves )) sailors)
D. Π name (( (σbid = 103 reserves )>= sailors)
The solution is : a
(QNO139). Which of the following is the selection property?
A. Idempotent
B. Transitive
C. Symmetric
D. Anti symmetric
The solution is : a
(QNO140). Find the names of sailors who have reserve at least one boat----------
A. Π sname ( sailors U resrves)
B. Πsname ( sailors resrves)
C. Πsname ( sailors ) resrves)
D. Πsname ( sailors Π resrves)
The solution is : b
DBMS ONLINE BITS
(QNO141). The --------- operation selects tuples that satisfy a given predicate.
A. Projection operation
B. Selection operation
C. Join operation
D. Union operation
The solution is : b
(QNO142). In the following which is not a unary operation?
A. Selection
B. Projection
C. Rename
D. Set difference
The solution is : d
(QNO143). Relational algebra is -------------
A. Nonprocedural language
B. Procedural language
C. Formal language
D. Informal language
The solution is : b
(QNO144). In the following which is not a binary operation.
A. Difference
B. Theta join
C. Projection
D. Natural join
The solution is : c
(QNO145). Selection operation indicated with------------------
A. σ
B. Π
C. X
D.
The solution is : a
(QNO146). If P and Q are predicates and P is the relational algebra expression then which of the
following equivalence are valid
A. &Pip (&piq (e) >= &piq (&pip (e))
B. &Pip (&piq (e)) =< &pip)q (e)
C. &Piq (&pip (e)) = &pip)q (e)
D. &Pip (&piq (e)) = &pip)q (e)
The solution is : c
(QNO147). Find the equivalent relational algebra. SELECT guestname, guestaddress FROM
guest
A. &piguest name,guset address
B. &sigma guest name,guset address
C. &piguestname, gusetaddress (guest)
D. &sigma guestname, gusetaddress (guest)
The solution is : c
(QNO148). ---------------- lists the table for joining the from clause of a SELECT statement using
command to separate them
A. Explicit join notation
B. Implicit join notation
C. Outer join notation
D. Inner join notation
The solution is : b
(QNO149). Equi join is a specific type of ---------------
A. Equivalence based join
B. Not Equivalence based
C. Comparator based join
D. Unconditional join
The solution is : c
(QNO150). Selection is associative with projection if and only if ------------
A. The fields referenced in the selection condition are a subset of the fields in the projection.
B. The fields referenced in the selection condition are a superset of the fields in the projection.
C. The fields referenced in the projection condition are a superset of the fields in the selection.
D. The fields referenced in the projection condition are a subset of the fields in the selection.
The solution is : a
(QNO151). Projection is distributive over -----------------
A. Cross product
B. Projection
C. Set difference
D. Selection
The solution is : c
(QNO152). ---------- refer to a language that is complete with respect to first order predicate
calculus apart from the restrictions.
A. Relational algebra
B. Relational calculus
C. Relational completeness
D. Relational query
The solution is : c
(QNO153). -------- does not require each record in the two joined tables to have a matching
record.
A. Inner join
B. Outer join
C. Natural join
D. Cross join
The solution is : b
(QNO154). The join condition is identical to a--------------- in form
A. Projection condition
B. Selection condition
C. Union condition
D. Cross product
The solution is : d
(QNO155). Selection is distributed over the ----------------
A. Set difference
B. Cross product
C. Projection
D. Intersection
The solution is : d
(QNO156). Which operator is used for pattern matching in SQL query
A. LIKE
B. %
C. _
D. .^
The solution is : a
(QNO157). Which operator stands for zero or more arbitrary characters in SQL query
A. LIKE
B. %
C. _
D. .^
The solution is : b
(QNO158). _______ clause of a query specifies selection conditions on the tables mentioned in
the FROM clause.
A. SELECT
B. FROM
C. WHERE
D. DISTINCT
The solution is : c
(QNO159). Which operator stands for exactly one arbitrary character in SQL query
A. LIKE
B. %
C. _
D. .^
The solution is : c
(QNO160). SQL: 1999 includes a more powerful version of the LIKE operator called ___
A. SIMILAR
B. SAME
C. MATCH
D. SIMI
The solution is : a
(QNO161). ______ evaluation strategy is a way to evaluate the query that is intended to be easy
to understand rather than efficient.
A. Conceptual
B. Descriptional
C. Horizontal
D. Vertical
The solution is : a
(QNO162). _______ clause of a query specifies columns to be retained in the result.
A. SELECT
B. FROM
C. WHERE
D. DISTINCT
The solution is : a
(QNO163). _______ clause of a query specifies a cross product of tables.
A. SELECT
B. FROM
C. WHERE
D. DISTINCT
The solution is : b
(QNO164). _________ keyword is used to eliminate duplicates in the result of a query.
A. SELECT
B. FROM
C. WHERE
D. DISTINCT
The solution is : d
DBMS ONLINE BITS
(QNO165). The language used in application programs to request data from the DBMS is
referred as the -----------
A. DML
B. DDL
C. query language
D. DCL
The solution is : a
(QNO166). A standard for data access query language is __________
A. DML
B. DDL
C. SQL
D. DCL
The solution is : a
(QNO167). We can substitute ____________ for '=any and _________ for '! =any'?
A. all, in
B. all, any
C. in, not in
D. all, no tin
The solution is : c
(QNO168). SELECT DISTINCT T.branchname FROM branch T, branch S WHERE T.assets>
S.Assets AND S.branchcity=HYDfinds the name of
A. All branches that have greater assets than some branch located in HYD.
B. All branches that have greater assets than all branch located in HYD.
C. All branches that have greater assets in HYD.
D. Any branch that has greater assets than any branch located in HYD.
The solution is : a
(QNO169). Consider the relation Examinee (regno, name, score) where regno is the primary key
and score is a real number. An SQL query to list the regno of Examinee who have a score greater
than the average score.
A. SELECT regno FROM Examinee WHERE score> avg (score).
B. SELECT regno, avg (score) FROM Examinee WHERE score > avg (score).
C. SELECT regno FROM Examinee WHERE score> (SELECT avg (score) FROM Examinee).
D. SELECT regno, avg (score) FROM Examinee WHERE score < avg (score).
The solution is : c
(QNO170). Correlated sub query is a
A. Query evaluated once for the entire parent statement.
B. Evaluated once for every row processed by the parent statement.
C. Query evaluated once only.
D. The query will never be evaluated.
The solution is : b
(QNO171). Sailors (Sid, sname, rating, age)
Reserves (Sid, bid, day)
Boats (bid, bname, color)
SELECT S.sname FROM Sailors S WHERE S.Sid
NOT IN (SELECT R.Sid FROM Reserves R WHERE R.bid IN
(SELECT B.bid FROM Boats B WHERE B.color='red'')
A. Retrieves the names of sailors who have reserved a red boat.
B. Retrieves the names of sailors who have not reserved a red boat.
C. The names of sailors who have reserved all boats expected red boat.
D. It retrieves the all sailors details
The solution is : b
(QNO172). Employee (fname, minit, lname, ssn, bdate, address, sex, salary, superssn, dno) SQL
query to retrieve the names of all employees who do not have supervisors?
A. SELECT fname, lname FROM Employee WHERE superssn=0.
B. SELECT fname, lname FROM Employee WHERE superssn=NULL.
C. SELECT fname, lname FROM Employee WHERE ssn IS NULL.
D. SELECT fname, lname FROM Employee WHERE superssn IS NULL.
The solution is : d
(QNO173). A ____________ is a query that has another query embedded within it.
A. Nested query
B. Relational query
C. Multi dimensional query
D. Algebraic query
The solution is : a
(QNO174). I n SQL ------------ command we can use to sort the table.
A. Group by clause
B. Having clause
C. Order by clause
D. Where clause
The solution is : c
(QNO175). Which SQL statements used to update the data from databases?
A. Save
B. update
C. modify
D. save as
The solution is : b
(QNO176). The ___________ statement is used to add or drop columns in an existing table.
A. DROP TABLE
B. DELETE TABLE
C. ALTER TABLE
D. INSERT TABLE
The solution is : c
(QNO177). With SQL, how do you select all the records from a table named ''Persons'' where
The value of the column ''FirstName'' is ''Peter''?
A. SELECT [all] FROM Persons WHERE FirstName='Peter'.
B. SELECT [all] FROM Persons WHERE FirstName LIKE 'Peter'.
C. SELECT * FROM Persons WHERE FirstName='Peter'.
D. SELECT * FROM Persons WHERE FirstName LIKE 'Peter'.
The solution is : c
(QNO178). Consider the join of a relation R with a relation S. if R has m tuples and S has n
tuples then the maximum and minimum sizes of the join respectively are ____________
A. +n and 0
B. mn and 0
C. m+n and (m-n)
D. mn and m+n
The solution is : b
(QNO179). We can disallow null values by specifying ___ as part of the field definition.
A. NO NULL
B. NOT NULL
C. ! NULL
D. != NULL
The solution is : b
(QNO180). _______ keyword specifies that the join condition is equality on all common
attributes.
A. COMMON
B. GENERAL
C. NATURAL
D. EQUAL
The solution is : c
(QNO181). MAX ( A ) aggregate operator gives ________
A. Maximum value in column A
B. Maximum value in row A
C. Maximum value in row A and column A
D. Maximum of table A
The solution is : a
(QNO182). The number of unique values in the column A can be obtained by ___
A. COUNT( [DISTINCT] A)
B. COUNT ( A )
C. COUNT ( [UNIQUE] A)
D. COUNT ( [A] )
The solution is : a
(QNO183). When a column value is unknown or inapplicable, then it is treated as ___ in SQL
A. Null
B. Zero
C. 1
D. Any value
The solution is : a
(QNO184). SQL provides ___ special comparison operator to test whether a column value is
null.
A. IS NULL
B. NULL
C. ARE NULL
D. NOTNULL
The solution is : a
DBMS ONLINE BITS
(QNO185). OR of two arguments evaluates to ____ if one argument evaluates to false and the
other evaluates to unknown.
A. true
B. false
C. unknown
D. cant be determined
The solution is : c
(QNO186). AND of two arguments evaluates to ____ if one argument evaluates to unknown and
the other evaluates to true or unknown.
A. true
B. false
C. unknown
D. cant be determined
The solution is : c
(QNO187). Tuple variables in sql are defined in
A. From clause
B. Select clause
C. Where clause
D. Having clause
The solution is : a
(QNO188). SQL is relationally
A. Complete language
B. Incomplete language
C. Cant handle certain relations
D. Sound language
The solution is : a
(QNO189). Constraints not associated with any one table are called as _____
A. Associations
B. Assistants
C. Assertions
D. Associated conditions
The solution is : c
(QNO190). I n SQL __________ command we can use to sort the table.
A. Group by clause
B. having clause
C. order by clause
D. where clause
The solution is : c
(QNO191). A User can define a new domain using the _______ statement
A. CREATE DOMAIN
B. MAKE DOMAIN
C. MADE DOMAIN
D. FORM DOMAIN
The solution is : a
(QNO192). CHECK clause is used for constraints over ______
A. A single table only
B. Two tables only
C. Three tables only
D. Four tables only
The solution is : a
(QNO193). ____ keyword is used to associate a default value with a domain
A. DEFAULT
B. ANY
C. UNKNOWN
D. ALL
The solution is : a
(QNO194). Which command is not used in DCL.
A. COMMIT
B. GRANT
C. ROLLBACK
D. SET TRANSACTION
The solution is : b
(QNO195). Which command is not used in DDL.
A. DROP
B. REVOKE
C. ROLLBACK
D. COMMENT
The solution is : c
(QNO196). SQL is used for
A. Data processing in batch mode
B. Query for relational databases
C. Dtp work
D. Command line arguments
The solution is : b
(QNO197). ____ , ______ keywords are used to refer to the values before and after modification
A. Before, after
B. Old, new
C. Older, newer
D. Before, after
The solution is : b
(QNO198). In _______ triggers, the execution of the action part of a trigger could again activate
the same trigger.
A. Repetitive
B. Recursive
C. Called
D. Calling
The solution is : b
(QNO199). ____ is a procedure that is automatically invoked by the DBMS in response to
specified changes to the database.
A. Trigger
B. Assertion
C. Active database
D. Passive database
The solution is : a
DBMS ONLINE BITS
(QNO200). ___ is a procedure that is executed when the trigger is activated and it's condition is
true.
A. Event
B. Condition
C. Action
D. Assertion
The solution is : c
(QNO201). _____ clause is used for row-level triggers.
A. FOR EACH ROW
B. FOR ROW
C. EACH ROW
D. ROW
The solution is : a
(QNO202). A database that has a set of associated triggers is called an ________
A. Active database
B. Passive database
C. Data warehouse
D. Associated database
The solution is : a
(QNO203). A trigger description contains ______ parts
A. 2
B. 3
C. 4
D. 5
The solution is : b
(QNO204). Which of the following is not a part of a trigger description
A. Event
B. Condition
C. Action
D. Assertion
The solution is : d
(QNO205). ______ is a change to the database that activates the trigger
A. Event
B. Condition
C. Action
D. Assertion
The solution is : a
(QNO206). ___ is a query or test that is run when the trigger is activated
A. Event
B. Condition
C. Action
D. Assertion
The solution is : b