Scribd
Upload
4 views

DBMS-CAT3

This document outlines the Continuous Assessment Test III for M.Sc in Software Systems at Kongu Engineering College, focusing on Database Management Systems. It includes a variety of questions divided into two parts, covering topics such as functional dependencies, normalization, RAID levels, and indexing mechanisms. The test is designed to assess students' understanding and application of database concepts, with a total of 50 marks available.

Uploaded by

jayabalanakshaya
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
4 views

DBMS-CAT3

This document outlines the Continuous Assessment Test III for M.Sc in Software Systems at Kongu Engineering College, focusing on Database Management Systems. It includes a variety of questions divided into two parts, covering topics such as functional dependencies, normalization, RAID levels, and indexing mechanisms. The test is designed to assess students' understanding and application of database concepts, with a total of 50 marks available.

Uploaded by

jayabalanakshaya
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/ 5

KONGU ENGINEERING COLLEGE, PERUNDURAI, ERODE – 638 060

CONTINUOUS ASSESSMENT TEST - III April 2025

Roll Number………………..
Programme : M.Sc Date :
Branch : Software Systems Time :
Semester : IV
Course Code : 22IST42 Duration : 1 ½ Hours
Course Name : Database Management Systems Max Marks : 50

PART-A (10X2=20 Marks)


Answer all questions
1. Give your suggestions to identify the good relation in database. [CO4,K3]
2. Consider the following decomposition, identify the issue in this kind of decomposition, [CO4,K3]
employee(ID, name, street, city, salary)
into
employee1 (ID, name)
employee2 (name, street, city, salary)

3. Given a relation R(A, B, C, D) with functional dependencies F = {A → B, B → [CO4,K3]


C, C → D}, find the closure of {A} (A⁺).
4. Decompose the schema into BCNF. [CO4,K3]

in_dep (ID, name, salary, dept_name, building, budget )


5. A university database has StudentID, Name, Course, Instructor with F = {StudentID → [CO4,K3]
Name, Course → Instructor}. Is {StudentID, Course} a superkey? Prove.
6. Interpret the factors for choosing RAID level. [CO5,K2]
7. In a sequential file organization, you insert a new record with a key value that [CO5,K3]
should be placed in the middle of the file. What happens to the existing records?
How are they affected during the insertion process?
8. You are designing an index for a table storing Employee Records. The table has [CO5,K3]
columns EmployeeID, Name, Age, and DepartmentID. The EmployeeID is the primary
key, and many employees belong to the same DepartmentID. Would you choose a
dense index or a sparse index for indexing EmployeeID? Justify your choice.
9. Classify ordered indices. [CO5,K2]
10. If hash storage space is 1000 records. The available data record for storage is [CO5,K3]
1100. How do you handle this situation?

PART-B (3X10=30 Marks)

11. Given the set of functional dependencies: [CO4,K3]


F = {A → B, B → C, A → C, C → D, AD → E} Identify and remove redundant
functional dependencies to obtain the minimal cover.
12. Apply 1NF,2NF, 3NF and BCNF to the following relation [CO4,K3]

StudentID StudentName Course Instructor Grade

201 John Doe Math Dr. Smith A

201 John Doe Science Dr. Brown B+

202 Alice Lee Math Dr. Smith A-

203 Bob Miller History Dr. Green B

13. Explain in detail about RAID level in disk storage. [CO5,K2]

14. Illustrate indexing and hashing mechanism for storage. [CO5,K2]

Blooms Rememberin Understanding Applying Analyzing Evaluating Creating


Taxonomy g [K2] [K3] [K4] [K5] [K6]
[K1]
% - 40 60 - - -

KONGU ENGINEERING COLLEGE, PERUNDURAI, ERODE – 638 060


CONTINUOUS ASSESSMENT TEST - III April 2025

Roll Number………………..
Programme : M.Sc Date :
Branch : Software Systems Time :
Semester : IV
Course Code : 22IST42 Duration : 1 ½ Hours
Course Name : Database Management Systems Max Marks : 50

PART-A (10X2=20 Marks)


Answer all questions
1. Consider r(A,B ) with the following instance of r. Whether it achieves functional [CO4,K3]
dependency in the case A  B and BA.
A B
1 4
1 7
3 5
2. If F = {X → Y, Y → Z, Z → W}, does X → W hold? Justify using closure. [CO4,K3]
3. In an employee database, attributes are EmpID, Name, Department, Manager, [CO4,K3]
Salary with F = {EmpID → Name, Department, Department → Manager,
Manager → Salary}. Find the closure of {EmpID}.
4. For given relation F = {AB ® C, A ® D, D ® C} whether AB ® C is extraneous or not? [CO4,K3]
Prove.
5. Interpret the Armstrong’s axioms for closure. [CO4,K2]
6. A small business with an online database system needs to choose a RAID level [CO5,K3]
for its disk array. The system requires high availability (data redundancy) but
can tolerate some performance degradation. Which RAID level would you
recommend: RAID 1, RAID 5, or RAID 0?
7. Suppose you have a file containing 1000 records, and you create an index on a [CO5,K3]
field called ProductID. How would a dense index on ProductID differ from a
sparse index on the same field in terms of storage and performance?
8. You are designing an indexing strategy for a large database that stores book [CO5,K3]
records, with fields like BookID (primary key) and Title. You decide to create
an index on BookID. What are the advantages and disadvantages of using a
dense index for this table?
9. Compare sparse index and dense index. [CO5,K2]
10. In hash index, storage space is not enough for given record. How do you handle [CO5,K3]
this situation.
PART-B (3X10=30 Marks)

11. Apply 1NF,2NF, 3NF and BCNF to the following relation [CO4,K3]

Employee_Project Table (UNF)

EmpID EmpName ProjectID ProjectName HoursWorked Manager

101 Alice P1 WebApp Dev 20 Mr. Smith

101 Alice P2 AI Research 25 Dr. Brown

102 Bob P1 WebApp Dev 30 Mr. Smith

103 Charlie P3 Data Analytics 15 Dr. Green

103 Charlie P2 AI Research 20 Dr. Brown

12. Illustrate functional dependency theory. [CO4,K2]


13. In a B+ Tree of order 4, the following keys are present: 10, 20, 30, 40, 50, 60, [CO5,K3]
70. Delete the key 30. Show the final tree structure after deletion.
14. Explain in detail about hash indexing for optimized storage. [CO5,K2]

Blooms Rememberin Understanding Applying Analyzing Evaluating Creating


Taxonomy g [K2] [K3] [K4] [K5] [K6]
[K1]
% - 40 60 - - -

You might also like