AAA COLLEGE OF ENGINEERNG AND TECHNOLOGY

Kamarajar Educational Road, Regulation :

Amathur, Sivakasi – 626 005. 2021
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING
UNIT IV QUESTION BANK
Name of the Course Instructor: Ms.K.Anuradha Class / Semester:II /IV
Course Code & Name : CS3492 & Database Management Systems
Academic Year: 2024 – 2025 Date of Exam :

COURSE OUTCOMES:
On Completion of the course, the students should be able to:
Construct SQL Queries for applications using relational databases RE
CO-1
CO-2 Design database using ER model and normalize the database UN
CO-3 Construct queries to handle transaction processing and maintain UN
consistency of the database
Compare and contrast various indexing strategies and apply the AP
CO-4 knowledge to tune the performance of the database
Analyse how advanced databases differ from Relational Databases and AP
CO-5 find a suitable database for the given requirement

COURSE ASSESSMENT MATRIX:

Cours P
e O PO PO PO PO PO PO PO PO PO PO PO PS PS PS
Outco 1 2 3 4 5 6 7 8 9 0 11 12 O1
1
O
2
O
3
me s
CO4 3 2 3 2 - - - - 3 2 3 3 2 2 3

INTERNAL TEST II - QUESTION BANK

UNIT – I (First Half)
PART – A
1 Define B-Tree? RE,CO4
2 What is a B+-Tree index? RE,CO4

3 Define MTTR and MTTF. RE,CO4

4 Discuss about the two main goals of parallelism and how to achieve them. UN,CO4

5 What are the factors to be taken into account when choosing a RAID level? RE,CO4

Define Primary index and Secondary Index. RE,CO4

6
7 List out the disadvantages of B-Tree over B+ Tree? RE,CO4

8 What are the factors needed to evaluate the technique of ordered indexing and RE,CO4
hashing?

9 List the merits and demerits of B+ tree index structure RE,CO4

10 Differentiate between dense index and sparse index. UN,CO4

PART – B
i) Explain in detail about RAID and its various levels with a neat sketch. UN,CO4
1 ii) Discuss about Data dictionary Storage and Column Oriented Storage

Describe the different types of file organization. Explain using a sketch of each UN,CO4
2 of them, with their advantages and disadvantages.

Explain in detail about various indexing techniques with relevant example. UN,CO4
3
4 Discuss about the various approaches of organizing records in file with suitable UN,CO4
example.

5 i) Explain in detail about B+ tree with an example. (6) UN,CO4

ii) Discuss about the algorithm for insertion & deletion operation in B+ tree. (7)

PART – C
Construct a B+ tree for the following set of key values :
1 (2, 3, 5, 7, 11, 17, 19, 23, 29, 31). Assume that the tree is initially empty and AP,CO4
values
are added in ascending order. Construct B+ trees for the cases where the
number of pointers that will fit in one node is as follows:
a) Four
b) Six
c) Eight.
2 Construct B tree of order 3 for the following data: 20, 10, 30, 15, 12, 40, 50, AP,CO4
62, and 45

UNIT – II (Second Half)

PART – A
1 Differentiate Static hashing and Dynamic hashing UN,CO4

2 What is a hash index? RE,CO4

List out the mechanisms to avoid collision during hashing RE,CO4

3
4 Define query processing? RE,CO4

5 Discuss about query evaluation plan. UN,CO4

6 State the need for Query Optimization. RE,CO4

7 List out the Cost Components of Query Execution. RE,CO4

List out the advantages and disadvantages of extendable hashing? RE,CO4

8
9 What are the Cost functions for SELECT Operation? RE,CO4

10 Define Cost Estimation in Query Optimization. RE,CO4

PART – B
1 i) Discuss the basic steps in query processing with a neat diagram. (7) UN,CO4
ii) With simple algorithms, explain the computing of nested loop join and
block nested loop join. (6)

2 Explain the algorithms for SELECT and JOIN operations in estimating the query UN,CO4
cost

3 Explain in detail about UN,CO4

i) Static hashing (6)
ii) Dynamic hashing with an example. (7)

4 i) Explain in detail about Heuristic optimization algorithms. (7) UN,CO4

ii) Explain about the various measures of cost in estimating the query cost. (6)

5 Discuss about the following UN,CO4

i) Open Hashing (6)
ii) Insertion of data using Extendable Hashing (7)

PART – C
 1 The following key values are organized in an extendable hashing technique. 1,
AP,CO4
3, 5,
8, 9, 12, 17, 28. Show the extendable hash structure for this file if the hash
function
is h(x) = x mod 8 and buckets can hold three records. Show how the extendable
hash structure changes as the result of each of the following steps:
INSERT 2.
INSERT 24.
DELETE 5.
DELETE 12

2 Let relations r1(A, B,C) and r2(C, D, E) have the following properties: r1 has AP,CO4
20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one block, and 30
tuples
of r2 fit on one block. Estimate the number of block transfers and seeks
required,
using each of the following join strategies for r1 1
r2:
a. Nested-loop join.
b. Block nested-loop join.
c. Merge join

Prepared By​ Approved By

(Ms.K.Anuradha)​ HoD-CSE
Course Instructor