0% found this document useful (0 votes)
4 views6 pages

B.Sc. - H - Computer Science Paper

The document is an examination question paper for a Database Management Systems course, containing various sections with questions related to database concepts, SQL queries, and functional dependencies. It includes instructions for candidates, a breakdown of sections, and specific questions that require theoretical and practical knowledge in database management. The paper is structured to assess understanding of key topics such as transaction properties, normalization, and relational algebra.
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)
4 views6 pages

B.Sc. - H - Computer Science Paper

The document is an examination question paper for a Database Management Systems course, containing various sections with questions related to database concepts, SQL queries, and functional dependencies. It includes instructions for candidates, a breakdown of sections, and specific questions that require theoretical and practical knowledge in database management. The paper is structured to assess understanding of key topics such as transaction properties, normalization, and relational algebra.
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/ 6

4803 '12 [This question paper contains 12 printeii pages.

blocking factor. Assume that file records are of Your Roll N o...............
fixed size with record length R = 100 bytes,
Sr, No. of Question Paper 4803 E
ordering key field is 9 bytes long and block pointer
is 6 bytes long. (6) Unique Paper Code 32341403

(b) What are the four desirable properties of a Name of the Paper Datab ase Management Systems

Transaction that should be enforced by the Name of the Course B.Sc. (H) Computer Science
concurrency control? (4)
Semester IV
Duration : 3 Hours Maximum Marks : 75

Ilqtructions for Candidates


l. Write your Roll No. on the top immediately on receipt
of this question paper.

2. Section A is compulsory.
3. Attempt any four questions from Section B.
4. Parts of a question must be answered together.

5. Marks are indicated against each question.

Section A

(a) When is it necessary to have a surrogate key while


mapping EER to a relational database? Justify with
an example. e\
(500) P.T.O.
4803 ) 4803 11

(b) In the reiation R (A, B, C, D, E) given below: 6 (a) Create a B-tree of or'der 4 inserting following
values in the given order (in steps)
B C D E

al b1 60 d1 2 t, 2, 3, 4, 5, 6,'7, 8,9, 10, I l, l2 (6)

a2 b2 80 d2 3
(b) Consider the following relations for the EMP-
a3 bl 50 d3 4
PROJ database with the following relations :

Which amongst the following dependencies are


violated? Justify your answer. Employee (Emp#, Name, Age, Salary, City, Mobile)

(i) B->c Allotted (Project#, Emp#)


(ii) D->E Q) Project (Project#, Project-Name, Project_Manager)

(c) Why is it necessary to give role names in a


-. Write the following queries in Relational Algebra
recursive relationship? Justify with an example.
(2) .
for the relations given above:-

(d) Explain the usage of the following ciauses in the (i) Display the project details of projects
*ON
SQL Query'ON UPDATE CASCADE" and managed by "James".
DELETE NULL". Q)
(ii) Count the number of employees working
(e) Find out the closure of CD in the following relation
on the "Artificial Intelligence" Project.
R (A, B, C, D, E, F, G) for the given set of
(4)
functional dependencies
F = {A -> BC, E -> C, CD -> AEG, ABG -> BD, 7 (a) Compute the number of blocks of access required
DG -> BC) to get records from an ordered file with r = 20,000
Show the stepsto compute the closure for CD. records stored on a disk with Block size B: 1024
Using the closure, can we say that CD is a bytes with or without primary index. Also, calculate
candidate key, if yes, Justify. (3)

P.T.O
4 803 '10 4 803 3

Project (Projecl#, Project-Name, Project_Manager) (f) Consider the following Medical Database relations
to keep track of Patients and Physicians:
Solve the following Queries on the above-
mentioned database using SQL : Patient (PP#, PName)

(i) Get Emp# of employees working on both Physician (Dname, Specialization)


Project# 353 and Project# 354. Test (PP#, Test_name, Date, Time, Dname)

(ii) Get details of employees working on all Identify the primary and foreign keys for the
"database" project.
relations given above (State any assumptions
(iii) Get Emp# of employees who work on all made). (3)

the projects that Emp # 107 works on.


(g) Give an example of the following with its proper
(iv) Insert a tuple <555 , "Operation Research", notation used in ER Model
"Jim"> in the Project table.
(i) Identifying Relationship
(v) Change the city of an employee from
"Delhi" to "Chennai" whose name is (ii) Complex attribute (3)
"James". (l+l+2+1+1)
(h) Differentiate between the following : (6)
(b) List all the FDs satisfied by the following table
(i) Database Definition language and Database
A B C D Manipulation language
al b1 cl d1

a1 b1 d2
(ii) Logical data independence and Physical
a2 b2 c2 d2 data independence
c4 d4 (4)
(iii) Database lntension and Database Extension

P.T.O.
4803 4 4803 9

(i) Find the'output of the following expressions in (b) Find the minimal covei of Functional dependency
relational algebra on the tables A, Bl, 82, 83 as set F : {B -+ A, D'-r A, AB -+ D}. (4)
given below: (l+2)
4 (a) Map the following ER-diagram into a Relational
database (Assume appropriate cardinality ratios
AI
S.No. P.No. 82
for each of the given relationships), Here CCI
SI PI denotes a ternary relationship between candidate,
P.No.
SI P2
P2
company and interview. (6)
SI P3
sl P4
S2 PI
S2 P2 ,Nesr
S3 P2
S4 P2 CANOIOATE ccr COMPANY

S4 P4
Date

tll t]3
P.No, I'.Nr-r.
P2 PI INTERVIEW RESULTS.IN ]OB OFFER
P4 lr2
P4

(b) Differentiate between a Specialization Hierarchy


(i) B r -82
and a Speciaiizalion Lattice using appropriate
(il) A/B3, where'/' is a division operator
examples. (4)

f) Consider the Relation given below 5 Given the following relations for an EMP-PROJ
database:
STUDENT COURSE
(a) Employee (Emp#, Name, Age, Salary, City, Mobile)
Namc Course Grade Ph no Major Department
Allotted (Project#, Emp#)

P.T,O
4803 8 4803 5

3 Consider the relation R, which has attributes to store Does this given relation STUDENT_COURSE
timetable of courses and suffer from any of the following anomalies? Justify
your answers using appropriate example.
(a) sections at a university; (6)
(i) Insertion
R = {Course_no, Sec_no, Offering_dept, Credit-hours,
Course_level, Instructor_ssn, Semester, Year,
(ii) Deletion

Days_hours, Room_no, No_of_students). (iii) Modification (3)

Suppose that the following functional dependencies (k) Two transactions Tl and T2 are executing
hold on R : concurrently (assuming concurrency control is not
in place) with initial value of X=15 and Y:5.
{Course_no} -+ {Offering_dept, Credit_hours,
Course_level ) TI T2

{Course_no, Sec_no, Sem est€r, Year) -) I . Read_item(X)


{Days_hours, Room_no, No of students, 2. X: X+10
Instructor_ssn ) 3. write_item (X)
4. Read_item(X)
{Room-no, Days_hours, Semester, Year} -+ 5.X=X+Y
{ Instructor_ssn, Course_no, Sec_no } 6. write_ item (X)
7. Read-item(X)
(i) Identify the Primary key in relation R?
Transaction T1 fails during the execution of
(ii) Apply normalization to convert it into 3NF
statement number 7. After the completion of the
stating the reasons behind each transaction T2 what will be the value of X. Is this
decomposition (assume R is already in the correct value, if not, identify the name of the
INF). concurrency control problem. (3)

P.T.O
4803 6 4803 7

Section B . Examiners of project reports are uniquely


identified by e-mail address. Each examiner's
first name, last nam6, phone number, areas of
2 (a) Consider a database PROJECT_EXAMINATION
interest are also recorded.
that maintains data about the project reports
submitted for consideration by the examiners. Each project report is assigned to two and four
Comments by the examiners are recorded for use reviewers. An examiner rates each report
in the project selection process. The database assigned to him or her on a scale of I to 10 in
system caters primarily to examiners who four categories: technical merit, readability,
record answers to pre-decided questions for each originality, and presentation. Finally, each
report they evaluate. The examiners make examiner provides an overall recommendation
recommendations regarding whether to accept or regarding each report.
reject the project. The data requirements are
summarized as follows : (6) Design an Entity Relationship Diagram (ER) for
the above database and identify existing composite
. Students write the project reports. attributes (if any).

. Students are uniquely identified by e-mail id. first (b) For the given binary relationship, suggest the
and last names are also recorded. cardinality ratio of the relationship based on the
general context of entity types and state the
. Each project is assigned a unique identifier by
context clearly' (+)
the system and is described by a title, abstract,
and the name of the electronic file containing Entity Set I Entity Set2
the project report.
I. Country President
. Multiple students may be involved in the same Il. Teacher Course
project, but one of the students is desiSnated as
the coordinator. III. Players Team

IV. Book Author

P.T.O

You might also like