Scribd
Upload
8 views3 pages

Assignment 2 QP DBMS

This document is an assignment for B.Tech. students in Information Technology at K.S. Rangasamy College of Technology, focusing on Database Management Systems. It includes questions on designing dense and sparse indexes for employee records, illustrating insertion and deletion operations, and inserting keys into a B-Tree. Additionally, it requires students to check the conflict serializability of a given schedule.

Uploaded by

Pro Pro
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
8 views3 pages

Assignment 2 QP DBMS

This document is an assignment for B.Tech. students in Information Technology at K.S. Rangasamy College of Technology, focusing on Database Management Systems. It includes questions on designing dense and sparse indexes for employee records, illustrating insertion and deletion operations, and inserting keys into a B-Tree. Additionally, it requires students to check the conflict serializability of a given schedule.

Uploaded by

Pro Pro
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/ 3

K.S.

RANGASAMY COLLEGE OF TECHNOLOGY, TIRUCHENGODE – 637 215


IT
(An Autonomous Institution, Affiliated to Anna University, Chennai)

Assignment II
Programme / B.Tech. & Information Technology Semester IV
Branch
Course Code &
60 IT 402– Database Management Systems Date of Issue 29.04.2024
Name
Date of
Maximum Marks 50 08.05.2024
Submission

Answer ALL Questions 50 marks

Q. Questions Bloom’s CO Mark


No. Level

1. Sample Data: Let's assume we have the following sample data for employee
records:
Employee ID Name Department Salary
101 John Doe Sales $50,000
102 Jane Smith Marketing $45,000
103 Mike Johnson IT $55,000
104 Sarah Lee HR $40,000
105 David Brown Finance $60,000
106 Emily Davis Sales $48,000
107 Alex Wilson Marketing $52,000
108 Olivia Clark IT $58,000
(i) Design dense and sparse indexes for the above database managing
employee records.
(ii)Discuss how each index structure facilitates efficient retrieval based on
different search criteria like employee ID and salary range, and then illustrate
the insertion and deletion operations for each index type.
Dense Index Design:
1. Employee ID Dense Index:
 The dense index will consist of a sorted array or list of employee
IDs along with pointers to the corresponding records. Ap CO3 20
 This index facilitates direct access to employee records
based on their unique IDs.
 Each entry in the dense index corresponds to a unique employee
ID.
2. Salary Range Dense Index:
 Similarly, another dense index will be created for salary ranges.
 Each entry in this index will represent a salary range (e.g.,
$30,000 -
$40,000) along with pointers to records falling within that range.
 This index allows efficient retrieval of employee records based
on salary ranges.

Illustration of Insertion Operation (Dense Index):


Let's insert a new employee record:
 Employee ID: 109
 Name: Robert Taylor
 Department: Finance
 Salary: $55,000
1. Insertion in Employee ID Dense Index:
 Insert the employee ID 109 into the sorted array of
employee IDs, maintaining the sorted order.
 Update the corresponding pointer array to include the pointer
to the new record.
2. Insertion in Salary Range Dense Index:
 Insert the salary range ($55,000) into the sorted array of salary
ranges.
 Update the corresponding pointer array to include the pointer
to the new record.

Illustration of Deletion Operation (Dense Index):


Let's delete the employee record with Employee ID 103 (Mike
Johnson):
1. Deletion from Employee ID Dense Index:
 Remove the entry for Employee ID 103 from the array of
employee IDs.
 Adjust the pointer array accordingly.
2. Deletion from Salary Range Dense Index (if applicable):
 If the record's salary falls within a $55,000 salary range,
remove the corresponding entry from the array of salary
ranges.
 Adjust the pointer array accordingly

2. Consider a B-Tree of order m=4. Illustrate the process of inserting the following
keys into the B-Tree: 10, 20, 5, 15, 25, 30, 3, 9, 8. Show the resulting B-Tree
Ap CO3 10
after each insertion, including any necessary splitting or merging operations.

3. Check whether the given schedule S is conflict serializable or not

Ap CO4 20

You might also like