Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

DBMS LECTURE---NOTES, Lecture notes of Database Management Systems (DBMS)

DBMS LECTURE---NOTES FROM PARUL UNIVERSITY

Typology: Lecture notes

2022/2023

Available from 01/21/2024

sahil-ajudiya
sahil-ajudiya 🇮🇳

1 document

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Enrollment No:
PARUL UNIVERSITY
FACULTY OF ENGINEERING & TECHNOLOGY
B.TECH MIDSEM EXAMINATION
3'd SEMESTER (ACY- 2022-231
Subject Name 1203105251): DBMS
Date: 03/0812022
Time: 2:30PM to 4:00PM Total Marks: 40
Q.1
(A) One line Questions 5* 1
a) What is Primary I(ey?
:t
b) Define MultivalLred attribute rvith exarnple.
c) Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic
. values F={cH-rG,A-> BC, B->cFH, E->A, F-> EGiisasetof functional
dependencies (FDs) . find the closer of A
d) The maximum number of superkeys for the relation schema R(E,F,G,H)with E
as the key
e) Explain 3NF with an example ,
(li) Corn pulsory Qucstion 5* I
a)
-
attribute name could be structured as an attribute consisting of first
name, middle initial, and last name
b) Minimal Super key is known as
c) Normalization is used to eliminate
d) Attributes of relations which are part of candidate,key are known as
e) ALTER is _ command.
Q.2 Attenrpt any loLrr 4+ j
1) Explain trivial and non-trivial functional dependency with example
2) Define Super Key and Candidate key with example.
pf2

Partial preview of the text

Download DBMS LECTURE---NOTES and more Lecture notes Database Management Systems (DBMS) in PDF only on Docsity!

Enrollment No:

PARUL UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY

B.TECH MIDSEM EXAMINATION

3'd (^) SEMESTER (ACY- (^) 2022- Subject Name (^) 1203105251): DBMS Date: 03/

Time: 2:30PM to 4:00PM Total Marks: 40

Q.

(A) One line Questions 5* 1

a) What is Primary I(ey? b) Define (^) MultivalLred attribute:t rvith (^) exarnple.

c) Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic

. values F={cH-rG,A-> BC, B->cFH, E->A, F-> EGiisasetof functional

dependencies (FDs)^. find the closer of A

d) The maximum number of superkeys for the relation schema R(E,F,G,H)with E

as the key

e) Explain 3NF with an example ,

(li) Corn pulsory Qucstion 5* I

a)

attribute name could (^) be structured as an (^) attribute consisting of first

name, middle initial, and last name

b) Minimal Super key is known as

c) Normalization is used to eliminate

d) Attributes of relations which are part of candidate,key are known as

e) ALTER is _ command.

Q.2 Attenrpt^ any^ loLrr^ 4+ j

  1. Explain (^) trivial and non-trivial functional dependency with example
  2. Define (^) Super Key and Candidate key with (^) example.

3) Draw the^ E-R diagram^ of^ uni'.'ersity's^ database.

4) ln the following relation S(SNO,SNAME,CITY)^ write^ a^ query^ to^ update the value^ of

CITY to KANPUR for^ the^ suPPlier 51.

5) Consider a schema R(A,^ B,^ C,^ D)^ and^ following functional dependencies.

A --^ B, B ---'C,^ C -*^ D,D --- A.^ find^ the^ total^ number of^ candidate^ key

Q.3 Attempt^ any^ two^ 2'*

(1) Consider a schema R(A, B, C, D) and following^ funciional dependencies.

A ----^ B, B --- C, C --,^ D,D -+^ B. The highest normal fcrnt of^ this^ relatiot'l^ scheme

(2) Differentiate bdtween DML and DDL

(3) (^) What is Generalization and Specialization? Explain^ with^ example.

Q.4 I^ *

(A) From the following table employee(emp_id,emp_nalxe,salary) write SQL

query .

a) find the salaries^ of^ all^ employees

B) find the name of^ employee's where salary^ is grater^ then^ 30000.

c) find the maximum^ salary^ of^ employees.

d) find the employee's name^ that^ staft^ v/ith "a"

e) find the Second minimum salaries of employees.

B) Explain advantages of DBMS over file management^ system.^ 1*

OR

B) Considera schema^ R(A,^ B,^ C,^ D) and^ following functional^ dependencies.^ 1"

A ---^ B, B -, C,^ C ---^ D,D^ - B.^ then^ decomposition of^ R^ into^ R1^ (A, B), R2(8,^ C) and

R3(8, D) is LOSSLESS OR^ LOSSY?