Scribd
Upload
323 views

DBMS - Internal Assessment Question Paper

This document provides a summary of an internal assessment test for a Database Management Systems course. It includes 10 multiple choice and written response questions across two sections worth a total of 50 marks. The questions cover topics such as RAID levels, B-tree construction, hash structures, SQL queries, join strategies, query optimization, distributed database design, and the ODMG data model. Students have 90 minutes to complete the exam.

Uploaded by

Gayuscribd
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
323 views

DBMS - Internal Assessment Question Paper

This document provides a summary of an internal assessment test for a Database Management Systems course. It includes 10 multiple choice and written response questions across two sections worth a total of 50 marks. The questions cover topics such as RAID levels, B-tree construction, hash structures, SQL queries, join strategies, query optimization, distributed database design, and the ODMG data model. Students have 90 minutes to complete the exam.

Uploaded by

Gayuscribd
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Internal Assessment Test-III Max.Marks :50


2020-2021(Even) Duration :90 mins
Sub Code : CS8492 Branch : CSE
Year/Sem : III/04
Sub Name : Database Management Systems
Answer all Questions
PART - A (5x 2 = 10)
Sl.no Questions Blooms
CO
Level*
1 Which of the RAID levels yield the least amount of B4
CO4
interferences between the yield and ongoing disk access?
2 Construct B tree for the following values in order 4. CO4 B3
{1,2,3,4,5,6,7,8,9,10}
3 Why is a hash structure not the best choice for a search key CO4 B4
on range queries likely?
4 If (read-only queries/ update queries)>1, do the replication CO5 B5
strategies work or fail? Justify

5 Write a SQL query with collective datatypes, array and CO5 B3


multiset for type library_book.

PART- B (5x 8= 40)


Sl.no Blooms
Questions CO
Level*

6.a CO4 B6

The relation “takes” is as follows:


Give a file structure of these relations that uses multitable
clustering.
(Or)
6.b Create Primary and Secondary index for the following CO4 B5
Section relation.

7.a Construct B+ tree for the following data items CO4 B3


{1,4,7,10,17,21,31,25,19,20,28,42}, Keep the order(4).
(Or)
7.b Construct B+ tree with the following search key values. CO4 B4
{Super,Fuzzy,Backup,Lack,Facebook}. Note:3 Pointers
can fit in one node. Now show the structure of B+ tree
after deleting the value ‘Fuzzy’.
8.a Let relations r1(A, B,C) and r2(C, D, E) have the CO4 B3
following properties: r1 has 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 r2:
a. Nested-loop join.
b. Block nested-loop join.
c. Merge join
(Or)
8.b Optimize the following query using heuristics. CO4 B3
SELECT ISBN,book-title,category,price
FROM Book B, Publisher P
WHERE P.PID=B.PID AND Pname=”xyz publications”
AND Price>300;
9.a Illustrate an algorithm for allocating data in a distributed CO5 B5
database. Consider there are 5 sites where the data is
distributed. Justify your technique with respect to
replication, selection and projection costs, table update
costs, site capacities.

(Or)
9.b Design a distributed database system for online shopping. CO5 B6

10.a Discuss about ODMG Model. Create a type person with CO5 B4
name, no, address, dob and age. Create subtypes employee
with salary, doj and student with cgpa for the person type.
Create 3 tables respectively and write queries showing
type inheritance and table inheritance.

(Or)
10.b Explain in brief about Object Query Language (3) CO5 B3
Find out all open Tickets from train ticket reservation
database tables where the attribute “status” is not defined
in the class Ticket, but in each derived class (3)
Retrieve the members of a team whose age >25 (2)

You might also like