You are on page 1of 76

Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!

B$%& !"#'
B. TECH SECOND YEAR
COMPUTER ENGINEERING
(Batch 2012)
Sessi! (201"#1$)
SCHEME O% PAPERS
THIRD SEMESTER (COMPUTER ENGINEERING)
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1. ECE-209 Digital Electronic Circuits 3 1 0 3.5
2. CPE-201 Computer Architecture 3 1 0 3.5
". CPE-202 Obect Oriente! Programming 3 1 0 3.5
$. CPE-203 Operating "#stems 3 1 0 3.5
-. CPE-20$ "#stem Anal#sis % Design 3 1 0 3.5
.. CPE-205 Discrete &athematical "tructure 3 1 0 3.5
/. ECE-259 Digital Electronic Circuits 'ab 0 0 2 1.0
0. CPE-252 Obect Oriente! Programming 'ab 0 0 2 1.0
1. CPE-253 Operating "#stem 'ab 0 0 2 1.0
Tta2
1
(
) ) 2$
Tta2 C!tact H&,s 3 "0
ECE-259* CPE-252 an! CPE-253 are practical papers onl#. +here ,ill not be an# theor#
e-amination .or these papers.
U!i4e,sit5 C22e6e 7 E!6i!ee,i!6
Punabi /ni0ersit#* Patiala.
Ge!e,a2 I!st,&cti!s t the Pa8e, Sette,s
Page # o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
1Common .or 2.+ech. in Computer Engineering* Electronics an! communication Engineering*
&echanical Engineering* Ci0il Engineering an! 3ntegrate! 2+ech4&2A 2ranches5
A882ica'2e t 20109 20119 2012 Batches !25
+he 2. +ech 6uestion paper structure ,ill be as sho,n belo,7
Patte,! 7 :&esti! Pa8e,
+3+'E O8 "/29EC+ 1CODE----5
2achelor o. +echnolog# 12ranch5 "ection7 :::..
En! "emester E-am
+3&E A''O;ED7 3 <our =oll. >o::::.
&a-imum &ar?s7 $5
>ote7- Attempt .our 6uestions selecting one 6uestion .rom each section A* 2* C an! D. "ection E is compulsor#.
Secti!#A (%,* Secti! A 7 the s522a'&s)
@1. .........................................................................
@2. ........................................................................ 1-9
Secti!#B (%,* Secti! B 7 the s522a'&s)
@3. .........................................................................
@$. ......................................................................... 1-9
Secti!#C (%,* Secti! C 7 the s522a'&s)
@5. .........................................................................
@). ......................................................................... 1-9
Secti!#D (%,* Secti! D 7 the s522a'&s)
@A. .........................................................................
@(. ......................................................................... 1-9
Secti!#E (C**! 7,* ;h2e 7 the S522a'&s)
@9.
a5.........................................................................
b5 .........................................................................
c5 .........................................................................
!5 .........................................................................
e5 .........................................................................
.5 .........................................................................
g5 .........................................................................
h5 .........................................................................
i5......................................................................... 9-1
Note for the paper setter:
1. >umbers o. 6uestions to be set are nine 195 as per the abo0e .ormat.
2. "ection A* 2* C an! D contain t,o 6uestions o. >ine 195 mar?s each. <o,e0er* nine mar?s 6uestion ma#
be splitte! into subparts.
3. "ection E is compulsor# an! contains nine sub-parts o. one mar? each. +he ans,ers .or each 6uestion
shoul! pre.erabl# be o. 2 to 3 lines.
$. +he ma-imum limit on numerical 6uestions to be set in the paper is 35B ,hile minimum limit is 20B
e-cept theoretical papers.
5. +he paper setter shall pro0i!e !etaile! mar?ing instructions an! solution to numerical problems .or
e0aluation purpose in the separate ,hite en0elopes pro0i!e! .or solutions.
). +he paper setters shoul! seal the internal % e-ternal en0elope properl# ,ith signatures % cello tape at
proper place.
A. 'og tables* charts* graphs* Design !ata tables etc. shoul! be speci.ie!* ,hene0er nee!e!.
(. /se o. "cienti.ic calculator shoul! be clearl# speci.ie!.
9. +here are some &2A subects 1like BAS 202 Operational Research, MBA 5011 Foundation of Financial
Accounting, MBA 5012 Foundation of Managerial Accounting, MBA 5022 Foundations of Marketing,
MBA 5023 Foundations of a!, MBA 5031 Foundations of Macroecono"ics, MBA 5032 Foundations of
Microecono"ics, MBA#5033 Foundations of $nternational Business, MBA 5013 Foundations of Finance5
,here s#llabus is not !i0i!e! among .our sections namel# A*2*C*D then @uestion paper must be set b#
,ithout speci.#ing section in it an! gi0ing proper ,eightage to the respecti0e portions.
ECE#201 DIGITA+ E+ECTRONIC CIRCUITS
+ T P C,
Page ! o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3 1 0 3.5
Secti!#A
N&*'e, S5ste*s a!) C)es < 2inar#* Octal an! <e-a!ecimal number s#stems* 2inar# to
!ecimal* Decimal to binar#* Octal an! he-a!ecimal to binar# an! binar# to octal an!
he-a!ecimal con0ersions* 2CD co!e* Cra# co!e* Alphanumeric co!es* Parit# metho! .or error
!etection.
+6ic 6ates a!) B2ea! A26e',a< O=* A>D an! >O+ operations an! gates* >O=* >A>D*
DO= an! D>O= operations an! gates* E0aluating logic circuit outputs* 3mplementing circuits
.rom 2oolean e-pressions. 2oolean theorems* De&organEs theorem* uni0ersalit# o. >A>D an!
>O= gates* 3EEE4A>"3 stan!ar! logic s#mbols.
Secti!#B
C*'i!ati!a2 +6ic Ci,c&its< "um o. pro!uct .orm* Pro!uct o. sum .orm* "impli.ication o.
2oolean .unctions using algebric an! Farnaugh map metho!s. <al. a!!er* 8ull a!!er* <al.
subtractor* .ull subtractor circuits* &ultiplication operation an! A'/.
C*'i!ati!a2 )i6ita2 IC 8ac=a6es< &ultiple-ers* De-multiple-ers* Co!e con0erters*
Combinational logic circuits. "ome e-amples o. 2oolean gate 3Cs an! 3Cs implementing
!i..erent combinational logic circuits.
Secti!#C
Se>&e!tia2 Ci,c&its< ="* 9F* D an! + .lip-.lops circuits an! their con0ersions* "erial an!
parallel counters an! shi.t registers* /ni0ersal shi.t registers* "ome e-amples o. counter an! shi.t
register 3Cs.
+6ic 7a*i2ies a!) )i6ita2 ICs< Characteristics o. !igital 3Cs* Classi.ication o. !i..erent logic
.amilies.
Secti!#D
Me*,ies < "emi-con!uctor memories* =O& an! =A&* =O& using !io!es* 29+s* an! 8E+s.
=A& cell. &emor# organiGation an! e-pansion. An i!ea about other t#pes o. memories.
Di6ita2 t A!a26 a!) A!a26 t Di6ita2 C!4e,te,s< Hariable register net,or?* =-2= D4A
con0erters. D4A accurac# an! resolution* A4D con0erters* "imultaneous con0ersion an! counter
metho!. An i!ea about D4A an! A4D 3C pac?ages.
Rec**e!)e) B=s <
1. =.9 +occi* I Digital Principles CircuitI Prentice <all o. 3n!ia* >e, Delhi.
2. &.&. &ano* I Digital DesignI &cgra, <ill* /"A
3. &orris &. &ano IDigital logic an! Computer !esignI Prentice <all o. 3n!ia >e, Delhi.
$. &al0ino 'each* I Digital Principles an! ApplicationsI &Cgra, <ill* /"A
CPE#201 COMPUTER ARCHITECTURE
+ T P C,
Page ' o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3 1 0 3.5
Secti!#A
Re4ie? 7 Di6ita2 E2ect,!ics7 8lip-.lops* registers* counters* multiple-er* !eco!er.
Basic C*8&te, O,6a!i@ati! a!) Desi6!< 3nstruction Co!es* Computer 3nstructions* +iming
an! Control* E-ecution o. instructions* 3nput* Output an! 3nterrupt* Design o. basic Computer.
Secti!#B
Mic, 8,6,a* C!t,2 O,6a!i@ati!< Control &emor# A!!ress "e6uencing* &icro
program "e6uences* &icroinstruction 8ormats.
A,ith*etic P,cess, Desi6!< Comparison an! "ubtraction o. unsigne! 2inar# >umbers*
A!!ition* "ubtraction* &ultiplication Algorithm.
Secti!#C
C!t,2 P,cess, O,6a!i@ati!< Processor 2us OrganiGation* A'/* "tac? OrganiGation*
3nstruction 8ormats* A!!ressing &o!es* Data +rans.er an! &anipulation* Program Control*
Pipeline an! 0ector processing.
I!8&t#O&t8&t O,6a!i@ati!< 34O inter.ace* As#nchronous Data trans.er D&A* Priorit#
3nterrupt* 34O Processor.
Secti!#D
Me*,5 O,6a!i@ati!< &emor# hierarch#* main memor#* Associati0e memor#* Hirtual %
Cache &emor#* &emor# &anagement <ar!,are.
M&2ti8,cess,s< Characteristics o. multiprocessors* interconnection structures* inter-processor
arbitration* inter-processor communication % s#nchroniGation* cache coherence.
Rec**e!)e) B=s<
1. Computer "#stem Architecture7 &.&. &ano* Prentice <all o. 3n!ia.
2. "tructure! Computer OrganiGation7 An!re, ". +anenbaum* Prentice <all o. 3n!ia
3. 9.P. <a#es* Computer "#steui Architecture* Prentice <all o. 3n!ia* >e, Delhi.
$. Ali leigh. "#stem Architecture* "outh ,ester publishing co. >e, Delhi.
CPE#202 OBAECT ORIENTED PROGRAMMING
+ T P C,
Page + o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3 1 0 3.5
Secti!#A
I!t,)&cti! t O'(ect O,ie!te) P,6,a**i!6< ;hat is obect oriente! programming. ;h#
!o ,e nee! obect-oriente!* Programming characteristics o. obect-oriente! languages. C an! CJ
J* Obect oriente! para!igm* elements o. obect oriente! programming* &erits an! !emerits o.
OO &etho!olog#.
CBB 7&!)a*e!ta2s< Data t#pes* +o?ens* Operators an! E-pressions* Control 8lo,* Arra#s*
"trings.
Secti!#B
%&!cti!s C St,&ct&,es< Protot#ping* re.erencing the 0ariables in .unctions* t#pes o. .unction
call* "tructures* memor# allocation in structures
C2asses a!) O'(ects< &emor# allocation .or obects* Arra#s o. obects* Classes* constructors
an! !estructors* operator o0erloa!ing* inheritance* 0irtual .unctions an! pol#morphism.
Secti!#C
I!he,ita!ce< E-ten!ing classes* Deri0e! classes* +#pes o. 3nheritance* o0erloa!ing an!
o0erri!ing.
A)),esses a!) 8i!te,s< +he a!!ress-o. operator % pointer an! arra#s. C-t#pes string. &emor#
management7 >e, an! Delete* pointers to obects* !ebugging pointers.
Secti!#D
P25*,8his*< Hirtual .unctions an! pol#morphism* abstract classes* 0irtual base class.
IDO 8e,ati!s a!) 7i2es< Classes .or .iles* operations on a .ile* .ile pointers. 8unction templates*
Class templates E-ceptions.
Rec**e!)e) B=s<
1. Obect Oriente! Programming ,ith C J J b# 2ala Curus,am#K +A+A &cCra, <ill
Publishing Co. 't!.
2. +urbo C J J =obert an! 'a.ore7 Calgolia Publications.
3. "atGinger* Obect Oriente! Anal#sis an! Design ,ith the uni.ie! process* Cengage
'earning 1+homson5
$. CJJ Primer Plus b# "tephan % P=A+7 Calgotia Publications
CPE#20" OPERATING SYSTEMS
+ T P C,
Page , o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3 1 0 3.5
Secti!#A
Basic %&!cti!s a!) C!ce8ts 7 O8e,ati!6 S5ste*s< Concept o. an operating s#stem*
batch s#stem* &ulti-programme!* +ime sharing* Personal Computer "#stem* Parallel s#stem*
=eal time s#stem* Ceneral s#stem Architecture.
%eat&,es a!) O'(ecti4e 7 O8e,ati!6 S5ste*s< "#stem components* operating s#stem ser0ices*
"#stem calls* "#stem Programmes* "#stem "tructure* "#stem !esign an! implementation.
Secti!#B
P,cess Ma!a6e*e!t< Concept o. process* process states* process state transitions* process
control bloc?* operations o. processes* !ea!loc?s* sche!uling algorithms* sche!uling criteria
Secti!#C
Me*,5 Ma!a6e*e!t< 'ogical an! ph#sical a!!ress space* storage allocation an! management
techni6ues* s,apping* concepts o. multi programming* paging* segmentation* 0irtual memor#*
0irtual storage management strategies* Deman! Paging* Page =eplacement Algorithms*
+hrashing.
Secti!#D
I!7,*ati! Ma!a6e*e!t< 8ile concept* Access metho!* Director# structure* Protection 8ile
s#stem structure* Allocation metho!s* .ree space management* Director# implementation
Dis= Ma!a6e*e!t< Dis? structure* Dis? "che!uling* Dis? &anagement. ",ap "pace
&anagement.
Rec**e!)e) B=s<
1. Operating "#stem7 1"i-th E!ition5 20057 Cal0in "ilberschatG* A!!ison ;esle#
Publishing 't!.
2. 8l#nn I/n!erstan!ing operating "#stemsI* Cengage 'earning 1+homson5
3. D& Dham!here* IOperating "#stem r A Concept 2ase! ApproachI* +ata &e Cra,- <ill.
$. Operating "#stems Design an! 3mplementation7 An!re, ". +anembaum*
P<3 1'atest E!ition5.
CPE#20$ SYSTEM ANA+YSIS C DESIGN
+ T P C,
Page * o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3 1 0 3.5
Secti!#A
"#stems Concepts an! 3n.ormation "#stems En0ironment7 3ntro!uction* characteristics o. a
s#stem* Elements o. a s#stem* the s#stem !e0elopment 'i.e C#cle* =ole o. a "#stem Anal#st.
Secti!#B
"#stem Planning an! 3nitial 3n0estigation* 3n.ormation Cathering* +he +ools o. structure!
anal#sis* 8easibilit# "tu!#* Cost4 2ene.it Anal#sis.
Secti!#C
+he process an! stages o. s#stem Design* 3nput4Output an! .orms !esign* 8ile OrganiGation an!
!atabase !esign.
Secti!#D
"#stem testing an! 6ualit# assurances* 3mplementation an! so.t,are maintenance* Proect
"che!uling an! so.t,are* "ecurit#* Disaster4=eco0er#* an! Ethics in s#stem !e0elopment.
Case stu!# o. the .ollo,ing s#stems
135 3n0entor# Control
1335 =ail,a# =eser0ation "#stem
13335 /ni0ersit# &anagement "#stem
13H5 <ospital management "#stem

Rec**e!)e) B=s <
1. "#stem anal#sis an! !esign - Elias &.A,a!.
2. "#stem anal#sis an! !esign LPerr# E!,ar!s
3. Anal#sis an! !esign o. in.ormation s#stems L 9ames A."enn
$. "#stem anal#sis an! Design b# Elias &. A,a! Calgotia Publication P0t. 'imite!.
CPE#20- Disc,ete Mathe*atica2 St,&ct&,es
+ T P C,
Page ) o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3 1 0 3.5
Secti!#A
Re2ati!s a!) %&!cti!s< 2inar# relations* composition o. relationsK E6ui0alence relations an!
partitionsK partiall# or!ere! sets an! 'attice <asse !iagramsK 8unctions* 3nection* "urection an!
2isectionK Composition o. .unctions. =ecursion an! =ecurrence =elations7 Pol#nomials an! their
e0aluation* recursion* iteration* se6uences an! !iscrete .unctions* =ecurrence =elations*
generating .unctions.
Secti!#B
G,a8hs< 3ntro!uction to graphs* Craph terminolog#* =epresenting Craphs an! Craph
3somorphism* Connecti0it#. &athematical 'ogic7 "tatement an! notations* normal .orms* theor#
an! in.erence .or statement an! calculus* pre!icate calculus* in.erence theor# .or pre!icate
calculus. Craph +heor#7 Directe! an! un!irecte! graphs an! their matri- representations7
Eucli!ean paths an! c#clesK <amiltonian paths an! c#clesK shortest paths* Euler.Es .ormula.
Secti!#C
B2ea! A26e',a< 2asic Circuits an! theorems* 2oolean e-pressionsK 'ogic gates an! relation o.
2oolean .unctions. 3n!uction an! =ecursion7 Principle o. &athematical in!uctionK =ecursi0e
!e.inition.
Secti!#D
A26e',aic St,&ct&,es< 3ntro!uction to algebraic structures* semi groupsK Croups an! subgroupsK
<omomorphism an! homomorphism o. groups* 'agrange theorem.
Rec**e!)e) B=s<
1. 9.P.+remble7 Discrete &athematics "tructure ,ith application to Computer "cience*
&cCra, <ill* 19(A
2. +russ* 9ohan.F7 Discrete &athematics .or Computer "cientist* Pearson E!ucation* 3n!ia.
3. 'iu* C.'.7 Elements o. Discrete &athematics* $lh E!ition* &cCra, <ill* >e, Mor?*
199(.
ECE#2-1 DIGITA+ E+ECTRONIC CIRCUITS +AB
+ T P C,
Page - o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
0 0 2 1.0

+ist 7 EE8e,i*e!ts
E-periment 1.
i5 Heri.# the truth table .or !i..erent 'ogic Cates.
ii5 =ealiGe A>D*O=* >O=* >O+ .unctions using onl# >A>D Cate.
iii5 =ealiGe A>D*O=* >A>D* >O+ .unctions using onl# >O= Cate.
i05 3mplement ED-O=* ED->O= using A>D.O=*>O+ Cates
05 3mplement ED-O=* ED->O= using onl# >A>D* >O= Cates
E-periment 2. 2oolean Algebra7-
i5 Heri.# la,s o. &ultiplication.
ii5 Heri.# la,s o. A!!ition.
E-periment 3. &a?e the circuit o. 2inar# a!!er theorticall#.
i5 <al.-A!!er.
ii5 8ull-A!!er an! then Heri.#.
E-periment $. &a?e the circuit o. binar# subtractor theoreticall#.
i5 <al.-"ubtractor
ii5 8ull-"ubtractor an! then Heri.#.
E-periment 5. Construct !i..erent t#pes o. 88.
i5 ="-88
ii5 9F-88
iii5 D-88
i05 +-88
E-periment ). Heri.# the &aster-"la0e 9-F.lip .lops an! construct &aster "la0e 88 .rom 9F-88.
E-periment A. Heri.# the $-bit magnitu!e comparator.
E-periment (. Cenerate all the 0-9 !igits .rom 2CD to A segment !eco!er an! then ma?e F-&ap.
E-periment 9. &a?e truth table .or 1)71 mu- an! implement ACDJ2AJAC2 in it.
E-periment 10. Heri.# all the shi.t registers.
i5 "3"O
ii5 "3PO
iii5 P3"O
i05 P3PO
E-periment 11. Heri.# !eca!e Counters7
i5 Heri.# an! Design &-) Counter7
E-periment 12. +o "tu!# % Heri.# ADC an! DAC con0erter.
CPE # 2-2 OBAECT ORIENTED PROGRAMMING +AB
+ T P C,
Page . o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
0 0 2 1.0
1. ;rite a program to illustrate the ,or?ing o. !i..erent iterati0e controls.
2. ;rite a program to illustrate the use o. con!itional statements.
3. ;rite a program to illustrate !i..erence bet,een call b# re.erence an! call b# 0alue.
$. ;rite a program to illustrate use o. classes an! obects.
5. ;rite a program to illustrate the use o. constructors an! !estructors in obect oriente!
language.
). ;rite a program to illustrate the use operator o0erloa!ing in obect oriente! language.
A. ;rite a program to illustrate the use o. inheritance an! t#pe o. inheritance in obect
oriente! language.
(. ;rite a program to illustrate the use 0irtual .unction in obect oriente! language.
9. ;rite a program to illustrate the use runtime pol#morphism in obect oriente!
language.
10. ;rite a program to illustrate the use o. 8ile "tream operation in obect oriente!
language.
CPE#2-" OPERATING SYSTEMS +AB
Page #" o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
+ T P C,
0 0 2 1.0
1. 8amiliariGation o. />3D4'3>/D En0ironment.
2. 3nstallation an! A!ministration o. />3D4'3>/D operating s#stem.
3. 3mplementation o. common comman!s o. />3D operating s#stems.
$. ;or?ing on 0i e!itor using its !i..erent mo!es.
5. =e!irection o. input an! output using 8ilters an! Pipes.
). "hell programming an! its .eatures.
A. 3mplementation o. programs using shell scripts.
Rec**e!)e) B=s<
1. 8orouGan />3D an! "hell Programming 1
s t
E!ition* Cengage 'earning
1+homson5
B. TECH SECOND YEAR
Page ## o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
COMPUTER ENGINEERING
(Batch 2012)
Sessi! (201"#1$)
SCHEME O% PAPERS
%OURTH SEMESTER (COMPUTER ENGINEERING)
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1. 2A"-201 >umerical &etho!s % Applications 3 1 0 3.5
2. CPE-20) Hisual Programming 3 1 0 3.5
". CPE-20A Computer >et,or?s 3 1 0 3.5
$. CPE-20( Data "tructures 3 1 0 3.5
-. <""-201 &anagement Practice % OrganiGation 2eha0iour 3 1 0 3.5
.. Electi0e 3 N 3 1 0 3.5
/. 2A"-251 >umerical &etho!s % Application 'ab 0 0 2 1.0
0. CPE-25) Hisual Programming 'ab 0 0 2 1.0
1. CPE-25( Data "tructures using C4CJJ 'ab 0 0 2 1.0
10. NN En0ironmental "cience
Tta2 1
(
) ) 2$
Tta2 C!tact H&,s 3 "0
E2ecti4e S&'(ects F I G
S.
N.
S&'(ect
C)e
S&'(ect Na*e + T P C,.
1. 2A"-202 Operations =esearch 3 1 0 3.5
2. CPE-209 Computer Peripheral % 3nter.aces 3 1 0 3.5
GChse a!5 !e 7,* the 2ist
CPE-25)* CPE-25( an! 2A"-251 are practical papers onl#. +here ,ill not be an# theor#
e-amination .or these papers.
N N 3n a!!ition to abo0e mentione! subects* there ,ill be an a!!itional course on En0ironmental
"cience as a 6uali.#ing subect.
U!i4e,sit5 C22e6e 7 E!6i!ee,i!6
Punabi /ni0ersit#* Patiala.
Ge!e,a2 I!st,&cti!s t the Pa8e, Sette,s
1Common .or 2.+ech. in Computer Engineering* Electronics an! communication Engineering*
&echanical Engineering* Ci0il Engineering an! 3ntegrate! 2+ech4&2A 2ranches5
A882ica'2e t 20109 20119 2012 Batches !25
Page #! o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
+he 2. +ech 6uestion paper structure ,ill be as sho,n belo,7
Patte,! 7 :&esti! Pa8e,
+3+'E O8 "/29EC+ 1CODE----5
2achelor o. +echnolog# 12ranch5 "ection7 :::..
En! "emester E-am
+3&E A''O;ED7 3 <our =oll. >o::::.
&a-imum &ar?s7 $5
>ote7- Attempt .our 6uestions selecting one 6uestion .rom each section A* 2* C an! D. "ection E is compulsor#.
Secti!#A (%,* Secti! A 7 the s522a'&s)
@1. .........................................................................
@2. ........................................................................ 1-9
Secti!#B (%,* Secti! B 7 the s522a'&s)
@3. .........................................................................
@$. ......................................................................... 1-9
Secti!#C (%,* Secti! C 7 the s522a'&s)
@5. .........................................................................
@). ......................................................................... 1-9
Secti!#D (%,* Secti! D 7 the s522a'&s)
@A. .........................................................................
@(. ......................................................................... 1-9
Secti!#E (C**! 7,* ;h2e 7 the S522a'&s)
@9.
a5.........................................................................
b5 .........................................................................
c5 .........................................................................
!5 .........................................................................
e5 .........................................................................
.5 .........................................................................
g5 .........................................................................
h5 .........................................................................
i5......................................................................... 9-1
Note for the paper setter:
1. >umbers o. 6uestions to be set are nine 195 as per the abo0e .ormat.
2. "ection A* 2* C an! D contain t,o 6uestions o. >ine 195 mar?s each. <o,e0er* nine mar?s 6uestion ma#
be splitte! into subparts.
3. "ection E is compulsor# an! contains nine sub-parts o. one mar? each. +he ans,ers .or each 6uestion
shoul! pre.erabl# be o. 2 to 3 lines.
$. +he ma-imum limit on numerical 6uestions to be set in the paper is 35B ,hile minimum limit is 20B
e-cept theoretical papers.
5. +he paper setter shall pro0i!e !etaile! mar?ing instructions an! solution to numerical problems .or
e0aluation purpose in the separate ,hite en0elopes pro0i!e! .or solutions.
). +he paper setters shoul! seal the internal % e-ternal en0elope properl# ,ith signatures % cello tape at
proper place.
A. 'og tables* charts* graphs* Design !ata tables etc. shoul! be speci.ie!* ,hene0er nee!e!.
(. /se o. "cienti.ic calculator shoul! be clearl# speci.ie!.
9. +here are some &2A subects 1like BAS 202 Operational Research, MBA 5011 Foundation of Financial
Accounting, MBA 5012 Foundation of Managerial Accounting, MBA 5022 Foundations of Marketing,
MBA 5023 Foundations of a!, MBA 5031 Foundations of Macroecono"ics, MBA 5032 Foundations of
Microecono"ics, MBA#5033 Foundations of $nternational Business, MBA 5013 Foundations of Finance5
,here s#llabus is not !i0i!e! among .our sections namel# A*2*C*D then @uestion paper must be set b#
,ithout speci.#ing section in it an! gi0ing proper ,eightage to the respecti0e portions.
BAS F 201 NUMERICA+ METHODS C APP+ICATION
+ T P C,
3 1 0 3.5
Secti!#A
S2&ti! 7 A26e',aic a!) T,a!sce!)e!ta2 E>&ati!s< +runcation errorK =oun!-O.. errorK
Absolute an! =elati0e errorsK 2isection metho!K 3teration metho!7 Con!itions .or the
Page #' o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
con0ergence o. the 3teration metho!* Acceleration o. con0ergence-Ait?enOs
2

processK
>e,ton-=aphson metho!7 Con!itions .or the con0ergenceK Comparison o. =egula 8alsi metho!
an! "ecant metho!K =ate o. con0ergence an! geometrical representation o. each metho!K
>e,ton-=aphson metho! .or s#stem o. non-linear e6uations.
Secti!#B
S2&ti! 7 s5ste* 7 !!#h*6e!e&s 2i!ea, e>&ati!s< &atri- in0ersion metho!K Causs
Elimination metho!7 Partial an! Complete Pi0oting.K Causs 9or!an Elimination metho!K
+riangulariGation metho!K 8actoriGation metho!K 9acobiOs metho! an! Causs-"ei!alOs metho!.
"olution o. +ri!iagonal s#stem o. e6uations.
Ei6e! 4a2&es a!) Ei6e! 4ect,s 7 a *at,iE7 Eigen 0alues o. +ranspose o. matri-* in0erse o.
matri-* <ermitian matri- an! "imilar matricesK 3terati0e &etho!s to .in! Eigen 0alues an! Eigen
0ectors7 Po,er metho! an! 9acobi metho!. DiagonaliGation o. a matri-. C&,4e 7itti!6< &etho!
o. 'east "6uares-.itting a straight line* a secon! !egree parabola an! e-ponential cur0es.
Secti!#C
N&*e,ica2 Di77e,e!tiati! a!) I!te6,ati!< >umerical Di..erentiation using .inite !i..erences*
>umerical 3ntegrationK >e,ton-Cotes metho!s* +rapeGoi!al rule* "impsonOs 143 rule* "impsonOs
34( rule.
Secti!#D
N&*e,ica2 S2&ti! 7 Di77e,e!tia2 E>&ati!s< >umerical solution o. .irst or!er or!inar#
!i..erential e6uations using +a#lorOs series metho!K Picar!Os metho!K EulerOs metho!K 3mpro0e!
EulerOs metho!K &o!i.ie! EulerOs metho!K =unge-Futta metho! o. "econ! an! 8ourth or!erK
Pre!ictor-Corrector metho!s7 &ilneOs metho! an! A!amOs metho!. 2oun!ar# 0alues problems
.or or!inar# !i..erential e6uation b# .inite !i..erence metho!.
RECOMMENDED BOOKS:
1. >umerical &etho!s .or &athematics* "cience an! Engineering b# &athe,s* Prentice-
<all o. 3n!ia. E!. "econ!.
2. >umerical &etho!s .or "cientist an! Engineering Computation b# &. F. 9ain* ". =. F.
3#engar an! =. F. 9ain* >e, Age 3nternational Publisher* E!. 8ourth.
3. 3ntro!uctor# &etho!s o. >umerical Anal#sis b# ". ". "astr#
CPE#20. HISUA+ PROGRAMMING
+ T P C,
3 1 0 3.5
Secti!#A
I!t,)&cti! t His&a2 P,6,a**i!6< strategies* t#pes* 0isual languages an! user inter.aces.
Page #+ o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
%&!)a*e!ta2s 7 His&a2 Basic< e0ent !ri0en programming* language basics li?e 0ariables t#pes*
control structures* arra#s* proce!ures* t#pes o. statements* ,or?ing ,ith .orms.
Secti!#B
Basic Acti4eI c!t,2s< +e-t2o-* 'abel* 2utton* 'ist2o-* Combo2o-* Chec?2o-*
=a!io2utton* +imer* "croll2ar* "li!er2ar* &enu2ars etc.
A)4a!ce) Acti4eI c!t,2s< Common Dialogs* +reeHie,* 'istHie,* 3mage'ist etc.
Creating &D3 applications.
Secti!#C
Ma!i8&2ati!6 6,a8hics i! HB7 graphics controls* metho!s* scale properties an! metho!s.
2uil!ing Acti0eD controls manuall# using generic controls.
C2asses a!) O'(ects in H2* ,or?ing ,ith !ata reports
Creating Data Proect using Acti0eD Designers* ADO Data control an! Acti0e Data Obects.
OptimiGing H2 Applications* O'E Automation.
Secti!#D
I!t,)&cti! t Data'ase C!ce8ts< Data in!epen!ence* D2&" Architecture* components o. a
!atabase s#stem* A!0antages an! !isa!0antages o. Database s#stem* "chemas* 3nstances* E=
&o!el
I!t,)&cti! t Re2ati!a2 Data'ase Ma!a6e*e!t S5ste*7 2asic "@' @uer#* Creating +able
an! Hie,s* "@' as D&'* DD' an! DC'* 3ntegrit# Constraints in "@'
RECOMMENDED BOOJS<
1. P&astering &icroso.t Hisual 2asic )Q b# E0angelos Petroutsos* 2P2.
2. PProgramming &icroso.t Hisual 2asic ).0Q b# 8rancesco 2alena* &icroso.t Press.
3. P&icroso.t Hisual 2asic ).0 Pro.essional "tep b# "tepQ b# &ichael <al0orson* &icroso.t
Press.
$. I"pecial E!ition using Hisual 2asic ).0I b# "il0er % "pots* P<3.
5. PHisual 2asic ) 2lac? 2oo?Q b# "te0en <olGner* +he Coriolis Croup.
). P/sing &icroso.t Hisual 2asic.>E+Q b# 2rian "iler an! 9e.. "potts* Pearson E!ucation.
A. Pratee? 2hatia* Database &anagement s#stem* Fala#ani Publishers
(. Forth an! "ilberschatG Abraham* Database Concepts* &cCra, <all* 1991
CPE #20/ COMPUTER NET;ORJS
+ T P C,
3 1 0 3.5
Secti!#A
Page #, o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3ntro!uction* histor# an! !e0elopment o. computer net,or?s* +#pes o. computer net,or?s7 'A>* &A>*
;A>* broa!cast an! point to point net,or?s* >et,or? topologies*
'a#ere! Architecture7 concept o. la#ers* protocols* inter.aces an! ser0ices* +he O"3 =e.erence &o!el* +he
+CP43P =e.erence &o!el* Comparison o. O"3 an! +CP43P &o!els
Secti!#B
Ph5sica2 +a5e,< Concept o. Analog % Digital "ignal* 2an!,i!th* +ransmission 3mpairments7 Attenuation*
Distortion* >oise* Data rate limits7 >#6uist .ormula* "hannon 8ormula* ",itching7 Circuit ",itching* &essage
",itching an! Pac?et ",itching
Cui!e! +ransmission me!ia7 +,iste! Pair* Co-a-ial Cables* 8iber Optics* ;ireless +ransmission7 =a!io an!
&icro,a0e an! 3n.rare! +ransmission* Comparison o. =epeaters* <ubs* ",itches
Secti!#C
Data +i!= +a5e,< Data lin? la#er Design 3ssues* Error Detection an! Correction* Elementar# !ata lin?
protocols7 An /nrestricte! "imple- Protocol* A "imple- "top an! ;ait Protocol* A "imple- Protocol .or a
>ois# Channel. "li!ing ,in!o, protocols7 A One 2it "li!ing ;in!o, Protocol* A Protocol /sing go bac? >*
A Protocol using "electi0e =epeat
MAC S&' 2a5e,< +he Channel Allocation Problem7 "tatic an! D#namic Channel Allocation in 'A>s an!
&A>s* Carrier "ense &ultiple Access Protocols7 Persistent an! >on Persistent C"&A* C"&A4CD protocols

Secti!#D
>et,or? la#er7 3P A!!ressing* =outing algorithms7-"hortest Path =outing* 8loo!ing* Distance Hector =outing
an! 'in? "tate =outing* 3ntro!uction to Congestion * Ceneral Principles o. Congestion Control*Comparison o.
bri!ges* routers an! Cate,a#s.
T,a!s8,t 2a5e,< 3ntro!uction to Elements o. +ransport Protocols /DP* +CP* Electronic-mail* ;;;*
Domain >ame "#stem
Case St&)5< Design % 3mplementation o. 'ocal Area >et,or?
Rec**e!)e) B=s<
1. A. ". +annenbaum. Computer >et,or?s* 3r! E!ition* Prentice-<all.
2. D. E. Comer. 3nternet,or?ing ,ith +CP-3P7 Principles* Protocols an! Architecture* Hol 3* 2n! E!ition*
Prentice <all* 1991.
3. D. E. Comer an! D. '. "te0ens. 3nternet,or?ing ,ith +CP-3P7 Design* 3mplementation* an! 3nternals*
Hol 33* Prentice <all* 1990.
CPE #200 DATA STRUCTURES
+ T P C,
3 1 0 3.5
Secti!#A
Page #* o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
Basic Data St,&ct&,es a!) O8e,ati!s ! the*< Arra#s* "tac?s an! @ueues an! +heir
Applications* 'in?e! an! "e6uential =epresentation. 'in?e! 'ist* =epresentation o. 'in?e! 'ist*
&ulti-'in?e! "tructures
Secti!#B
T,ees< De.initions an! 2asic Concepts* 'in?e! +ree =epresentation* =epresentations in
Contiguous "torage* 2inar# +rees* 2inar# +ree +ra0ersal* "earching* 3nsertion an! Deletion in
2inar# +rees* 2inar# "earch +ree* <eap an! <eap "ort Algorithm* AH' +rees.
Secti!#C
G,a8hs an! +heir Application* "e6uential an! 'in?e! =epresentation o. Craph-A!acenc#
&atri-* Operations on Craph* +ra0ersing a Craph* Di?straEs Algorithm .or "hortest Distance*
D8" an! 28"* &inimal "panning +ree.
%i2e O,6a!i@ati!< "e6uential* =elati0e* 3n!e- "e6uential* 2-+ree* &ulti-Fe#* 3n0erte! 8ile.
Secti!#D
"earching an! "orting* use o. Harious Data "tructures .or "earching an! "orting* 'inear an!
2inar# "earch* 2ubble "ort* 3nsertion "ort* "hell "ort* "election "ort. &erge "ort* =a!i- "ort*
@uic? "ort.
Hashi!6< 3ntro!uction to hash table* hash .unction* resol0ing collision b# chaining an! open
a!!ressing* !eleting items .rom a hash table.
Rec**e!)e) B=s<
1. Data structures7 a Pseu!oco!e Approach ,ith-C* 33n! E!ition*E
Cengage 'earning 1+homson5.
2. 8un!amentals o. Data "tructures* C2" Publishers an! Distributors* Delhi* Ellis <or,itR
an! "arta "ahni.
3. An intro!uction to !ata structures ,ith applications* &c-Cra, <ill 3nc.* 9.P. +remble#
an! P.C* "orensen.
$. Data "tructures an! Program Design in C Prentice <all o. 3n!ia* 1992* =obort '. Fruse*
2ruce P. 'eung* Clu0is '. +un!o.
5. Data "tructure using 1C % CJJ* "anee0 Fumar* Fhanna Publishers.
HSS#201 MANAGEMENT PRACTICE C
ORGANIKATION BEHAHIOUR
+ T P C,
3 1 0 3.5
Secti!#A
Page #) o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3ntro!uction to &anagement7 De.inition* 3mportance an! .unctions o. &anagement. +heories o.
&anagementK Classical* >eo-classical an! &o!ern. Planning7 >ature o. planning* planning
process* t#pes o. plans* 3mportance an! 'imitations o. Planning. 3ntro!uction to &2O
1&anagement b# Obecti0es5. "ocial responsibilit# o. business.
Secti!#B
Decision &a?ing7 3mportance an! Process. OrganiGation7 Process o. OrganiGing* OrganiGing
Principles* OrganiGation Chart* Authorit# an! =esponsibilit# relationship* "teps in Delegation o.
Authorit#. Communication7 Process* channels* me!ium o. communication* communication
barriers. Controlling7 "teps* t#pes o. control s#stem* essentials.o. e..ecti0e control s#stem.
Secti!#C
OrganiGational 2eha0iour7 Concept* .eatures an! importance. Personalit#7 !eterminants an!
!e0elopment. =ole o. Halues an! Attitu!es in in!i0i!ualEs beha0iour. +he concept o. moti0ation
an! its theories. Perception7 Concept* Process* Errors in perceptual accurac#* =ole o. perception
in !ecision ma?ing
Secti!#D
'earning7 Classical an! Operant con!itioning theor#* =ein.orcement-?in!s an! a!ministration.
Concept o. group !#namics. 'ea!ership theories an! st#les. OrganiGational con.lict7 Concept*
Dimensions* con.lict management techni6ues. 3ntro!uction to concept o. po,er an! politics in
,or? relate! organiGation. OrganiGation culture an! e..ecti0eness
Rec**e!)e) B=s<
1. As,athappa* F an! =e!!# C. "u!arsana* &anagement an! Organisation 2eha0iour* <imal#a
Publishing <ouse.
2. Pierce 9ohn '.* Car!ner Donal!* Car!ner Donal!* &anagement an! Organisational 2eha0ior7
An 3ntegrate! Perspecti0e* E!.1* Cengage 'earning 3n!ia
3. 'aurie &ullins* &anagement an! Organisation 2eha0iour* A4e* Pearson E!ucation.
$. "tephen* P. =obbins* "eema "anghi an! +imothi A 9u!ge* OrganiGational 2eha0ior 134e*
Pearson E!ucation.
5. "tephen P. =obbins* &ar# Coulter an! >ehari?a Hohra* &anagement 104e* Pearson
E!ucation.
). <einG* ;eihrich an! <arol! FoontG* Essentials o. &anagement* +ata &cCra, <ill.
A. Cene 2urton an! &anab +ha?ur* &anagement +o!a#7 Principles an! Practice*
+ata &cCra,-<ill.
(. P C +ripath#* P > =e!!#* Principles o. &anagement* +ata &cCra,-<ill.
9. Dr. >eeru Hashishth* Principles o. &anagement ,ith case stu!ies* +a-mann Publication.
10. '.&.Prasa!* Principles % Practice o. &anagement* "ultan Chan! % "ons >
Delhi
11. 9ames "toner* = E!,ar! 8reeman an! Daniel = Cilbert* &anagement )4e* Pearson E!ucation.
BAS#2-1 NUMERICA+ METHODS AND APP+ICATION +AB
+ T P C,
0 0 2 1.0
+ist 7 EE8e,i*e!ts<
Page #- o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
1. ;AP to implement =egular 8alsi &etho!.
2. ;AP to implement "ecant &etho!.
3. ;AP to implement >e,ton-=aphson &etho!
$. ;AP to implement Causs-Elimination &etho!
5. ;AP to implement Causs-"ie!al &etho!
). ;AP to implement +rapeGoi!al =ule
A. ;AP to implement "impsonEs =ule
(. ;AP to implement EulerEs &etho!
9. ;AP to implement =unge-Futta &etho!
10. ;AP to implement Pre!ictor Corrector &etho!
11. ;AP to implement Po,er &etho!
CPE F 2-. HISUA+ PROGRAMMING +AB
+ T P C,
0 0 2 1.0
1. ;rite a ;in!o,s application that .unctions li?e a &athematical Calculator.
2. ;rite a ,in!o,s application that .unctions li?e a "top,atch.
Page #. o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3. ;rite a ,in!o,s application to !emonstrate control structures
$. ;rite a ,in!o,s application that .unctions li?e a >otepa! 1using &enu E!itor*
Common Dialog Control* +e-tbo-Es properties5.
5. ;rite a ;in!o,s application !emonstrating the use o. Collections.
). ;rite a ,in!o,s application that !etermines a stu!entEs letter gra!e 1using "elect Case5.
A. ;rite a ,in!o,s application that uses graphical metho!s to !ra, !irectl# on a .orm.
(. ;rite a ,in!o,s application !emonstrating the use o. ADODC
9. ;rite a ;in!o,s application .or buil!ing a generic control.
10. ;rite a ,in!o,s application !emonstrating 0arious &D3 .eatures supporte! in
H2).
11. Creating tables using integrit# constraints
12. &anipulation 13nsert* /p!ate* Delete5 on +ables
CPE#2-0 DATA STRUCUTRE USING CDCBB +AB
+ T P C,
0 0 2 1.0
1. ;rite a program to chec? ,hether a string is palin!rome or not
2. ;rite a program to e-tract substring .rom gi0en string.
Page !" o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
3. ;rite a program to implement stac? using arra#s.
$. ;rite a program to implement 6ueues using arra#s.
5. ;rite a program to create a lin?e! list an! per.orm .ollo,ing operations7
15 3nsert element at beginning.
25 3nsert element at en!.
35 3nsert element at gi0en position.
$5 Delete element .rom beginning
55 Delete element at en!.
)5 Delete element .rom gi0en position.
). +a?e a list o. number an! create a sorte! lin?e! list .rom gi0en list
A. 3mplement stac? using lin?e! representation.
(. 3mplement 6ueue using lin?e! representation.
9. ;rite a program to sort a gi0en list o. number using .ollo,ing algorithm.
1. 2ubble sort
2. 3nsertion sort
3. "election sort
$. @uic? sort
5. =a!i- sort
10. ;rite a program to implement linear an! binar# search algorithm.
BAS#202 OPERATIONS RESEARCH
+ T P C,
3 1 0 3.5
Secti!#A
De.initions* characteristics* necessit#* scope an! obecti0es o. O.=. Phases o. operations
=esearch stu!#* 'imitations o. O.=.
Page !# o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
'inear Programming* assumptions in '.P. .ormulation o. mathematical mo!els .or 0arious t#pes
o. '.P. problems* graphical metho!s % trial an! error metho!s o. sol0ing '.P. problems*
'imitations o. '.P. metho!s.
"imple- metho!* arti.icial 0ariable techni6ue-the big-& metho!* !egenerac#* unconstraine!
0ariables* !ualit# in '.P.
Secti!#B
+ransportation mo!el* .ormulation an! solution o. transportation problems* sensiti0it# anal#sis in
+.P.
Assignment mo!el* .ormulation an! solution o. assignment problems* se6uencing problems.
Secti!#C
Came theor#* solution o. games ,ith an! ,ithout sa!!le point* rules o. !ominance* arithmetic
an! algebraic metho!s .or 2-2 games solution o. 2-n or m - 2 games.
PE=+ % CP& &o!els7 Characteristics % uses* Dra,ing o. net,or?* remo0al o. re!un!anc# in
net,or?* computing EO=* 'O+* 8ree "lac?* +otal slac?* Crashing* =esource allocations.
Secti!#D
3n0entor# control* necessit# .or maintaining in0entor#* in0entor# cost* in0entor# mo!els .or
bought-out items ,ith % ,ithout shortages* in0entor# mo!el .or ma!e-in items ,ithout
shortages* in0entor# mo!els ,ith price-brea?s* 3n0entor# management techni6ues* solution o.
problems.
"imulation* a!0antages an! limitations o. simulation* &onte carlo metho!* solution o. problems
using simulation.
Rec**e!)e) B=s<
1. P.F. Cupta an! D.". <ira* Operations =esearch* ". Chan! an! Co. 't!.* =am >agar* >e,
Delhi* E!. 199(.
2. <.A. +aha* Operations =esearch L an 3ntro!uction* &acmillan Publishing Co.* >e, Mor?*
E!. 199$.
3. =a0in!ran* Operations =esearch* 9ohn ;ile# % "ons* >. Mor?
$. A.P. Herma* Operations =esearch* ".F. Fataria % "ons
5. <.&. ;agner* Principles o. Operation =esearch* P<3* >e, Delhi
CPE # 201 COMPUTER PERIPHERA+ C INTER%ACE
+ T P C,
3 1 0 3.5
Secti!#A
C*8&te, a! its c*8!e!ts< About computer* e0olution o. computer* 23O"* &otherboar!*
Processor* =A&* =O&* <ar! Dis?* Po,er "uppl#* Cabinet* 8lopp# Dri0e* CD Dri0e* &onitor*
Page !! o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
Fe#boar!* &ouse* Hi!eo Car!* "oun! Car!.
I!8&t D O&t8&t De4ices< Fe#boar!* &ouse* "canner* +rac?2all* 'ight pens* C=+ !ispla#
&onitor* their ,or?ing* 'CD an! 'ED Panels* Printer 1.unction* characteristics* t#pe o. printer
an! printing mechanism5.
Secti!#B
P,cess, D Mthe,'a,)< +#pes an! generation o. processors* t#pes o. motherboar!* t#pes o.
34O buses* C&O" "ettings* boot se6uence* pass,or! setup an! enable4!isable o. 0arious ports.
Me*,5< =O& an! its t#pes* =A& an! its t#pes* cache memor#* har! !is? an! its t#pes* Pen
!ri0es* c!s4!0!s* Comparison o. !i..erent t#pes o. memor#. 8unctioning o. <DD* 8DD* about
sector* platter* hea! etc.
Secti!#C
8ile "#stem % Data =eco0er#7 Dis? 8ormatting* 2oot sector* !is? partitioning* 8A+1)* 8A+32*
>+8"* =eco0er# so.t,are
3nterrupt* D&A Channel* 34O Port A!!resses an! resol0ing the con.lict o. resources. 34O buses-
3"A* E3"A* 'ocal bus* HE"A 'ocal bus* PC3 bus* PC3 E-press* Accelerate! graphics port bus.
Secti!#D
3nter.acing7 "erial an! Parallel inter.aces* ="-232 inter.ace* current loop inter.ace* /"E=+. <ar!
Dis? Controller7 - 3ntro!uction* 3DE origin* 3DE 3nter.ace A+A stan!ar!s A+A1 to A+AA. A+A
.eature* A+A =A3D an! "C"3 =A3D* "C"3 Cable an! pin Connector pin outs "C"3 H4s 3DE
A!0antages an! limitation* <DC comman! 3DE* E3DE* "C"3* /"2.

Rec**e!)e) B=s<
1. &icroprocessors an! 3nter.acing 7 D.<all * +&<.
2. 32& PC an! Clones 7 2 Co0in!araalu* +&< .
3. Peripherals 3nter corporation7 9ohn 2. Peatman.
$. P. Pal Chan!hari * PComputer OrganiGation an! !esignQ Prentice <all o. 3n!ia
P0t. 't!* 199$.
5. Del Corso* <.Firrman* 9D >icon! P&icrocomputer buses % lin?sQ Aca!emic
Press 19().
). Douglas H <all P&icroprocessor % 3nter.acing Programming % <4;Q &cCra,<ill
3nternational 2n! E!ition 1992.
A. "cott &uller* P/pgra!ing an! repairing PCQ
E!4i,!*e!ta2 St&)ies
+ime allote!7 3 hours
+otal &ar?s 7 100
+otal 'ectures 7 50 Pass &ar?s 7 35
;ritten Paper 7 A5 &ar?s
8iel! ;or? 7 25 &ar?s
I!st,&cti!s
+he ,ritten paper ,ill ha0e t,o parts. 8irst part ,ill be o. 25 mar?s it ,ill contain 10 6uestions* the stu!ents ,ill attempt 5 6uestions o. .i0e
mar?s out o. this part. +he ans,er to these 6uestions shoul! non-e-cee! 50 ,or!s each.
Part secon! ,ill be o. 50 mar?s an! ,ill contain 10 essa# t#pe 6uestions. +he can!i!ates ,ill attempt 5 6uestions out o. this part an! the ans,er
to each 6uestion shoul! not e-cee! 500 ,or!s. Each 6uestion ,ill carr# ten mar?s.
U!it 1< The M&2ti)isci82i!a,5 !at&,e 7 e!4i,!*e!ta2 st&)ies
De.inition* scope an! importance* >ee! .or public a,areness
12 'ectures5.
U!it 2 Nat&,a2 Res&,ces <
Page !' o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
Re!e?a'2e a!) !! ,e!e?a'2e ,es&,ces<
>atural resources an! associate! problems.
a5 8orest resources7 /se an! o0er - e-ploitation* !e.orestation* case stu!ies. +imber e-traction* mining* !ams an! their e..ects
on .orests an! tribal people* b5 ;ater resources7 /se an! o0er utiliGation o. sur.ace an! groun! ,ater* .loo!s* !rought* con.licts o0er ,ater* !ams
bene.its an! problems* c5 &ineral resources7 /se an! e-ploitation* en0ironmental e..ects o. e-tracting an! using mineral resources* ease stu!ies*
!5 8oo! =esources 7 ;orl! 8oo! problems* changes cause! b# agriculture an! o0ergraGing* e..ects o. mo!ern agriculture* .ertiliGer-pestici!e
problems* ,ater loggingK salinit#* case stu!ies* e5 Energ# resources7 Cro,ing energ# nee!s* rene,able an! non-rene,able energ# sources*
use o. alternate energ# sources* Case stu!ies* 85 'an! resources7 'an! as a resource* lan! !egra!ation* man inclu!e! lan!sli!es* soil
erosion an! !eserti.ication.
=ole o. an in!i0i!ual in conser0ation o. natural resourcesK E6uitable use o. resources .or sustainable li.est#les.
U!it "< Ecs5ste*s
Concept o. an ecos#stem* "tructure an! .unction o. an ecos#stem* Pro!ucers* consumers an! !ecomposers* Energ# .lo, in the ecos#stem*
Ecological succession* 8oo! chains* .oo! ,ebs an! ecological p#rami!s* 3ntro!uction* t#pes* characteristic .eatures* structure an! .unctions o. the
.ollo,ing ecos#stem7-8orest ecos#stem* Crasslan! ecos#stem* Desert ecos#stem* A6uatic ecos#stems 1 pon!s* streams* la?es* ri0ers* oceans*
estuaries5
1 ) lectures5
U!it $< Bi)i4e,sit5 a!) its c!se,4ati!
intro!uction - - De.inition7 species an! ecos#stem !i0ersit#* 2iogeographicall# classi.ication o. 3n!ia* Halue o. bio!i0ersit#7 consumpti0es use*
pro!ucti0e* social* ethical* aesthetic an! option 0alues* 2io!i0ersit# at global* >ational an! local le0els* 3n!ia as a mega-!i0ersit# nation* <ot
spots o. bio!i0ersit#* +hreats to bio!i0ersit#7 <abitat loss* poaching o. ,il!li.e* man-,il!li.e con.licts* En!angere! an! en!emic species o. 3n!ia*
Conser0ation o. bio!i0ersit#7 3n-situ an! E--situ conser0ation o. bio!i0ersit#.
1( 'ectures5
U!it -< E!4i,!*e!ta2 P22&ti!
De.inition 7 Causes* e..ects an! control measures o.7-Air Pollution* ;ater Pollution* "oil Pollution* &arine Pollution* >oise Pollution* +hermal
Pollution* >uclear <aGar!s* "oli! ,aste &anagement Causes* e..ects an! control meausers o. urban an! in!ustrial ,astes.* =ole o. an! in!i0i!ual
in pre0ention o. pollution* Pollution case stu!ies* Disaster management 7 .loo!s* earth6ua?e* c#clone an! lan!sli!es.
1( 'ectures5
U!it .< "ocial 3ssues an! the En0ironment
8rom /nsustainable to "ustainable !e0elopment* /rban problems relate! to energ#* ;ater conser0ation* rain ,ater har0esting*
,atershe! management* =esettlement an! rehabilitation o. peopleK its problems an! concerns Case stu!ies* En0ironmental ethics7 3ssues an!
possible solutions - Climate change* global ,arning* aci! rain* oGone la#er !epletion* nuclear acci!ents an! holocaust* Case stu!ies ;astelan!
reclamation* Consumerism an! ,aste pro!ucts.* Consumerism an! ,aste pro!ucts* En0ironment Protection Act* Air 1Pre0ention an! Control o.
Pollution5 Act* ;ater 1Pre0ention an! control o. pollution5 Act* ;il!li.e Protection Act* 8orest Conser0ation Act* 3ssues in0ol0e! in en.orcement
o. en0ironmental legislation* Public a,areness.
1A 'ectures5
U!it /< H&*a! P8&2ati! a!) the E!4i,!*e!t
Population gro,th* 0ariation among nations* Population e-plosion - 8amil# ;el.are Programme* En0ironment an! human health* <uman =ights*
Halue E!ucation* <3H4 A3D"* ;omen an! Chil! ;el.are* =ole o. 3n.ormation +echnolog# in En0ironment an! human health* Case "tu!ies
1) 'ectures5
U!it 0< %ie2) ;,=
Hisit to a local area to !ocument en0ironmental areas* ri0er4 .orest4 grasslan!4 hill4 mountain* Hisit to a local pollute! site - /rban4 =ural4
3n!ustrial4 Agriculture* "tu!# o. common plants* insects* bir!s* "tu!# o. simple ecos#stems-pon!* ri0er* hill slopes* etc. 18iel! ,or? E6ual to 5
'ecture hours5
Page !+ o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
B. TECH THIRD YEAR
COMPUTER ENGINEERING
(Batch 2012)
Sessi! (201$#1-)
SCHEME O% PAPERS
%I%TH SEMESTER (COMPUTER ENGINEERING)
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1. CPE-301 "#stem Programming 3 1 0 3.5
2. CPE-302 Database &anagement "#stem 3 1 0 3.5
3. CPE-303 Algorithm Anal#sis % Design 3 1 0 3.5
$. CPE-30$ +heor# o. Computation 3 1 0 3.5
5.
CPE-305 &icroprocessor % Assembl# 'anguage Prog.
3 1 0 3.5
).
CPE-30) "o.t,are Engineering
3 1 0 3.5
A. CPE-352 Database &anagement "#stem 'ab 0 0 2 1.0
(. CPE-353 Algorithm Anal#sis % Design 'ab 0 0 2 1.0
9. CPE-355 &icroprocessor % Assembl# 'anguage Prog. 'ab 0 0 2 1.0
10. "+C-351 "ummer +raining NN - - - ).0
Tta2
1
(
) ) 30
Tta2 C!tact H&,s 3 "0
CPE-352* CPE-353 an! CPE-355 are practical papers onl#. +here ,ill not be an# theor#
e-amination .or these papers.
NN "ummer +raining ,ill be o. $ to ) ,ee?s !uration in 3n!ustr# 4 3n <ouse.
U!i4e,sit5 C22e6e 7 E!6i!ee,i!6
Punabi /ni0ersit#* Patiala.
Ge!e,a2 I!st,&cti!s t the Pa8e, Sette,s
1Common .or 2.+ech. in Computer Engineering* Electronics an! communication Engineering*
&echanical Engineering* Ci0il Engineering an! 3ntegrate! 2+ech4&2A 2ranches5
Page !, o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
A882ica'2e t 20109 20119 2012 Batches !25
+he 2. +ech 6uestion paper structure ,ill be as sho,n belo,7
Patte,! 7 :&esti! Pa8e,
+3+'E O8 "/29EC+ 1CODE----5
2achelor o. +echnolog# 12ranch5 "ection7 :::..
En! "emester E-am
+3&E A''O;ED7 3 <our =oll. >o::::.
&a-imum &ar?s7 $5
>ote7- Attempt .our 6uestions selecting one 6uestion .rom each section A* 2* C an! D. "ection E is compulsor#.
Secti!#A (%,* Secti! A 7 the s522a'&s)
@1. .........................................................................
@2. ........................................................................ 1-9
Secti!#B (%,* Secti! B 7 the s522a'&s)
@3. .........................................................................
@$. ......................................................................... 1-9
Secti!#C (%,* Secti! C 7 the s522a'&s)
@5. .........................................................................
@). ......................................................................... 1-9
Secti!#D (%,* Secti! D 7 the s522a'&s)
@A. .........................................................................
@(. ......................................................................... 1-9
Secti!#E (C**! 7,* ;h2e 7 the S522a'&s)
@9.
a5.........................................................................
b5 .........................................................................
c5 .........................................................................
!5 .........................................................................
e5 .........................................................................
.5 .........................................................................
g5 .........................................................................
h5 .........................................................................
i5......................................................................... 9-1
Note for the paper setter:
1. >umbers o. 6uestions to be set are nine 195 as per the abo0e .ormat.
2. "ection A* 2* C an! D contain t,o 6uestions o. >ine 195 mar?s each. <o,e0er* nine mar?s 6uestion ma#
be splitte! into subparts.
3. "ection E is compulsor# an! contains nine sub-parts o. one mar? each. +he ans,ers .or each 6uestion
shoul! pre.erabl# be o. 2 to 3 lines.
$. +he ma-imum limit on numerical 6uestions to be set in the paper is 35B ,hile minimum limit is 20B
e-cept theoretical papers.
5. +he paper setter shall pro0i!e !etaile! mar?ing instructions an! solution to numerical problems .or
e0aluation purpose in the separate ,hite en0elopes pro0i!e! .or solutions.
). +he paper setters shoul! seal the internal % e-ternal en0elope properl# ,ith signatures % cello tape at
proper place.
A. 'og tables* charts* graphs* Design !ata tables etc. shoul! be speci.ie!* ,hene0er nee!e!.
(. /se o. "cienti.ic calculator shoul! be clearl# speci.ie!.
9. +here are some &2A subects 1like BAS 202 Operational Research, MBA 5011 Foundation of Financial
Accounting, MBA 5012 Foundation of Managerial Accounting, MBA 5022 Foundations of Marketing,
MBA 5023 Foundations of a!, MBA 5031 Foundations of Macroecono"ics, MBA 5032 Foundations of
Microecono"ics, MBA#5033 Foundations of $nternational Business, MBA 5013 Foundations of Finance5
,here s#llabus is not !i0i!e! among .our sections namel# A*2*C*D then @uestion paper must be set b#
,ithout speci.#ing section in it an! gi0ing proper ,eightage to the respecti0e portions.
CPE#"01 SYSTEM PROGRAMMING
+ T P C,
3 1 0 3.5
Page !* o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
Secti!#A
I!t,)&cti! t s5ste*s s7t?a,e< De.inition* .eatures o. s#stem Programming* "#stem
Programming 0s. Application Programming* t#pe o. s#stem programs.
Machi!e +a!6&a6e< 2asic concepts o. machine structure o. 32&-3)0* .eatures o. machine
language o. 32&-3)0. Assembl# 'anguage o. 32&-3)07 Assembl# language program structure*
E-ample using 'iterals.
Secti! # B
Asse*'2e,< "ingle pass assembler* t,o pass assembler an! !esign proce!ure o. an assembler.
Mac, 8,cess,< &acro language an! its .eatures* macro instructions* .eatures o. macro
.acilit#* implementation* one pass macro pre-processor* t,o pass macro pre-processor.
Secti! # C
C*82ie,s< O0er0ie, o. compilation process* le-ical anal#sis* s#nta- anal#sis* semantic
anal#sis an! interme!iate co!e generation an! co!e optimiGation techni6ues* complier 0s.
interpreter.
Secti! # D
+i!=e,s a!) 2a)e,s< 'oa!er "cheme* Compile an! Co 'oa!er* Absolute 'oa!er* "ubroutine
'in?age* =elocating 'oa!ers* Direct 'in?ing 'oa!er.77
O8e,ati!6 s5ste*< 2asic concepts o. an operating s#stem* memor# management* processor
management.
Rec**e!)e) B=s<
1. 9ohn.9.Dono0an. I"#stem Programming.I &cCra,-<ill* 1 99 1.
2. Ann. A.H.. /llman "ethi =.*1.15.7 Compilers7 Principles* +echni6ues an! +ools. A!!ison-
;esle# Publishing Co.* 1999.
3. D.&.Dhum!liere* I"#stems Programming an! Operating "#stemI +ata &eCra, <ill.
2002.
Page !) o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"02 DATABASE MANAGEMENT SYSTEM
+ T P C,
3 1 0 3.5
Secti!#A
I!t,)&cti! t Data'ase C!ce8ts< Di..erence bet,een Database an! non !atabase s#stem*
Data in!epen!ence* D2&" Architecture* components o. a !atabase s#stem* A!0antages an!
!isa!0antages o. Database s#stem* 3nten!e! /ses o. a D2&"* "chemas* an! 3nstances* Database
'anguages an! 3nter.aces* Classi.ication o. Database &anagement "#stems.
Data M)e2s< =elational &o!el* >et,or? &o!el* <ierarchical &o!el* E= &o!el7 Design*
issues* &apping constraints* ?e#s* E= !iagram* ,ea? entit# sets* e-ten!e! E= .eatures* Design
o. an E= Database schema* =e!uction o. an E= "chema to tables* Comparison o. &o!els.
Secti!#B
Data'ase Desi6!< I!te6,it5 C!st,ai!ts< Domain constraints* =e.erential integrit#* entit#
integrit#* speci.# these constraints in "@'* speci.ication o. A!!itional Constraints as assertions
an! triggers.
%&!cti!a2 )e8e!)e!cies< 8unctional !epen!encies* Decomposition* >ormaliGation using 8DOs
&HDOs an! 9DOs Domain ?e# normal .orm* DenormaliGation.
Secti!#C
:&e,5 P,cessi!6< in =elation Algebra* =elational Calculus* @uer#ing =elational Data* cost
base! 6uer# optimiGation
Re2ati!a2 :&e,5 +a!6&a6es< "@'7 2asic "@' @uer#* Creating +able an! Hie,s* "@' as
D&'* DD' an! DC'* "@' Algebraic Operations* >este! @ueries* Aggregate Operations*
Cursors* D#namic "@'* 3ntegrit# Constraints in "@'
Secti!#D
T,a!sacti! 8,cessi!6< AC3D Properties* 3mplementation o. Atomicit#* an! !urabilit#*
concurrent e-ecution* serialiGabilit#* =eco0erabilit#.
C!c&,,e!c5 c!t,2< +,o-phase loc?ing an! +imestamp or!ering techni6ues
Rec4e,5 c!ce8ts< categories o. reco0er# algorithms* caching o. !is? bloc?s* ;rite-ahea!
'ogging* "teal4>o-steal an! 8orce4>o-8orce* Chec?points* +ransaction =ollbac?* =eco0er#
techni6ues base! on De.erre! up!ate* an! 3mme!iate up!ate* sha!o, paging
Rec**e!)e) B=s<
1. >a0athe an! Elmasri* 8un!amentals o. Database "#stems* Pearson e!ucation
2. Forth an! "ilberschatG Abraham* Database Concepts* &cCra, <all* 1991.
3. An intro!uction to !atabase s#stem b# C.9.Date 1A!!ison ;else#* Publishing house5.
$. 2ipin Desai* Database "#stem* +&C
5. Pratee? 2hatia* Database &anagement s#stem* Fala#ani Publishers
Page !- o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"0" A+GORITHM ANA+YSIS C DESIGN
+ T P C,
3 1 0 3.5
Secti!#A
I!t,)&cti!< Algorithm* anal#Ging algorithms* stac?s* 6ueues* trees* heaps* graphs* hashing.
Di0i!e an! Con6uer7 Ceneral metho!* binar# search* .in!ing the ma-imum an! minimum*
&erge sort* @uic? sort* "trassenOs matri- multiplication.
Secti!#B
G,ee)5 Meth)< Ceneral &etho!* Fnapsac? problem* minimum spanning trees* single source
shortest paths.
Secti!#C
D5!a*ic P,6,a**i!6< Ceneral &etho! multistage graphs* All pairs shortest path* tra0eling
salesman problem.
B,a!ch C B&!)< 2ranch % boun! &etho!* 041 Fnapsac? problem* +ra0eling salesman
problem.
Secti!#D
+?e, B&!) The,5< 'o,er boun! techni6ue* Comparison trees .or sorting an! searching*
some lo,er boun! on parallel computation
Rec**e!)e) B=s<
1. 8un!amentals o. Computer Algorithm* 'atest e!ition* 2# <oro,itG "ahni* Calgotia
Publication.
2. Algorithms* 'atest E!ition* 2# ?nuth.
3. Design % Anal#sis o. Algorithm* 'atest E!ition* 2# Coo!man* &cCra, hill Publication.
Page !. o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"0$ THEORY O% COMPUTATION
+ T P C,
3 1 0 3.5
Secti!#A
Sets9 Re2ati!s a!) +a!6&a6es< "ets* =elations an! .unctions* .inite an! in.inite sets* Closures an!
algorithms* alphabets an! languages
%i!ite A&t*ata< Deterministic 8inite Automata 1D8A5* >on Deterministic 8inite Automata 1>D8A5*
&oore an! &eal# &achine* Application o. .inite automata* Con0ersion o. >D8A to D8A* &eal# to
&oore an! &oore to &eal#
Secti!#B
G,a**a,< De.inition o. Crammars* Deri0ation % 'anguage generate! b# Crammars* Choms?#
Classi.ication o. 'anguages
Re6&2a, EE8,essi! a!) +a!6&a6es< =egular e-pression* .inite Automata an! =egular e-pression*
Properties o. =egular 'anguages* Pumping lemma .or regular languages* application o. pumping lemma*
Closure properties o. regular languages* &inimiGation o. .inite Automata.
Secti!#C
C!teEt 7,ee G,a**a, a!) +a!6&a6es< Conte-t .ree grammar7 Parse +rees* Ambiguit# in Crammar
an! 'anguages* Construction o. =e!uce! Crammars
P,8e,ties 7 C!teEt 7,ee 2a!6&a6es L >ormal .orms .or conte-t .ree grammars* Choms?# >ormal
8orm 1C>85* Creibach >ormal 8orm 1C>85
Secti!#D
P&sh)?! A&t*ata< Push!o,n Automata7 Deterministic Push !o,n Automata* E6ui0alence o. Push
Do,n automata an! Conte-t .ree Crammar.
T&,i!6 Machi!es< De.inition o. +uring &achine* Application o. +uring &achine in language accepting
an! computing.
Ce22&2a, A&t*ata< 8ormal 'anguage aspects* Algebraic Properties /ni0ersalit# % Comple-it#
Hariants.
Rec**e!)e) B=s<
1. F.'.P. &ishra* >. Chan!rase?aran* P+heor# o. Computer "cience* Automata* 'anguages an!
ComputationQ* P<3
2. 9.E .<opcro.t* =. &ot,ani an! 9.D. /llmn* P3ntro!uction to Automata +heor#* 'anguage an!
ComputationQ* Pearson E!ucation Asia* 2n! E!ition.
3. 2.&. &oret* P+he +heor# o. ComputationQ* Pearson E!ucation Asia.
$. <.=. 'e,is an! C.<. Papa !imitriou* PElements o. the theor# o. ComputationQ* Pearson
E!ucation Asia* 2n! E!ition.
Page '" o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"0- Mic,8,cess, C Asse*'25 +a!6&a6e P,6.
+ T P C,
3 1 0 3.5
Secti! A
&icroprocessor Architecture7 &icroprocessor Architecture an! its Operations* &emor#*
3nput4Output 134O5 E-ample o. a &icrocomputer s#stem* inter.acing De0ices.(0(5 base!
&icrocomputer s#stems7 (0(5 &P/* E-ample o. an (0(5 base! microcomputer. 3nstructions an!
timings7 3nstruction classi.ication* instruction .ormat* <o, to ,rite an! e-ecute a simple
program* 3nstruction timings an! operation status* O0er0ie, o. the (0(5 instruction set.
Secti! B
3ntro!uction to (0(5 basic 3nstructions7 Data trans.er 1Cop#5 3nstruction* Arithmetic Operations*
'ogic operations* 2ranch Operations* ;riting Assembl# 'anguage Programs* Debugging a
program. Programming techni6ues ,ith a!!itional 3nstructions7 Programming +echni6ues
'ooping* Counting an! in!e-ing* A!!itional Data trans.er an! 1)-bit Arithmetic 3nstruction*
arithmetic Operations relate! to memor#* 'ogic operations7 =otate* compare* Debugging.
Counter an! +iming Dela#s7 Counters an! time !ela#s* he-a!ecimal counter* 0-9 1&o!ulo-105
counter. "tac? an! subroutines7 "tac?* subroutine* con!itional call an! return instructions*
a!0ance! subroutine concepts.
Secti! C
Co!e con0ersions* 2CD arithmetic an! 1)-bit !ata operations7 2CD to binar# con0ersions*
binar# to 2CD con0ersions* 2CD to A-segment 'ED co!e con0ersions* 2inar# to A"C33 an!
A"C33 to binar# co!e con0ersions. 2CD a!!ition* 2CD subtraction* 3ntro!uction to a!0ance!
instructions an! applications* multiplications an! subtraction ,ith carr#.
Secti! D
3nter.acing Peripherals 134Os an! applications57 Parallel input4output an! inter.acing applications*
basic inter.acing concepts* inter.acing output !ispla#s* input ?e#boar!s* memor#-mappe! 34O*
3nter.acing memor#. 3nterrupts7 the (0(5 interrupts Ceneral-purpose programmable peripheral
!e0ices7 the (255A programmable peripheral inter.ace* !irect memor# access 1D&A5 an! (25A
D&A controller* (259 programmable interrupt controller. "erial 34O an! !ata communication7
2asic concepts in serial 34O* so.t,are-controlle! as#nchronous serial 34O. the (0(5 serial 34O
lines7 "OD an! "3D.
Rec**e!)e) B=s <
1. (0(5 &icroprocessor b# =amesh Caon?ar*
2. &icroprocessor b# 2.=am
3. Daniel +aba?* A!0ance! &icroprocessors* &cCra,- <ill* 3nc.* "econ! E!ition 1995.
$. Douglas H. <all* &icroprocessors an! 3nter.acing7 Programming an! <ar!,are*
+ata &cCra, <ill E!ition* 19().
5.Charles &.Cilmore* &icroprocessors7 principles an! Applications* &cCra, <ill
Page '# o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"0. SO%T;ARE ENGINEERING
+ T P C,
3 1 0 3.5
Secti!#A
I!t,)&cti! t S7t?a,e E!6i!ee,i!6< "o.t,are Problem* "o.t,are Engineering* Approach* "o.t,are
process* Characteristics o. "o.t,are Engineering Process* so.t,are De0elopment *)e2s. S7t?a,e
Re>&i,e*e!t A!a25sis a!) S8eci7icati!< "o.t,are =e6uirement "peci.ication* Problem Anal#sis*
=e6uirement "peci.ications.
Secti!#B
S7t?a,e P,(ect P2a!!i!6< Cost estimation* cost estimation mo!els* Proect sche!uling* "o.t,are
Con.iguration management* +eam "tructure* =is? &anagement.
Secti!#C
%&!cti! ,ie!te) )esi6!< Design principles* Coupling Cohesion* "tructure! Design &etho!ologies
O'(ect O,ie!te) Desi6!< OOAD* Classes an! obects* inheritance an! pol#morphism* !esign notation
an! speci.ication
2rie. intro!uction to 0arious stan!ar!s relate! to "o.t,are Engineering
Secti!#D
CODING< +op Do,n* bottom up approaches* structure! programming* in.ormation hi!ing programming
st#le* !ocumentation*
TESTING< +esting 8un!amentals* ;hite bo- testing* 2lac? bo- testing* 8unctional testing* boun!ar#
0alue testing* cause e..ect* graphing.
Rec**e!)e) B=s<
1. "o.t,are Engineering Approach* 2# =. " Pressman
2. "o.t,are Engineering* "O&&E=H3''E Pearson E!ucation
3. An 3ntegrate! Approach to so.t,are Engineering. PA>FA9 9A'O+E
Page '! o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"-2 Data'ase Ma!a6e*e!t S5ste* +a'
+ T P C,
0 0 2 1. 0
OBAECTIHE<#
+he stu!ents are re6uire! to !o e-ercises 4 proects in !atabase !esign7
1. Creation o. tables* 0irtual tables an! 0ie,s in "@'*
2. Hie,ing the contents o. !ata !ictionar#
3. Changing o. schema
$. 3nsert* up!ate* !elete o. ro,s tables in "@'
5. "peci.ication o. 0arious constraints in "@'7 3ntegrit# Constraints7 Domain
constraints* =e.erential integrit#* entit# integrit# etc
). "peci.ication o. A!!itional Constraints as assertions an! triggers
A. @uer# processing in s6l
Page '' o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE "-" A+GORITHM ANA+YSIS C DESIGN +AB
+ T P C,
0 0 2 1. 0
C&,se C!te!ts<
1. ;rite a program to sort SnO numbers using merge sort. &ention the numbers o.
comparisons ma!e b# the program.
2. ;rite a program to sort SnO numbers using 6uic? sort. &ention the numbers o.
comparisons ma!e b# the program.
3. ;rite a program .or stressorEs matri- multiplication.
$. ;rite a program .or ?napsac? problem.
5. ;rite a program .or minimum spanning trees.
). ;rite a program .or single source shortest paths.
A. ;rite a program o. tra0eling salesman problem.
(. ;rite a program .or all pairs shortest paths
Page '+ o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"-- Mic,8,cess, C Asse*'25 +a!6&a6e P,6. +a'
+ T P C,
0 0 2 1.0
+ist 7 P,actica2Ls
1. 3ntro!uction to (0(5 ?it.
2. ;riting a .e, assembl# language utilit# programs .or logical* arithmetic* shi.t
operations* co!e con0ersion an! !ela# routines.
3. ;riting assembl# language programs .or inter.acing o. .ollo,ing chips ,ith
(0(57
a. Programmable peripheral inter.ace* (255
b. Programmable inter0al timer* (253
c. Programmable ?e#boar!4!ispla# inter.ace* (2A9
!. D&A Controller* (25A
e. Programmable 3nterrupt Controller* (259
$. 3nter.acing o. analog to !igital con0erters ,ith (0(5
5. 3nter.acing o. !igital to analog con0erters ,ith (0(5
Page ', o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
B. TECH THIRD YEAR
COMPUTER ENGINEERING
(Batch 2012)
Sessi! (201$#1-)
SCHEME O% PAPERS
SIITH SEMESTER (COMPUTER ENGINEERING)
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1. CPE-30A =D2&" using "@' an! P'4"@' 3 1 0 3.5
2. CPE-30( Computer Craphics 3 1 0 3.5
3. CPE-309 Compiler Design 3 1 0 3.5
$. CPE-310 Dot>et Programming 3 1 0 3.5
5. CPE-35A =elational Database &anagement "#stem 'ab 0 0 2 1.0
). CPE-35( Computer Craphics 'ab 0 0 2 1.0
A. CPE-3)0 Dot>et Programming 'ab 0 0 2 1.0
(. Electi0e-33 N 3 1 0 3.5
9. Electi0e-333 NN 3 1 0 3.5
Tta2 1( ) ) 2$
Tta2 C!tact H&,s 3 "0
E+ECTIHE F II %OR SIITH SEMESTER (COMPUTER ENGINEERING)G
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1 CPE-311 Parallel Computing 3 1 0 3.5
2 CPE-312 &ultime!ia "#stems 3 1 0 3.5
1. CPE-313 "o.t,are Proect &anagement 3 1 0 3.5
2. CPE-31$ Distribute! Computing 3 1 0 3.5
3. &2A-5011 8oun!ation o. 8inancial Accounting 3 1 0 3.5
GCHOOSE ANY ONE %ROM THE +IST
E+ECTIHE F III %OR SIITH SEMESTER (COMPUTER ENGINEERING)GG
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1. CPE-315 >et,or? "ecurit# 3 1 0 3.5
2. CPE-31) A+& >et,or?s 3 1 0 3.5
3. CPE-31A Cri! Computing 3 1 0 3.5
$. CPE-31( 2usiness 3ntelligence 3 1 0 3.5
5. &2A-5012 8oun!ations o. &anagerial Accounting 3 1 0 3.5
GGCHOOSE ANY ONE %ROM THE +IST
CPE-35A* CPE-35( an! CPE-3)0 are practical papers onl#. +here ,ill not be an# theor#
e-amination .or these papers.
Page '* o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
U!i4e,sit5 C22e6e 7 E!6i!ee,i!6
Punabi /ni0ersit#* Patiala.
Ge!e,a2 I!st,&cti!s t the Pa8e, Sette,s
1Common .or 2.+ech. in Computer Engineering* Electronics an! communication Engineering*
&echanical Engineering* Ci0il Engineering an! 3ntegrate! 2+ech4&2A 2ranches5
A882ica'2e t 20109 20119 2012 Batches !25
+he 2. +ech 6uestion paper structure ,ill be as sho,n belo,7
Patte,! 7 :&esti! Pa8e,
+3+'E O8 "/29EC+ 1CODE----5
2achelor o. +echnolog# 12ranch5 "ection7 :::..
En! "emester E-am
+3&E A''O;ED7 3 <our =oll. >o::::.
&a-imum &ar?s7 $5
>ote7- Attempt .our 6uestions selecting one 6uestion .rom each section A* 2* C an! D. "ection E is compulsor#.
Secti!#A (%,* Secti! A 7 the s522a'&s)
@1. .........................................................................
@2. ........................................................................ 1-9
Secti!#B (%,* Secti! B 7 the s522a'&s)
@3. .........................................................................
@$. ......................................................................... 1-9
Secti!#C (%,* Secti! C 7 the s522a'&s)
@5. .........................................................................
@). ......................................................................... 1-9
Secti!#D (%,* Secti! D 7 the s522a'&s)
@A. .........................................................................
@(. ......................................................................... 1-9
Secti!#E (C**! 7,* ;h2e 7 the S522a'&s)
@9.
a5.........................................................................
b5 .........................................................................
c5 .........................................................................
!5 .........................................................................
e5 .........................................................................
.5 .........................................................................
g5 .........................................................................
h5 .........................................................................
i5......................................................................... 9-1
Note for the paper setter:
1. >umbers o. 6uestions to be set are nine 195 as per the abo0e .ormat.
2. "ection A* 2* C an! D contain t,o 6uestions o. >ine 195 mar?s each. <o,e0er* nine mar?s 6uestion ma#
be splitte! into subparts.
3. "ection E is compulsor# an! contains nine sub-parts o. one mar? each. +he ans,ers .or each 6uestion
shoul! pre.erabl# be o. 2 to 3 lines.
$. +he ma-imum limit on numerical 6uestions to be set in the paper is 35B ,hile minimum limit is 20B
e-cept theoretical papers.
5. +he paper setter shall pro0i!e !etaile! mar?ing instructions an! solution to numerical problems .or
e0aluation purpose in the separate ,hite en0elopes pro0i!e! .or solutions.
). +he paper setters shoul! seal the internal % e-ternal en0elope properl# ,ith signatures % cello tape at
proper place.
A. 'og tables* charts* graphs* Design !ata tables etc. shoul! be speci.ie!* ,hene0er nee!e!.
(. /se o. "cienti.ic calculator shoul! be clearl# speci.ie!.
9. +here are some &2A subects 1like BAS 202 Operational Research, MBA 5011 Foundation of Financial
Accounting, MBA 5012 Foundation of Managerial Accounting, MBA 5022 Foundations of Marketing,
MBA 5023 Foundations of a!, MBA 5031 Foundations of Macroecono"ics, MBA 5032 Foundations of
Microecono"ics, MBA#5033 Foundations of $nternational Business, MBA 5013 Foundations of Finance5
,here s#llabus is not !i0i!e! among .our sections namel# A*2*C*D then @uestion paper must be set b#
,ithout speci.#ing section in it an! gi0ing proper ,eightage to the respecti0e portions.
Page ') o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"0/ RDBMS &si!6 S:+ a!) P+DS:+
+ T P C,
' # " '.,
Secti! A
I!t,)&cti! 7 DBMS<
+#pes o. D2&" an! their a!0antages an! !isa!0antages* D2&" architecture* Enhance!-E=
1EE=5 &o!el Concepts* EE=-to-=elational &apping* Data Abstraction an! Fno,le!ge
embe!!e! "@'* @uer# b# e-ample.
Dist,i'&te) Data'ases a!) C2ie!t#Se,4e, A,chitect&,e< 3ntro!uction to Distribute! D2&"
Concepts* Client-"er0er Architecture O0er0ie,* Data 8ragmentation* =eplication* an!
Allocation +echni6ues .or Distribute! Database Design* +#pes o. Distribute! Database "#stems.
Data'ase Sec&,it5< +#pes o. "ecurit#* Control &easures* D2 securit# an! D2A* Access
protection* Discretionar# Access Control base! on granting an! re0o?ing pri0ileges
Secti! B
O4e,4ie? 7 S:+<
3ntro!uction to "@' "er0er an! Oracle "er0er. "elect* 3nsert* /p!ate* Delete Comman!s
3nbuilt .unction 1string* numeric an! !ate5* oins* create table an! constraints* Data Dictionar#*
0ie,s* Crant =e0o?e
Secti! C
P+DS:+< 2loc? structure* !ata t#pes* creation o. 0ariable* scope* neste! bloc?s* control
structures* cursors an! its t#pes

Secti! D
Proce!ures an! t#pes o. parameter passing
8unctions both inbuilt an! user !e.ine!
Pac?ages both user !e.ine! an! inbuilt
+riggers an! its t#pes
Rec**e!)e) B=s <
1. >a0athe an! Elmasri* 8un!amentals o. Database "#stems* Pearson e!ucation
2. Forth an! "ilberschatG Abraham* Database Concepts* &cCra, <all* 1991.
3. An intro!uction to !atabase s#stem b# C.9.Date 1A!!ison ;else#* Publishing house5 'atest
e!ition.
$. 2ipin Desai* Database "#stem* +&C
5. Pratee? 2hatia* Database &anagement s#stem* Fal#ani Publishers
Page '- o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"00 COMPUTER GRAPHICS
+ T P C,
3 1 0 3.5
Secti!#A
GRAPHICS HARD;ARE< =aster C=+s* =aster an! =an!om "can Displa#s* Displa#
Controllers an! Processors* Craphics 3nput De0ices* Applications o. Computer Craphics.
RASTER SCAN CONHERSION A+GORITHMS< 'ine Dra,ing Algorithms 1DDA %
2resenhamOs5* Circle Dra,ing Algorithms 1&i! Point an! 2resenhamOs5.
Secti!#B
T;O#DIMENSIONA+ GEOMETRIC TRANS%ORMATIONS< 2asic +rans.ormations*
1+ranslation* =otation an! "caling5 &atri- =epresentation an! <omogenous Coor!inates* "hear
an! =e.lection +rans.ormations* Composite +rans.ormations.
%I++ING< =egion .illing Algorithms 12oun!ar# 8ill an! 8loo! 8ill5.
Secti!#C
;INDO;ING AND C+IPPING< Hie,ing pipeline* 0ie,ing trans.ormations. 2-D Clipping
algorithms- 'ine clipping algorithms 1Cohen "utherlan!* 'iang 2ars?# algorithm5 Pol#gon
clipping 1"utherlan! <o!geman pol#gon clipping* ;eiler an! Atherton pol#gon clipping5.
THREE#DIMENSIONA+ GEOMETRIC TRANS%ORMATIONS< 2asic +rans.ormations7
1+ranslation* "caling* =otation5 Composite trans.ormations.
Secti!#D
PROAECTIONS< Parallel an! Perspecti0e.
HISIB+E SUR%ACE DETECTION METHODS< Depth 2u..er &etho!* A-2u..er &etho!* "can
'ine &etho!* Area "ub!i0ision &etho!.
Sha)i!6< Courau! an! Phong "ha!ing Algorithms* Properties o. 2eGier an! 2-"pline Cur0es.
Rec**e!)e) B=s<
1. Computer Craphics7 2# Donal! <earn* &. Pauline 2a?er
2. Computer Craphics 1"chaum "eries 5 b# 'ipschutG 1&C Cra, <ill5
3. Principles o. 3nteracti0e Computer graphics7 2# ;.&. >e,man* =."proull
$. 8un!amentals o. 3nteracti0e Computer Craphics7 2# 9.D. 8ole#* A. Han Dam
5. Computer Craphics /sing OPE> C'7 2# 8.". <ill 9r.
). Computer Craphics7 =o# A. Plastoc?* Cor!on Falle#.
Page '. o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE # "01 COMPI+ER DESIGN
+ T P C,
3 1 0 3
Secti! A
INTRODUCTION TO COMPI+ING<
Compilers L Anal#sis o. the source program L Phases o. a compiler L Cousins o. the Compiler L
Crouping o. Phases L Compiler construction tools L 'e-ical Anal#sis L =ole o. 'e-ical Anal#Ger
L 3nput 2u..ering L "peci.ication o. +o?ens.
Secti! B
SYNTAI ANA+YSIS< =ole o. the parser L;riting Crammars LConte-t-8ree Crammars L +op
Do,n parsing L =ecursi0e Descent Parsing L Pre!icti0e Parsing L 2ottom-up parsing L "hi.t
=e!uce Parsing L Operator Prece!ent Parsing L '= Parsers L "'= Parser L Canonical '= Parser
L 'A'= Parser.
Secti! C
INTERMEDIATE CODE GENERATION< 3nterme!iate languages L Declarations L Assignment
"tatements L 2oolean E-pressions L Case "tatements L 2ac? patching L Proce!ure calls.
Secti! D
CODEGENERATION< 3ssues in the !esign o. co!e generator L +he target machine L =untime
"torage management L 2asic 2loc?s an! 8lo, Craphs L >e-t-use 3n.ormation L A simple Co!e
generator L DAC representation o. 2asic 2loc?s L Peephole OptimiGation.
CODE OPTIMIKATION AND RUN TIME ENHIRONMENTS7 3ntro!uctionL Principal "ources
o. OptimiGation L OptimiGation o. basic 2loc?s L 3ntro!uction to Clobal Data 8lo, Anal#sis L
=untime En0ironments L "ource 'anguage issues L "torage OrganiGation L "torage Allocation
strategies L Access to non-local name ParameterPassing.

Rec**e!)e) B=s <
1. Al.re! Aho* =a0i "ethi* 9e..re# D /llman* PCompilers Principles* +echni6ues an!
+oolsQ*
Pearson E!ucation Asia* 2003.
2. Allen 3. <olub PCompiler Design in CQ* Prentice <all o. 3n!ia* 2003.
3. C. >. 8ischer an! =. 9. 'e2lanc* PCra.ting a compiler ,ith CQ* 2enamin Cummings*
2003.
$. 9.P. 2ennet* P3ntro!uction to Compiler +echni6uesQ* "econ! E!ition* +ata &cCra,-<ill*
2003.
5. <en? Alblas an! Albert >#me#er* PPractice an! Principles o. Compiler 2uil!ing ,ith
CQ* P<3* 2001.
). Fenneth C. 'ou!en* PCompiler Construction7 Principles an! PracticeQ* +hompson
'earning* 2003
Page +" o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"10 DtNet P,6,a**i!6
+ T P C,
3 1 0 3.5
Secti! A
I!t,)&cti! t DtNet %,a*e?,=. Desi6! %eat&,es< 3nteroperabilit#* Common 'anguage
=untime Engine* 'anguage 3n!epen!ence* 2ase Class 'ibrar#* "impli.ie! Deplo#ment* "ecurit#*
Portabilit#. A,chitect&,e< Common 'anguage 3n.rastructure 1C'35* Class 'ibrar#* "ecurit#*
&emor# management
Secti! B
I!t,)&cti! t HB.Net< 'anguage 2asics7 Data +#pes* Hariables* Arra#s* "trings* Control
"tructures* Proce!ures* 8unctions.
Desi6!i!6 Use, I!te,7ace< +e-t2o-* 'abel* 2utton* 'ist2o-* Combo2o-* =a!io 2utton*
Chec?2o-* +imer* Dialog 2o-* Progress 2ar etc* "peci.#ing e0ent han!lers* A!!ing &enus*
&D3.
Secti! C
Obect % Classes* >amespaces* Error <an!ling* Debugging
Usi!6 ADO.Net< Connection* Data A!apter* Data "ets* Data Comman!s* A!0ance Data 2oun!
Controls* 3ntro!uction to Cr#stal =eports
Secti! D
B&i2)i!6 a c&st* ?i!)? c!t,2< A!!ing ne, properties* metho!s an! e0ents* testing a
control* enhancing e-isting controls
I!t,)&cti! t ASP.Net7 ;eb Controls* Hali!ating Controls
Rec**e!)e) B=s <
1. 2rian "iler % 9e.. "potts* P&icroso.t Hisual 2asic.>etQ
2. &atthe, &acDonal!* P.>E+ 3nsight .or H2 De0elopersQ
3. P&astering in H2.>etQ
Page +# o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#"-/ Re2ati!a2 Data'ase Ma!a6e*e!t S5ste* +a'
+ T P C,
0 0 2 1.0
OBAECTIHE
1. +he stu!ents are re6uire! to !o e-ercises 4 proects in !atabase !esign
2. 3mplementation o. "@' 6ueries DD'* D&'* DC'
3. 3mplementation o. P'4"@'
a. 2loc? "tructure* Hariables
b. Control "tructure
c. Cursors
!. Proce!ures
e. 8unctions
.. Pac?ages
g. +riggers
Page +! o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE 358 COMUPTER GRAPHICS +AB
+ T P C,
0 0 2 1. 0
OBAECTIHE<#
+he stu!ents are re6uire! to !o e-ercises on 0arious computer graphics algorithms in either C4CJ
J 'anguage. 3mplement .ollo,ing using 0arious algorithms7
1. 'ine !ra,ing
2. 'ine clipping
3. circle !ra,ing
$. area clipping
5. !ra,ing o. some 2-D pictures
). 2-D trans.ormations7 rotation* translation etc
A. "ha!ing
(. 'ine <i!!ing
8inall# !esign some A!s.* Came etc using all the abo0e or built in comman!s.
Page +' o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE-360 DotNet Programming Lab
+ T P C,
0 0 2 1.0
OBAECTIHE
+he stu!ents are re6uire! to !o e-ercises 4 proects7
1. 3mplementation o. 3terati0e "tructures.
2. 3mplementation o. Con!itional "tructures.
3. "plit % oin .unctions in "tring.
$. 3mplementation o. class.
5. /se o. +e-tbo-* 'abel* 2uttons component.
). /se o. +imer* Progress 2ar* &enu 2ar component.
A. /se o. 'ist2o-* Combo2o-* Chec?2o-* =a!io 2utton component.
(. 3mplementation o. Craphics metho!s.
9. Creating a ,in!o, control.
10. Database Connecti0it#.
Page ++ o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE # "11 Pa,a22e2 C*8&ti!6
+ T P C,
3 1 0 3.5
Secti!#A
O0er0ie, o. Parallel Processing an! Pipelining Processing. >ecessit# o. high per.ormance* Constraints o.
con0entional architecture* Parallelism in uniprocessor s#stem* E0olution o. parallel processors* .uture
tren!s* Architectural Classi.ication* Applications o. parallel processing* Classi.ication o. Computers on
the basis o. instructions* memor# access an! grain siGe.
Secti!#B
3nstruction le0el Parallelism an! +hrea! 'e0el Parallelism* E-plicitl# Parallel 3nstruction Computing
1EP3C5 Architecture. Principles o. scalable per.ormance7 Per.ormance &etrics an! &easures* "pee!up
Per.ormance 'a,s P=A& algorithms o. su..i- summation* parallel re!uction tree an! list ran?ing.
Secti!#C
Hector an! Arra# Processor7 2asic 0ector architecture* 3ssues in Hector Processing* Hector per.ormance
mo!eling* 0ectoriGers an! optimiGers. "3&D Computer OrganiGation &as?ing an! Data net,or?
mechanism* 3nter PE Communication* 3nterconnection net,or?s o. "3&D* "tatic H s D#namic net,or?*
cube h#per cube an! &esh 3nterconnection net,or?. Parallel Algorithms .or Arra# Processors
Secti!#D
&ultiprocessor Architecture7 'oosel# an! +ightl# couple! multiprocessors* Processor characteristics o.
multiprocessors* 3nter Processor communication net,or?* +ime share! bus* Crossbar s,itch* &ultiport
&emor# &o!el* &emor# contention an! arbitration techni6ues* Cache coherenc# an! bus snooping*
&assi0el# Parallel Processors 1&PP5* CO;Es an! >O;Es Cluster an! >et,or? o. ;or? "tations* Chip
&ultiprocessing 1C&P5* Case "tu!# o. 32& Po,er$ Processor.3nter Processor Communication an!
"#nchroniGation
Rec**e!)e) B=s <
1. H.=aaraman* ' "i0aram &urth#* IParallel ComputersI* P3D.
2. ;illiam "tallings* IComputer OrganiGation an! Architecture* Designing .or per.ormanceI
Prentice <all* "i-th e!ition
3. Fai <,ang* "calable Parallel Computing
$. <arrol! "tone* <igh per.ormance computer Architectures
5. =ichar! M. Fain * A!0ance! Computer Architecture
). Parallel Computing in C an! Open&P3 * &. 9. @uinn* &cCra,-<ill 1200$5 3"2> 00A2(225)2
A. Parallel Processing ,ith Communicating Process Architecture* 3 East* /C' Press 119955.
(. Designing an! 2uil!ing Parallel Programs* 3 8oster* A!!ison ;esle# 1199)5 3"2> 02015A59$9
9. Programming ,ith +hrea!s* " Fleiman et al.* Prentice <all 1199)5 3"2> 0131A23(9(
10. Fai <,ang* 8a#e A. 2riggs* IComputer Architecture an! Parallel ProcessingI &cCra,hill
international E!ition
11. Fai <,ang* IA!0ance! Computer ArchitectureI* +ata &cCra,hill E!ition
Page +, o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE # "12 M&2ti*e)ia S5ste*s
+ T P C,
3 1 0 3.5
Secti!#A
3ntro!uction TDe.inition* E0olution* &ultime!ia presentation an! pro!uction* Characteristics o. a multime!ia
presentation* Components an! "tructure* <ar!,are an! "o.t,are "peci.ications* DigitiGation concepts* Application
!omainsUK +e-t T3ntro!uction* +#pes o. te-t* A"C33 co!es* /nico!e stan!ar!s* 8ont* 3nsertion o. te-t* OC=* 8ile
.ormatsUK 3mage an! Craphics T3ntro!uction* 3mage t#pes* Color an! color mo!els* "canner* Digital camera*
3nter.ace stan!ar!s* "peci.ication o. !igital images* Color management s#stems* De0ice in!epen!ent color mo!els*
Camma an! gamma correction* 3mage processing steps an! so.t,are* 8ile .ormats* 3mage output on monitor an!
printerUK
Secti! F B
Au!io T3ntro!uction* >ature o. soun! ,a0es* &usical soun! an! noise* +one an! note* Ps#cho-acoustics an!
!ecibels* &icrophone* Ampli.ier* "pea?ers* Digital au!io speci.ications* "#nthesiGers* &usical 3nstrument Digital
3nter.ace 1&3D35* "oun! car!* Au!io processing steps an! so.t,are* 8ile .ormatsUK Hi!eo T3ntro!uction* Hi!eo
.rames an! .rame rate* Analog 0i!eo camera* Hi!eo signal .ormats* +ele0ision broa!casting stan!ar!s* 2roa!cast
Hi!eo "tan!ar!s* >+"C* PA' *Digital 0i!eo* Digital 0i!eo stan!ar!s* PC Hi!eo* Hi!eo processing steps an!
so.t,are* 8ile .ormats.
Secti!MC
Compression T3ntro!uction* CODEC* +#pes o. compression* +#pes o. re!un!ancies* 'ossless compression
techni6ues* 'oss# compression techni6ues* =un length enco!ing* <u..man co!ing* Arithmetic co!ing* 'empel-Ri0-
;elsh co!ing* Di..erential pulse co!e mo!ulation* C38 stan!ar!* 9PEC stan!ar!* &PEC-1* &PEC-2* &PEC-$*
&PEC-AU*8'H* 8$H
Secti!#D
Animation7 t#pes* +he Po,er o. &otion* Principles o. Animation* Animation b# Computer* techni6ues* ?e# .rame
animation* utilit#* morphing. Hirtual =ealit# concepts. Application o. &4& intelligent &4& "#stem. Des?top H=K
realit# O"K Distribute! 0irtual en0ironment s#stemK Hirtual en0ironmen)t. !ispla#s an! orientation trac?ingK
Hisuall# couple! s#stem re6uirementsK 3ntelligent H= . so.t,are s#stems . Application o. en0ironments in 0arious
.iel!s* such as me!ical* entertainment* manu.acturing* business* e!ucation.
Rec**e!)e) B=s <
1. Prabhat F An!leigh* Firan +ha?rar* I&ultime!ia "#stem DesignI* Prentice <all* 199)
2. =al. "teinmetG* Flara >ahrste!t* I&ultime!ia Computing* Communications an! ApplicationsI* Prentice <all*
1995
3. >alin "har!a* I&ultime!ia 3n.ormation >et,or?ingI* Prentice <all* 1999* 3"2> 7 01325(AA3$
$. +.HaughanK &ultime!iaK &a?ing it ,or?* +ata &cCra, <ill Publishing Compan# 'imite!* >e, Delhi.
5. ".9.CibbsK &ultime!ia Programming7 obects* en0ironments % 8rame,or?s*Dion#sios C. +sichritGis*
/ni0ersit# o. Cene0a* C&D*2onn.9.9e..coate*
). &ultime!ia in Practice7 +echnolog# % Applications* Prentice <all o.
A. Elsom Coo? L PPrinciples o. 3nteracti0e &ultime!iaQ L &cCra, <ill
(. =anan Pare?h* PPrinciple o. &ultime!iaI* +ata &cCra, <ill* >e, Delhi* 200). 3"2>7 0-0A-05((33-3
9. 8re! <alsall* I&ultime!ia Communications 7 Applications* >et,or?s* Protocols an! "tan!ar!sI* Pearson
E!ucation 't!.* 2001.
10. 8rancois 8luc?iger* I/n!erstan!ing >et,or?e! &ultime!ia 7 Applications an! +echnolog#I* Prentice <all*
1995
11. 'i* Dre,* &ultime!ia Computing * Pearson E!ucation* 'atest E!ition.
Page +* o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE F "1" S7t?a,e P,(ect Ma!a6e*e!t
+ T P C,
3 1 0 3.5
Secti! A
3ntro!uction to "o.t,are Proect &anagement7 3ntro!uction* "o.t,are* Di..erence bet,een
so.t,are an! Program* Characteristics o. "o.t,are* ;hat is a ProectV ;h# "o.t,are Proect
&anagementV Acti0ities Co0ere! b# "o.t,are Proect &anager* "tructure o. "o.t,are Proect
&anagement Document* "o.t,are Proect &anagement 'i.e C#cle* =ole o. &etrics an!
&easurement.
Secti! B
Proect "iGe &easurement using F'OC an! 8unction Point &etric* Cost Estimation Anal#sis*
COCO&O &o!el* PE=+* Cantt chart an! Critical &ath &anagement .or Proect "che!uling.
"o.t,are Proect De0elopment &o!els7 ;ater.all &o!el* Protot#pe &o!el* "piral &o!el an!
=AD &o!el* &erits an! Demerits o. !i..erent mo!els.
Secti! C
&anaging an! E0aluating the Proect< &anaging the tas?7 Proect &onitoring an! control*
managing the plan* re0ie,s* .ee!bac? an! reporting mechanisms* con.iguration management*
6ualit# control an! 6ualit# assurance* managing change* rea!usting goals an! milestones* ris?
management* testing phases* .ormaliGe! support acti0itiesK
&anaging the team7 +eam organiGations* recruiting an! sta..ing-pic?ing the right people*
technical lea!ership* a0oi!ing obsolescence-training etc.
Secti! D
=is? &anagement 7 ;hat is ris? management an! ,h# it is important =is? &anagement C#cle*
=is? 3!enti.icationK Common +ools an! +echni6ues* =is? 6uanti.ication* =is? &onitoring* =is?
mitigation.
Rec**e!)e) B=s <
1. +om Demarco* Controlling "o.t,are Proect &anagement* &easurement* Prentice <all* >e,
9erse#.
2. +om Clib* 8inGi "usannah* Principles o. "o.t,are Engineering &anagement* A!!ison ;esle#*
Englan!.
3. 2ob <ughes an! &i?e CotterellK "o.t,are Proect &anagement* thir! e!ition* +ata &cCra,
<ill Publishing Compan# 't!.* >e, Delhi.
$. Pan?a 9aloteK "o.t,are Proect &anagement in Practice* Pearson E!ucation Asia.
5. ;atts ". <umphre#K ;inning ,ith "o.t,are V An E-ecuti0e "trateg#* Pearson E!ucation
Asia.
)."o.t,are Proect &anagement* ;al?er =o#ce7 Pearson E!ucation* 2005.
A."o.t,are Proect &anagement* 9oel <enr#* Pearson E!ucation.
Page +) o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE F "1$ DISTRIBUTED COMPUTING
+ T P C,
3 1 0 3.5
Secti! A
I!t,)&cti!< &oti0ation* obecti0es* characteriGation % classi.ication o. !istribute!
s#stems. Distribute! s#stem architecture. Ha,)?a,e C s7t?a,e iss&es9 C**&!icati!<
'a#ere! protocols* Client ser0er protocols* =PC* group communication.
C,)i!ati!9 s5!ch,!i@ati! C c!siste!c5< 'ogical cloc?s* Ph#sical cloc?s* mutual
e-clusion* election algorithms* atomic broa!cast* se6uential consistenc# transaction
!istribute! consensus* Th,ea)s< +hrea! s#nchroniGation* implementation issues* an!
threa!s 0s. =PC.
Secti! B
M)e2s 7 )ist,i'&te) c*8&ti!6< Client - "er0er Architectures 7 Challenges* Design*
&etho!olog#* 3ntranets an! Croup,are. Croup mo!els an! peer to peer7 Croups .or ser0ice
replication4 reliabilit#* groups .or parallelism 4 per.ormance* client4 ser0er 0s. peer-to-peer*
multicast.
Secti! C
Dist,i'&te) 7i2e s5ste*< "ecurit#* >aming4 location transparenc#* =4; semantics* cache
coherence* replication. 'oa! 2alancing Distribute! share! memor#.
Dist,i'&te) *&2ti*e)ia s5ste*< 3ntro!uction* characteristics* an! resource management stream
a!aptation
Secti! D
%a&2t t2e,a!t )ist,i'&te) s5ste*s< 3ntro!uction* !epen!abilit#* .aults 0s. errors 0s. .ailure*
space time an! 0alue re!un!anc#* .ault tolerant architecture* .ailure !etection algorithms*
partitioning* 8+ consensus.
"ecurit# techni6ues* cr#ptographic algorithms* authentication an! access control.
Rec**e!)e) B=s <
1. Distribute! s#stems* concepts an! !esign* 3r! E!ition* A!!ison ;esle# b# Ceorge
Colouris* 9ean Dollimore an! +im Fin!er berg.
2. Distribute! s#stem* 2n! E!ition* A!!ison ;esle# b# "ape &ull en!er.
3. Distribute! Computing* Principles an! applications* &.'.'iu* Pearson E!ucation
Page +- o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
MBA -011 %OUNDATIONS O% %INANCIA+ ACCOUNTING
+ T P C,
3 1 0 3.5
I!t,)&cti! t %i!a!cia2 Acc&!ti!6
%i!a!cia2 State*e!ts< 2alance "heet* 3ncome "tatement* "tatement o. cash .lo,s. &echanics o.
Accounting7 +ransaction Anal#sis* 9ournal Entries* +rial o. 2alance. C*82eti!6 the
Acc&!ti!6 C5c2e< Accrual Accounting* A!usting Entries* Preparing 8inancial "tatements.
E!s&,i!6 the I!te6,it5 7 %i!a!cia2 I!7,*ati!< Problems* "a.eguar!s. "elling a Pro!uct or a
"er0ice7 =e0enue =ecognition* Cash Collection* Accounts =ecei0able. 3n0entories7 >ature o.
3n0entories* Haluation &etho!s.
Rec**e!)e) B=s<
1. Fhan an! 9ain* 8inancial &anagement* +ata &cCra,-<ill Publishing Co. 't!.* >e, Delhi*
$th E!ition.
2. =obert Anthon#* Da0i! 8. <a,?ins an! Fenneth A. &erchant* Accounting-+e-t an! Cases*
+ata &cCra,-<ill Publishing Co. 't!.* >e, Delhi* 12th E!ition* 200A.
Page +. o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE # "1- NET;ORJ SECURITY
+ T P C,
3 1 0 3.5
SECTION A
BASIC ENCRYPTION AND DECRYPTION< Attac?ers an! +#pes o. threats* challenges .or
in.ormation securit#* Encr#ption +echni6ues* Classical Cr#ptographic Algorithms7
&onoalphabetic "ubstitutions such as the Caesar Cipher* Cr#ptanal#sis o. &onoalphabetic
ciphers* Pol#alphabetic Ciphers such as Higenere* Hernam Cipher* "tream an! 2loc? Ciphers.
SECTION B
SECRET JEY SYSTEMS< +he Data encr#ption "tan!ar! 1DE"5* Anal#Ging an! "trengthening
o. DE"* 3ntro!uction to A!0ance Encr#ption "tan!ar! 1AE"5
PUB+IC JEY ENCRYPTION SYSTEMS< Concept an! Characteristics o. Public Fe# Encr#ption
s#stem* 3ntro!uction to &er?le-<ellman Fnapsac?s* =i0ets L "hamir-A!lman 1="A5
Encr#ption.
SECTION C
HASH A+GORITHMS< <ash Algorithms* &essage Digest Algorithms such as &D$ an! &D5*
"ecure <ash Algorithms such as "<1 an! "<A2.
NET;ORJ SECURITY< >et,or? "ecurit# 3ssues such as 3mpersonation* &essage
Con.i!entialit#* &essage 3ntegrit#* Co!e 3ntegrit#* Denial o. "er0ice* 8ire,alls* D&Rs* Hirtual
Pri0ate >et,or?s* >et,or? &onitoring an! Diagnostic De0ices.
SECTION D
;EB SECURITY< ;eb "er0ers* "ecure Electronic &ail* Enhance! Email* Prett# Coo! Pri0ac#*
Public Fe# Cr#ptograph# "tan!ar!s
ETHICA+ HACJING< 3ntro!uction to Ethical <ac?ing* +erminolog#* <ac?ers* Crac?ers* an!
Other =elate! +erms* <acti0ism* +hreats* <ac?ing <istor# *Ethical <ac?ing Obecti0es an!
&oti0ations. .
Rec**e!)e) B=s<
1. Principles o. Cr#ptograph#* ;illiam "tallings* Pearson E!ucation
2. P"ecurit# in Computing 1"econ! E!ition5O* Charles P.P.leeger* 199)* Prentice <all
3nternational* 3nc.
3. Cr#ptograph# % >et,or? "ecurit#* Atul Fahate* +&<
Page ," o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE F "1. ATM Net?,=s
+ T P C,
3 1 0 3.5
Secti!#A
2rie. <istor# o. 2-3"D> an! A+&. Principles an! buil!ing bloc?s o. 2-3"D> - 2-3"D>
principles* 2-3"D> net,or? concept - >et,or?ing +echni6ues - >et,or? la#ering* ",itching o.
0irtual channels an! 0irtual paths* Applications o. 0irtual channel4path connections. +ra..ic
management aspects
Secti!#B
2-3"D> user-net,or? inter.aces an! protocols - 2-3"D> protocol re.erence mo!el - Ceneral
aspects 'a#ere! architecture* relationship bet,een the 2-3"D> P=& an! the O"3 re.erence
mo!el* 2-3"D> P=& !escription* 'a#er 8unctions* =elationship bet,een OA& .unctions an!
the 2-3"D> P=&. Ceneral aspects o. the user-net,or? inter.ace - +rans.er mo!e* 2it rates
3nter.ace structure. A+& 'a#er - Cell structure* Cell <ea!er* A+& =e.erence &o!el* A+&
a!aptations 'a#er
Secti!#C
3mplementation issues - Ph#sical la#er* A+& 'a#er. +ra..ic management7 +ra..ic control
proce!ures an! their impact on resource management. &echanisms to achie0e a speci.ie! @o" -
/se o. 0irtual paths* Connections a!mission control* /sage parameter control an! net,or?
parameter control* Priorit# control* +ra..ic shaping.
+he 3nternet an! A+& 7 3P o0er A+& - Encapsulation* a!!ressing an! routing* A!!ress
resolution* * &ulticast an! broa!cast support .or 3P an! A+& - &ulticast a!!ress resolution
ser0er operations. 3P Hersion ) o0er A+&.. 3P s,itching* +ag s,itching* Carrier scale
internet,or?ing - 3P s,itching* tag s,itching* Carrier scale internet,or?ing.
Secti!#D
3nter,or?ing ,ith other net,or?s an! ser0ices7 3nter,or?ing principles* Circuit emulation
ser0ice 1CE"5. A+& local area net,or?s* 'ocal Area net,or? emulation - +he basic 'A>E
principles* the buil!ing bloc?s* a!0antages an! !isa!0antages o. 'A>E* o0er0ie, o. 'A>E
0ersion 2. &ultiprotocol o0er A+& - +he basic principles* Principles o. !ata .lo,* &POA
control .lo,s. A+& s,itching - ",itching elements - &atri--t#pe s,itching elements* Central
memor# s,itching element* 2us t#pe s,itching element* =ing- t#pe s,itching element*
Per.ormance aspect* +echnological aspects* "ingle stage net,or?s* &ulti - stage net,or?s* Cell
hea!er processing in s,itch .abrics* &ulticast .unctionalit#. ",itches an! corss connects -
Ceneric s#stem structure* "#stem buil!ing bloc?s.
Rec**e!)e) B=s <
1. A+& >et,or?7 3r! E!ition* =ain <an!el* <an!el % "chro!er
2. A+& - +heor# an! Application b# Da0i! E. &cD#san % Darren '. "pohn* &c Cra, <ill 199$
3. 3EEE >et,or?s &agaGine "ep E92 on,ar!s
CPE # "1/ G,i) C*8&ti!6
+ T P C,
3 1 0 3.5
Secti! A
Page ,# o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
O0er0ie, an! &oti0ation7 +he histor# an! e0olution o. Cri! computing* 2asic concepts o. Cri!
computing an! =e6uirements. Problems* +ren!s an! Directions in Cri! Computing. Applications of %rid
&o"puting'
Secti! B
Cri! Architectures an! +echnologies7 >ature o. Cri! architecture* Components o. Cri!* 'a#ere! Cri!
Architecture7 Fe# Components7 Cri! =esource Allocation &anagement 1C=A&5* Cri! 8+P protocol*
Cri! =esource 3n.ormation "er0ice 1C=3"5. =esource in.rastructure* Open Cri! "er0ices Architecture
1OC"A5* Clobus +ool?it an! ;eb "er0ices* g'ite* an! />3CO=E etc.
Secti! C
Cri! Computing En0ironments* =esource allocation* sharing an! !isco0er#. Peer-to-peer s#stems7
Purpose* !e.inition* characteristics* +#pes o. P2P s#stems* Securit( issues in %rid en)iron"ent
Secti! D
A!0ance! Applications o. Cri! in >e, 2iolog# an! the Cri!* Data 3ntensi0e Cri!s applications .or high-
energ# ph#sics* "emantic Cri!. Case St&)5< HECC 1>ational Proect5* ;orl! Communit# Cri! 1Clobal
Proect5* 2O3>C % 8W<
Rec**e!)e) B=s<
1. 2art 9acob* &ichael 2ro,n* Fentaro.u?ui* >ihar +ri0e!i L 3ntro!uction to Cri! Computing 132&
=e! 2oo?5 2005
2. Ananth Crama* Anshul Cupta* Ceorge Far#pis* Hipin Fumar L 3ntro!uction to Parallel
Computing 1Pearson E!u5* 200$ 33 E!.
3. H. =aaraman* C. "i0a =am &urth# L Parallel Computers L Architecture an! Programming
1P<35* 2000
$. 9osh# 9oseph % Craig 8ellenstein* PCri! ComputingQ* Pearson4P<3 P+=-2003.
5. 8ran 2erman* Ceo..re# 8o-* an! +on# <e# L PCri! Computing7 &a?ing +he Clobal
3n.rastructure a =ealit#Q* 2003
CPE # "10 B&si!ess I!te22i6e!ce
+ T P C,
3 1 0 3.5
SEC!ON "
Page ,! o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
/ntro0uction to Business /ntelligence
/ntro0uction to 0igital 0ata an0 its types 1 structure0, semi2structure0 an0 unstructure0,
/ntro0uction to $3TP an0 $34P (5$34P, 6$34P, 7$34P, B/ 8e(initions 9 Concepts, B/
Frame:or;, 8ata <arehousing concepts an0 its role in B/, B/ /n(rastructure Components 1 B/
Process, B/ Technology, B/ 6oles 9 6esponsibilities, Business 4pplications o( B/, B/ best
practices.
SEC!ON B
Basics o( 8ata /ntegration (E=traction rans(ormation Loa0ing
Concepts o( 0ata integration, nee0s an0 a0vantages o( using 0ata integration, intro0uction to
common 0ata integration approaches, 5eta 0ata 2 types an0 sources, /ntro0uction to 0ata >uality,
0ata pro(iling concepts an0 applications, intro0uction to ET3 using ?ettle.
SEC!ON C
/ntro0uction to 5ulti28imensional 8ata 5o0eling
/ntro0uction to 0ata an0 0imension mo0eling, multi0imensional 0ata mo0el, E6 5o0eling vs.
multi 0imensional mo0eling, concepts o( 0imensions, (acts, cubes, attribute, hierarchies, star an0
sno:(la;e schema, intro0uction to business metrics an0 ?P/s, creating cubes using 5icroso(t
E=cel.
SEC!ON D
Basics o( Enterprise 6eporting
4 typical enterprise, 5alcolm Bal0rige 2 >uality per(ormance (rame:or;, balance0 scorecar0,
enterprise 0ashboar0, balance0 scorecar0 vs. enterprise 0ashboar0, enterprise reporting using
5% 4ccess @ 5% E=cel, best practices in the 0esign o( enterprise 0ashboar0s.
RECOMMENDED BOOKS:
# 6.A. Prasa0 an0 %eema 4charya, Fun0amentals o( Business 4nalytics, <iley
/n0ia 3t0.
! 5i;e Biere, Business /ntelligence (or the Enterprise, Prentice 7all Pro(essional.
' Teo 3achev, 4pplie0 5icroso(t 4nalysis %ervices !"",& 4n0 5icroso(t Business
/ntelligence Plat(orm, Prologi;a Press.
+ 8avi0 Taniar, Progressive metho0s in 0ata :arehousing an0 business
intelligence& concepts an0 competitive analytics, /0ea Broup /nc (/B/.
, 8ata :arehousing& the ultimate gui0e to buil0ing corporate business intelligence,
Bir;hCuser.
* 5ar; 7umphries, 5ichael <. 7a:;ins, 5ichelle C. 8y, 8ata :arehousing&
architecture an0 implementation, Prentice 7all Pro(essional.
MBA -012 %OUNDATIONS O% MANAGERIA+ ACCOUNTING
+ T P C,
3 1 0 3.5
Page ,' o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
&anagement Accounting an! Cost Concepts. 3n0esting Acti0ities7 >ature o. 'ong-'i0e! Assets*
Depreciation metho!s. 'ong-term 'iabilities. E6uit# 8inancing7 >ature o. e6uities* Accounting
.or E6uities* =etaine! Earnings. 3n0estments in Debt an! E6uit# "ecurities7 +ra!ing "ecurities*
A0ailable-.or-sale "ecurities* <el!-to-maturit# securities. "tatement o. Cash 8lo,s7 Purpose*
Classi.ication. 8inancial "tatement Anal#sis7 =atios* Common-"iGe 8inancial "tatements.
Acti0it#-2ase! Costing. Cost 2eha0ior an! Decisions using C-H-P anal#sis7 3mportance o. C-H-
P* Anal#sis o. &i-e! costs* &etho!s o. C-H-P anal#sis. Capital 3n0estment Decisions7
>on!iscounte! Capital 2u!geting +echni6ues* Discounte! Capital 2u!geting +echni6ues.
Rec**e!)e) B=s<
1. Charles +. <orngren* Ceorge 8oster an! "ri?ant &. Datra* &ost Accounting* A Managerial
+"phasis, Prentice-<all o. 3n!ia* >e, Delhi* 12
th
E!ition.
2. Charles +. <orngren* $ntroduction to Manage"ent Accounting, Prentice-<all o. 3n!ia* >e,
Delhi* 12
th
E!ition* 200A.

B. TECH %OURTH YEAR
COMPUTER ENGINEERING
(Batch 2012)
Sessi! (201-#1.)
SCHEME O% PAPERS
Page ,+ o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
SEHENTH SEMESTER (COMPUTER ENGINEERING)
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1. CPE-$01 3nternet % ;eb +echnologies 3 1 0 3.5
2. CPE-$02 9a0a Programming 3 1 0 3.5
3. CPE-$03 "#stem &o!eling % "imulation 3 1 0 3.5
$. CPE-$0$ Arti.icial 3ntelligence 3 1 0 3.5
5. CPE-$51 3nternet % ;eb +echnologies 'ab 0 0 2 1.0
). CPE-$52 9a0a Programming 'ab 0 0 2 1.0
A. CPE-$5$ Arti.icial 3ntelligence 'ab 0 0 2 1.0
(. Electi0e- 3H N 3 1 0 3.5
9. Electi0e L H NN 3 1 0 3.5
Tta2 1
(
) ) 2$
Tta2 C!tact H&,s 3 "0
E+ECTIHE F IH %OR SEHENTH SEMESTER (COMPUTER ENGINEERING)G
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1. CPE-$05 >eural Computing 3 1 0 3.5
2. CPE-$0) A!0ance! Computer >et,or?s 3 1 0 3.5
3. CPE-$0A Data &ining % ;arehousing 3 1 0 3.5
$. CPE-$0( Digital 3mage Processing 3 1 0 3.5
5. CPE-$09 A!0ance! Computer Architecture 3 1 0 3.5
). CPE-$10 Obect Oriente! Anal#sis % Design /sing /&' 3 1 0 3.5
A. &2A-5033 8oun!ation o. 3nternational 2usiness 3 1 0 3.5
NC<OO"E A>M O>E 8=O& +<E '3"+
E+ECTIHE F H %OR SEHENTH SEMESTER(COMPUTER ENGINEERING)GG
S. N. S&'(ect C)e S&'(ect Na*e + T P C,.
1 ECE-$03 ;ireless % &obile Communication 3 1 0 3.5
2 ECE-$0A >ano Electronics 3 1 0 3.5
3 ECE-$0( 2iome!ical 3nstrumentation 3 1 0 3.5
$ ECE-$09 Optical >et,or?s 3 1 0 3.5
5 &2A-5013 8oun!ations o. 8inance 3 1 0 3.5
NC<OO"E A>M O>E 8=O& +<E '3"+
CPE-$51* CPE-$52 an! CPE-$5$ are practical papers onl#. +here ,ill not be an# theor#
e-amination .or these papers.
Page ,, o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
U!i4e,sit5 C22e6e 7 E!6i!ee,i!6
Punabi /ni0ersit#* Patiala.
Ge!e,a2 I!st,&cti!s t the Pa8e, Sette,s
1Common .or 2.+ech. in Computer Engineering* Electronics an! communication Engineering*
&echanical Engineering* Ci0il Engineering an! 3ntegrate! 2+ech4&2A 2ranches5
A882ica'2e t 20109 20119 2012 Batches !25
+he 2. +ech 6uestion paper structure ,ill be as sho,n belo,7
Patte,! 7 :&esti! Pa8e,
+3+'E O8 "/29EC+ 1CODE----5
2achelor o. +echnolog# 12ranch5 "ection7 :::..
En! "emester E-am
+3&E A''O;ED7 3 <our =oll. >o::::.
&a-imum &ar?s7 $5
>ote7- Attempt .our 6uestions selecting one 6uestion .rom each section A* 2* C an! D. "ection E is compulsor#.
Secti!#A (%,* Secti! A 7 the s522a'&s)
@1. .........................................................................
@2. ........................................................................ 1-9
Secti!#B (%,* Secti! B 7 the s522a'&s)
@3. .........................................................................
@$. ......................................................................... 1-9
Secti!#C (%,* Secti! C 7 the s522a'&s)
@5. .........................................................................
@). ......................................................................... 1-9
Secti!#D (%,* Secti! D 7 the s522a'&s)
@A. .........................................................................
@(. ......................................................................... 1-9
Secti!#E (C**! 7,* ;h2e 7 the S522a'&s)
@9.
a5.........................................................................
b5 .........................................................................
c5 .........................................................................
!5 .........................................................................
e5 .........................................................................
.5 .........................................................................
g5 .........................................................................
h5 .........................................................................
i5......................................................................... 9-1
Note for the paper setter:
1. >umbers o. 6uestions to be set are nine 195 as per the abo0e .ormat.
2. "ection A* 2* C an! D contain t,o 6uestions o. >ine 195 mar?s each. <o,e0er* nine mar?s 6uestion ma#
be splitte! into subparts.
3. "ection E is compulsor# an! contains nine sub-parts o. one mar? each. +he ans,ers .or each 6uestion
shoul! pre.erabl# be o. 2 to 3 lines.
$. +he ma-imum limit on numerical 6uestions to be set in the paper is 35B ,hile minimum limit is 20B
e-cept theoretical papers.
5. +he paper setter shall pro0i!e !etaile! mar?ing instructions an! solution to numerical problems .or
e0aluation purpose in the separate ,hite en0elopes pro0i!e! .or solutions.
). +he paper setters shoul! seal the internal % e-ternal en0elope properl# ,ith signatures % cello tape at
proper place.
A. 'og tables* charts* graphs* Design !ata tables etc. shoul! be speci.ie!* ,hene0er nee!e!.
(. /se o. "cienti.ic calculator shoul! be clearl# speci.ie!.
9. +here are some &2A subects 1like BAS 202 Operational Research, MBA 5011 Foundation of Financial
Accounting, MBA 5012 Foundation of Managerial Accounting, MBA 5022 Foundations of Marketing,
MBA 5023 Foundations of a!, MBA 5031 Foundations of Macroecono"ics, MBA 5032 Foundations of
Microecono"ics, MBA#5033 Foundations of $nternational Business, MBA 5013 Foundations of Finance5
,here s#llabus is not !i0i!e! among .our sections namel# A*2*C*D then @uestion paper must be set b#
,ithout speci.#ing section in it an! gi0ing proper ,eightage to the respecti0e portions.
Page ,* o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#$01 INTERNET C ;EB TECHNO+OGIES
+ T P CR
" 1 0 ".-
SECTION A
Basics 7 I!te,!et< <istor# o. 3nternet an! ;;;* Concepts.
A,chitect&,e< 3nternet* 3ntranet an! E-tranet* Design Coals* 3ssues an! relate! aspects* a!!ressing
schemes* protocols* applications - e-mail* .tp* telnet* ;;;* 3=C.
SECTION B
I!t,a!et C!!ecti4it5< Connection concepts* 8DD3* 3"D>* AD"'* PPP* A+&* pro-# ser0er
SECTION C
I!t,)&cti! t IM+9 #ML& Pro0ucing 7T53 0ocuments , Tags , hea0ings , (onts , lists, tables,(orms ,
(rames , lin;s ,images.
Aa4a P,6,a**i!6 - class !esign* inheritance* o0erloa!ing* pol#morphism* e-ception han!ling* .ile
streams an! their manipulation* Applets* ser0lets* >et,or?ing*
SECTION D
;e' P,6,a**i!6 < 3ntro!uction to ;eb Pages* 3ntro!uction to 9a0a "cript7 2asic concepts* 0ariables
an! !ata t#pes* .unctions* con!itional statements* loops* operators* arra#s* stan!ar! obects an! .orm
processing in 9a0a* 9D2C* 3ntro!uction to .>E+ technologies an! P<P .
Rec**e!)e) B=s <
1. 9a0a 27 +he complete re.erence b# "chil!t* <erbert
2. 3nternet Programming Fris 9amsa an! Fene Cope Calgotia Publication
'. <eb Programming Chris Bates ,<illey ,
+. 3nternet an! technolog# L "atish 9ain
,. D.Comer* +he 3nternet 2oo?
*. ;eb +echnologies- A Computer "cience Perspecti0e b# 9e..re# C. 9ac?son* Pearson E!ucation
). ;eb +echnolog#- A !e0eloperOs perspecti0e b# >.P. Copalan* 9. A?ilan!esh,ari* P<3 learning
Page ,) o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE $02 AAHA P,6,a**i!6
L P CR
3 $ 0 3%5
SECTION A
Aa4a Meth)s9 C2asses a!) I!he,ita!ce<
3ntro!uctionK classesK metho!sK constructorsK o0erloa!ing metho!sK arra#sK recursionK passing arra#s an!
obects to metho!sK 3nheritanceK metho! o0erri!ingK abstract classesK using .inalK pac?agesK inter.aces.
EEce8ti!a2 Ha!)2i!6 a!) M&2tith,ea)e) P,6,a**i!6<
E-ception han!ling .un!amentalsK e-ception t#pesK uncaught e-ceptionsK tr# an! catchK creating e-ception
classesK thro,ing e-ceptionsK 9a0a threa! mo!elK threa! prioritiesK creating a threa!K inter-threa!
communication* s#nchroniGationK suspen!ing* resuming an! stopping threa!sK 34O.
SECTION B
IDO C Net?,=i!6 8,6,a**i!6< 34O basicsK stream classesK b#te an! character streamsK rea!ing an!
,riting .ilesK commonl# use! classes an! inter.aces o. a0a.net pac?age* soc?et programming.
A882ets a!) G,a8hics<
Applet .un!amentalsK Applet classK Applet initialiGation an! terminationK e0ent han!lingK ?e#boar! an!
mouse e0entsK A;+ classK 'a#out managersK panelsK can0asesK 8rame ,in!o,sK !ra,ing lines*
rectangles* ellipses.
SECTION C
O4e,4ie? 7 A2EE a!) ?,=i!6 ?ith ADBC<
;hat is 92EE* component base! architecture o. 92EE7 ;eb* 2usiness an! Application component
ADBC 8,6,a**i!6<Commonl# use! classes an! inter.aces o. a0a.s6l pac?age* connecting a0a
application to a !atabase* prepare! statements.

SECTION D
Se,42ets a!) ASP<
9a0a "er0lets* compilation* !eplo#ment* an! testing a ser0let* session management* re6uest !ispatching*
9a0a "er0er Pages* !eplo#ing an! testing a 9"P* using a0a beans in 9"P.
E!te,8,ise Aa4a Bea!s(EAB)<
Architecture o. E92* creating a stateless-session E92* state.ull-session bean* 'i.e C#cle o. session beans*
Entit# beans* li.e c#cle o. entit# beans
Rec**e!)e) B=s <
1.Dietel an! Dietal* 9a0a7 <o, to Program* )
th
E!ition* Pearson E!ucation
2.<erbert "chil!t +he Complete =e.erence 9a0a2* +&<
3.9ames E!,ar! Feogh* 9im Feogh 92EE7 +he complete =e.erence* &cCra,-<ill
Page ,- o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE $0" SYSTEM MODE+ING C SIMU+ATION
+ T P CR
" 1 0 ".-
SECTION F A
I!t,)&cti!< "#stems* mo!eling* general s#stems theor#* Concept o. simulation* "imulation as
a !ecision ma?ing tool* t#pes o. simulation. "imulation +erminologies- Application areas L
&o!el Classi.ication L+#pes o. "imulation- "teps in a "imulation stu!#- Concepts in Discrete
E0ent "imulation - "imulation E-amples.
SECTION#B
Statistica2 M)e2s F C!ce8ts< F Discrete Distribution- Continuous Distribution L Poisson
Process- Empirical Distributions- @ueueing &o!els L Characteristics- >otation L @ueueing
"#stems L &ar?o0ian &o!els- Properties o. ran!om numbers- Ceneration o. Pseu!o =an!om
numbers- +echni6ues .or generating ran!om numbers-+esting ran!om number generators-
Cenerating =an!om-Hariates- 3n0erse +rans.orm techni6ue L Acceptance- =eection techni6ue L
Composition % Con0olution &etho!.
SECTION#C
Desi6! 7 Si*&2ati! EE8e,i*e!ts< Problem .ormulation* !ata collection an! re!uction* time
.lo, mechanism* ?e# 0ariables* logic .lo, chart* starting con!ition* run siGe* e-perimental
!esign consi!eration* output anal#sis an! interpretation 0ali!ation* input mo!eling* Data
collection* Assessing sample in!epen!ence* <#pothesiGing !istribution .amil# ,ith !ata*
Parameter Estimation* Coo!ness-o.-.it tests* "electing input mo!els in absence o. !ata* Output
anal#sis .or a "ingle s#stem* +erminating "imulations* "tea!# state simulations.
SECTION#D
De0elopment o. simulation mo!els using simulation language stu!ie! .or s#stems li?e 6ueuing
s#stems* Pro!uction s#stems* 3n0entor# s#stems* maintenance an! replacement s#stems an!
3n0estment anal#sis. "imulation +ools L &o!el 3nput* <igh le0el computer s#stem simulation*
CP/ L&emor# "imulation* Comparison o. s#stems 0ia simulation L "imulation Programming
techni6ues - De0elopment o. "imulation mo!els. "imulation programming languages L
simulation suitabilit# ,ith characteristics* Comparison an! selection o. simulation languages*
stu!# o. an# one simulation language.
Rec**e!)e) B=s<
1. 9err# 2an?s an! 9ohn Carson* P Discrete E0ent "#stem "imulationQ* 8ourth E!ition* P<3*
2005.
2. Ceo..re# Cor!on* P"#stem "imulationQ* "econ! E!ition* P<3* 200).
3. >arsingh Deo* P"#stem "imulation ,ith Digital Computer* PPrentice <all* 3n!ia* 2001.
$. 8ran? '. "e0erance* P "#stem &o!eling an! "imulationQ* ;ile#* 2001.
5. 9err# 2an?s* P<an!boo? o. "imulation7 Principles* &etho!olog#* A!0ances* Applications an!
PracticeQ* ;ile#* 199(.
Page ,. o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#$0$ ARTI%ICIA+ INTE++IGENCE
+ T P CR
" 1 0 ".-
SECTION A
Arti.icial 3ntelligence +echni6ues* le0els o. mo!els* un!erstan! the importance* .unctions* a!0antages* as
,ell as the limitations o. arti.icial intelligence. /se o. Arti.icial 3ntelligence an! intelligent agents
SECTION B
"tate* space* search* control strategies* heuristic search* problem characteristics* pro!uction s#stem
characteristics. &apping bet,een .acts an! representations* approaches to ?no,le!ge representation*
semantic sets* .rame* conceptual !epen!ing* scripts* pre!icti0e logic* resolution in pre!icate logic
SECTION C
Proce!ural Hs !eclarati0e ?no,le!ge* matching* con.lict resolution* >on-monotonic reasoning* !e.ault
reasoning* statistical reasoning* ?no,le!ge e-traction. 3n0estigate the roles an! !e0elopment metho!s o.
arti.icial intelligence in !ecision ma?ing processes. >eural net,or? resources* cogniti0e science* role o.
neural net,or? in computer science.
SECTION D
Characteristics o. A3 language* '3"P-s#mbol manipulation- basic lisp .unction* pre!icate!* con!ition*
recursion* iteration* Arra#-lamb!a .unctions* input-output statements. A3 problems 7 pattern recognition*
0oice recognition* 8eature E-traction
Rec**e!)e) B=s <
1. Arti.icial 3ntelligence b# =ich an! Finght* +&<
2. 3ntro!uction to Arti.icial 3ntelligence b# Charnia? an! &c!ermott. A!!ison-;esle#* 19(5.
3. Essentials o. Arti.icial 3ntelligence b# Cinsburg. &organ Fau.mann* 1993.
$. Arti.icial 3ntelligence b# ;inston 3r! E!ition* A!!ison ;esle#* 1992.
5. Arti.icial 3ntelligence b# Pa!h#* O-.or! Press
Page *" o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE $-1 INTERNET C ;EB TECHNO+OGIES +AB
+ T P C,
0 0 2 1.0
1. 2asic Concept o. 3nternet Connecti0it# % their .eatures.
2. "tu!# o. Di..erent search engines
3. Di..erent ;eb "er0er an! their comparison.
$. 3llustration o. ,eb scripting languages an! their applications.
5. 3ntro!uction to 9AHA APP'E+"* PACFACE" % 9D2C
Page *# o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE $-2 AAHA P,6,a**i!6 +a'
+ T P C,
0 0 2 1.0
1. ;AP to implement constructors an! o0erloa!ing.
2. ;AP to implement recursion* .unctions an! arra#s.
3. ;AP to implement 3nheritance* inter.aces an! pac?ages.
$. ;AP ,hich ,ill e-plain the concept o. tr#* catch an! thro,.
5. ;AP to !emonstrate threa!s an! animations.
). ;AP to e-plain 34O streams an! .iles an! soc?et programming.
A. ;AP to implements Applets an! use o. it on internet.
(. ;AP to !escribe A;+ Class* 8rames* Panels an! Dra,ing.
9. ;AP to !emonstrate 9D2C an! buil! an application.
10. ;AP to implements use o. 9"P.
Page *! o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE $-$ A,ti7icia2 I!te22i6e!ce +a'
+ T P C,
0 0 2 1.0
1. 3ntro!uction to P=O'OC an! its .eatures.
2. =epresentation o. .acts using P=O'OC
3. =epresentation o. pre!icate 'ogic.
$. 3ntro!uction to >'P +echni6ues an! their applications.
5. 3ntro!uction to E-pert "#stem
Page *' o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#$0- NEURA+ COMPUTING

+ T P CR
" 1 0 ".-
SECTION A
Ne&,a2 !et?,=s< intro!uction* neural net,or?s* super0ise! or unsuper0ise! learning* .ee! .or,ar!
net,or?* <op.iel! net,or?.
Ne&,a2 !et?,= *)e2s< neural net,or? mo!els* la#ers in neural net,or? an! their connections. 3nstar*
outstar* ,eights on connections* threshol! .unction.
SECTION B
Bac=8,8a6ati!< 8or,ar! bac? propagation net,or?- mapping* la#out* training* 2P> applications.
+ea,!i!6 a!) t,ai!i!6< obecti0es o. learning* <ebbOs rule* !elta rule* super0ise! learning* unsuper0ise!
net,or?s* learning 0ector 6uantiGer* associati0e memor# mo!els* one-shot learning* resonance* stabilit#*
training an! con0ergence.
SECTION C
%&@@5 +6ic< 3ntro!uction* .uGG# sets* .uGG# operations* an! .uGGiness in neural net,or?s* neural traine!
.uGG# s#stem* 2A&- bi!irectional associati0e memor#* inputs an! outputs* ,eights an! training. 8A&-
.uGG#
Associati0e memor#* association* 8A& neural net,or?s* enco!ing
SECTION D
A882icati! 7 7&@@5 +6ic< 8uGG# in.erence s#stem* !e.uGGi.ication.
3ntro!uction to >euro 8uGG# "#stems Architecture o. a >euro 8uGG# >et,or?.
GENETIC A+GORITHM< An o0er0ie,* CA in problem sol0ing 3mplementation o. CA an! CP
Rec**e!)e) B=s <
1. =ao* Hallinu 2.*an! =ao* <a#agri0a . >eural net,or?s an! .uGG# 'ogic* secon! e!ition* 2P2
Publication
2. 2er?an C. =iGa* +rubatch '* "hel!on* 8uGG# "#stems !esign Principlea. 3EEE Press * stan!ar!
publishers
3. 8reeman A. 9ames* "?apura &. Da0i!- neural net,or?s algorithms* applications an!
programming.
$. "o.t Computing b# 8re! AminGa!el % 9amshich* Prentice <all
Page *+ o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#$0. ADHANCED COMPUTER NET;ORJS
+ T P CR
" 1 0 ".-
SECTION#A
8un!amentals o. Optical net,or?ing an! ;D&* ,a0elength con0ertible net,or?s* 0irtual topolog#*
net,or? sur0i0abilit#* optical multicast routing* optical internet net,or?s
Hi6h S8ee) Net?,=s< 3ntro!uction* 3"D>* 'a#ere! &o!el Architecture* 23"D>.
SECTION F B
As5!ch,!&s t,a!s7e, *)e< 3ntro!uction* A+& la#er mo!el* A+& s,itching- input* output an!
central 6ueuing* A+& +ra..ic &anagement* le0els o. @O"* resource reser0ation* /nicast % &ulticast
routing* multime!ia compression* =outing an! a!!ressing in A+& net,or?s* A+& 3nter-,or?ing
stan!ar!s
SECTION F C
S5ste* sec&,it5< Cr#ptograph#* Public an! Pri0ate Fe# encr#ption* ="A algorithm* DE" Algorithm*
Digital signatures* 8ire,alls* <ac?ing.
SECTION F D
A)#hc Net?,=s< O0er0ie,* mobile a!-hoc net,or?s* ,ireless a!-hoc net,or?s* routing principles*
=outing .or ;ireless multi-hop >et,or?s* Per.ormance issues.
Rec**e!)e) B=s <
1. C.".=. &urth# % &. Curusam#* I ;D& optical >et,or?s7 Concepts* Design % Algorithms
I* P<3
2. ". Fasera an! P. "ethi* PA+& >et,or?s-Concepts an! Protocols I* &cCra,-<ill
3. '.'. Peterson* 2.". Da0ie* PComputer >et,or?s7 A "#stems ApproachQ* Pearson E!ucation
Page *, o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#$0/ DATA MINING C ;AREHOUSING
+ T P CR
" 1 0 ".-
SECTION A
3ntro!uction to Data &ining % ;arehousing* 3ts 3mportance an! applications* Data &arts* &ata Data*
Data Cubes* &ulti!imensional Data 2ases* 3ntro!uction to O'+P* O'AP* =O'AP* &O'AP. Data ,are
house process an! architecture* Data ,are house manager.
SECTION B
I!t,)&cti! Data Mi!i!6 Tech!i>&es < +ools an! applications. Data &ining @uer# 'anguages* Data
speci.ications* hierarch# speci.ication* pattern presentation an! 0isualiGation speci.ication.
SECTION C
Data Mi!i!6 Tech!i>&es < Clustering +echni6ues Decision +rees Fno,le!ge !isco0er# through neural
>et,or?s* rough sets* support 0ictor machines an! .uGG# techni6ues 7 Association rules.
SECTION D
3ntro!uction to "patial Data bases* multime!ia !ata bases * !istribute! % 0irtual !ata ,are house. +ime
series an! "e6uence !ata 7 mining te-t Data bases an! mining ,or! ,i!e ,eb.
Rec**e!)e) B=s<
1. Data ;arehousing in the =eal ;orl! 7 "am Anahor# % Dennis &urrar# 7 199A* Pearson.
2. Data &ining 7 Concepts % +echni6ues7 9ia,ei <an % &icheline Famber L 2001* &organ
Fau.mann.
3. Data &ining +echni6ues 7 Arun Puar 2001* uni0ersit# Press 7 <#!erba!.
Page ** o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE $00 DIGITA+ IMAGE PROCESSING
+ T P CR
" 1 0 ".-
SECTION#A
I!t,)&cti! a!) Di6ita2 I*a6e %&!)a*e!ta2s< Digital 3mage representation* 8un!amental steps in
3mage processing* Elements o. !igital 3mage processing* "ampling an! 6uantiGation* some basic
relationships li?e neighborOs connecti0it#* !istance measure bet,een pi-els* 3mage geometr#.
I*a6e T,a!s7,*s< Discrete 8ourier trans.orm* "ome properties o. t,o-!imensional 8ourier trans.orm*
8ast 8ourier trans.orm* 3n0erse 88+.
SECTION#B
I*a6e E!ha!ce*e!t< Point Operations* <istograms* "patial Domain metho!s* 8re6uenc# !omain
metho!s* Enhancement b# point processing* "patial .iltering* lo, pass .iltering* <igh pass .iltering*
<omomorphic .iltering* Colour image processing.
3mage =estoration Degra!ation mo!el* Algebraic approach to =estoration* 3n0erse .iltering* ;iener .ilter*
Constraine! least s6uare restoration* 3nteracti0e restoration* =estoration in spatial !omain.
SECTION#C
I*a6e C*8,essi!< Co!ing 3nter-pi-el an! Ps#cho 0isual re!un!anc#* 3mage Compression mo!els*
Error .ree compression* 'oss# Compression* 3mage Compression stan!ar!s.
I*a6e Se6*e!tati!< Detection o. !iscontinuities* E!ge lin?ing an! boun!ar# !etection* +hreshol!ing*
=egion Orientation "egmentation* &otion base! segmentation.
SECTION#D
Re8,ese!tati! a!) Desc,i8ti!< =epresentation schemes li?e chain co!ing* Pol#gonal appro-imation*
"ignatures* 2oun!ar# "egments* "?eleton o. region* 2oun!ar# Description* =egional !escriptors*
&orpholog#.
Rec6!iti! a!) I!te,8,etati!< Elements o. 3mage Anal#sis* Pattern an! pattern classes* Decision
+heoretic metho!s* "tructural metho!s* 3nterpretation.
Rec**e!)e) B=s<
1. A.F. 9ain*Q 8un!amentals o. Digital 3mage ProcessingQ* Pearson E!ucation.
2. =a.ael C. ConGaleG % =ichar! E. ;oo!s* PDigital 3mage ProcessingQ* A;'.
3. ;. F. Pratt*Q Digital 3mage ProcessingQ.
$. =amesh 9ain* 2rian C. "chunc?* P&achine HisionQ* +&<.
Page *) o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE#$01 ADHANCED COMPUTER ACRHITECTURE
+ T P CR
" 1 0 ".-
SECTION A
I!t,)&cti! t Pa,a22e2 P,cessi!6< E0olution o. Computer Architecture* Parallelism in /niprocessor
"#stem* Parallel Computer "tructures* Architectural Classi.ications "chemes* &ultiprocessors an!
&ulticomputers* &ulti0ector an! "3&D Computers* Parallel processing application.
Me*,5 a!) i!8&t &8&t s&'s5ste*s< <ierarchical &emor# structure* Hirtual memor# s#stem*
&emor# Allocation an! &anagement* Cache &emories an! &anagement* 3nput-Output "ubs#stem.
SECTION B
Pi8e2i!i!6 a!) Hect, P,cessi!6< Pipelining* 3nstruction an! Arithmetic Pipelines* Principles o.
Designing Pipeline! Processors* Hector Processing =e6uirements * Hector "uper Computers* Pipeline
Chaining an! Hector 'oops* HectoriGation an! OptimiGation &etho!s.
SECTION C
St,&ct&,es a!) A26,ith*s 7, A,,a5 P,cess,s< "3&D Arra# Processors* "3&D 3nterconnection
>et,or?s7 "tatic % D#namic >et,or?s* &esh Connecte! >et,or?* Cube interconnection >et,or?s*
Parallel Algorithms .or arra# processors* Associati0e Arra# Processing.
SECTION D
M&2ti8,cess, A,chitect&,e a!) P,6,a**i!6< 8unctional "tructures* 3nterconnection >et,or?s7
&ulti stage net,or?s 8or multiprocessors* Parallel &emor# OrganiGation* &ultiprocessor Operating
"#stem* E-ploiting Concurrenc# .or &ultiprocessing.
Rec**e!)e) B=s <
1. <a,ang ?ai* 2riggs 8.A.* Computer Architectures an! Parallel Processing* &cCra,-<ill
2. Fain =ichar! M.* A!0ance! Computer Architecture* P<3
3. <,ang Fai* A!0ance! Computer Architecture* &cCra,-<ill
$. &ano &.* Computer "#stem Architecture* P<3
Page *- o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
CPE-&$0 OBAECT ORIENTED ANA+YASIS C DESIGN Usi!6 UM+
+ T P CR
" 1 0 ".-
SECTION A
I!t,)&cti! t O'(ect< Obect Orientation* De0elopment* &o!eling* Obect &o!eling techni6ue.
Obect mo!eling7 Obects an! classes* 'in?s an! Association* CeneraliGation an! inheritance* Crouping
constructs* Aggregation* Abstract Classes* CeneraliGation as e-tension an! restriction* &ultiple
inheritance* P25*,8his*9 E!ca8s&2ati!* &eta !ata* Can!i!ate ?e#s* Constraints.
D5!a*ic *)e2i!6< E0ents an! states* >esting* Concurrenc#* A!0ance! D#namic &o!eling concepts
%&!cti!a2 *)e2i!6< 8unctional &o!els* Data .lo, !iagrams* "peci.#ing operations* Constraints*
=elation o. 8unctional mo!el to Obect an! D#namic &o!els.
SECTION B
Desi6! Meth)2659 A!a25sis< Obect mo!eling* D#namic mo!eling* 8unctional mo!eling* A!!ing
operations* 3terating Anal#sis.
S5ste* )esi6!< "ubs#stems Concurrenc#* Allocation to processor an! tas?s* &anagement o. !ata stores*
<an!ling Clobal =esources* <an!ling boun!ar# Con!itions* "etting +ra!e-o.. priorities.
O'(ect Desi6!< O0er0ie,* Combining the three mo!els* Designing Algorithms* Design OptimiGation*
3mplementation o. Control* A!ustment o. 3nheritance* Design o. Associations* Obect =epresentation*
Ph#sical Pac?aging* an! Document Design Decision.
SECTION C
UM+< 2asics* Emergence o. /&'* A,chitect&,e* I*8,ta!ce 7 M)e2i!6* P,i!ci82es 7 M)e2i!6*
C!ce8t&a2 M)e2 7 UM+* +#pes o. Diagrams.
Use Case< Actors* /se Case Diagram* an! =elationships bet,een /se Cases.
C2asses< Class Diagram* Classes* Obects* Attributes Operations* &etho!s* 3nter.aces* Constraints*
CeneraliGation* "pecialiGation* Association* an! Aggregation.
SECTION D
A)4a!ce) St,&ct&,a2 *)e2i!6< A!0ance! classes* a!0ance! relationships* 3nter.aces t#pes an! roles
pac?ages* instances an! obect !iagrams.
Basic 'eha4i,a2 *)e2i!6< 3nteractions use casesK /se case Diagrams* 3nteraction Diagrams* Se>&e!ce
Dia6,a*s* E4e!t State Dia6,a*9 C22a',ati! Dia6,a* an! acti0it# !iagrams.
A,chitect&,a2 M)e2i!6< +erms* Concepts* e-amples* mo!eling techni6ues .or component !iagrams*
De825*e!t Dia6a,*s.
Case St&)ies< +i',a,5 A882icati!s9
Rec**e!)e) B=s<
1. 2OOC<* PObect Oriente! Anal#sis an! DesignQ* A!!ison ;esle#
2. Pierre-Alain &uller* P3nstant /&'Q* "hro.. Publishers* 2000
3. 2ooch* =umbaugh* 9acobson* P+he /ni.ie! &o!eling 'anguage /ser Cui!eQ* A!!ison ;esle#*
1999
$. 2ooch* =umbaugh* 9acobson* P+he /ni.ie! &o!eling 'anguage =e.erence &anualQ* A!!ison
;esle#* 1999
5. =ebecca ;ir.s-2roc?* PDesign Obect Oriente! "o.t,areQ* P<3
). =ambough* PObect Oriente! &o!eling an! DesignQ* Pearson E!ucation* 2002
A. 2ern! Oestereich* PDe0eloping "o.t,are ;ith /&'Q* Pearson E!ucation.
Page *. o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
MBA -0"" %OUNDATIONS O% INTERNATIONA+ BUSINESS
+ T P CR
" 1 0 ".-
/n!erstan! the nature an! language o. 3nternational business 4 international tra!e* Origin o. 3nternational
tra!e. 3nternational economic en0ironment* 3nternational Culture an! its impact on global tra!e*
&anaging Di0ersities. Anal#Ging ;orl! Con!itions an! their impact on 3nternational tra!e* Clobal
perspecti0e on ,orl! e0ents an! contemporar# issues. 2alance o. Pa#ments % 8oreign E-change
&anagement
Rec**e!)e) B=s<
1. 3nternational 2usiness L A "trategic &anagement Approach b# Alan > =ugman* =.&. <o!getts*
&cCra, <ill.
2. "imai* &ihal#* +he 8uture o. Clobal Co0ernance* ;ashington* D.C.* /nite! "tates 3nstitute o. Peace
Process* 199$.
Page )" o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
ECE $0" ;IRE+ESS C MOBI+E COMMUNICATION

L P CR
3 $ 0 3%5
SECTION A
I!t,)&cti!< <istor# o. ,ireless communication. 8uture tren!s in cellular ra!io an! personal
communications. "econ! generation 12C5 cellular net,or?s* e0olution to 2.5C ,ireless net,or?s
1<"C"D* CP=" an! EDCE .or 2.5C C"& an! 3"-13)* 3"-952 .or 2.5C CD&A5. 3g ;ireless >et,or?s7
3C ;-CD&A 1/&+"5* 3C CD&A 2000* 3C +D-"CD&A. ;ireless local loop 1;''5 an! '&D"*
;'A>s* 2luetooth an! PA>s.
SECTION B
Ce22&2a, C!ce8ts< 3ntro!uction* .re6uenc# reuse* channel alignment strategies* han! o.. strategies*
inter.erence an! s#stem capacit#* +run?ing an! gra!e o. ser0ice* impro0ing co0erage an! capacit# in
cellular s#stems using cell splitting* sectoring* cellular s#stem !esign consi!erations.
M'i2e Ra)i P,8a6ati!< 'arge scale path loss7 3ntro!uction to ra!io ,a0e propagation* 8ree space
propagation mo!el* +hree basic propagation mechanism* re.lection* groun! re.lection 1t,o-ra#5 mo!el.
Di..raction* scattering* sha!o, .a!ing* combine! path loss an! sha!o,ing.
SECTION C
S*a22 Sca2e %a)i!6 A!) M&ti8ath7 3ntro!uction* small scale multipath propagation* 3mpulse response
o. a multipath channel. 8actors in.luencing small scale .a!ing* parameters o. mobile multipath channels
1time !ispersion* coherence ban!,i!th* !oppler sprea! an! coherence time5. +#pes o. smaal scale .a!ing*
=a#leigh* =ician an! >a?agami .a!ing !istributions.
M&2ti82e Access Tech!i>&es< 3ntro!uction* 8D&A* +D&A* ""&A* CD&A* "D&A* pure A'O<A %
slotte! A'O<A.
SECTION D
8unctional bloc? !iagram o. mo!ulation an! !emo!ulation .or C"&.
S8,ea) S8ect,&* M)&2ati! Tech!i>&es< Pseu!o- noise 1P>5 se6uences* D"-""* 8<-"". 2loc?
!iagram o. 3"-95 .or,ar! lin?* bloc? !iagram o. 3"-95 re0erse lin?. 8unctional bloc? !iagram o.
mo!ulator % !emo!ulator .or C"&.
;i,e2ess Si6!a2 Detecti! a!) Esti*ati!7 Di0ersit# +echni6ues* Combiner anal#sis* Detection an!
estimation algorithms.
Current an! upcoming ;ireless "#stems7 3C* $C* (02.11a4b4g* (02.1)* A!hoc net,or?s.
M&2ti82e Access Tech!i>&es< 3ntro!uction* 8D&A* +D&A* ""&A*8<&A* CD&A* <#bri! sprea!
spectrum techni6ues* "D&A* pac?et ra!io protocols- pure A'O<A % slotte! A'O<A* C"&A.
Rec**e!)e) B=s <
1. ;ireless Communications- An!rea Col!smith* Cambri!ge /ni0ersit# Press.
2. ;ireless Communications7 Principles % Practice L +heo!ore ". =appaport* Pearson
E!ucation.
3. Digital Communications- 9ohn C. Proa?is* &cgra, <ill
Page )# o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
ECE $0/ NANO E+ECTRONICS

L P CR
3 $ 0 3%5

SECTION#A
I!t,)&cti!< 3ntro!uction to >ano-scale "cience an! >ano-scale +echnolog#. ;h# nano
science an! nano technolog#V 'ength* energ#* an! time scales. >ano structure t#pes an!
properties* electronic an! optical properties o. materials* sensors.
@uantum ,ires an! !ots* single electron e..ects an! single electron transistors* coulomb
bloc?a!e e..ects in ultra small metallic tunnel unctions* @uantum con.inement o. electrons in
semicon!uctor nanostructures7 t,o !imensional con.inement16uantum ,ells5* 2an! gap
engineering* Epita-#.
SECTION#B
%a',icati!< >anomagnets an! spintronics* non-i!eal inter.aces an! !e.ects* nano
.abrication1 'ithograph#* "el. assembl#* Contact imprinting5* molecular electronics* Organic
Electronics1 Carbon 8ullerness an! nanotubes* pol#mers5 .
Bi E2ect,!ics< 3ntro!uction* 2in!ing o. Organic semicon!uctors* D>A computing.
SECTION#C
Na!#Pht!ics< Emitters* ;a0e Cui!es* Detectors* Photonic Cr#stals.
S&,7ace A!a25tica2 I!s,&*e!tati! Tech!i>&es %, Na!tech!265< Atomic scale
characteriGation techni6ues7 scanning tunneling microscop#* atomic .orce microscop#. 'o,
Energ# Electron Di..raction 1'EED5* "canning Probe &icroscop#* /H Photo electron
spectroscop# 1/P"5.
SECTION#D
Me*s A!) Ne*s< &icroElectro mechanical s#stems 1&E&"5 an! >ano electro mechanical
s#stems1>E&"5* siGe !epen!ent electronic* magnetic an! optical beha0ior o. nano materials .
A882icati!< 3ntro!uction to 6uantum metho!s o. in.ormation processing* >ano Particles an!
En0ironmental <aGar!ness * 3n!ustrial applications o. >ano "iGe! materials.
Rec**e!)e) B=s <
1. +ransport in >anostructures- Da0i! 8err#* Cambri!ge /ni0ersit# Press*2000
2. 3ntro!uction to &esoscopic Ph#sics -M.3mr#* O-.or! /ni0ersit# Press*199A
3. Electron +ransport in &esoscopic "#stems *".Datta* Cambri!ge /ni0ersit# Press*1995
$. "ingle Charge +unneling* <.Crabert an! &.De0oret* Plenum Press*1992
5. <an!boo? o. &icrolithograph#* &icromachining an! &icro.abrication -P.=ai Chou!har#*
"P3E*199A
Page )! o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
ECE $00 BIOMEDICA+ INSTRUMENTATION

L P CR
3 $ 0 3%5
SECTION#A
HUMAN BODY SUBSYSTEMS: 2rie. !escription o. neuronal* &uscular* Car!io0ascular an!
respirator# s#stemsK their electrical* &echanical an! chemical acti0ities.
TRANSDUCERS AND ELECTRODES: Principles an! classi.ication o. trans!ucers .or bio-me!ical
applicationsK Electro!e theor#* Di..erent t#pes o. electro!esK "election criteria .or trans!ucers an!
electro!es.
CARDIOVASCULAR SYSTEM MEASUREMENTS: &easurement o. bloo! pressure* 2loo! .lo,*
&easurement o. p< 0alue o. bloo!* Car!iac rate* <eart soun!sK Electrocar!iograph* Pleth#smograph.
SECTION#B
RESPIRATORY SYSTEM MEASUREMENTS: &easurement o. gas 0olume* 8lo, rate* Carbon-!io-i!e
an! o-#gen concentration in e-hale! air.
MEASUREMENT OF ELECTRICAL ACTIVITY IN NEUROMUSCULAR SYSTEM AND BRAIN*
>euron potential* &uscle potential* Electrom#ograph* 2rain potentials* Electroencephalograph.
SECTION#C
MEDICAL IMAGING: Diagnostic D-ra#s* CA+* &=3* /ltrasonograph#* &e!ical use o. isotopes*
En!oscop#.
PATIENT CARE MONITORING AND SAFETY MEASURES: Elements o. intensi0e care monitoringK
2asic hospital s#stems an! componentsK Ph#siological e..ect o. electric currents* "hoc? haGar!s .rom
electrical e6uipment* "a.et# measures.
SECTION#D
ASSISTING AND THERAPEUTIC DEVICES: 3ntro!uction to car!iac pacema?ers* De.ibrillators*
Hentilators* Diatherm#.
BIO!TELEMETRY AND LASERS: Ph#siological parameters a!aptable to 2io-telemetr#* components o.
a bio telemetr# s#stem* Application o. telemetr# in patient care* Application o. lasers to biome!ical
sciences.
Rec**e!)e) B=s <
1. '. 2iome!ical 3nstrumentation an! &easurement -Chrom,ell* 8.9.;eibell* E.A.P.ei..er Prentice
<all o. 3n!ia* >e, Delhi.
2. 3ntro!uction to biome!ical E6uipment technolog#- Carr 99 an! 2ro,n 9&* Pearson Publishers*
Delhi.
3. &e!ical 3nstrumentation applications an! !esign -9.C ;ebster* 9ohn ;ile# "ons* >e, Mor?.
$. <an!boo? o. 2iome!ical 3nstrumentation- =." Fhan!pur* +ata &c Cra, <ill* >e, Delhi
5. Principles o. applie! 2iome!ical 3nstrumentation -'.C.Ce!!es* '.E. 2a?er* 9ohn ;ile# "ons*
>e, Mor?.
Page )' o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
ECE $01 OPTICA+ NET;ORJS

L P CR
3 $ 0 3%5

SECTION A
Ceneration o. +ransport net,or?s* ;D&* +D&* ,ireless optical s#stems* ?e# optical no!es* e0olution o.
optical s#stems* ?e# attributes o. optical .iber. +elecommunication 3n.rastructure* !igital multiple-ing
techni6ues* !igital signaling hierarch#* +1* D"1* +3 or D"3* la#ere! protocol mo!el. +iming %
"#nchroniGation in !igital net,or?s* +iming error* cloc?ing signal* +iming t#pes* 0ariation* cloc?
e-change metho!s* "O>E+ an! D"1 timing* Do,nstream !e0ices timing* 23+"* ""&s.
SECTION B
"O>E+ % "D< e0olution* multiple-ing structure* .rame structure* en0elopes* .unctional components*
problem !etection* pa#loa!* pointers* H+s o0erhea! b#tes* "O>E+ % "D< concatenation. Architecture
o. optical transport net,or?s* Digital ,rappers* O4O4O* hierarch#* O+> la#er mo!els. ;D& D;D&*
operation* its components.
SECTION C
>et,or? topologies* protection schemes* robustness* !i0ersit#* 17> protection* optical channel* t#pes
2'"=* passi0e optical net,or?s an! &etro. &P'" an! optical net,or?s* 'abel s,itching* 'amba
s,itching* tra..ic engineering* 'in? management protocol 1'&P5* 'in? up* '&P messages* connecti0it#*
8ault management. Optical =outers s,itching* pre.erences* O"P* '"P* loa! increasing* technologies*
&E&"* +hermo* bubble* Cranularit# o. 'abels.
SECTION D
ATM 4s. IP i! 8tica2 i!te,!ets< 3P o0er A+& % "O>E+* O"3 internet la#ere! mo!el* Encapsulation %
its metho!s* PPP pac?et* A+& 0s. 3P !ebate* Optical 3nternets E0olution to 3C architecture* &igration to
3P net,or?ing* 3P subnets* non-optical no!es* routing tables* stac? alternati0es* !igital ,rapper*
internet,or?ing* internet ser0ice pro0i!ers.
Rec**e!)e) B=s<
1. Optical >et,or?s-+hir! Ceneration +ransport "#stems L /#less 2lac?* Pearson E!ucation.
2. Optical >et,or? Design an! 3mplementation - Hi0e? Al,a#n* Pearson E!ucation
3. /n!erstan!ing "O>E+4"D< an! A+&-communications net,or?s .or the ne-t millennium b#
"tamatious H. Fartalopoulos* Prentice - <all 3n!ia.
Page )+ o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
MBA -01" %OUNDATIONS O% %INANCE
L P CR
3 $ 0 3%5
An O0er0ie, o. 8inancial &anagement7 "harehol!er ;ealth &a-imiGation* Haluation &o!els*
Agenc# =elationships. =is? an! =eturn7 3n0estment =eturn* "tan!-alone ris? an! Port.olio ris?* 2ata
Coe..icient an! CAP&. 2on! Haluation7 2on! characteristics* Haluation. "toc? Haluation7 +#pes o.
Common "toc?* Common "toc? Haluation &o!els.
Rec**e!)e) B=s<
1. 9.9. <amton* 8inancial Decision &a?ing7 Concepts* Problems an! Cases* Prentice-<all o. 3n!ia* >e, Delhi* $
th
E!ition.
2. Fhan an! 9ain* 8inancial &anagement* +ata &cCra,-<ill Publishing Co. 't!.* >e, Delhi* $
th
E!ition.
3. "tephan A. =oss* =an!olph ;. ;ater.iel! an! 9e..er# 9a..e* Corporate 8inance* +ata &cCra,-<ill Publishing
Co. 't!.* >e, Delhi* A
th
E!ition.
Page ), o( )* Batch& !"#! (CE
Punjabi University, Patiala Four Year B.Tech( Computer Engg Batch !"#!
B$%& !"#'
B. TECH %OURTH YEAR
COMPUTER ENGINEERING
(Batch 2012)
Sessi! (201-#1.)
SCHEME O% PAPERS
EIGHTH SEMESTER (COMPUTER ENGINEERING)
C)e Tit2e 7 Pa8e, Tta2 C,e)its
P=9-$51 Proect "emester
1One "emester +raining in 3n!ustr#5
20
B,ea=&8 7 Ma,=s<
I!)&st,ia2 Hisit '5 %ac&2t5 C,)i!at, (1-0 Ma,=s)
1;ithin 10X12 ,ee?s o. commencement o. +raining5
Presentation 7 )0 &ar?s
Hi0a Hoce 7 )0 &ar?s
=eport 1<ar! Cop#5 7 30 &ar?s
E0aluation b# 8acult# Coor!inator is consolation ,ith 3n!ustrial Coor!inator !uring in!ustrial 0isit.
E4a2&ati! '5 a Tea* 7 %ac&2t5 Me*'e,s i! the I!stit&te (2-0 Ma,=s)
1;ithin One ;ee? o. completion o. +raining5
Presentation 7 100 &ar?s
Hi0a Hoce 7 100 &ar?s
=eport 1<ar! Cop#5 7 50 &ar?s
+he 8inal Presentation an! 0i0a L 0oce ,ill be con!ucte! ointl# b# the .acult# coor!inator* e-ternal
e-aminer an! nominee o. the <ea! to be appointe! b# the <ea! o. the Department.
+he 'etter gra!e ,ill be a,ar!e! to the stu!ents accor!ing to mar?s obtaine! b# him4her out o. total $00
mar?s.
Page )* o( )* Batch& !"#! (CE