B.

TECH (Computer Engineering and Information Technology , Computer Science and

Information Technology, Information Technology) FIFTH SEMSTER SYLLABUS
Database Management System (BCS501)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
CO 1 Apply knowledge of database for real life applications. K3
CO 2 Apply query processing techniques to automate the real time problems of databases. K3, K4

CO 3 Identify and solve the redundancy problem in database tables using normalization. K2, K3
Understand the concepts of transactions, their processing so they will familiar with broad range K2, K4
CO 4
of database management issues including data integrity, security and recovery.
CO 5 Design, develop and implement a small database project using database tools. K3, K6
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Overview, Database System vs File System, Database System Concept and
Architecture, Data Model Schema and Instances, Data Independence and Database Language and
Interfaces, Data Definitions Language, DML, Overall Database Structure. Data Modeling Using the
I 08
Entity Relationship Model: ER Model Concepts, Notation for ER Diagram, Mapping Constraints,
Keys, Concepts of Super Key, Candidate Key, Primary Key, Generalization, Aggregation,
Reduction of an ER Diagrams to Tables, Extended ER Model, Relationship of Higher Degree.
Relational data Model and Language: Relational Data Model Concepts, Integrity Constraints,
Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints, Relational Algebra,
Relational Calculus, Tuple and Domain Calculus. Introduction on SQL: Characteristics of SQL,
II Advantage of SQL. SQl Data Type and Literals. Types of SQL Commands. SQL Operators and Their 08
Procedure. Tables, Views and Indexes. Queries and Sub Queries. Aggregate Functions. Insert,
Update and Delete Operations, Joins, Unions, Intersection, Minus, Cursors, Triggers,
Procedures in SQL/PL SQL
Data Base Design & Normalization: Functional dependencies, normal forms, first, second, 8 third
III normal forms, BCNF, inclusion dependence, loss less join decompositions, normalization using 08
FD, MVD, and JDs, alternative approaches to database design
Transaction Processing Concept: Transaction System, Testing of Serializability, Serializability of
Schedules, Conflict & View Serializable Schedule, Recoverability, Recovery from Transaction
IV 08
Failures, Log Based Recovery, Checkpoints, Deadlock Handling. Distributed Database: Distributed
Data Storage, Concurrency Control, Directory System.
Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency
V Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple 08
Granularity, Multi Version Schemes, Recovery with Concurrent Transaction, Case Study of Oracle.
Text books:
1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill
2. Date C J, “An Introduction to Database Systems”, Addision Wesley
3. Elmasri, Navathe, “ Fundamentals of Database Systems”, Addision Wesley
4. O’Neil, Databases, Elsevier Pub.
5. RAMAKRISHNAN"Database Management Systems",McGraw Hill
6. Leon & Leon,”Database Management Systems”, Vikas Publishing House
7. Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications
8. Majumdar & Bhattacharya, “Database Management System”, TMH

Curriculum & Evaluation Scheme: Computer Engineering and Information Technology, 4

Computer Science and Information Technology, IT (V & VI semester)
 Database Managtment Syswm
UNI T-01
DBMS
Dab base
" Collethn of Relate d Data
Database Syskm Cotle on

Insert on
Data base DBMS
OPerrahions Updaiom
RDBMS)
SaL Server
Stucted Unstucturtd
IRCTC Orade (9,I), 12e ete resima

Univity -twebpaes My SeL

chats, t )
" Stored n a pahulr
Structne Stuctw
(Hot a prtde fmed shructue)
Relaional DBns

StructuTed Date h Stod Definiien

in the tabie fomat
Adatabase managet S,stm(peM5)
Rot
databa ses
R
’A DBMS maes it posSible for end users to
protk) read ,wpdate and delete data
n a dàaabase
’ The most preralent data mmaament platform, the
Dems essentially tnteface bten database,
and that d ata i
applfca n protan, ensurtng
Consis tety ordanized and emains accessible.
 Hle System Vs DR8Ms

’ Bfore DBMS, file [ystenn was ysed.

its daa ; im the fle tormat
5lk Syste ip în built into thf oporaini syskem
Hetsotk fle Sy sternm_ disth bue d 1e Systemy potos
Commn ntspee devloped by Sn mievosyshm
hat allqs ises to shae sles pontrs (in 1984
nd other Souees oves a netu

Nokel- Sk syshm îp weseing property hen ohatis the use se MS

using Client Server Arhitetut it
means my data i lseated Centalized an users from aiftent
data

(MyDaa

SERVAR

duback
LKB data

Easy stachin?
 Mulhpe acessing frm dittent perple atsa
tme.
arailable th l Syst,it mean means if ml Hple people
7he at Same tmme , then dara inconsisteney ocud.
Butfor DeMS potoest ests i

9 Seriy :- Role based seutty Da

Studen

Rest dah is Role based AeLecs (omtro

niSSble to unattnse
ole based

Redundanyi (bupitacy g data)

Muhple fle ith ditent names but Comtta t Zame

But frn Dgms,thetat so may cmstrints ki prim key

n Dms uniae data ts Stoed

 epts and Arhitecture of DB MS
2 tier amd 3 tier
Artiectunt )

2-Trer (laqer) 3-Ter (Layer)

Clienti liintAppliatim
C3 cltent layer

Process
Buinessler
AppltaSm
Seye
Database Serve

Data
2Ties ArhGtetane iz Consiss of Source

to layers ) Ui nt Applteatn
Dabbase Sees ientMaehine

Serner both aeode the omei betn Applthon r

client macine and
dientlayer nd bta leye
Hrst esblished the Connem

Busines5 layr suppnt al mterfoces,

Uint-Sve Reqet-Resyonce
tndel.
Request has beem drnefm Tier arthitere toad f cle
heen proessedn3
nd thi requst has
Sever bnd.

Ardhte tune User diety diety forwrded to data layer

+In 2-Tier
Applitatin Server proressed
àLles s t e dahbae.
and foid itt dah lyer
’ Them dea îg nttiered to cliet maline
|Note- 3-T tetue is maeh Sew
archetue be Cause
4ser i mot in diet access to d a
 t Data Model sehema And InstanEB
L Shema Logical Repnsentam ot bat
-
Resn of data psented n tthe
G-o RDBMS
table format
(2) E-R Model Data i e tSented n te
Gntty hd Relasm.
Studet Course
the shema
Styden
Rollno. Hame Addesses

Course
Cid buraton

Ly Jhe overal
desig ofa datba ge is cale d sehem
+A daabase shema î th Skeleon shuctur
otte databage. t p Semts
es ofte entire database
Ht A Shema Contains shen obts Giue table, piy vey, fontigm
dab tpes et.
tabie zm Cotumn
dahtye s)
Create table Studemt Roll no. int 1°), Name varhr (20),
/ Addess Varchr
Marne ofthe
table

The da base shema Con be

eptgeded b
The diaram sehs tne darabase objets nd relainsh p
witn tach ther,

the dakbase desgner to

hp poromm ohose Softo will ftere wth the
data ba se he
rolesS of darabase Cyeahfon i Cled dabase
modelir
 The daa hih fo stortd fin the datebase at a parbuler
the daabase.

G In tthe dahbase, ahuel data

Studen in the tudemt table Hhe at+ m n t

o ime added

nstan ct- Occuremtt

of an erent, which upded tne da bae
Dah Tndependemce
ab:lt a 6hema de sniim n one

defnion in the mest hiher Jed i

attoing
Called
Shema

Sher 1eel
STUPEHT
9Am BRANCH| EAR
Ccotemop
Sehema CSE 4
lerel
2

Sehena 3
PPP ECE
Jerl
Reor)
Rol\ tð,
Suppose you ant
 DaBa befinitm (amade (DD)
bata be niti on
Osed to de Hne +he schea or stucture of daBaba se
DDL are set of Cornmands aie R3 used to Crate, Update
amd selete struct o bB.
\hese Conmand% ae mot me ant fos end uses bat
rther used DBA
baaba se
begnr
Create table enplyee
Atsbute

Ate Id fnt, os2le Symax

Hane archar (20)
Addess Vavhar (36)
Tuneate
Sbuctee îs Cotaled
-Renme TA Aehdess
RAN
2 SA LLk
KRISH NAnUmA|
RADHA ATHRA
S S1TA

Crtatei- Used tor Cstalt tablR or database ALTER TABLE Employts

ALTeR I Used tor modify the tabie. ADD GmeBl Vchr 1ot;

DROP- Used for delete drop the tabie

TEUMCATe i Vsed for delefn
TRUMCAT TA8LE Employees
Renorne Vsed tor hangna of taie
 Data manipulat'on lomae (bm)
standa tor bata manipadin lang
DML standa tor
Jata

Used to etieve fnto from Db.

ne data delete wnoated data md mod
extaind data.
Too types of Dm
Po ce dunl Dm1 hat data is meeded nd ha
toget 5t,
Non Poce dul m - Oniy hat data is meeded,î ia
lasy 4o learn,
procedural,
w h the fethed tte daa
ony
DML Commands

Tnsert
Updatt database tableA
Delete
the

data în database tables

Delete Used tes delete emor the
from tne table
 E-R Model Conept { Gnhty- Retaionship
ntity - Any obiets ohich i phyieal etstence îs Caled ty
Student ( Rotl to, Ag, Addres )
Enthy SUhema

fo ex Seppsse too nies rihble ,e studen nd Coe

both enkHes usll b pemted att

Student shudy the

Relaio

Student KStudy Course

En hty Atributes
(ourse (Cousse-jd, Cousse-Hamf,
Relaonsàp Sehea r shruce
Dr Cnepul stuture
Abore CR model i fusther Pnplemented sith Shukutd Bueny
Cmguge

Atrs bte
Popesty of n ensty
Types of Attri bues Studen hane sinte Resishraim Ho
but mttiple mob.mo or Addess

2 Ns Composit Atti bates

9 Stored Vs Denved
Goutste ipse
9 key Vs Hen key
Atibets
(6) Reqpind s Opboml Atribtes
Atbaes
 doy mam Het
Atobtet opo
bese AtReayitd
s
pOB, Addrss,
Atites ton-
ayost tettbs key Eept Atsbte)-
uwipresented
th lusany
at sthibutt
is key
odel E-R immderline ke Hotel
valu) (uniqe
semted
ss eprt atbutst Dersved
eipse doted
Cwnent
studems, 2 DOB kmou weT
deve thn
we
Athibf bemed
Hhsbute SimpleA Reqtto
dmotherr rom attsbett
the
Studemt
RoMto
Ahaete key
ert_Hame DoB
onpasiR
(Plobto
DOB deed) Ctb Whih AtibuteS Stored
Atbete Shtd bak Multald
Attd
me Cast
Middietme
Fst_ttame HameStuden. forea
diide terther beCan which Atibate (omposi
fther diwded oken bo be
cammot hich Athibude- Simple
10)
 Hotaiens of e-R Datram
Many to
Attribukes
Mamy
ndestine
Key Atbutea

rMany
One
Compose
Atdbuts
me to One

eelipse fMusral«ed
AHibutes

dotted Deived
eipse Atibues

(Primany key ptsnt

weak Entity set

tot prtsent)

Diamond Rdaisnshp
Shepe
Links
( ink volth fatsty to fahty
énsy to Reonnip
 MAPPIN G CONSTRINTS

L’ To mantain

?) Pprtipa Hon enstraints

(asdinahcs
of ensses och hare ehin oith notner ensk.
Sho easonship stats betuseen tnt hek of GnBty Se's.

() ne to One 2) One to PMa Many to one

-bs

Poatscipabo Constnnts
eniy sot depends set for its
eis tence enby
paakn Constraints a

0 Tota! b

ba
Total
Partial
L AI| the enistseg of
one

toter tntity se iz Cayed Tota!

Poti cipahn Constnin nel ahn, aled
Patupation anstrint.
 nosjleto

Loon
TCustomert

Adiess -Total
PaHal
Pasticipasm

Abovt dia rom shoss Custemts Lo Relaisnship

Tt is not that ustomer of bamk bane taken loam,
necessaj
7LPn totally depent upon Customes eis ttnce, mes

double line
 Ktys
(oncepts fn DBMS
A key j a vae whch (an alys be used to
sject instam ee.

Key ís used to
ot data
fom the table.
sden t relamsNp be
between
I is also used to esta blis h and
esta blish and

tables.

for eul Ib is used as a in the studemt table because ft is

Cniaue for each shudent.

In the persen table ) pa55pvt -number, Lic ense.nmber kays
Uunjoqe for each pensm.

Types of keys
(sndrdate Conpasste Fo
Super ey key key

OSuper kay i Asuper key ís a sct of ne oT more atthhtta that,

ilke colek'a l o us to

in the set.

ex! Jn Student table ith sttibue

ne,
(S-Rottno, s-Mme, S. Brnes, sYeor

S2
S-Rollme, S-Bramh
S3 S- Rotlno, S-\ear
Ss ~ S. Rolne, S- None, S-Brneh
Ss S Rollmo, S.Brnh, S.Yea
 STUPEHT TABLE

S- Roll . S-Mant S.Banch Serr

4 KAMAL 2001

SATYAm
2003
MAMR EE 2002
KAMAL

Gndidate key The mial set of attributez that can

a table. i8 knon Candidak key,

he minimm o Super ke
Casdidate kay Com be def e a
that idemtifes the ecord amiqy
" Tt must Contain nique value
(andidate
table must have at least a
ith attsbte.
for t In stu dent table
S-Brnh, S-Yea )
(S-Rot1 to, S-tene
C ’ S, Rollto.
Camdidate kay C ’ S- Roll to S_4ame

Cn be defme as the mimimm ne, (andidate key

that i hGsen by tthe daabase dengner primcipel
within st.

at a ime

duplieae vaus, it has uniqe vals,

for eee Tn student table oith ats bwte S- Rotno, S-to,5- Banh, 5- ye )
(4) Composite key ; whener a primay key Consiss of

h a suden table, wtha4 bw

Conposik
`- Remo, S-D, 3-Hame.

Composite yeay .S-Rotno, SID

S-mn

Foreign kuy A Colum h ose Valee oe

he. me he anothr tab1e

Jt Combjmes tuoo os more tlaions (table) at a me.

Thy
feritn ey he (otumn o4 the table used to pint
to the
pomykey of angter tatbie.
Studen Tabie 2
StudetTle 1

Roll to

Kalash 12 34
key 56 Lwen
2 Kame
EE

Act as
Seeond Table
Frst Table

Then trat atthibult i% (aled