0% found this document useful (0 votes)
56 views

Paper-1

The document outlines the Final Assessment Test for the B.Tech course in Database Systems at VIT Vellore, scheduled for July/August 2023. It includes various sections with questions on DBMS architecture, normalization, recovery techniques, SQL queries, PL/SQL functions, and transaction management. The test consists of multiple questions requiring theoretical and practical knowledge in database systems, with a total of 100 marks available.

Uploaded by

ishaan agarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
56 views

Paper-1

The document outlines the Final Assessment Test for the B.Tech course in Database Systems at VIT Vellore, scheduled for July/August 2023. It includes various sections with questions on DBMS architecture, normalization, recovery techniques, SQL queries, PL/SQL functions, and transaction management. The test consists of multiple questions requiring theoretical and practical knowledge in database systems, with a total of 100 marks available.

Uploaded by

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

VIT

Vellore lastitule af echelo


Reg. No. :

FinalAssessment Test (FAT) -July/August 2023


Programme B.Tech. Semester FallInter Semester 22-23
Course Title DATABASE SYSTEMS Course Code BCSE302L
Slot F2+TF2
Faculty Name Prof. KP Vijayakumar
Class Nbr |CH2022232501054
Time 3 Hours Max. Marks 100

Section A (7X 10 Marks)


Answer All questions
01. Assume that an online retail store called "HappyShoppy" has experienced rapid growth in its [10]
customer base and product inventory.
a. Identify and elaborate the kind of DBMS architecture needed to manage their operations
efficiently with a neat diagram. (8 Marks)
b. Mention the benefits of chosen architecture (2 Marks)

[10]
02.
(DOORE)STREET) CITY STATE
PIN
cOURSE_ID
(STUDENT NAME ADDRESS cOURSE ID
COURSE_NAME
STUDENT_ID M
Attends COURSE
STUDENT
AGE
1

HOBBY
HAS

DO8
Teaches
M
Takes (LECTURER ID

M
SUBJECTS sUBJECT_ ID
LECTURER Teaches

SUBJECT_NAME

(LECTURER_ID LECTURER_NAME. CoURSE_ID

appropriate relation schema.(5 Marks)


a. Map the above E-R model to the mapped
Determine the prinmary key, foreign key, and any other appropriate constraints
b. constraints.(5 Marks)
each
of
schemaand also describe the purpose
the database [101
designer at TeachEasy and you need to maintain
03. Assume that you are the database following:
for easier access and retrieval of
records at any tine. The database contains the

Page 1of 3
Tutor PHONE
Block Numbers
Book Publishe Title Room
ID d Date NUMBER

9940497934, AB3
B1 23.02.23 |Tutl PYTHON AB3310
9940497938

B2 18.11.23 Tut3 SQL AB1331|9876123456 AB1

9940497934, AB2
B3 23.02.23|Tutl MATLAB AB2310
9940497938

BS 05.02.23 Tut3 JAVA AB2332 |9876123459 AB2

B4 04.07.23|Tuts AZURE DB321 9876543210 DB

Normalize the given table up to the third level normal form with proper justifications for
violations in each form.
04. a. Banking System online application is used to store, manipulate and retrieve the customer's [10]
account details. Identity and describe the recovery techniques that can be applied for critical data
restoration in case of some transaction failure or data corruptions. (4 Marks)
b. Write the log records created during Deferred database modification and Immediate database
modification for the following schedule. Assume that the initial values ofA=1100, B=1200 and
C=1000. (6 Marks)
TO: Read(A)
A:=A-550
Write(A)
Read(B)
B:=B+550
Write (B)
T1: Read(C)
C:=C-300
Write(C)
maintains the grade of the students in an institute 10]
05. a. Consider the Grade Monitoring System that
to view their grade. A faculty posts the
that enables the faculty to post the grade and students node
the student A access his/her grade from the
grade of the student A from the node XYZ and
scenario. (8 Marks)
PQR. Illustrate the upholding CAP using the given distributed
"Achieving CAP is not possible at all times in a
b. Comment on the statement :
system" (2 Marks)
[10)
06. Consider the following student table:
Physics Chemistry Maths Department Residential Clty
Reg.No. Name Marks Marks Marks Age
80 98 19 SENSE Chennai
1001 Harish 90

90 20 SENSE Bangalore
1002 Ram 50 95

75 19 SENSE Mumbai
1003 Suresh 80 85

20 ScOPE Kolkata
95 55
1004 Dhamu 95

85 19 SENSE Delhi
1005 Prathik 85 70

18 SCOPE Chennai
65 52 40
1006 Gokul

Write SQ1. query lor the following. the above table and find the average of all the students (2
Add a ew column "Average"
in
4.
Page 2 of 3
Maks)
b. Display the name of all students whose residential city is either Chennai or Bangalore (2
Marks)
c. List the name of all students in Upper Case those who are in the age 19 and studying in
SENSE department (2 Marks)
d. Display the minimum and maximum age of the students (2 Marks)
e. Find the student name and department whose average mark above 80 department wise (2
Marks)
07. a. The management team wanted to check whether a particular faculty in the university is [10]
employed or not. Write a PL/SQL function to assist the management team so that a message is
displayed as "Employed" Otherwise "Not Enmployed". (5 Marks)
b. Create an explicit cursor named university cur and fetch the details of all students in the
student table whose department is SENSE. Also, Illustrate the ROWCOUNT using implicit
cursor. (5 Marks)
Note: Assume the required tables with data are already existing in the database.
Section B (2 X 15 Marks)
Answer All questions
08. Consider the following relations of a university database. [15]
Faculty (Empld, Name, Phno, School, DateOfJoining)
Student (RegNo, Name, Phno, School)
Course (CourseCode, CourseName, Credits)
CourseAllocation (ClassNumber, AEmpld, ACourseCode,Venue, MaxStrength, Slot)
StudReg (RegNo, ClassNumber)
Name and Phone numbers of
a. Write a relational algebra query and depict a query tree to find
DBMS course. (5 Marks)
Faculty members who have joined after 01-01-2023 and handling
using Heuristic technique. (5
b. Convert the constructed canonical tree into optimized tree
Marks)
hash table of length 8 using
c. The Keys 12,18,13.2,3,23,5 and 15 are inserted into an empty
Show the resultant hash table of each key
open addressing with hash function h(k)=k mod 8.
entries (5 Marks)
ofA, B andCare 200, 200, and 380 [15]
09. Consider the Concurrent Transaction and initial values
respectively
Transaction Tx Transaction Ty
Time

T1 Read (A) Read(A)

T2 Read (B) Read (B)

T3 Write (B=A+100)

Write (C=C+B*2) Write (B=A+100)


T4

T5 Read (C) Write (C=C+B'2)

T6 Read(A) Read (A)

T7 Read(B) Read(B)

T8 Read (C)

a. Identify and elaborale the issues on the concurrent transaction as given in the ab0ve tuble (4
Marks)
b. lustrate the solution to overcome the problems using lock based protocol (basic, Strict and
Rigorous) with proper justification(11 Marks)

Page s of 3

You might also like