Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

BCA V Semester

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 2

BCA V semester

Advanced DBMS
1. Consider the following set of requirements for a university database that is used to
keep track of students' transcripts. This is similar but not identical to the
database shown in Figure 1.2:

(a) The university keeps track of each student's name, student number, social
security number, current address and phone, permanent address and phone,
birthdate, sex, class (freshman, sophomore, ..., graduate), major department,
minor department (if any), and degree program (B.A., B.S., ..., Ph.D.). Some user
applications need to refer to the city, state, and zip of the student's permanent
address, and to the student's last name. Both social security number and student
number have unique values for each student.

(b) Each department is described by a name, department code, office number, office
phone, and college. Both name and code have unique values for each department.

(c) Each course has a course name, description, course number, number of semester
hours, level, and offering department. The value of course number is unique for
each course.

(d) Each section has an instructor, semester, year, course, and section number. The
section number distinguishes different sections of the same course that are taught
during the same semester/year; its values are 1, 2, 3, ...; up to the number of
sections taught during each semester.

(e) A grade report has a student, section, letter grade, and numeric grade (0, 1, 2, 3,
4 for F, D, C, B, A, respectively).

Design an ER schema for this application, and draw an ER diagram for that schema.
Specify key attributes of each entity type and structural constraints on each relationship type.
5 Marks

2. Differentiate between
a) dense and sparse index 2
b) B+ tree and B tree 1marks
3. Answer the following 7 marks
a) Index files are typically much------------- (smaller/larger) than the original file
b) ordered sequential file with a primary index is called as--------------
c) Secondary indices have to be dense(T/F)
d) Each node that is not a root or a leaf has between ---------- and ------------ children
e) ----------------- is a function from the set of all search-key values K to the set of all bucket
addresses B.
f) To reduce number of disk accesses to index records, ----------------index can be made

You might also like