Scribd
Upload
9 views4 pages

CT3 Question Bank

Uploaded by

Mirsha R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views4 pages

CT3 Question Bank

Uploaded by

Mirsha R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

CT3 Question Bank

Any query issued to the database is first picked by ____


a. optimizer b. parser
c. Query processor d. translator

______optimization transforms query tree by using set of rules


a. cost based b. heuristic
c. memory based d. time based

The selectivity of condition to get the estimated number of tuples nr – size((r))


is the condition for
a. conjunction b. disjunction
c. Negation d. association
____________Dependency occurs when a nonprime attribute is functionally
dependent on part of a candidate key.
a. Partial b. Transitive
c. Functional d. Multivalued
______rule is not a Armstrong’s Axiom
a. Reflexivity b. transitivity
c. Pseudo transitivity d. augmentation

The tables and columns are verified on


a. Data dictionary b. storage disk
c. compiler d. Memory

Materialized view is the view whose contents are______


a. computed not stored
b. computed and stored
c. only computed
d.only stored

____________is used to minimize the redundancy from a relation or set of


relations.
a. Join statements
b. Dependancy
c. Normalization
d.Interdependancy
The transaction said to be successfully executed when __________statement is
executed
a. commit b. rollback
c. set transaction d. begin transaction
In order to maintain transactional integrity and database consistency, what
technology does a DBMS deploy?
a. Triggers b. Pointers
c. Locks d. Cursors

_____ defines what algorithm used for each operation


a. Storage b.Coding
c. Evaluation Plan d.Algorithm
Which of the following belongs to transaction failure
a.Read Error b. Boot Error
c. System crash d. Logical Error

The time complexity of dynamic programming


a. O(3n) b. O(2n)
c. O(n) d. O(3n)
In representing statistical information for cost estimation the size of tuple r
a. nr b. br
c. lr d. fr
Materialized view is the view whose contents are______
a. computed not stored
b. computed and stored
c. only computed
d.only stored

The transaction said to be successfully executed when __________statement is


executed
a. commit b. rollback
c. set transaction d. begin transaction

In order to maintain transactional integrity and database consistency, what


technology does a DBMS deploy?
a. Triggers b. Pointers
c. Locks d. Cursors
Which of the following are introduced to reduce the overheads caused by the
log-based recovery?
a.Checkpoints b. Indices
c.Deadlocks d. Locks
The property of a transaction that persists all the crashes is
a. Atomicity. b. durability
c. concurrency d. isolation
The log is a sequence of _________ recording all the update activities in the
database.
a. Log records b. Records
c. Entries d. Redo

The ____________ scheme uses a page table containing pointers to all pages;
the page table itself and all updated pages are copied to a new location.
a. Shadow copy b. Shadow Paging
c. log records d. Log paging
The failure occurred sufficiently early during the transfer that the destination
block remains intact.
a. Partial failure b. Blocks
c. Reads d. Build

8 marks

Unit 4
1. How locks are helpful in preventing concurrency? Explain about two phase
locking protocol.
2. Explain the required properties of transaction with examples.
3. What is conflict serializability?. How it can be tested and avoided?
4. How can dead lock be prevented? Explain with neat diagram various steps
involved
5. What are the recovery schemes available for transactions?
6. What are checkpoints? Where it is used?

Unit 5
1. Explain the how query optimization is done with example
2. How are fixed and variable records maintained in a file?
3. Illustrate different types of ordered indices in files
4. What is indexing in file storage?. Explain with example
5. Explain extendable hash function with example.
6. Explain selection and join algorithm used for query processing

15 marks
Higher order thinking Questions
Unit 4
1. Consider the following schedule
R(X) denotes read operation on data item X by Transaction Ti.
W(X) denotes write operation on data item X by Transaction Ti.
Explain whether this schedule is recoverable or cascadeless.
2. Consider the following schedule

R(X) denotes read operation on data item X by Transaction Ti.


W(X) denotes write operation on data item X by Transaction Ti.
Identify the possible number of view serializable schedule of the above
schedule S.

Unit 5
1.Consider a hash table with 8 slots. The hash function is h(X) = X mod 8. The
collisions are resolved by chaining. Find out the maximum, minimum, and
average chain lengths in the hash table. If the keys are inserted in the following
order: 3, 18, 29, 25, 30, 43, 52, 67, and 70.

2. Explain with neat diagram how insertion is done in B+tree for the following
sequence 3,9,16.20.32,24,36,76,72,84,90,48,61,53,69
of key 56?

You might also like