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
