Chandi

gar
hUni
ver
sit
y,Ghar
uan

Comput
erOrganizat
ionand
L T P C
Archi
tect
ure
Subj
ectCode
Tot
alCont
actHour
s:45Hour
s
CST-
203/
ITT-
203
Commont oal
lSpeci
ali
zat
ionsof 3 0 0 3
nd
CSE/
IT2 Year

Mar
ks-
100

I
nter
nal
-40 Ext
ernal
-60

Cour
seObj
ect
ives

 Tof
ami
l
iar
izest
udent
swi
tht
hear
chi
tect
ureofapr
ocessor
.
 Tohav
eagoodunder
standi
ngofv
ari
ousf
unct
ional
uni
tsofcomput
er.
 Tounder
standt
hedesi
gnofabasi
ccomput
ersy
stem.
Uni
t Cour
seOut
comes

Under
standt
heoper
ati
onofel
ect
roni
clogi
cel
ement
s
Under
standtheor
gani
zat
ionofacomput
ersy
stem i
nter
msofi
tsmai
n
I
. component
s
Under
standdi
ff
erentpr
ocessorar
chi
tect
ures
Under
standi
nput
/out
putmechani
sms
I
I.
Under
standt
hev
ari
ouspar
tsofasy
stem memor
yhi
erar
chy
Hav
epr
act
ical
exper
ienceofpr
otot
ypi
ngdi
git
alci
rcui
ts
I
II
.
Beabl
etoi
nter
facedi
git
alci
rcui
tst
omi
cropr
ocessorsy
stems

Cont
ent
soft
heSy
ll
abus

UNI
T-I [
15h]

Basi
c concept
s-Di
git
alcomputerwit
hi t
s block di
agr
am,computerhardwar
e
component
s-ALU,r egi
ster
s,memor
y,syst
em busst r
uct
ure-
dat
a,addr
essand
cont
rol
bus.
Inst
ruct
ion Set Ar chi
tect
ures-Lev
els of programming Languages, Assembl
y
LanguageInst
ruct
ions:inst
ruct
ioncy cl
e,i
nst
ruct
ionty
pes,addressi
ngmodes,RISC
v/sCISC.
Comput
erOr
gani
zat
ion-CPUor
gani
zat
ion,Memor
ySubsy
stem Or
gani
zat
ion:Ty
pes
ofmemor
y,I
nter
nal
Chi
pOr
gani
zat
ion,
memor
ysubsy
stem conf
igur
ati
on.

UNI
T-I
I [
15h]

Desi
gnofcont
roluni
t-Har
dwi
redcont
roluni
t,Mi
cro-
Progr
ammedcont
roluni
tand
compar
ati
vest
udy.
Memor
yor
gani
zation-
Memoryhi
erar
chy,
CacheMemoryAssoci
ati
veMemor y
,Cache
memor
ywi
thassociat
ivememor
y,Vi
rt
ualMemor
y:Pagi
ng,Segmentat
ion.
I
nput output organi
zati
on –Asy nchr
onous Dat
a transf
er: Source I
nit
iat
ed,
Dest
inat
ionI
nit
iat
ed,Handshaki
ng,
Pr ogr
ammedI/O,
Int
err
uptsDMA, andIOP
UNI
T-I
II [
15h]

I
ntr
oducti
on to Par
all
elPr
ocessi
ng-Parall
eli
sm i
nuniprocessorsy st
em,Fl
ynn’
s
Cl
assi
fi
cati
on,Handler
’sCl
assi
fi
cat
ion,conceptofpi
pel
ining,Inst
ructi
onPi
peli
ne,
Ar
it
hmeticPipel
i
ne.
Mul
ti
processor
s-Charact
eri
sti
cs ofmulti
processor
s,Unif
orm and non-
uni
for
m
memoryaccessmul
tipr
ocessor
s,var
iousi
nter
connecti
onnet
works.
TextBooks:
1.Carpinell
iJ.
D,”Comput
ersy
stemsorgani
zat
ion&Archi
tect
ure”
,Fourt
hEdit
ion,
AddisonWesl ey.
2.PattersonandHennessy,“Comput
erArchi
tect
ure”,Fift
hEdi t
ionMorgaon
Kauffman.

Ref
ere
nceBook
s:
1.J.
P.Hay
es,
“Comput
erAr
chi
tect
ureandOr
gani
zat
ion”
,Thi
rdEdi
ti
on.
2.Mano,
M.,
“Comput
erSy
stem Ar
chi
tect
ure”
,Thi
rdEdi
ti
on,
Prent
iceHal
l
.
3.Stal
l
ings,W. ,“Comput
erOr
gani
zat
ion and Ar
chi
tect
ure”
,Ei
ght
h Edi
ti
on,
PearsonEducat
ion.

Cour
seCode- Comput
erOr
gani
zat
ionandAr
chi
tect
ure
CST-
203/
ITT-
203

Depart
ment
Teachi
ngt
he Depar
tmentofComput
erSci
enceandEngi
neer
ing
Subj
ect

Pr
ogr
am Out
come a b c d E f g h i j
Mappi ngofCour
se
outcome wit
h I
,
II,
I
II
Program out
come

Pr
oject
/Tr
aini
n
BS ES PD PC PE OE
Cat
egor
y g

Appr
oval Dat
eofmeet
ingoft
heBoar
dofSt
udi
es

I
nst
ruct
ionsf
ort
hepaper
-set
ter

Pleasegothroughthesei
nstr
ucti
onsthor
oughl
yandfoll
owt hesamepatter
nwhi
l
e
setti
ngthepaperasthest
udentshav
ebeenprepar
edaccordi
ngtothi
sfor
mat.

Maxi
mum Mar
ks=60 Ti
me:
3Hr
s

Thesy l
labushasbeendivi
dedintothreeequalunits.Thepaperset
terisrequi
redto
settenquestionsinal
l,t
hreequestionsfrom eachunitandacompul soryquesti
on
consist
ingoff i
vesubpart
sandbasedont hewholesyll
abus.Thecandidat
ewi l
lbe
requi
redt oat
t emptsi
xquesti
onsi ncludi
ngthecompul sor
yquesti
onnumberno1
andnotmor ethantwoquesti
onsfrom eachunit.

Nameoft
heSubj
ect Comput er Subj
ectCode CST-
203/
ITT-
203
Or
ganizationand
Architectur
e

I
tiscer
ti
fi
edThatsyl
labusi
sfr
eefrom spel
l
ing,
grammati
caloranydupl
i
cacy
.Cour
se
out
comeshavebeenmappedwi thPr
ogr
am outcome

S.No. name Desi

gnat
ion si
gnat
ure

2 Asso.Dean
 Chandi
gar
hUni
ver
sit
y,Ghar
uan

Di
scr
eteMat
hemat
ics L T P C
Subj
ectCode Tot
alCont
actHour
s:45Hour
s
SMT-
221 Commont oal
lSpeci
ali
zat
ionsof 3 1 0 4
nd
CSE/
IT2 Year

Mar
ks-
100

I
nter
nal
-40 Ext
ernal
-60

Cour
seObj
ect
ives

 I
denti
fyandappl
ybasi
cconcept
sofsett
heory,
ari
thmet
ic,
logi
c,pr
oof
t
echni
ques,bi
nar
yrel
ati
ons,
graphsandt
rees

 Appl
ytheknowl
edgeandski
ll
sobt
ainedt
oinv
est
igat
eandsol
veav
ari
etyof
di
scr
etemathemati
cal
probl
ems

Uni
t Cour
seOut
come

somef
undament
almat
hemat
ical
concept
sandt
ermi
nol
ogy
;
I
.
howt
ouseandanal
yzer
ecur
siv
edef
ini
ti
ons;
I
I. howt
ocountsomedi
ff
erentt
ypesofdi
scr
etest
ruct
ures;
Techni
quesforconst
ruct
ingmat
hemat
icalpr
oof
s,i
l
lust
rat
edbydi
scr
ete
I
II
.
mathemati
csexamples.

Cont
ent
soft
heSy
ll
abus

UNI
T-I [
15h]

SetTheor y:Introducti
ont osettheory,setoperations,algebraofset s,combination
ofset s,duality,fi
niteandi nfi
nit
eset s,classesofset s,powerset s,multiset s,
Cartesianproduct
Relationsandf uncti
ons:Binaryrelat
ions,typesofr elat
ions,equiv
alencerelations
andpar ti
ti
ons,par t
ialorderrel
ati
ons,mat hematicalinduction,pr
inci
plesofinclusion
&excl usi
on,f uncti
onsandi tstypes,composi ti
onoff unctionandrelati
ons,i
nv erse
rel
ationsandf unctionspigeonhol
epr i
nciple.

Proposi
ti
onalcalcul
us:Basi
coperat
ions:AND(˄)OR(˅)
,NOT( -)Tr
uthv
alueofa
compoundstatements,
proposi
ti
ons,
tautol
ogi
es,
cont
radi
cti
ons.
 UNIT-I
I [15h]
Recursi
onandr ecurr
encerelat
ions:Sequence,part
ialfr
act
ionsl
inearr
ecurrence
rel
ati
ons wi
th constant coeff
ici
ents,homogeneous and par t
icul
ar sol
utions,
sol
uti
onsofrecur
rencerel
ati
onusinggenerat
ingfunct
ions.

Algebrai
c str
uctures:Definit
ion,elementary proper
ti
es ofalgebrai
c struct
ures,
semigroup monoi d, group,homomor phism,i somorphi
sm and aut omorpbi
sm,
congruencerelat
ions,subgroups,normalsubgr oups,coset
s,Lagrange'st
heorem,
cycli
cgroups,r
ings,i
ntegr
aldomai nsandfields.

UNI
T-I
II [
15h]

Combi
nat
ori
alMathematics:Techni
quesofcount
ing,r
uleofsum,r
uleofpr
oduct
per
mut
ati
onsandcombinations.

Graph Theor y :I ntr

oduction t o gr aphs,di r
ected and undi rected graphs,
homomor phicandi somor phicgraphs, subgr aphsmultigr
aphsandwei ghtedgraphs,
pathsandci rcuits,shortestpat hinwei ght
edgr aphs,euler
ianpat hsandci r
cuit
s,
Hami l
tonianpat hsandci rcuit
s,planergr aphsEuler'
sformula,
chr omatic
number s(coloringpr obl
ems) .
Trees:Intr
oduct iontot r
ees, di
fferencebet weengraphsandat reerootedtrees,pat
h
l
engthi ntrees,spanni ngtrees&cut -sets,minimum spanningtrees,bi
narytreesand
i
tstraversal.

TextBooks:
1.LiuC. L."ElementsofDiscr
eteMathematics".McGrawHill
,3rdEdit
ion.
st
2.Sant ha,"
Discret
eMat hemati
cswi t
hGr aphTheor y,CengageLear ning,1
Edi
ti
on.
3.Ronal dG,Knut h,DonaldandPat ashi
k,Or en,"concret
eMat hematics:A
FoundationforComputerScience"
,Addison-Wesley.

Ref
erenceMat er
ial:
1.Kolaman,B.amdBusbyR, C, “
DiscreteMathemat i
calStr
uctures”,
PHI,1stEdit
ion.
2.Gersti
ng,Judi thL.“ Mathemat i
calSt r
ucturesforcomput erScience”,Comput er
SciencePr ess.
3.DoerrandLev asseur,“Appli
edDi scert
eStructur
eforComput erScience”.
4.Tembl ey& Manohar,“ Discret
eMat hemat i
calStr
uctureswi t
hAppl icat
ionst o
Comput ers”,McGr awHi l
l
.
5.RosenK. H, “DiscreteMathemat icsanditsappli
cati
ons”Mc- Gr
ewhi l
l.
6.Lyengar.NChSN, Chandrasekaran,VM, “
DiscreteMathematics”.
 Cour
seCode-
Di
scr
eteMat
hemat
ics
SMT-
221

Depart
ment
Teachi
ngt
he Depar
tmentofAppl
iedSci
ences
Subj
ect

Pr
ogr
am Out
come a b c d e f g h i J

Mappi ngofCour
se
outcome wit
h I
,
II I
,
II,
I
II
Program out
come

Pr
oject
/Tr
aini
BS ES PD PC PE OE
Cat
egor
y ng


Appr
oval Dat
eofmeet
ingoft
heBoar
dofSt
udi
es

I
nst
ruct
ionsf
ort
hepaper
-set
ter

Pleasegothroughthesei
nstr
ucti
onsthor
oughl
yandfoll
owt hesamepatter
nwhi
l
e
setti
ngthepaperasthest
udentshav
ebeenprepar
edaccordi
ngtothi
sfor
mat.

Maxi
mum Mar
ks=60 Ti
me:
3Hr
s

Thesy l
labushasbeendivi
dedintothreeequalunits.Thepaperset
terisrequi
redto
settenquestionsinal
l,t
hreequestionsfrom eachunitandacompul soryquesti
on
consist
ingoff i
vesubpart
sandbasedont hewholesyll
abus.Thecandidat
ewi l
lbe
requi
redt oat
t emptsi
xquesti
onsi ncludi
ngthecompul sor
yquesti
onnumberno1
andnotmor ethantwoquesti
onsfrom eachunit.

Nameoft
heSubj
ect Discr
ete Subj
ectCode CST-
205/
ITT-
205
Mat
hematics

I
tiscer
ti
fi
edThatsyl
labusi
sfr
eefrom spel
l
ing,
grammati
caloranydupl
i
cacy
.Cour
se
out
comeshavebeenmappedwi thPr
ogr
am outcome

S.No. name Desi

gnat
ion si
gnat
ure

1
2
 Chandi
gar
hUni
ver
sit
y,Ghar
uan

Dat
aSt
ruct
ures L T P C
Subj
ectCode Tot
alCont
actHour
s:45Hour
s
CST-
231/
ITT-
231 Commont oal
lSpeci
ali
zat
ionsof 3 0 0 3
nd
CSE/2 Year

Mar
ks-
100

I
nter
nal
-40 Ext
ernal
-60

Cour
seObj
ect
ives

 Tounder
standt
heconceptoft
hedat
ast
ruct
uresandoper
ati
onsont
hem,
 Toappl
ydi
ff
erentdat
ast
ruct
uresf
ormodel
i
ngr
eal
wor
ldpr
obl
ems.
Uni
t Cour
seOut
comes

Under
standt
hepr
oper
ti
esofv
ari
ousdat
ast
ruct
ures.
I
.
i
dent
if
ythest
rengt
hsandweaknessesofdi
ff
erentdat
ast
ruct
ures

designandempl
oyappr
opr
iat
edat
ast
ruct
uresf
orsol
vi
ngcomput
ing
problems
I
I.
possesst
heknowl
edgeofv
ari
ousexi
sti
ngal
gor
it
hms

anal
yzeandcompar
etheef
fi
ciencyofal
gor
it
hms

I
II
. possesst
heabi
l
ityt
odesi
gnef
fi
ciental
gor
it
hmsf
orsol
vi
ngcomput
ing
probl
ems

Cont
ent
soft
heSy
ll
abus

UNI
T-I [
15h]

I
ntroduction:Conceptofdata and i
nformati
on,Int
roducti
on t
o Dat a St
ruct
ures,
Typesofdat ast r
uct
ure:Li
nearandnon-l
ineardatastr
uctur
es,operati
onsonDat a
St
ructures,Algor
it
hm compl
exit
y,Ti
me-spacetradeof
f,asymptot
icnotat
ions.

Arr
ays:Basict erminol
ogy,Li
neararraysandthei
rrepr
esentat
ion,Traver
singLinear
Arr
ay,Insert
ion&Del et
ioninarrays,
searchi
ng–li
nearsearch,binar
ysearch,sorti
ng
–inser t
ion sort,select
ion sort,bubblesort,mer gi
ng arrays& mer gesor t,
complexity analysi
s of each al gor
ithm, Mul
ti
-di
mensional array
s and t heir
r
epresent
ati
on,
Pointer
s;Poi
nterAr
ray
s, Recor
ds; Recor
dstr
uct
ure,r
epresent
ati
onof
r
ecordsinMemory
, Paral
l
elAr
rays,
sparsematricesandthei
rst
orage.

UNI
T-I
I [
15h]

LinkedList:Linearli
nkedlist
,Representati
onofLi
nkedListsinMemor y
,Traver
singa
l
inkedlist,searchingal inkedlist,i
nserti
onin&del eti
onfrom li
nkedlist
,Header
LinkedList,doublyli
nkedlist,
Oper at
ionsondoubl
ylinkedli
st,compl
exit
yanalysi
sof
eachalgorithm, Appl
icat
ionoflinkedlist
s.
Stacks:Basict erminology,Sequenti
alandl inkedr epresentati
ons,Oper ati
onson
stacks:PUSH & POP,Appl i
cat
ionofst acks:Parenthesismat ching,eval
uationof
postfi
xexpressions,conv er
sionfr
om infi
xt opostfi
xr epresentation,Qui
ckSor tand
i
tscompl exi
tyanalysis.Meaningandimpor t
anceofr ecursion,principl
esofrecursi
on
&impl ementat
ionofr ecursi
veprocedure
Queues:Linearqueue,
Sequenti
alandli
nkedrepr
esent
ati
onofLi
nearqueue,
Cir
cul
ar
queue,Operati
onsonqueue,Deques,
Prior
it
yqueue.
UNI
T-I
II [
15h]

Gr
aphs:Gr
aphTheoryter
minol
ogy
,sequent
ialrepr
esent
ati
onofgr
aphs(
adj
acency
matr
ix,
Pat
hMatr
ix)
,tr
aversi
ngagr
aph,Oper
ationsonGraph.
Trees:Basicterminology,BinaryTr ees,Repr
esent
ati
onofBi naryTr
eesinMemor y,
tr
av ersi
ngBinar
yTr ees,TraversalAl gor
it
hmsusingstacks,HeaderNodes;Threads,
Binar ySear
chtrees,Sear ching,Inserti
ng& Delet
inginBi nar
ySearchTr ees,AVL
Sear chtr
ees,BTrees,Heap&HeapSor t
.
Hashing & Fi
le Organi
zati
on:Hash Table,Hash Functi
ons,Coll
isi
on Resolut
ion
St
rategi
es,HashTabl eImplementati
on.Concept
soff i
l
es,Organi
zati
onofr ecords
i
ntoBlocks,
Fil
eor gani
zat
ion:Sequent
ial
,Rel
ati
ve,I
ndexSequent
ial
,I
nvert
edFile.

TextBooks:
1.Li
pschut
z,Sey
mour
,“Dat
aSt
ruct
ures”
,Schaum'
sOut
li
neSer
ies,
Tat
aMcGr
aw
Hi
ll
.
2.Gi
l
ber
g/For
ouzan,
”Dat
aSt
ruct
urewi
thC,
CengageLear
ning.
3.Augenst
ein,
MosheJ ,
 
Tanenbaum,Aar
on M,“
Dat
aSt
ruct
uresusi
ngC and
C++”,Pr
enti
ceHal
lofI
ndi
a.

Ref
erencebooks:
1.Goodr
ich,MichaelT.,Tamassi
a,Rober
to,and Mount,Dav
id M.
,“Dat
a
St
ruct
uresandAlgor
it
hmsinC++”
,Wil
eySt
udentEdi
ti
on.
 2.Aho,Alf
redV.,Ull
man,Jeff
reyD.
,Hopcr
oft,
JohnE.
 “
Dat
aSt
ruct
uresand
Al
gori
thms”,
AddisonWesl
ey.

Cour
seCode
Dat
aSt
ruct
ures
CST-
231/
ITT-
231

Depart
ment
Teachi
ngt
he Depar
tmentofComput
erSci
enceandEngi
neer
ing
Subj
ect

Pr
ogr
am Out
come a b c d E f g h i j

Mappi ngofCour
se
outcome wit
h I
,
II,
I
II
Program out
come

Pr
oject
/Tr
aini
BS ES PD PC PE OE
Cat
egor
y ng

Appr
oval Dat
eofmeet
ingoft
heBoar
dofSt
udi
es

I
nst
ruct
ionsf
ort
hepaper
-set
ter

Pleasegothroughthesei
nstr
ucti
onsthor
oughl
yandfoll
owt hesamepatter
nwhi
l
e
setti
ngthepaperasthest
udentshav
ebeenprepar
edaccordi
ngtothi
sfor
mat.

Maxi
mum Mar
ks=60 Ti
me:
3Hr
s

Thesy l
labushasbeendivi
dedintothreeequalunits.Thepaperset
terisrequi
redto
settenquestionsinal
l,t
hreequestionsfrom eachunitandacompul soryquesti
on
consist
ingoff i
vesubpart
sandbasedont hewholesyll
abus.Thecandidat
ewi l
lbe
requi
redt oat
t emptsi
xquesti
onsi ncludi
ngthecompul sor
yquesti
onnumberno1
andnotmor ethantwoquesti
onsfrom eachunit.

Nameoft
heSubj
ect Dat
aSt
ruct
ures Subj
ectCode

I
tiscer
ti
fi
edThatsy
ll
abusi
sfr
eef
rom spel
l
ing,
grammat
ical
oranydupl
i
cacy
.Cour
se
 out
comeshav
ebeenmappedwi
thPr
ogr
am out
come

S.No. Name Desi

gnat
ion si
gnat
ure

2
 CHANDI
GARHUNI
VERSI
TY,
GHARUAN

Subj
ect Sof
twar
eEngi
neer
ing L T P C
Code
Tot
alCont
actHour
s:45Hour
s
CST-
Commont
oal
lSpeci
ali
zat
ionsofCSE2nd 3 0 0 3
220/
/ITT-
220 Year

Pr
erequi
si
te:
Studi
edPr
ojectBasi
csi
nInst
it
uti
onal
Trai
ning

Mar
ks-
100

I
nter
nal
-40 Ext
ernal
-60

Cour
seObj
ect
ives

 Tost
udyandl
ear
nvar
iousmet
hodsofsof
twar
eengi
neer
ing.

 Tounder
standt
hev
ari
ousphasesofsof
twar
edev
elopment
.

 Tounder
standt
hev
ari
oust
est
ingt
echni
ques.

 Tol
ear
nvar
ioususeri
nter
facedesi
gns.

Uni
t Cour
seOut
comes

 Select
ionandi
mpl
ement
ati
onofdi
ff
erentsof
twar
edev
elopment
processmodel
s
I
 Ext
ract
ingandanal
yzi
ngsof
twar
erequi
rement
sspeci
fi
cat
ionsf
or
di
ff
erentpr
oject
s

 Defi
ningthebasi
cconceptsandi
mportanceofSoftwarepr
oject
managementconceptsli
kecostest
imati
on,schedul
ingandrevi
ewi
ng
theprogr
ess.
I
I
 I
dent
if
icat
ionandi
mpl
ement
ati
onoft
hesof
twar
emet
ri
cs
 Appl
yi
ngdi ff
erentt
est
inganddebuggi
ngt
echni
quesandanal
yzi
ngt
hei
r
ef
fect
iveness.

 Anal
yzi
ngsof
twar
eri
sksandr
iskmanagementst
rat
egi
es
I
II  Def
ini
ngtheconceptsofsoft
war equal
i
tyandr
eli
abi
l
ityont
hebasi
s
ofI
nter
nati
onalqual
i
tystandards.

Cont
ent
soft
heSy
ll
abus

Uni
t-
I [
15h]

I
ntr
oduct
ion:Def
ini
ti
onofsof
twar
eandSof
twar
eengi
neer
ing,Di
ff
erencebet
ween
Program andProduct
,Softwaredevel
opmentl i
fecy cl
e,Diff
erentl
ifecy
clemodel
s
(waterf
all
, Iter
ati
ve wat
erfal
l
,Pr ot
oty
pe,Ev olut
ionary and Spir
almodel)
,Agil
e
soft
war edev
elopmentandTheirchar
acter
ist
ics.

Soft
war e requi
rement: Requi
rement Anal y
sis, Analy
sis pri
nci
ple, Soft
ware
prot
otypi
ngSpecifi
cat
ion,Dat
amodeling,Funct
ionalmodeli
ngandinformat
ionfl
ow,
behavi
oralmodel
ing,Mechani
csofstr
ucturalmodeli
ng,Datadi
cti
onar
y.

Functi
onandObjector
ienteddesign:Str
uctur
edanal ysis,
Datafl
owdiagrams,Basi
c
obj
ectori
ent
ati
onconcepts,Unif
iedmodel i
ngl anguage,Unifi
edmodeli
nglanguage,
Usecasemodel,Cl
assdiagrams,Int
eract
iondiagrams, Acti
vi
tydi
agr
ams, St
atechart
di
agrams.

UNI
T–I
I [
15h]

Sof
twaredesign:Desi
gnprocessandconcept
s,Ef
fect
iveModul
ardesi
gn,
thedesi
gn
model
,Designdocumentat
ion,Appr
oachestoSoft
waredesi
gn.

Software Pr
ojectmanagement:Soft
ware projectplanni
ng,Pr oj
ectesti
mati
on
techni
ques,COCOMO Model,Proj
ectschedul
ing,Riskanal
y si
sandmanagement ,
Softwar
equalityandmanagement,St
aff
ing,softwareconf
igurat
ionmanagement.

Userint
erf
aceDesign:Character
ist
icsofgooduserint
erf
acedesi gn,Command
l
anguageuseri
nter
face,Menubased,Dir
ectmani
pul
ati
oninter
faces,Fundament
als
ofcommandbaseduserint
erface.

UNI
T-I
II [
15h]

SoftwareTesti
ng:Testi
ngl
evel
s,Act
ivi
ti
es,Veri
fi
cati
onandVali
dat
ion,
Unitt
est
ing,
System t
esti
ngIntegr
ati
ont
esti
ng,Val
idat
iontesti
ng,Bl
ackboxandwhit
ebox
test
ing.

Qualit
ymanagement:Sof t
warequal
i
ty,
Sof
twar
erel
i
abil
ity
,Soft
warer
evi
ews,For
mal
techni
calr ev
iews,Stat
isti
calSQA,Soft
warerel
iabi
l
ity,The I
SO 9000 codi
ng
standards,
SQAplan,SEI
CMM.

Software Mai
ntenance and Reuse:Defi
nit
ion,Ty
pes ofmaintenance,Soft
ware
rever
se engi
neeri
ng,Differ
entMai nt
enance models,Basi
cissue in any r
euse
program,r
euseapproach
Text&Ref
erenceBooks:

1.Pr essman Rogers,“ Soft

ware Engineeri
ng:A Practi
tioner
's Appr
oach”
,Sixth
edi
ti
on.
2.Somer vi
ll
eIan,“Soft
war eEngi
neeri
ng”,AddisonWesley
,8thEditi
on.
3.JamesFPet er
sandPedr yezWitol
d,“ Soft
wareEngineeri
ng– AnEngi neer
ing
Approach”,
WileyStudentEditi
on.
4.Kassem ,”SoftwareEngineeri
ng”
,engageLear ni
ng.

CST-
220/
ITT-
220 Sof
twar
eEngi
neer
ing

Department
Teachingthe Depar
tmentofCSE
Subject

a b c d E f g h i j k
Pr
ogr
am Out
come

Mappi ng ofCourse
outcome wi
th
Program outcome

Pr
oject
/
BS ES PD PC PE OE Tr
aini
n
Cat
egor
y g

Appr
oval Dat
eofmeet
ingoft
heBoar
dofSt
udi
es…….
.

I
nst
ruct
ionsf
ort
hePaper
-Set
ter

Pleasegothroughthesei
nstr
ucti
onsthor
oughl
yandfoll
owt hesamepatter
nwhi
l
e
setti
ngthepaperasthest
udentshav
ebeenprepar
edaccordi
ngtothi
sfor
mat.

Maxi
mum Mar
ks=60 Ti
me:
3Hrs

Wei
ghtageperuni
t=20mar
ks(
excl
udi
ngov
erat
temptwei
ghtage)

1.Questi
onPaperwi
l
lconsi
stoft
enquesti
ons.
2.Secti
onAofquesti
onpaperi
scompulsory
,cont
aini
ngf
ivepar
tseachof2mar
ks
cover
ingthe wholesy l
l
abus( shortanswertype-total10marks)
3.Setthr
eequest i
onsfrom eachuni tI,I
IandI I
I.Studentswi
llat
tempt5questions
sel
ecti
ngatl eastonequestionf rom secti
onsB,C&D.Eachquest i
oncar
ri
es10
marks.Questi
onsofSect i
onBwi llbefrom unitI
, Questi
onsofSecti
onCfrom unitI
I
andQuestionsofsect
ionDf r
om uni tI
II
.

4.I
nthequesti
onpaper
,di
str
ibuti
onoft
hequest
ionsshoul
dbebyconsi
der
ing30%
numeri
cal
partand70%conceptual.

Nameoft
heSubj
ect Sof
tware Subj
ectCode
Engi
neer
ing

I
tiscer
ti
fi
edThatsyl
labusi
sfr
eefrom spel
l
ing,
grammati
caloranydupl
i
cacy
.Cour
se
out
comeshavebeenmappedwi thPr
ogr
am outcome

S.No. name Desi

gnat
ion si
gnat
ure

2
 CHANDI
GARHUNI
VERSI
TY,
GHARUAN

Sof
twar
eEngi
neer
ingLab L T P C
Subj
ect
Tot
alCont
actHour
s:45Hour
s
Code
Commont
oal
lSpeci
ali
zat
ionsofCSE2nd 0 0 2 1
CSP-
Year
207/
ITP-
207
Pr
erequi
sit
e:Basi
cKnowl
edgeofpr
ojectmanagement

Mar
ks-
100

I
nter
nal
-60 Ext
ernal
-40

Cour
seObj
ect
ives

 Tounder
standt
hev
ari
ousphasesofsof
twar
edev
elopment
.

 Tol
ear
nvar
ioususeri
nter
facedesi
gns.

 Tounder
standt
hev
ari
oust
est
ingt
echni
ques.

Uni
t Cour
seOut
comes

 Tost
udyanddr
awdi
ff
erentl
evel
DFDandchar
ts.
I
-I
II
 Tost
udyanddesi
gnmodel
susi
ngUMLmodel
i
ngobj
ect
s

Li
stofExper
iment
s
 Uni
t-
I

1)Draf
taproj
ectplanf
ortheanyoftheproj
ect,
studentsubmit
tedinpr
evioussemest
er.
2)Devel
opmentofSRSdocument ,
Designdocumentforthesel
ectedpr
oject.
3)Todrawadiff
erentl
evelDFD.

Uni
t-
II
4)Todr
awaERdiagram.
5)Todr
awacasediagr
ams.
6)Todr
awasequencediagr
ams.
7)Todr
awacl
assdiagrams.

Uni
t-
II
I
8)Todrawcol
laborat
iondiagr
ams.
9)TodrawGanttchartandnetwor
kdi
agr
am.
10)Todr
awastruct
uredchat

CSP-
207/
ITP-
207 Sof
twar
eEngi
neer
ingLab

Department
Teachingthe Depar
tmentofCSE
Subject

A b c d E f g h i j k
Pr
ogr
am Out
come

Mappi ng ofCourse
outcome wi
th
Program outcome

Pr
oject
/
BS ES PD PC PE OE Tr
aini
n
Cat
egor
y g

Appr
oval Dat
eofmeet
ingoft
heBoar
dofSt
udi
es…….
.

Nameoft
heSubj
ect Sof
twar
eEngi
neer
ing Subj
ectCode
 Lab

I
tiscer
ti
fi
edThatsyl
labusi
sfr
eefrom spel
l
ing,
grammati
caloranydupl
i
cacy
.Cour
se
out
comeshavebeenmappedwi thPr
ogr
am outcome

S.No. name Desi

gnat
ion si
gnat
ure

CHANDI
GARHUNI
VERSI
TY,
GHARUAN

DataStructuresLab L T P C
Tot
alContactHour s: 45Hours
SubjectCode Commont oall Special
i
zationsof 0 0 4 2
nd
CSP-
232/ I
TP-232 CSE2 Year
Prer
equisite:St
udiedC/ C++i
npr
evi
oussemest
ers

Mar
ks-
100
I
nter
nal
-60 Ext
ernal
-40
Cour
seObj
ect
ives
 Toimpl
ementvari
ousdat
ast
ruct
ureandoper
ati
onsonthem usi
ngC++.

 Toi
mpl
ementv
ari
oussor
ti
ngandsear
chi
ngal
gor
it
hmsusi
ngC++.

Uni
t Cour
seOut
comes
Desi
gningandapply
ingappropr
iat
edat
astr
uct
ureusi
ngsi
mpl
eal
gor
it
hms
I
.
formodel
ingandsolvi
nggi
vencomputi
ngpr
obl
ems.

I
I. Under
standandi
mpl
ementt
hebot
har
raybasedandl
i
nked-
li
stbaseddat
a
 st
ruct
ures,
incl
udi
ngsi
ngl
y,doubl
y,andci
rcul
arl
i
nked-
li
sts.

I
I. Under
I standandi
mpl
ementt
heSt
ackdat
ast
ruct
ureandst
ackoper
ati
ons.

Li
stofExper
iment
s
UNIT-
I

1.Wr iteamenudr i
venpr ogram thatimpl ementfoll
owingoperati
ons( usi
ngseparat
e
functions)onalinearar ray:
a)I
nsertanewel ementatendaswel lasatagivenpositi
on
b)Del
eteanel ementf rom agi v
enwhosev al
ueisgivenorwhoseposi t
ioni
s
given
c)Tofi
ndt helocat ionofagi venel ement
d)Todisplaytheel ement soft helineararr
ay
2.Pr ogram t
odemonst rat etheuseofl inearsearchtosearchagi venelementinan
array.
3.Pr ogram t
odemonst ratet heuseofbi narysearchtosearchagi venelementina
sortedar r
ayinAscendi ngor der .
4.Pr ogram t
osor tanar rayofi nteger
si nascendingorderusingbubblesort.
5.Pr ogram t
osor tanar rayofi nteger
si nascendingorderusingselecti
onsort.
6.Pr ogram t
osor tanar rayofi nteger
si nascendingorderusinginsert
ionsort.
7.Pr ogram t
osor tanar rayofi nteger
si nascendingorderusingmer gesort.

UNI
T-I
I

8.Writeamenudr i
venprogr
am thatmai
ntai
nsalinearl
inkedli
stwhoseel
ements
arestoredinonascendi
ngorderandimplement
st hefoll
owingoper
ati
ons(usi
ng
separ
atefunct
ions)
:

a)Inser tanewel ement

b)Del eteanexi st
ingelement
c)Sear chanel ement
d)Di splayalltheel ement s
9.Wr i
teapr ogram todemonst ratetheuseofst ack( i
mpl ementedusingli
neararray)
i
nconv er
tingar i
thmet icexpressi onfrom infixnotati
ont opost f
ixnotati
on.
10.Program t odemonst rat
et heuseofst ack( i
mpl ement edusinglinearl
inkedli
sts)
i
nev aluatingar i
thmet icexpressi oninpost fi
xnotation.
11.Program t osor tanar rayofi ntegersinascendi ngor derusingquicksort.
12.Progr am t odemonst rat
iont hei mplement ati
onofv ariousoperati
onsonal inear
queuer epr esent edusi ngalinearar ray.
13.Pr ogr am t o demonst r
ation t he implement ati
on ofv ari
ous operat
ions on a
ci
rcularqueuer epresentedusi ngal i
nearar r
ay.
UNI T-I
II
14.Pr ogram t odemonst ratet hei mplement ati
onofv ari
ousoper ati
onsonaqueue
repr
esentedusi
ngal i
nearli
nkedli
st(l
inkedqueue).
15.Program toil
lustr
atethei mplementat
ionofdi f
ferentoper at
ionsonabi
nar
y
searchtr
ee.
16.Progr
am tosortanarrayofint
egersinascendi
ngorderusi ngheapsor t
.
17.Progr
am toil
l
ustrat
ethet r
aversalofgr
aphusingbreadth-fi
rstsearch.
18.Progr
am toil
l
ustrat
ethet r
aversalofgr
aphusingdept h-
fi
rstsearch.

CSP-232/I
TP-232 Dat
aSt
ruct
uresLab
Depart
ment
Teachi
ngthe Depar
tmentofComput
erSci
enceandEngi
neer
ing
Subj
ect

Pr
ogr
am Out
come a b c D E f g h i j

Mappi ngofCour
se
outcome wit
h I
,
II,
I
II
Program out
come

Pr
oject
/Tr
aini
BS ES PD PC PE OE
Cat
egor
y ng

Appr
oval Dat
eofmeet
ingoft
heBoar
dofSt
udi
es

Nameoft
heSubj
ect Dat
aSt
ruct
uresLab Subj
ectCode

I
tiscer
ti
fi
edThatsyl
labusi
sfr
eefrom spel
l
ing,
grammati
caloranydupl
i
cacy
.Cour
se
out
comeshavebeenmappedwi thPr
ogr
am outcome

S.No. name Desi

gnat
ion si
gnat
ure

1 Asst
t.Pr
of

2 HOD

CHANDI
GARHUNI
VERSI
TY,
GHARUAN

JavaProgrammi ngLab L T P C
Tot
alContactHours:45Hours
SubjectCode Commont oallSpeci
ali
zat
ionsof 0 0 4 2
CSY-
208/ I
TY-208 CSE2ndYear
Pr
erequisi
te:
Studi
edC/ C++i
npr
evi
oussemest
ers

Mar
ks-
100
I
nter
nal
-60 Ext
ernal
-40
Cour
seObj
ect
ives
 Toimpl
ementpr
ogr
amsi
njav
a.

 Toenabl
estudent
stor
etr
iev
eandupdat
edat
afr
om r
elat
ionaldat
abases
usi
ngJDBC.

Uni
t Cour
seOutcomes
Thest
udent
swil
ll
ear
ntowr
it
e,compi
l
ing&execut
ebasi
cjav
apr
ogr
am.

I
.Thestudentwil
llear
ntheuseofdat
aty
pes&v
ari
abl
es,
deci
sioncont
rol
st
ruct
ures:i
f,nestedi
fetc.

I
I.Thest
udentwi
l
llear
ntheusel
oopcont
rol
str
uct
ures:
do,
whi
l
e,f
oret
c.

Thestudentwi
l
lbeabl
etocr
eat
ecl
assesandobj
ect
sanduset
hem i
nthei
r
I
II
.progr
am.

Li
stofExper
iment
s

UNI
T-I

1.Pr
ogr
amsusi
ngconst
ruct
oranddest
ruct
or.

2.Cr
eat
ionofcl
assesanduseofdi
ff
erentt
ypesoff
unct
ions.

3.Countt
henumberofobj
ect
scr
eat
edf
oracl
assusi
ngst
ati
cmemberf
unct
ion.

4.Wr
it
epr
ogr
amsoni
nter
faces.

UNI
T-I
I

5.Wr
it
epr
ogr
amsonpackages.

6.Wr
it
epr
ogr
amsusi
ngf
unct
ionov
erl
oadi
ng.

7.Pr
ogr
amsusi
ngi
nher
it
ance.

8.Pr
ogr
amsusi
ngI
Ost
reams.

9.Pr
ogr
amsusi
ngf
il
es.

UNI
T-I
II

10.Wr
it
eapr
ogr
am usi
ngexcept
ionhandl
i
ngmechani
sm.

11.Pr
ogr
amsusi
ngAWT.

12.Pr
ogr
amsonswi
ng.
13.Pr
ogr
amsusi
ngJDBC.

CSY-208/I
TY-208 Jav
aPr
ogr
ammi
ngLab
Depart
ment
Teachi
ngthe Depar
tmentofComput
erSci
enceandEngi
neer
ing
Subj
ect

Pr
ogr
am Out
come a b c D E f g h i j

Mappi ngofCour
se
outcome wit
h I
,
II,
I
II
Program out
come

Pr
oject
/Tr
aini
BS ES PD PC PE OE
Cat
egor
y ng

Appr
oval Dat
eofmeet
ingoft
heBoar
dofSt
udi
es

Nameoft
heSubj
ect Jav
aPr
ogr
ammi
ng Subj
ectCode
Lab

I
tiscer
ti
fi
edThatsyl
labusi
sfr
eefrom spel
l
ing,
grammati
caloranydupl
i
cacy
.Cour
se
out
comeshavebeenmappedwi thPr
ogr
am outcome

S.No. name Desi

gnat
ion si
gnat
ure

1 Asst
t.Pr
of

2 HOD
 Chandi
gar
hUni
ver
sit
y,Ghar
uan

Engi
neer
ingMathemati
cs(
ForLEET
L T P C
Student
s)
Subj
ectCode Tot
alCont
actHour
s:45Hour
s
SMY-
222 Commontoal
lSpeci
ali
zat
ionsof 3 1 0 4
nd
CSE2 Year

Pr
erequi
sit
e:knowl
edgeofmat
hemat
icsupt
oseni
orsecondar
y
l
evel
.

Mar
ks-
100

I
nter
nal
-40 Ext
ernal
-60

Cour
seObj
ect
ives

 Toimpartanaly
tical
abi
l
ityi
nsol
vingmat
hemat
ical
probl
emsasappl
i
edt
othe
respect
ivebr
anchesofEngi
neer
ing.

 Tohav
eknowl
edgei
nli
nearal
gebr
a.

 Toi
mpr
ovet
hei
rabi
l
ityofcomput
ati
oni
nmat
ri
cesandcompl
exnos.

 Tof
ami
l
iar
izest
udent
swi
thpar
ti
aldi
ff
erent
iat
ion.

 Toenabl
ethest
udent
stoappl
ythenot
ionspr
act
ical
l
y.

 Toi
ntr
oducev
ari
ousor
dinar
yandl
i
neardi
ff
erent
ial
equat
ions.

 Topr
act
icev
ari
ousmet
hodsofsol
vi
ngt
hesedi
ff
erent
ial
equat
ions.

Uni
t Cour
seOut
come

Underst
andtheconcept
sofmodel
i
ngort
ransl
ati
ngaphy
sical
oranyot
her
 pr
oblem int
oamat hemati
cal
mode

 Abl
etoappl
ythi
sknowl
edget
osol
vet
hepr
obl
ems.

 Anabi
l
ityt
oident
if
y,f
ormul
ates,
andsol
vest
hepr
obl
ems.

Cont
ent
soft
heSy
ll
abus

UNI
T-I [
15h]
BASICALGEBRA
Matri
ces:Rankofmat ri
ces;el
ement
arytr
ansf
ormati
on;r
educt
iontonormalform;
consi
stency and sol
uti
on of homogenous and non homogeneous al
gebr
aic
equat
ions.

Compl exNumber s:De-Moiv r

e’stheorem,appl
i
cationsofDe-Moivr
e’stheorem;real
andimagi nar
ypartsofexponentialf
uncti
on;l
ogari
thmicfunct
ion;
circul
arfuncti
on.
Infi
nit
eSer i
es:Conver
genceanddi v
ergenceofseri
es;test
sofconvergence( wi
thout
proofs),compari
son test;rati
ot estand Gausst est;conv
ergenceand absol ute
convergenceofalt
ernati
ngseries.

UNI
T-I
I [
15h]

PARTI
ALDI
FFERENTI
ATI
ONANDDI
FFERENTI
ALEQUATI
ON

Parti
al Diff
erent
iati
on: Review of basic dif
ferenti
ati
on,Defini
ti
on of Partial
Diff
erent
iat
ion,Funct i
onoft woormor evari
ables;homogeneousf unct
ion;Eul
er’
s
theorem;compositefunct
ions;i
mpl
ici
tfunct
ions;total
deri
vat
ives.

Di
ff
erent
ialequat
ions:Or
dinar
yDiff
erenti
alEquat
ion,Exactdi
ff
erent
ial
equat
ions,
methodofVari
abl
eSeparabletosol
veODE.
UNI
T-II
I
[15h]

MULTI
PLEI
NTEGRALANDVECTORCALCULUS

Doubl
eandTri
pleI
ntegr
ati
on:Rev
iew ofbasi
cofi
ntegr
ati
on,doubl
eandt
ri
ple
I
ntegr
ati
on.

Vector Calcul
us:Scalar and vect
or fi
elds;di
ffer
enti
ati
on of v
ect
ors;v
ect
or
di
fferent
ial
operat
ors:
Del,gradi
ent
,di
ver
gence,cur
l,pr
opert
ies.

TextBooks:

1.Grewal
,B.
S.,Hi
gherEngi
neer
ingMat
hemat
ics,KhannaPubl
i
sher
s,NewDel
hi,42th
ed.
2013.

Ref
erenceMat
eri
al:

1.Kreyszi
g,E.,AdvancedEngineeri
ngMat hemati
cs, JohnWiley
,10thEd.
2011.
2.RayWy l
ie,C.,AdvancedEngineeri
ngMat hemati
cs, 6thed.
,McGrawHill
.
3.Jain,R.K.andl yengar,S.
R. ,Adv
K. ancedEngi neeri
ngMat hemati
cs,3rdEdi
ti
on,
NarosaPublishingHouse,NewDel hi,
2004.
4.Ramana, B.VAdv ancedEngineeri
ngMat hemat
ics, McGrawHill
,Jul
y2006.

I
nst
ruct
ionsf
ort
hepaper
-set
ter
Pleasegothroughthesei
nstr
ucti
onsthor
oughl
yandfoll
owt hesamepatter
nwhi
l
e
setti
ngthepaperasthest
udentshav
ebeenprepar
edaccordi
ngtothi
sfor
mat.

Maxi
mum Mar
ks=60 Ti
me:
3Hr
s

Thesy l
labushasbeendivi
dedintothreeequalunits.Thepaperset
terisrequi
redto
settenquestionsinal
l,t
hreequestionsfrom eachunitandacompul soryquesti
on
consist
ingoff i
vesubpart
sandbasedont hewholesyll
abus.Thecandidat
ewi l
lbe
requi
redt oat
t emptsi
xquesti
onsi ncludi
ngthecompul sor
yquesti
onnumberno1
andnotmor ethantwoquesti
onsfrom eachunit.

Cour
seCode
Engi
neer
ingMat
hemat
ics
SMY-
215

Depart
ment
Teachi
ngt
he Depar
tmentofAppl
iedSci
ences
Subj
ect

Pr
ogr
am Out
come a b c d E F G h i j

Mappi ngofCour
se
outcome wit
h I
,
II I
,
II,
I
II
Program out
come

Pr
oject
/Tr
aini
BS ES PD PC PE OE
Cat
egor
y ng


Appr
oval Dat
eofmeet
ingoft
heBoar
dofSt
udi
es

Nameoft
heSubj
ect Engineer
ing Subj
ectCode
Mathematics

I
tiscer
ti
fi
edThatsyl
labusi
sfr
eefrom spel
l
ing,
grammati
caloranydupl
i
cacy
.Cour
se
out
comeshavebeenmappedwi thPr
ogr
am outcome

S.No. name Desi

gnat
ion si
gnat
ure

1 Asst
t.Pr
of

2 HOD