gyan vihar syllabus - Latest

estrapadesherbetΛογισμικό & κατασκευή λογ/κού

18 Νοε 2013 (πριν από 4 χρόνια και 11 μήνες)

858 εμφανίσεις


3
BT
CS1:

MATHEMATICS

-

III



Class B.Tech. III Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials : 1

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




U
nit

Contents of the subject

No. of hour
required

I



Linear Programming
: Mathematical Formulation of Linear
Programming problem. Graphical method of solving Linear
Programming problem



Simplex method for solving Linear Programming problem



Duality in Linear P
rogramming problem.


7

II



Project Scheduling
: Project Scheduling by PERT and CPM
Network Analysis.



Sequencing Theory: General Sequencing problem



N
-
jobs through 2 machines & 3 machines and 2
-
jobs through
m machine.


7

III


Transportation
Problem




Find

the initial solution using North West Co
r
ner rule, Least
Cost

Method.



Find optimal solution using Stepping Stone method, Modified

Distribution Method.



Solve unbalanced transportation problem using fictitious
origins or

destination.


Assignment proble
m
-



Solving Assignment problem using Hungarian Method

7

IV


Transform Calculus



Laplace transform with its simple




properties



Applications to the solution of ordinary and partial differential
equation having constant coefficients with special

reference
to the wave and diffusion equation


8

V


Numerical Methods
:
-

Finite differences and Interpolation ,



Numerical differentiation and Integration .Solution of


Algebraic and transce
du
al equations by Graphical method,


Bis
ection method ,Regular Falsi method and Newton’s


Raphson method .Numerical solution of ordinary differential


equations

8


Recommended Books:


1.

Advanced Mathematics for Engineers by Chandrika Prasad

2.

Hig
h
er Engineering Mathematics by B.S. Grew
al

3.

Hig
h
er Engineering Mathematics by Y.N. Gaur and C.L. Koul

4.

Hig
h
er Engineering Mathematics by K.C. Jain and M.L.
R
awat




3
BT
CS2
: DATA

STRUCTURES AND ALGORITHMS




Class B.Tech. III Sem.

Evaluation

Schedule Per Week


Lectures : 3



Tutorials : 1

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



䑡瑡 S瑲畣瑵牥㨠䑥Diniti潮, 䥭灬em敮瑡tio測nOp敲慴i潮, Ap灬ic慴a潮,
A
lg潲楴桭 wri瑩湧 a湤 c潮v敮瑩潮⸠An慬ysis 潦 慬g潲楴hmⰠ䍯m灬數ity
䵥慳畲敳⁡湤⁎潴otio湳



Arrays㨠 剥灲敳e湴ntio渠 潦 慲aays (m畬瑩摩m敮sio湡l), Ad摲敳s
c慬c畬a瑩o渠nsi湧⁣ol畭渠n湤⁲ow慪潲o摥rin朮



䱩湫敤 Lis瑳 : 䥭灬敭敮瑡ti潮Ⱐ䑯D扬y li湫敤 lis琬 Circ
畬慲ali湫敤 lis琬
畮r潬le搠 li湫敤 lis琬t skip
-
lis瑳Ⱐ S灬ic敳Ⱐ S敮ti湥l 湯摥sⰠ A灰lic慴i潮
(S灡rs攠e慴物ⰠAss潣i慴ive⁁rray,⁆畮 ti潮慬 Pr潧r慭mi湧)


8

II



S瑡tks : 䑥Di湩瑩潮Ⱐ 䥭灬敭敮瑡ti潮Ⱐ A灰lic慴i潮 (T潷敲o 潦 䡡湯i,
F畮c瑩o渠 䍡ll 慮搠 r整畲測 P慲敮瑨ts
敳 M慴a桩湧Ⱐ B慣k
-
瑲慣ki湧Ⱐ
E灲敳si潮 Eval畡tio温



Q略略s 㨠D敦i湩tio測nd敱ueⰠ敮q略Ⱐ灲楯rity 煵e略Ⱐ扯畮摥搠q略u攬e
䥭灬em敮瑡tio測nA灰lica瑩on


7

III



Tr敥㨠䑥Di湩瑩o渠潦 敬敭敮tsⰠBi湡ry
trees:
Types (Full, Complete,
Almost complete), Binary Search Tree
, Traversal (Pre, In, Post &
Level order)



Pr畮i湧Ⱐ Gr慦瑩湧⸠ A灰licati潮㨠 Ari瑨t整ec E灲敳si潮s Ev慬畡ti潮
V慲a慴a潮s㨠䥮摥敤⁂i湡ry Tr敥



T桲敡摥搠Bi湡ry Tr敥ⰠAV䰠瑲敥Ⱐ䵵l瑩
-
睡y 瑲e敳ⰠB 瑲敥ⰠB+ 瑲敥,
F潲敳琬⁔ri攠e湤 䑩c瑩潮慲y


7

IV



Gr慰桳㨠 El敭敮t
慲y d敦i湩瑩潮Ⱐ 剥灲敳敮瑡瑩o渠 (A摪ac敮cy 䵡瑲i,
A摪慣敮cy⁌is瑳)



Tr慶敲e慬 (BFSⰠ䑆S)A灰lic慴a潮㨠Sp慮ni湧 Tr敥 (Prim 慮搠Kr畳k慬
Alg潲楴桭)



䑩jkstr愧a⁡ 杯ri瑨tⰠ,桯r瑥t琠t慴栠hl杯ri瑨ts.


6

V



S潲瑩湧㨠Bu扢l攬eSel散瑩潮Ⱐ䥮I敲瑩o測nQuickⰠ剡,i



䵥r来Ⱐ
B畣k整e 䡥慰Ⱐ Se慲a桩湧㨠 䡡H桩湧Ⱐ Sym扯l T慢l攬e Bi湡ry
S敡rc栬hSim灬攠S瑲i湧 S敡rc桩湧


6



Recommended
Books:


1.

Aho A.V.
, J.E.Hopcroft
.
J.D.Ulman: Data

Structures and Algorithms
, Addison

Wesley.

2.

Brastrad: Algorithms
, PHI.

3.

Horowitz and
Sawhni: Algorithms

D
esign and Analysis
, CS

Press.

4.

Kruse
R.L.: Data

structure and Program Design.PHI.

5.

Horwitz and
Sawhni: Data

structures in PASCAL, BPB.

6.

Tanenbaum : Data structures in C,PHI

7.

Trembley & Sorenson :An Introduction to Data Structures, Mc
-
Graw Hill International

8.

Ba
ase: Computer

Algorithms, Pearson Education.



3
BT
CS3
: SWITCHING

THEORY AND LOGIC DESIGN



Class B.Tech. III Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum
Marks = 100

[
Internal

(30) &
Semester End Exam
(70)



.

Unit

Contents of the subject

No. of
hour
required

I



乵N扥r sys瑥tsⰠ䍯摩n朠Sc桥m敳㨠B䍄ⰠEc敳s
-
㌬3GreyⰠr❳ 慮d

-
l)’s complement. Boolean Algebra, Fundamental theorems,
pim灬ific慴a潮s ⁂o潬
敡渠數灲敳si潮s



䱯gic 条瑥t a湤 t桥ir 瑲u瑨 瑡tl攮eG慴攠im灬敭敮瑡tio渠慮搠Tr畴u
瑡tl攠ef⁂o潬敡n⁦畮c瑩潮s.


8

II



S瑡t摡r搠 f潲os of B潯le慮 f畮c瑩o湳⸠ Mi湴敲e a湤 M慸瑥牭
摥sig湡ti潮 潦 f畮c瑩潮s⸠ Sim灬ific慴a潮 潦 f畮c瑩潮s 潮 K慲a慵gh
m慰s



䥮I潭灬整ely

s灥cifie搠 f畮c瑩o湳⸠ 䍵Cic慬 re灲ps敮瑡ti潮 潦
B潯le慮⁦畮c瑩潮s⁡ 搠d整ermi湡瑩o渠nf⁰物m攠em灬ic慮ts



S敬散瑩o渠 潦 慮 潰tim慬 s整e 潦 灲業攠 im灬ic慮瑳⸠ M畬ti灬攠 潵t灵t
circ畩瑳⁡ 搠d慰 mi湩miz慴a潮 畬瑩灬攠e畴uu琠tirc畩ts



T慢畬慲⁤a瑥牭i湡瑩o渠nf畬t
i灬攠e畴uu琠trim攠em灬ica湴n.


7

III



䍯C扩湡瑩潮al⁣irc畩瑳


Ad摥rⰠI畢瑲慣t潲Ⱐ敮oo摥rⰠIo摥r



䵵ltipl數敲⸠e敳ig渠nf⁃潭扩n慴a潮al⁣irc畩琠tsi湧 䵵l瑩灬數敲e.


7

IV



䵵ltipl數敲e 䑥Di杮 潦 䍯C扩n慴a潮al circui琠畳in朠䵵l瑩灬數敲e⸠Flip
Fl潰s㨠RSⰠJ
-
KⰠD
ⰠT⸠S敱略湴ial circ畩瑳⸠Cl潣kⰠ灵ls攠慮搠l敶敬
m潤攠e敱略湴ial⁣irc畩瑳 An慬ysis⁡ 搠d敳i杮 潦⁳敱略湴nal⁣ircui瑳



Syn瑨tsis 潦 s瑡te di慧ramsⰠFi湩瑥 mem潲y circui瑳Ⱐ敱畩val敮ce
r敬慴i潮s 敱uiv慬敮琠t瑡瑥t 慮搠dircui瑳



䑥瑥rmi湡瑩o渠 潦 cl慳ses 潦 i湤is
ti湧畩s桡扬攠 s瑡t敳 慮搠
sim灬ific慴a潮 by im灬ic慮瑳 瑡tl敳⸠.e慬y 慮搠䵯潲攠e慣桩n敳



S瑡t攠 慳si杮m敮琠 慮d mem潲y 敬敭敮琠 i湰畴u 敱畡瑩潮s,
P慲瑩瑩o湩湧⁡湤⁳瑡瑥t慳sig湭敮琮


6

V



Swi瑣hin朠䑥vic敳⸠P潳itive 慮d 乥条tiv攠l潧ic 潦 O刬RA乄Ⱐ乏刬R
乁乄ⰠNO删慮
搠d乏删条瑥t



䱯gic F慭ily㨠剔䰬L䑔䰬LD䍔䰬LTT䰬L剃T䰬LE䍌C 䡔䰬L䵏S 慮搠
䍍CS lo杩c circ畩琮t S灥敤 慮搠摥lay i渠lo杩c circ畩tsⰠi湴n杲慴敤
circ畩琠t潧ic⁡ d is攠emm畮ity


6



Recommended
Books:


1.

Sandiege: Modern

Digital Design, McGraw Hill.

2.

Moris Mano :D
igital Design, PHI

3.

H, Taub, D.Schilling :Digital Integrated Electronics, McGraw Hill

4.

Hill & Peterson :Switching Theory and Logic Design, John Wiley

5.

Parag K.
Lala: Practical

Digital Logic Design & Testing Prentice Hall of India.



3
BT
CS4
: ELECTRONIC

DEVICES

& CIRCUITS



Class B.Tech. III Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials : 1

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of
the subject

No. of hour
required

I



䑩潤攠eirc畩瑳㨠䑩潤攠慳⁡ circ畩琮tEl敭敮琬o慤 lin攠eo湣数t



䍬i灰i湧 &⁣l慭灩湧⁣irc畩瑳Ⱐ,ol瑡来s畬瑩pli敲e.


8

II



䑥Dic敳㨠c潮s瑲畣瑩o測nc桡r慣瑥物s瑩cs 慮搠w潲oi湧 灲p湣i灬敳 潦
瑨t f潬lo睩湧 摥vic敳⸠Diod敳 BJT
ⰠJFETⰠ䵏SFETⰠ啊TⰠ灨潴o
摩o摥sⰠ,E䑳Ⱐ,桯t漠or慮sis瑯牳



⸠.ol慲⁣ells⸠.桥rmis瑯爬⁌䑒


7

III



Tr慮sis瑯牳㨠 瑲慮sis瑯爠 c桡r慣瑥物s瑩csⰠ c畲u敮琠 com灯湥湴n,
c畲u敮琠条i湳⸠Al灨愠慮搠vi瑡t潰敲e瑩n朠灯i湴n Hig栠扲b摥 m潤敬,
h
-

灡r慭整er⁥ uiv慬敮琠tirc畩瑳



䍅ⰠCB

慮d 䍣 c潮fig畲慴u潮 䑣
慮d 慣 a湡lysis 潦 䍅Ⱐ䍃 慮d


慭灬ifi敲e



Ev敲e
-

m潬l m潤敬⸠ Biasi湧 a湤 s瑡扩liz慴io渠 瑥c桮iq略s.
T桥rm慬 r畮 a睡y, 瑨敲e慬 s瑡扩lity. E煵ivale湴n circ畩瑳 慮d
扬敳sin朠gf⁊FETs⁡ 搠dOSFETs



䱯w fr敱略湣y CS 慮搠CD

JFET amp
lifi敲e⸠FET 慳 愠vol瑡来
v慲a慢l攠牥eis瑯爮


7

IV



Sm慬l si杮al 慭灬ifi敲e 慴alow fr敱略湣y㨠a湡lysis 潦 BJT 慮搠
FETⰠ,c⁡ 搠牣⁣潵ple搠dm灬ifi敲e⁆ 敱略湣y⁥ p潮se



䵩d扡n搠条i測n条i湳 a琠lo眠慮搠hig栠fr敱略湣y. A湡lysis 潦 摣
慮搠摩ff敲敮瑩al⁡ 灬ifi敲e,

Millers’ theorem



䍡Cc慤in朠 瑲a湳is瑯爠 慭灬ifi敲eⰠ D慲汩湧t潮 a湤 c慳c慤敤
circ畩瑳⸠.mi瑴tr⁡ 搠d潵rce⁦潬lo睥ws.


6

V



Oscill慴潲o㨠 c潮c数t 潦 f敥摢慣k cl慳sific慴a潮Ⱐ cri瑥物潮 f潲o
潳cill慴a潮⸠.畮e搠d潬l散瑯爬⁈慲瑬ey⁃潬灩t瑳




-

灨慳攠 s桩f琬t W敩渠 扲
i摧攠 a湤 crys瑡l 潳cill慴潲oⰠ 慳瑡tl攬
m潮潳瑡tl攠e湤 扩s瑡扬e畬tivi扲慴潲o⸠.c桭i瑴⁴rig来r


6





Recommended
Books:


1.

J.Millman & C.C. Halkias :Integrated Electronics, McGraw Hill

2.

Millman
Grabel: Microelectronics
, McGraw Hill.









3
BTCS
5
: PRINCIPL
ES

OF PROGRAMMING LANGUAGE



Class B.Tech. III Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Uni
t

Contents of the subject

No. of hour
required

I



Programming Language: Definition, History, Features. Issue in
Language Design: Structure and Operation of computer



Language Paradigms. Efficiency, Regularity. Issues in
Language Translation: Syntax, Semanti
cs, Stages analysis and
synthesis, Parse Tree, CFG and BNF grammar.


8

II



Specification and Implementation of Elementary and Structured
Data Types



Type equivalence, checking and conversion. Array, List,
Structure, Union.


7

III



Sequence control with Expr
essions, Conditional Statements,
Loops, Exception handling



Subprogram definition and activation, simple and recursive
subprogram



Subprogram environment. Parameter passing mechanism.


7

IV



Abstract Data type, information hiding, encapsulation, type
definit
ion.



Static and Stack
-
Based Storage management



Fixed and Variable size heap storage management. Garbage
Collection


6

V



Parallel Programming: Introduction, parallel processing and
programming language



Threads, semaphore, monitor, message passing.


6





Recommended
Books:


1.

V.Rajaraman :Fundamentals of Computers

2.

Ghezzi: Programming

Language
Concepts, Addison

Wesley.

3.

Kernighan, Ritchie

:Programming in C

4.

Structure

:Programming in C++

5.

Pratt :Programming Languages

6.

Ravi Shetty:Programming Language






3
BTCS
6.
1

E
-
COMMERCE


Class B.Tech. III Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)



Unit

Contents of th
e subject

No. of hour
required

I



B畳in敳s S瑲慴agy i渠 慮 El散瑲o湩c A来㨠 V慬u攠 䍨慩n
-
s異灬y
c桡i湳Ⱐ Pr潴or❳ v慬略 ch慩測n m潤敬 慮搠 䥮I敲
-
Or条湩z慴io湡l
val略⁣h慩湳⸠䍯.灥瑩tiv攠Adv慮t慧e
-
䍯C灥瑩瑩v攠e瑲慴agy



Pr潴or❳ 䵯d敬Ⱐ Firs琠 䵯v敲e a摶慮瑡来 a湤 co
m灥瑩瑩ve
慤v慮t慧攠畳in朠g
-
c潭m敲c攠e畳i湥ss⁳瑲慴agy



䥮Ir潤畣ti潮 瑯t B畳i湥ss S瑲慴agyⰠ S瑲慴a杩c 䥭灬ic慴i潮s 潦 䥔I
瑥t桮ol潧y e
-
c潭merc攠em灬敭敮瑡ti潮 慮d⁥v慬畡tion


8

II



B畳in敳s 瑯t B畳in敳s El散瑲潮ic C潭m敲c攺e 䥮I敲
-
潲条oiz慴a潮al⁔r慮s慣瑩潮sⰠ



T桥⁣r敤i琠tr慮s慣瑩潮⁔r慤攠eycl攮e



A v慲i整y 潦 瑲慮s慣瑩潮sⰠ El散瑲o湩c m慲k整e
-
m慲k整e 慮搠
敬散瑲潮ic m慲k整e, 畳慧攠 潦 敬散瑲潮ic m慲k整eⰠ A摶a湴n来s
慮搠摩s慤va湴n来s ⁥ 散瑲潮ic慲k整e


.7

III



El散瑲o湩c 䑡瑡t 䥮瑥牣桡n来 (E䑉D㨠 D敦i湩瑩o渠 慮搠 be
湥fi瑳 潦
E䑉⸠



E䑉D 瑥t桮潬潧yⰠ s瑡td慲asⰠ comm畮ic慴a潮sⰠ im灬em敮瑡ti潮,
慧r敥m敮瑳⁡ 搠d散畲i瑩敳.



E䑉⁴牡摩湧⁰慴a敲湳⁡ d⁴牡湳慣瑩o湳.


7

IV



B畩ldin朠慮 E
-
䍯Cm敲e攠Sit攺e䥮瑲潤畣ti潮 瑯to扪散琠扥桡vi潲,
com灯湥湴nⰠ慣瑩v攠ecri灴in朮g



O扪散琠m潤敬s,

䥮Ir慳瑲畣瑵牥t潢j散瑳Ⱐs敲eic攠o扪散琠慮搠摡ta
潢j散瑳Ⱐ,桯潳i湧⁴桥扪散瑳⸠



B畩ldin朠愠sc慬慢l攠a灰lica瑩潮ⰠA摤i瑩o渠瑨攠c潮fi杵re m整e潤,
c潮湥c瑩湧 t漠 t桥 d慴a扡s攬e Acc敳si湧 慮d v敲eio湩n朠 瑨e
摡瑡扡s攮e



B畩ldin朠 瑨t c慴al潧 o扪散琠 睩瑨t 數慭灬攮e C
r敡ti湧 s桯灰ing
扡sk整
-
䡯H摩湧 s瑡t攬ecr敡ti湧 瑨攠瑡扬敳 f潲o愠s桯p灩n朠扡sk整e
m潤ifyin朠gh攠e扪散琠t潤敬 慮搠d慫i湧⁴ 攠e慳k整e慣c敳si扬e


6

V



J㉅E Arc桩瑥tt畲攠 Ov敲eiew㨠 E湴nr灲is攠 com灯湥湴nⰠ
䥮I潲m慴a潮⁴散桮ol潧y i渠n桥⁥湴nr灲楳敳Ⱐ



䥮Ir潤畣ti潮
瑯t 敮t敲灲ise 潢j散瑳 慮d 敮t敲灲is攠 c潭灯湥湴
m潤敬⸠



T桥 J㉅E m潤敬 f敡瑵r敳Ⱐ J㉅E c潭灯湥湴n
-
c潮瑡t湥r
慲a桩瑥t瑵牥⸠.湴nr灲is敳⁊慶愠慮搠d2EE⁡牣桩瑥t瑵牥t


6


Recommended
Books:


1.

David Whiteley
-

E
-
Commerce
Strategy, Technology

and Application, Tata
McGraw Hill.

2.

Mathew Reynolds
-

Beginning E
-
commerce with Visual Basic ASP, SQL Server 7.0 and MTS, Shroff
Publishers & Distributors Pvt. Ltd.

3.

Perrone & Chaganti
-

Building Java Enterprises System with J2EE, Techmedia.

4.

Kalakota
-

Frontiers of Electronic Com
merce, Pearson Education.


3BTCS6.2 MEDICAL

ELECTRONICS



Class B.Tech. III Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



Introduction of Human Physiology:

Nerve physiology.
Functions of nerves and myoneural junctions
. Membranae
and action potential of nerves.



Function of skeletal and smooth muscl
e and its rhythmic
contraction, cardiac muscle.



Blood flow system, Arterial pressure Mechanism of respiration.



CNS function of spinal cord and cord reflexes. Myo
-
electrical
control of paralyzed muscles.


8

II



ECG, EMG and EEG:

Principle & Means of recor
ding non
-
electrical biological parameters.



Signals from micro
-
electrodes and slat bridge Use of field
electric devices as electrometers,driven shield,photon coupled
amplifier. Artifacts


7

III



Measurement of biological events :

Electronic methods of
meas
uring blood pressure, skin & systemic body temperature



Pulse rate and coronary care monitoring.


7

IV



Biomedical Instruments:

Electronic pace makers. Implantable
power source.



Defibrillators. Micro power transmitter for telemeter binominals.
Special char
acteristics of CRO in bio
-
medical applications
Surgical and therapeutic diathermy units.



Physiological simulators. Basic diagnostic X
-
ray units.
Introduction to patient monitoring and intensive care unit.



Interference and patient safety. Anaesthetic expl
osion and fires.


6

V



Miscellaneous :

Introduction to heart Lung machines, CT
scanners



Ultrasound sonography and Doppler measurements, NMR &
PET Scans. Use of lasers in medical applications.


6


Recommended
Books:


1.

Webster
, J.G.: Medical

Instrumentation
, Application and Design, John Willey and Sons.

2.

Jacobson, B.Wester, J.G.
: Medical

and Clinical Engineering Prentice
Hall, International
.

3.

Cromwell: Biometical

Instrumentation and Measurements.et al. Prentice
Hall, International
.

4.

R.S.
Khandipur: Handbook

of
Biomeideal Instrumentation. Tata McGraw Hill.

5.

Carr
: Introduction

to Biomedical Equipmens
, Pearson

Education.






3
BT
CS6.3:

CIRCUIT ANALYSIS


Class B.Tech. III Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tu
torials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)


Unit

Contents of the subject

No. of hour
required

I



Computer Aided Circuit Analysis:

Introduction to circuit
simulation node
-
incidence matrix, modi
fied node
-
voltage
analysis.



Different types of analysis during simulation
-
DC, AC and
transient. Introduction to SPICE and ICAP simulation
environment.


8

II



Thevenin's Norton's Reciprocity. Superposition, Compensation,
Miller's. Tellegen's and maximum po
wer transfer theorems




Networks with dependent sources. Impulse, step, ramp and
sinusoidal response analysis of first order and second order
circuit.



Time domain and transformer domain (frequency, Laplace)
analysis. Initial and final value theorems


7

II
I



Complex periodic waves and their analysis by Fourier analysis.
Different kind of symmetry.



Power in a circuit.Conductively coupled circuits, Inductively
coupled circuits
-
mutual inductance, coefficient of coupling and
mutual inductance between portions o
f same circuit and
between parallel branches.



Transformer equivalent to inductively and conductively coupled
circuits
.


7

IV



Terminals and terminal pairs, driving point impedance transfer
functions.



Poles and zeros. Restrictions on pole
-
zero location in

s
-
plane.
Poles, zeros and frequency response: pole, zero and
impulse/step response.



Procedures of findings network functions for general two
terminal pair networks. Stability and causality Hurwitz
polynomial, positive real functions.


6

V



Two
-
port Netwo
rks: Two
-
port parameters and their
interrelations,z
-
parameters, y
-
parameters, h
-
parameters.



ABCD parameters Equivalence of two ports, transformer
equivalent, interconnection of two
-
port networks.



Image parameters. Attenuation and phase shift in symmetric
al
T & pi networks


6

Recommended Books:


1.

Kuo, Franklin
F.: Network

analysis and synthesis, II Ed., 1999,John Wiley & Sons.

2.

Desoer
, C
. and Kuh
, E.S
.:E.S. Basic Circuit
Theory, McGraw

Hill.

3.

Van Valkenburg, M.E
.:

Network Analysis Prentice
Hall, India
.

4.

Schau
m's Outline series on circuit analysis.

5.

Hayt
, W
. and
Kimmerly:

Engineering Circuit Analysis, McGraw Hill, Inc.

6.

Sudhakar.A. and Shyam Mohan
S.P.: Circuits

and Networks. Tata McGraw Hill, India.


3
BT
CS6.4:
OPTICAL COMMUNICATION



Class B.Tech. III Sem.

Evalu
ation

Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



Introdu
ction to optical communication principles of light
transmission optical fiber modes and configurations




Mode theory for circular wave
-
guides, Single
-
mode fibers,
Multimode fibers, Numerical aperture, Mode field diameter



Number, fiber materials, Fiber fabri
cation techniques.


8

II



Optical sources, LED'S, LASER diodes, Model reflection noise




Power launching and coupling, population inversion, fiber
splicing



optical connectors, Photo
-
detectors, PIN, Avalanche detector,
Response time, Avalanche multiplication

noise

7

III



Signal degradation in optical fibers, Attenuation losses, Signal
distortion in optical wave guides, Material dispersion



Wave guide dispersion, Chromatic dispersion, Inter
-
modal
distortion, Pulse broadening in Graded index fibers, Mode
coupli
ng



Advance fiber designs: dispersion shifted, Dispersion flattened,
Dispersion compensating fibers, Design opti
mization of single
mode fibers.

7

IV



Coherent optical fiber communication, Modulation techniques
for Homodyne and Heterodyne systems, Optical fi
lter link
design.



Rise time budget and link power budget, Long haul systems bit
error rate, line coding, NRZ, RZ, Block Codes eye pattern.

6

V



Advance system and techniques, wavelength division
multiplexing



optical amplifiers semiconductor amplifier, EDF
A, Comparison
between semiconductor and optical amplifier



Gain band width, Photonic switching, Optical Networks. Optical
fiber bus, Ring topology, Star architectures, FDDI, SON
-
ET.


6





Recommended
Books:


1.

Gerd Keiser
-
Optical Fiber Communications, Tata

Mc Graw Hill.

2.

J.N.Senior
-
Optical Fiber Communication
, Prentice

Hall of India.

3.

J.Gowar
-
Optical Communication Systems, Prentice Hall of India.

4.

J.Wilson & Hawkes
-
Opto Electronics
-
An
Introduction, prentice

Hall of India.






3BTCS7. DIGITAL ELECTRONICS LAB


1. Experimental study of characteristics of CMOS integrated circuits.

2. Interfacing of CMOS to TTL and CMOS.

3. Study of various combinatorial circuits based on: AND/NAND Logic blocks and OR/NOR
Logic blocks.

4. Study of following combinational circuits:
Multiplexer; Demultiplexer and Encoder. Verify
truth tables of various logic

f
unctions.

5. To study various waveforms at different points of transistor bistable multivibrators and its
frequency variation with different

p
arameters.

6. To study transistor as
table multivibrators.

7. To design a frequency driver using IC
-
555/timer.

8. To study Schmitt trigger circuit.

9. To study OP
-
AMP as Current to voltage and voltage to current converter comparator.

10. BCD to binary conversion on digital/IC trainer.

11. Stu
dy various Flip flops and construct Parallel
-
in
-
Serial
-
out register. Testing of digital IC
by automatic digital IC trainer.


















3BTCS

8. ELECTRONICS LAB


1. Study the following devices:

(a) Analog & digital millimeters

(b) Function/Signal gene
rators

(c) Regulated D.C. power supplies (constant, voltage and constant current operations).

2. Study of analog CRO measurement of time period

, amplitude, frequency and phase angle
using Lissajous figures.

3. Application of diode as clipper and clamper.

4. Plot V
-
I characteristic of zener diode & study zener diode as voltage, reverse Saturation
current and static & dynamic

resistances.

5. Plot V
-
I characteristic of zener diode & study zener diode as voltage regulator. Observe the
effect of load changes an
d

determine load limits of the voltage regulator.

6. Plot frequency response curve for audio amplifier and to determine gain bandwidth product.

7. Plot drain current
-
drain voltage and drain current
-
gate bias characteristics of field effect
transistor and m
easurement of I &

VP.

8. Plot gain: frequency characteristic of two stages RC coupled amplifier and calculate its
bandwidth and compare it with

theoretical value.

9. Plot gain: frequency characteristic of two stages RC coupled amplifier and calculate its
b
andwidth and compare it with

theoretical value.

10. Plot input and output characteristics of BJT in CB, CC and CE configurations. Find their h
-
parameters.

11. Study half wave rectifier and effect of filter network on D.C. voltage output and ripple
factor.

12. Study bridge rectifier and measure the effect of filter network on D.C. voltage output and
ripple factor.









3

BTCS

9. DATA STRUCTURE LAB


1. Program on array searching, sorting (Bubble sort, Quick sort, Marge sort etc.)

2. Program to insert eleme
nt at desire position, replacing element, deletion in array.

3. Various matrices operations.

4. Various strings programs.

5. Implementation of stack and queue using array

6. Implementation of stack and queue using link lists

7. Implementation of circular q
ueue using link lists.

8. Polynomial addition, multiplication.

9. Two
-
way link lists programs.

10. Infix to postfix/prefix conversion.

11. BST implementation (addition, deletion, searching).

12. Graph traversal (BFS, DFS).
























3 BTCS 10. INTERNET
PROGRAMMING

LAB


1.

Create a bio
-
data of self using HTML with a photograph on the page and containing
marks in a table.

2.

Develop your web page with the following properties.

(1) 2 Photographs display at the same place, which can flip on

mouse over.

(2) Link to separate HTML file for academics, sports and other interests.

3.

Enhance your Web page using style sheets, frames and setup a hyper link to your
friend’s page.

4.

Make a form for submission of Querying about the interest rates of bank (u
se Text
fields of HTML) and submit buttons of HTML.

5.

Make a local query form, which takes in the input the range of marks through Text
fields and display the list of students having marks in that range in another window.

6.

Enhance the above query through pass
word protection.

7.

Build a shopping Cart page in which items of 10 types are picked and quantity and a
bill is generated by the web page.

8.

Enhance the above page for making a payment through electronic billing system.

9.

Associate guest book in your web page.

10.

Se
tup a Counter to count the number of visitors on your web page.





































SURESH GYAN VIHAR UNIVERSITY


School of Engineering & Technology


Syllabus for B.Tech. (Computer Science Engg.)


IV Semester

































4
BT
CS1:
SOFTWARE ENGINEERING



Class B.Tech. IV SEM

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Un
it

Contents of the subject

No. of hour
required

I



System Analysis: Characteristics, Problems in system
Development




System Level project Planning, System Development Life
cycle (SDLC),




Computer system engineering system analysis, modeling the
architectur
e, system specification.


6

II



Software Project Management: Objectives, Resources and
their estimation, LOC and FP estimation, effort estimation




COCOMO estimation model, risk analysis




Software project scheduling. Software Development : Life
Cycle (SWDLC
), SWDLC models software engineering
approaches


7

III



Requirement Analysis: Requirement analysis tasks, Analysis
principles. Software prototyping and specification data
dictionary



Finite state machine (FSM) models. Structured Analysis: Data
and control f
low diagrams, control and process specification



behavioral modeling, extension for data intensive applications

7

IV



Software Design: Design fundamentals, Effective modular
design



Data architectural and procedural design, design
documentation



7

V



Object

Oriented Analysis: Object oriented Analysis Modeling,
Data modeling.



Object Oriented Design: OOD concepts and methods class
and object definitions, refining operations.




Class and object relationships, object modularization.
Introduction to Unified Modeli
ng Language




8






Recommended
Books:


1.

Pressman; Software

Engineering
-
A practitioner's Approach, McGraw Hill International

2.

Behforooz and F.J.
Hudson: Software

Engineering Fundamentals Oxford University Press







4
BT
CS2:
TELECOM ENGG. FUNDAMENTALS



Cla
ss B.Tech. IV SEM

Evaluation

Schedule Per Week


Lectures : 3


Tutorials : 1

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of
hour
required

I



INTRODUCTION

:
-

Electromagnetic Spectrum, Frequency
Spectrum
-
Bandwidth
-
Allocation, Time domain and Frequency
domain analysis



TRANSMISSION MEDIA
:
-

Twisted pair, UTP cables, Coaxial
and optical fiber cables, wireless, microwave and satellite

transmission



DATA TRANSMISSION:
-

Transmission

impairments. Serial
and parallel transmission, Simplex, half duplex or full duplex
transmission mode.


8

II



DATA ENCODING

:
-

Modulation (ASK, FSK and PSK, PCM,
PAM, Delta Modulations), Line coding (NRZ
-
L, NR
Z

I , Bipolar
AMI, Manchester and differential Manchester),



MULTIPLEXING
:
-

FDM, Synchronous and Statistical TDM



8

III



DATA LINK LAYER
: Channel allocation problem, pure and
slotted ALOHA Protocols, Persisted And Non
-
Persisted CSMA


Collision Free
Protocols, Digital Cellular Radio and CDMA


Logical Link Sub Layer, MAC Sub layer.



Brief Introduction:

Frame Relay, PPP



PROTOCOL

:
-

OSI & TCP/IP Protocol Architecture


6

IV



SWITCHING NETWORKS
: Circuit switching Networks, Space
and Time division swi
tching, Routing circuit switched
networks, control signaling packet switching principles, fixed,
flooding and adaptive routing strategies
:

X.25 & X.28 protocols

Brief introduction: ISDN,ADSL


6

V



NETWORK DEVICES
: Gateway, Router, Bridge, Switch, Hub,
Repe
ater, Multilayer Switch, Protocol Converter, Router,
Proxy, Firewall, Multiplexer, Network Card, Modem.



NETWORK TECHNOLOGY
: DSL, GSM, Bluetooth, Infrared.


7




Recommended
Books:


1.

William
Stallings: Data

and Computer Communications (PHI, 5
th

Ed.)

2.

James

Martin: Telecommunication

and the Computer (PHI
, 3
rd


Ed.)





4
BT
CS3:
STATISTICAL PROBABILITY & THEORY



Class B.Tech. IV Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials : 1

Examination Time = Three
(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I

Introduction & Discrete random variables


Sample space, Events, Algebra of events, Bernoulli Trials.


Probability
&
Baye

s
theorem. Random variables & their event


space,

Probability
generating function,

e
xpectations
, m
oments,


c
omputation
s

of mean
t
ime to failure. Bernoulli & Poisson


Processes

6

II

Discrete & continuous distributions


Probability

d
is
tribution

&
Probability

d
ensities
:
Binomial, Poisson
,


normal,r
ectangular

and
exponent
ial distribution & their PDF’s,

m
oments and

MGF

s for

above distributions

7

III

Correlation & Regression Correlation & regression
:

Linear regression
, Rank

correlat
ion,

Method of
least squares,
Fitting

of straight lines & second degree parabola.
Normal
regression and correlation
a
nalysis


7

IV

Queuing Theory
:

Pure birth, Pure Death and Birth
-
Death Processes
. M
athematical
Models for M/M/I, M/M/N, M/M/S and M/M/S/N
queues
.


7

V

Game Theory

Minimax & Maximum Strategies

Application of liner programming (Graphical Method)

8





Recommended Books:


1.

K.S.Trivedi :Probability & Statistics with RELIABILITY Queuing and Computer Science Application
(PHI)

2.

J.E. Frend & R.E. W
alpole :Mathematical Statistics

3.

Taha :Operational Research

4.

Kapoor & Saxena :Statistics & Probability

5.

Gokhroo et al. : Advanced Engg. Statistics (4CP1)













4
BT
CS4:
WEB TECHNOLOGY



Class B.Tech. IV Sem.

Evaluation

Schedule Per Week



Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



䥮Ir潤畣ti潮⁡ 搠W敢⁄敶el潰m敮琠t瑲a瑥ti敳⁈ist
潲y 潦 W敢



Pr潴ocols⁧ v敲ein朠W敢Ⱐ䍲敡瑩湧 W敢si瑥t⁦潲⁩湤ivi摵al
慮搠d潲灯o慴攠W潲汤Ⱐ,y扥r⁌ ws W敢⁁灰lica瑩o湳




Wri瑩湧 W敢⁐r潪散瑳Ⱐ䥤敮瑩fic慴ao渠nf⁏扪散瑳Ⱐ,慲来琠啳敲eⰠ
We戠T敡mⰠ,l慮ni湧 慮d⁐r潣敳s⁄敶el潰m敮琮


6

II



䡔䵌Ⱐ,䵌⁡ 搠dcri灴p湧

䱩s琬⁔慢l敳Ⱐ䥭慧敳Ⱐ䙯,msⰠ
Fram敳Ⱐ䍓S⁄潣畭敮琠ty灥⁤敦i湩ti潮Ⱐ



X䵌⁳c桥m敳Ⱐ,扪散琠t潤敬sⰠ,r敳敮ti湧⁘M䰬L啳i湧⁘䵌
Pr潣敳s潲o㨠䑏䴠Mn搠SAX



䥮Ir潤畣ti潮⁴ ⁊ava⁓crip琬tO扪散琠t渠nav愠Scri灴p⁄ynamic
䡔䵌⁷ 瑨tJava⁓cript


7

III



J慶愠 B敡湳 慮搠 W敢

S敲e敲e 䥮Ir潤畣瑩o渠 瑯t J慶a B敡湳Ⱐ
Adv慮t慧攬ePr潰敲ei敳ⰠBDK



䥮Ir潤畣ti潮 t漠EJBⰠJ慶愠B敡湳 AP䤠䥮Iro摵c瑩潮 瑯tS敲eel整eⰠ
䱩f散ycl攬⁊SDKⰠ,敲el整eAPI



S敲el整eP慣k慧敳㨠䡔TP 灡ck慧攬e睯wki湧 睩瑨 䡴瑰 r敱略s琠
慮搠牥dp潮s攬eS散畲ity 䥳s略s.


7

IV



䥮瑲
潤畣ti潮 瑯 JSPⰠJSP pr潣敳si湧ⰠJSP A灰lic慴i潮 䑥Di杮,
Tomc慴aS敲e敲Ⱐ䥭灬icit



JSPo扪散瑳Ⱐ䍯C摩tio湡l Pr潣敳si湧, 䑥Dl慲楮朠v慲a慢l敳 a湤
m整e潤s



Err潲o 䡡湤lin朠 慮搠 D敢u杧i湧Ⱐ S桡ri湧 摡t愠 扥t睥敮 JSP
灡来p
-

S桡ri湧 S敳si潮⁡n搠dp灬ic慴i潮 䑡瑡.


7

V



D
慴ab慳攠䍯湮散tivity⁄慴慢慳攠Pr潧r慭mi湧⁵ in朠J䑂C




S瑵dyi湧 J慶慸⹳煬.*灡ck慧攬e 慣c敳sin朠 a 摡瑡t慳e from a
JSP⁰慧e




A灰lica瑩潮
-
s灥cific 䑡瑡t慳攠Acti潮Ⱐ䑥velo灩湧 Jav愠B敡湳
i渠n⁊SP⁰ 来Ⱐi湴牯摵c瑩潮 瑯tS瑲畴u⁦ram敷潲o.


8



Recommended Books:


1 Ajit singh poonia, web technology and fundamentals

2

J.E. Frend internet and history






4BTCS5:


JAVA

Class B.Tech. IV Sem.

Evaluation


Schedule Per Week


Lectures : 3


Tutorials :
1

Examination Time = Three(3) Hrs

Maximum

Marks = 100

[
Internal

(30) &
Semester End Exam
(70)



Units

Contents of the Subject

No. of hour
required



I

An overview of Java:
Object oriented programming, Two paradigms, abstraction, the, OOP
principles, Java class libraries

Date types, variables

and arrays:
Integers, floating
-
point types, characters, Boolean, Iterates,
Variable, Data types and casting, automatic type promotion in expressions arrays.




7



II

Operators:
Arithmetic operators, bit wise operators, relational operators, Boolean logi
cal
assignment operators, the? Operator, operator precedence

Control statements:
-
Java's selection statements, iteration statements, jump statements

Introduction to classes: Class
fundamentals, declaring object reference variable, Introducing
methods, con
structors, the key word, garbage collection, the finalize () method.





6



III

Methods and Classes:
-
Overloading methods, using objects as parameters, recursion

Inheritance:
Inheritance basics, using super, method overriding, dynamic method dispatch, us
ing
abstract Classes, Using final with inheritance, Package and Interfaces, Package asses protection,
importing packages

Exception handling:
Exception handling fundamentals. Exception types, Uncaught Exceptions
Using try and catch, multiple catch clauses,
nested try statements throw, Finally Java built in
exception creating your own exception sub classes, using exceptions.

Multithreaded Programming:
The Java thread model, the main thread, creating thread, creating
multiple thread, using is alive () and join

(). Thread priorities, synchronization, Inter thread
Communications, suspending resuming and stopping thread using multithreading








8

IV

String handling:
The string constructor, string length, special string operator character extraction,
string co
mparison, searching string, modifying string, data conversion, changing the case of
characters, string buffer.




7

V

Networking:
Networking basics, Java and the Internet Address, TCP/IP client Sockets URL,URL
connection, TCP/IP server Sockets The Applet
Class

The Applet Class:
its architecture displays methods. The HTML APPLET. Passing parameters to
Applet. The get Documentation Base () and get Code Base () methods Applet Context and Show
Document





7


References:


1. Java 2 Computer Reference (Tata M
cGraw Hill)

2. Core Java
-
I (Addison Wesley)
-

horstmann

3. Core Java
-

II (Addison Wesley)

4. Thinking in Java (Bruce Eckel)










4
BT
CS6.1:
OPEN SOURCE TECHNOLOGY



Class B.Tech. IV Sem.

Evaluation

Schedule Per Week



Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



OST overview: Evolution & development of OST and
co
ntemporary technologies, Factors leading to its growth.



Open Source Initiative (OSI), Free Software Foundation and
the GNU Project, principle and methodologies. Contexts of
OST (India & international).




Applications of open source (open source teaching an
d open
source media) Risk Factors. Myths regarding open source.


6

II



Philosophy of Software Freedom, Free Software, OSS,
Closed software, Public Domain Software, Shared software,
Shared source.



Detail of few OSS like Open Audio, Video, 2d & 3d graphics
software, system tools, office tools,



Networking & internet, Security, Educational tools and Games

7

III



Open Source Development Model, Starting and Maintaining
an Open Source Project



Open Source Hardware, Open Source Design, Ongoing OS
Projects (i.e. ex
amples of few good upcoming software
projects.) Case Study:
-

Linux, Wikipedia.


7

IV



Licenses and Patents: What Is A License, How to create your
own Licenses?



Important FOSS Licenses (Apache,BSD, GPL, LGPL),
copyrights and copy lefts, Patents


7

V



Soci
al and Financial impacts of open source technology,
Economics of FOSS: Zero Marginal Cost, Income generation
opportunities




Problems with traditional commercial software,
Internationalization, Open Source as a Business Strategy
.


8





Recommended Books:




1)

Vikas thada, Review to OST

2)

Balaguruswamy concepts of open source concepts









4
BT
CS6.2
MANAGEMENT INFORMATION SYSTEM




Class B.Tech. IV Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :

Exam
ination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



Introduction: MIS concept, Definition, role & Impact of MIS



Process of management, organization structure &
behavior


6

II



Basic of Management Information System: Decision Making,
Information concepts



System concepts & control Types of system handling system
complexity System development model

7

III



Development of Management Information System:
Requirement and

implementation of MIS



Choice of information Technology for Management Information
System

7

IV



Application of Management Information system: Application in
manufacturing sector using for personal management



Financial management, Production Management, Ma
terial
Management, Marketing Management Application in Service
Sector

7

V



Enterprise Resource Planning (ERP): EMS, ERP, Benefits
implementation, EMS & MIS.



Case Studies: Application of SAP technologies in
manufacturing sector.


8





Recommended
Books:


1.

S.Jawadekar: Management

Information System, (Tata McGraw Hill)

2.

Loudon & Loudon
-
Management Information Systems, Pearson Education Asia.

















4
BT
CS6.3

PATTERN REC
OG
NITION & LEARNING



Class B.Tech. IV Sem.

Evaluation

Schedule Per Week



Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



Introduction to Learning, different approac
hes to machine
Learning.



Learning Algorithms, Complexity of inductive inference.


8

II



Review of formal languages, finite automata and regular
languages, context
-
free languages and parsing.



Language identification in the limit. Gold's basic results.


7

I
II



Polynomial learning, PAC learnability, Valiant's results.



VC
-
dimension. Examples from language identification.


7

IV



Sample Complexity for finite hypothesis spaces,



Learnability of CNF formulas.


7

V



Sample Complexity for infinite hypothesis spaces,
VC
dimension for neural networks.



Mistake Bound Model of Learning.


8




Recommended Books:



1.
Mitchell T.M., Machine Learning, Mc
-
Graw Hill International, 1984.

2. Anthony M. and Biggs N., Computational Learning Theory: An Introduction, Cambridge

University Press, England, 1992.

3. Natarajan B.K., Machine Learning: A Theoretical Approach, Morgan Kaufman, 1991.

4. Kearns M.J. and Vazirani U.V., an Introduction to Computational Learning Theory, Cambridge, Ma., MIT
Press, 1994
.
















4
BT
CS6.4: INTERNET TECHNOLOGY



Class B.Tech. IV

Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exa
m
(70)




Unit

Contents of the subject

No. of hour
required

I



䥎I剏䑕䍔䥏丠㨠䥮瑥牮整tc潮湥c瑩潮⁣o湣数瑳
-

S
敲e敲Ⱐ
C
li敮琠慮搠

r瑳Ⱐ,潭慩渠n慭攠eyst敭s



T敬数桯湥Ⱐ,a扬e⁡ 搠d慴alli瑥tco湮散ti潮s
-

Di慬異Ⱐ䥓䑎Ⱐ
A䑓䰠L湤 l敡se搠din攠e慳e搠d潮n散瑩o測nc慢le

慮d⁄ S
慣c潵湴nⰠW敢 TV⁡ 搠d湴n慮整eⰠ,SP⁦敡瑵牥t

6

II



䥎I剁久TS㨠W桡琠ts⁉ 瑲慮整e


䥮瑲慮整⁖s⁌A乳
䍯C灯湥湴n ⁡ ⁉湴牡n整etorks瑡ti潮s⁡ 搠dli敮琠t潦瑷慲t




S敲v敲⁡e搠d整w潲o 敲慴i湧⁳ys瑥tsⰠ乥,睯wk⁃慲摳Ⱐ
䍡扬in朠gn搠d畢sⰠ,瑥ts⁦or⁣r敡瑩n
g⁡ 䥮Ira湥琬t䵡i湴敮慮ce
慮搠do湮散ti湧 瑯tI湴nrn整e

7

III



E
-
䵁䥌I TE䍈乏䱏GY㨠 F敡瑵牥t 慮d 䍯湣数瑳
-

䵥ss慧e
桥慤敲eⰠAd摲敳s 扯潫ⰠA瑴tc桭敮琬tFil瑥ti湧 慮搠f潲o慲摩ng
m慩ls

7

IV



V䥄EO 䍏乆ERE乃䥎I A乄N I乔E剎䕔 TE䱅P䡏NY㨠
V潩ce⁶s⸠Vi摥o⁣潮f敲敮ei湧,




Vid敯 co湦敲敮ein朠 h慲aw慲攠 慮d f敡瑵牥t 潦 vi摥o
c潮f敲敮ei湧⁳潦tw慲攬⁤i杩t慬⁴敬e灨ony 慳⁉S䑎⁡灰lic慴a潮Ⱐ



䠠㌲3⁰牯瑯 潬s⁡湤畬瑩
-
p潩湴⁣潮f敲敮eing

7

V



WEB TE䍈乏䱏GY㨠 El敭敮瑳 潦o 瑨t W敢
-

䍬i敮瑳 慮d
s敲e敲eⰠ䱡湧u慧敳 a湤 灲潴潣潬s W敢 灡来
慮搠We戠si瑥t,
s灥ci慬i湤s W敢⁳i瑥t



We戠 剥R潵rc敳
-

S敡rc栠 E湧in敳Ⱐ 䵥ss慧攠 扯慲摳Ⱐ cl畢s,
乥ws 杲潵灳 慮搠 c桡琬 W敢 灡来 cr敡瑩潮 c潮c数瑳
-

灬a湮i湧Ⱐ乡vi条ti潮



T桥m敳 慮搠P畢lishin朠ⰠA湡lyzi湧 睥戠瑲慦fic
-

䱯朠fil攠摡t愬
慮alyzi湧 l潧⁦il敳⁡湤 灲p
d畣瑳⁦潲⁡湡lyzin朠we戠br慦fic

8




Recommended Books:


1.

M.L.Young
-
Internet: The Complete Reference, Tata Mc
-
Graw Hill Company.

2.

Harley Hanh
-
The internet Complete Reference, Tata McGraw Hill Company.

3.

Daniel Minoli
-
Internet & Intranet Engineering,Tata McGra
w Hill company












4

BTCS
7
. WEB PROGRAMING LAB


1.

Develop a static html page using style sheet to show your own profile.

Add a page to show 5 photos and

add a page to show your academics in a table

Add a page containing 5 links to your favorite websi
te

Add navigational links to all
above pages (add menu).

2.

Update your homepage, by creating few html file (e.g. header, footer, left
-
sidebar,
right), in these file you will put all

html code to be shown on every page.

3.

Use Cascading Style Sheets to format yo
ur all pages in a common format.

4.

Basic Php programs:

Write a simple "hello word" program using php.

5.


Write a program to accept two strings (name and age) from user. Print welcome
statement e.g. “Hi Ram, your

age is 24."

6.

Write a program to create a calculat
or, which can support add, subtraction and multiply
and division operation.

7.

Write a program to take input parameters for a table (no. of rows and no. of columns),
and create the desired

table.

8.

Create a "Contact Me" page
-
Ask user to enter his name, email I
D,

Use Java
-
Script to
verify entered email address.

9.

Store submitted value in a MySql database.

Display latest 5 submitted records in
contact me page.

Display above record with navigation support. e.g. (next, previous,
first, last).















4

BTCS

8
.
JAVA LAB


C++ Programs
:
-

1. Programs based on inheritance property.

2. Programs of operator overloading (complex number arithmetic, polar coordinates).

3. Programs using friend functions.

4. Programs on various matrix operations.

5. Stack operations using
OOPs concepts.

6. To implement Tower of Hanoi problem.

JAVA Programs:
-

7. To implement spell checker using dictionary.

8. To implement color selector from a given set of colors.

9. To implement shape selector from a given set of shapes.

10. To implement a
calculator with its functionality.

11. To show movement of a car.




















4

BTCS
9

UNIX LAB


1. Practice commands: cp, mv, rm, ln, ls, who, echo, cat, mkdir, rmdir. Wildcards (? *) ,

I/O redirection (<, >, >>), pipelines (|)

2. Practice commands
: xargs, alias, set
-
unset, setenv
-
unsetenv, export, source, ps, job, kill.

3. Practice commands: head, tail, cut, paste, sed, grep, sort, uniq, find, locate, chmod.

4. Writing a simple shell script to echo who is logged in.

5. Write a shell script to displ
ay only executable files in a given directory.

6. Write a shell script to sort a list of file either in alphabetic order or largest file first according
to user response.

7. Write a shell script to count the lines. Words and characters in its input (
Note:

Don't use wc).

8. Write a shell script to print end of a glossary file in reverse order using array. (Hint: use awk
tail).

9. Modify cal command to accept more than one month (e.g. $cal Oct, Nov, )

(Hint : use alias
too)

10. Write a shell script to check w
hether Ram logged in, continue checking every 60 seconds
until success.

















4
BTCS
10
. SOFTWARE ENGINEERING LAB


In this lab first 8 experiments are to practice software engineering techniques. Use any open
source CASE tool. Many of them are av
ailable

at www.sourceforge.net. You can choose any
other CASE tool, as per choice.

Language
: C++ / JAVA

Design Approach: Object Oriented

these designing can be done on any automation system e.g.
library management system, billing system, payroll system, bu
s reservation

system, gas agency
management system, book
-
shop management system, students management system.

1. Do feasibility study

2. Document all the requirements as specified by customer in Software Requirement
Specification

3. Design sequence diagrams

for project

4. Design Collaboration diagram

5. Design Data Flow Diagram for the project

6. Design Entity Relation Diagram for the project

7. Design Class diagram

8. Design at least 10 test cases for each module.

9.
-
10: Code and test the project, which yo
u have designed in last 8 labs.




























SURESH GYAN VIHAR UNIVERSITY


School of Engineering & Technology


Syllabus for B.Tech. (Computer Science Engg.)


V Semester
































5
BT
CS1:
DATABASE MANAGEMENT SYSTEMS



Clas
s B.Tech. V Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :
1

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of h
our
required

I



INTRODUCTION TO DATABASE SYSTEMS: Overview and
History of DBMS. File System vs DBMS .Advantage of DBMS
Describing and Storing Data in a DBMS.



Queries in DBMS. Transaction management and Structure of
a DBMS


6

II



ENTITY RELATIONSHIP MODEL:

Overview of Data Design
Entities, Attributes and Entity Sets, Relationship and
Relationship Sets.



Features of the ER Model
-
Key Constraints, Participation
Constraints, Weak Entities, Class Hierarchies, Aggregation



Conceptual Data Base, Design with ER Mode
l
-
Entity vs
Attribute, Entity vs Relationship Binary vs Ternary Relationship
and Aggregation vs ternary



Relationship Conceptual Design for a Large Enterprise


7

III



RELATIONSHIP ALGEBRA AND CALCULUS
:
Relationship
Algebra Selection and Projection, Set Ope
rations, Renaming,
Joints, Division



Relation Calculus, Expressive Power of Algebra and Calculus


7

IV



SQL QUERIES PROGRAMMING AND TRIGGERS: The
Forms of a Basic SQL Query, Union, Intersection and Except,
Nested Queries ,Correlated Nested Queries,



Set
-
Com
parison Operations, Aggregate Operators, Null
Values




Embedded SQL, Dynamic SQL, ODBC and JDBC, Triggers
and Active Databases.


7

V



SCHEMA REFINEMENT AND NORMAL FORMS:
Introductions to Schema Refinement, Functional
Dependencies, Boyce
-
Codd Normal Forms,
Third Normal
Form




Normalization
-
Decomposition into BCNF Decomposition into
3
-
NF

manufacturing sector.


8


Recommended
Books:


1.

Raghu Rama Krishnan : Database Managment Systems ,2nd ed: Tata Mc
-
Graw Hill

2.

Elmasri
-
Fundamentals of Data Base
Systems, Pearson

Educations.

3.

Silverschatz Korth and Sudarshan
-
Database Systems Concepts, 4th ed. Tata Mc
-
Graw Hill.

4.

Gordon C
-

Everest
-
Database Management Objectives Systems Functions and Administration. Tata Mc
-
Graw Hill.


5
BT
CS2:
ADVANCED SOFTWARE ENGINEERING



Class B.
Tech. V Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
r
equired

I



SOFTWARE CONFIGURATION MANAGEMENT: SCM
Process, Objects in Software configuration, Version control,
Change control, Configuration audit, Status reporting



SCM standards .SOFTWARE QUALITY ASSURANCE:
Quality Concepts, Quality Movement, SQA Activiti
es and
Formal Approaches to SQA


6

II



SOFTWARE TESTING AND DEBUGGING: Software Testing
Fundamentals .Text Case Design ,White

Box Testing, Basis
Path testing, Control Structure Testing, Black Box Testing and
Testing for Specialized Environments



Architectu
res and Applications. Program Error, Debugging
Process (Information Gathering, Fault Isolation, Fault
Confirmation, Documentation, Fixing fault, Testing) Debugging
Example


7

III



MANAGING TEAM: Understanding behavior and selecting
right person for the job
, Motivation, working in groups



Decision making, leadership and organizational structures.
INTERNATIONAL STANDARDS: Importance and defining
software quality, ISO 9126, BS 6079 planning steps, ISO
12207 approach to software lifecycle data


7

IV



WEB ENGINEE
RING
:
Attributes of Web
-
Based Applications.
Process, Modeling activity




Analysis modeling for WebApps, Design
-

functional,
information & interaction, testing WebApps
-

content,
navigation, configuration, and performance testing.


7

V



PROJECT MANAGEMENT FOR

SPECIAL CLASSES OF
SOFTWARE PROJECTS: Using CASE tools, CBSE, Re
-
engineering, forward engineering




Client/server software engineering, outsourcing, Software
project management standards. Change and Content
Management of Web Engineering
.


8



Recommended
Books:


1.

Roger S. Pressman
-

Software
Engineering, fifth

Edition, Mc
-
Graw Hill Publications.

2.

Ali Behforooz and
Frederick

J. Hudson
-

Software Engineering .Oxford Press.

3.

Ian
Summerville
-
Software
Engineering, Pearson

Education India.




5
BT
CS3: DISCRETE MATHEM
ATICAL STRUCTURES



Class B.Tech. IV Sem.

Evaluation

Schedule Per Week


Lectures : 3


Tutorials : 1

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)





Unit

Conten
ts of the subject

No. of hour
required

I



F潲m慬⁌ 杩c㨠S瑡t敭敮琬⁓ymb潬ic⁒ 灲敳敮t慴a潮⁡n搠
T慵瑯t潧i敳Ⱐ,u慮tifi敲eⰠ,r敤ic慴潲⁡o搠v慬idity




乯Nm慬⁦潲m⸠.r潰潳i瑩o湡l⁌ gicⰠ,re摩c慴攠e潧icⰠ䱯杩c
Pr潧r慭mi湧⁡ d⁐ro潦 ⁣潲o散瑮tss.


7

II



Pr潯fⰠ R
敬a瑩o渠 慮搠 A湡lysis 潦 Al杯rit桭 T散桮i煵敳 f潲
瑨t潲敭 灲潶in机g䑩r散琠Pr潯fⰠPr潯f by 䍯湴牡n灯siti潮ⰠPr潯f
by 數桡畳ti湧⁣慲敳⁡ d⁰ 潯f⁢y⁣o湴牡nic瑩on




Pri湣i灬攠 潦 m慴aem慴ac慬 in摵c瑩潮, 灲p湣ipl攠 潦 c潭灬整e
i湤畣瑩o渮n剥R畲uive⁤ fini瑩潮s



S潬u
瑩潮 m整e潤s f潲o li湥慲Ⱐ first
-
潲摥o r散畲u敮c攠 r敬慴i潮s
睩瑨tco湳瑡tt⁣潥ffici敮瑳.


8

III



Gr慰栠 T桥潲y㨠 Gr慰桳
-

䑩r散瑥t a湤 啮摩r散瑥搬d E畬敲楡渠
c桡i湳⁡湤⁣ycl敳⁈慭il瑯ni慮⁣h慩湳⁡ d⁣ycl敳




Tr敥sⰠ c桲hm慴ac 湵m扥rⰠ c潮湥c瑩vity a湤 潴桥r gr慰桩ca

灡r慭整ers⁁灰lic慴i潮s.




Polya❳⁔桥潲y † n畭敲慴ao渠n湤 i瑳⁡ 灬ic慴a潮s

7

IV



S整e 慮搠 Fu湣瑩o湳㨠 S整eⰠ r敬慴a潮sⰠ f畮c瑩o湳Ⱐ 潰er慴a潮s,
敱uiv慬e湣攠牥l慴i潮s



剥Ra瑩o渠nf⁰ rtial牤敲Ⱐ灡r瑩瑩o湳Ⱐ,i湡ry⁲el慴i潮s⸠



Tr慮sf潲ms㨠䑩scr整e F潵ri敲ea
湤 䥮v敲e攠F潵ri敲eTr慮sf潲ms
i渠n湥 慮搠tw漠摩m敮si潮s,⁤ scr整e⁃潳in攠er慮sf潲o

7

V



䵯湯i摳 慮搠 Gr潵灳㨠 Gr潵灳Ⱐ S敭i杲潵灳 慮搠 䵯湯i摳
cyclic⁳敭i⁧牡灨s⁡湤⁳ub潮潩摳,



S畢杲潵灳 a湤 c潳整e⸠䍯湧r略湣攠r敬慴io湳 潮 s敭i 杲潵灳⸠
䵯r灨ismⰠ乯,m慬⁳畢⁧
ro異s.



S瑲畣瑵牥t潦f cyclic 杲潵灳Ⱐ灥rm畴u瑩潮 杲潵灳 慮搠摩h敤ral
杲潵灳⁥l敭敮瑡ty 慰plica瑩潮s⁩n⁣潤i湧⁴桥潲y

8



Recommended Books:


1.

Kolman b, Busby R.: Discrete Mathematical Structure for Computer Science, PHI.

2.

Knuth, D.E. :The Art of Computer Pro
gramming, Volume I, Narosa

3.

Gibbons,A.: Algorithmic Graph Theory,Cambridge University Press

4.

Liu :Introduction to Discrete Mathematics, McGraw Hill

5.

Krishnamurthy :Combinatorics, EWP

6.

Liu :Introduction to Combinatorics, McGraw Hill

7.

Graham,Knuth, Pratshnik :Con
crete Mathematics

8.

Deo : Graph Theory, PHI




5
BT
CS4:
COMPUTER GRAPHICS



Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks = 100

Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



Introduction to Raster scan displays, Storage tube displays,
refreshing, flicking, interlacing, color monitors,



display processors resolution, working principle of dot matrix,
inkjet laser printers,

working principles of keyboard, mouse
scanner, digitizing camera, track ball , tablets and joysticks




graphical input techniques, positioning techniques, rubber
band techniques, dragging etc


6

II



Scan conversion techniques, image representation, line
dr
awing



simple DDA, Bresenham’s Algorithm, Circle drawing, general
method, symmetric DDA




Bresenham’s Algorithm, curves, parametric function, Beizier
Method, Bsp
-

line Method


7

III



2D & 3D Co
-
ordinate system, Translation, Rotation, Scaling,
Reflection Inve
rse transformation, Composite transformation



world coordinate system, screen coordinate system, parallel
and perspective projection, Representation of 3D object on 2D
screen


7

IV



Point Clipping. Line Clipping Algorithms, Polygon Clipping
algorithms



Intro
duction to Hidden Surface elimination, Basic illumination
model, diffuse reflection, specular reflection, phong shading,
Gourand shading ray tracing



color models like RGB, YIQ, CMY, HSV etc


7

V



Multimedia components, Multimedia Hardware, SCSI, IDE,
MCI




Multimedia data and file formats, RTF, TIFF, MIDI, JPEG,
DIB, MPEG, Multimedia Tools, Presentation tools, Authoring
tools, presentation


8



Recommended
Books:


1.

J.Foley, A. Van dam, S.Feiner
, J.Hughes: Computer

Graphics Principles and Practice. Addison We
sley.

2.

D.Rogers and
Adams: Mathematical

Elements of computer Graphics McGraw Hill.

3.

D.Hearn and
Baker: Computer

Graphics PHI.





5
BT
CS5:
MICROPROCESSOR AND INTERFACES



Schedule Per Week


Lectures : 3


Tutorials :

1

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



Introduction to Micro Computer Systems: Microprocessors,
microcontroller and microcomputer devices



Ma
chine and assembly language, Bus concept. Architecture &
Pinout of 8085A


6

II



Assembly Language and Programming in 8085: Instruction
set, Program structures (sequential, conditional, (iterative)




Macros and subroutines, Stack, Counter and timing delay,
i
nterrupt structure and its programming


7

III



Peripherals and their interfacing with 8085
-
I: Memory
Interfacing, Interfacing I/O ports




Data transfer schemes (Synchronous, asynchronous,
interrupt driven), Architecture & interfacing of PPI 8255, Data
Conve
rters and Timer 8254


7

IV



Peripherals and their interfacing with 8085
-
II:



Architecture & interfacing of
-

DMA controller 8257,



interrupt Controller 8259A, USART 8251, Level Converters
MC 1488 and MC 1489




Current loop, RS 232 C and RS 422 A


7

V



Compar
ative study of 8085 A, 8086 and 8088 (Pinout, internal
architecture, timing diagrams)




Instruction format and addressing modes


Data and Branch
related. Features of Pentium processor, MMX and Dual core
processor


8



Recommended
Books:


1.

Gaonkar
-
8085 Prog
ramming, Penram Press.

2.

A.P. Mathur
-
Introduction to Microprocessors, Tata Mc
-
Graw
-
Hill.

3.

Antanakos
-
Introduction to Intel Family Microprocessors, Pearson Education.

4.

Gilmore
-
Microprocessors Principles and Applications, Tata Mc
-
Graw Hill.

5.

B.Ram
-
Fundamentals of
Microprocessors & Micro Computers
, Dhanpat

Rai Pub.

6.

Ray and Bhurchandi
-
Intel Microprocessors, Tata
-
Mc
-
Graw Hill.











5
BT
CS6.1:
LOGICAL AND FUNCTIONAL PROGRAMMING



Schedule Per Week


Lectures : 3


Tutorials

:

Examination Time = Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)



Unit

Contents of the subject

No. of hour
required

I



PROPOSITIONS: Fully parenthesized propositions,
Evaluation of constant propositions, Evaluation of
pr
oposition n a state.



Precedence rules for operators, Tautologies, Propositions a
sets of states and Transforming English to prepositional
form


6

II



REASONING USING EQUIVALENCE
TRANSFORMATIONS: The laws of equivalence, rules of
substitution and transitivi
ty, formal system of axioms and
Inference rules.



NATURAL DEDUCTION SYSTEM: Introduction to deductive
proofs, Inference rules, proofs and sub
-
proofs, adding
flexibility to the natural deduction system and developing
natural deduction system proofs


7

III



PREDICATES: Extending the range of a state,
Quantification, Free and Bound Identifiers, Textual
substitution



Quantification over other ranges and some theorems about
textual substitution and states


7

IV



LOGIC PROGRAMMING: Introduction to prepositional an
d
predicate calculus, First
-
order predicate calculus



Format logical systems, PROLOG programming
-
Facts,
Rules and queries, Implementations, Applications, Strengths
and Weaknesses


7

V



FUNCTIONAL PROGRAMMING: Introduction to lambda
calculus
-
Syntax and sema
ntics, Computability and
correctness.



Features of Functional Languages
-
Composition of functions,
Functions as first
-
class Objects, no side effects and clean
semantics




LISP Programming
-
Data types and structures, Scheme
dialect, primitive functions, functi
ons for constructing
functions and functional forms. Applications of functional
languages and comparison of functional and imperative
languages


8


Recommended
Books:


1.

Appleby
-
Programming Languages, Tata Mc
-
Graw Hill.

2.

Sebesta
-
Concepts of Programming Langu
ages, Pearson Education

3.

David Gries
-
The Science of programming
, Narosa

Publication House.


5BT
CS6.2
: IC TECHNOLOGY



Schedule Per Week


Lectures : 3


Tutorials :

Examination Time = Three(3) Hrs

Maximum Marks
= 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



INTRODUCTION : Introduction to IC Technology


MOS,
PMOS, NMOS, CMOS & BiCMOS technologies
-

Oxidation,
Lithography, Diffusion, Ion implantation, Metallis
ation,
Encapsulation, Probe testing, Integrated Resistors and
Capacitors.

7

II



BASIC ELECTRICAL PROPERTIES: Basic Electrical
Properties of MOS and BiCMOS Circuits: Ids
-
Vds
relationships, MOS transistor threshold Voltage, gm, gds, and
figure of merit? o; P
ass transistor, NMOS Inverter, Various pull
ups, CMOS Inverter analysis and design, Bi
-
CMOS Inverters.

7

III



VLSI CIRCUIT DESIGN PROCESSES : VLSI Design Flow,
MOS Layers, Stick Diagrams, Design Rules and Layout, 2 ?m
CMOS Design rules for wires, Contacts
and Transistors Layout
Diagrams for NMOS and CMOS Inverters and Gates, Scaling
of MOS circuits, Limitations of Scaling.

8

IV



GATE LEVEL DESIGN : Logic Gates and Other complex
gates, Switch logic, Alternate gate circuits, Basic circuit
concepts, Sheet Resi
stance RS and its concept to MOS, Area
Capacitance Units, Calculations
-

??
-

Delays, Driving large
Capacitive Loads, Wiring Capacitances, Fan
-
in and fan
-
out,
Choice of layers

8

V



SUBSYSTEM DESIGN: Subsystem Design, Shifters, Adders,
ALUs, Multipliers, Par
ity generators, Comparators, Zero/One
Detectors, Counters, High Density Memory Elements.
SEMICONDUCTOR INTEGRATED CIRCUIT DESIGN : PLAs,
FPGAs, CPLDs, Standard Cells, Programmable Array Logic,
Design Approach.

6




Recommended Books:



1. Chip Design for
Submicron VLSI: CMOS Layout & Simulation,
-

John P. Uyemura, Thomson Learning.

2. Introduction to VLSI Circuits and Systems
-

John .P. Uyemura, JohnWiley, 2003.

3. Digital Integrated Circuits
-

John M. Rabaey, PHI, EEE, 1997.

4. Modern VLSI Design
-

Wayne
Wolf, Pearson Education, 3rd Edition, 1997.

5. VLSI Technology


S.M. SZE, 2nd Edition, TMH, 2003.














5
BT
CS6.3:
ADVANCED DATA STRUCTURES



Schedule Per Week


Lectures : 3


Tutorials :

Examination Time
= Three(3) Hrs

Maximum Marks = 100

[
Internal

(30) &
Semester End Exam
(70)




Unit

Contents of the subject

No. of hour
required

I



ADVANCED TREES: Definition
s
Operations on Weight
Balanced Trees (Huffman Trees), 2
-
3 Trees and Red
-
Black
Trees.



Augmenti
ng Red
-
Black Trees to Dynamic Order Statistics and
Interval Tree Applications.



Operations on Disjoint sets and its union
-
find problem
Implementing Sets. Dictionaries, Priority Queues and
Concatenable Queues using 2
-
3 Trees

6

II



MERGEABLE HEAPS: Merge abl
e Heap Operations, Binomial
Trees Implementing Binomial Heaps and its Operations, 2
-
3
-
4.
Trees and 2
-
3
-
4 Heaps.



Amortization analysis and Potential Function of Fibonacci
Heap Implementing Fibonacci Heap.



SORTING NETWORK
:
Comparison network, zero
-
one
prin
ciple, bitonic sorting and merging network sorter.

7

III



GRAPH THEORY DEFINITIONS: Definitions of Isomorphic
Components.




Circuits, Fundamental Circuits, Cut
-
sets. Cut
-
Vertices Planer
and Dual graphs, Spanning Trees, Kuratovski's two Graphs

7

IV



GRAPH T
HEORY ALGORITHMS
:
Algorithms for
Connectedness, Finding all Spanning Trees in a Weighted
Graph and Planarity Testing




Breadth First and Depth First Search, Topological Sort,
Strongly Connected Components and Articulation Point.



Single Min
-
Cut Max
-
Flow the
orem of Network Flows. Ford
-
Fulkerson Max Flow Algorithms


7

V



NUMBER THEORITIC ALGORITHM: Number theoretic
notation, Division theorem



GCD recursion, Modular arithmetic, Solving Linear equation,
Chinese remainder theorem, power of an element



RSA public ke
y Cryptosystem, primality Testing and Integer
Factorization

8




Recommended
Books:


1.

Narsingh Deo
-
Graph Theory with Application to Engineering and Computer
Science, Prentice

Hall of
India.

2.

Baase
-
Computer
Algorithms, Pearson

Education.

3.

Cormen
-
Introduction
to
Algorithms, Prentice

Hall of India.

4.

Aho A.V.
, Hopcrptt

J.E. and Ullman J.D.
-
The Design and Analysis of Computer Algorithms, Pearson
Education.

5.

Horowitz and Sawhni
-
Fundamentals of Data Structures Galgotia Book Source.



5 BTCS
7
. COMPUTER GRAPHICS LAB


1
. Implementation of line generation using slope’s method, DDA and Bresenham’s algorithms.

2. Implementation of circle generation using Mid
-
point method and Bresenham’s algorithm.

3. Implementation of ellipse generation using Mid
-
point method.

4. Implementa
tion of polygon filling using Flood
-
fill, Boundary
-
fill and Scan
-
line algorithms.

5. Implementation of 2D transformation: Translation, Scaling, Rotation, Mirror Reflection and
Shearing (write a

menu driven program).

6. Implementation of Line Clipping using

Cohen
-
Sutherland algorithm and Bisection Method.

7. Implementation of Polygon Clipping using Sutherland
-
Hodgman algorithm.

8. Implementation of 3D geometric transformations: Translation, Scalind and rotation.

9. Implementation of Curve generation using In
terpolation methods.

10. Implementation of Curve generation using B
-
spline and Bezier curves.

11. Implementation of any one of Back face removal algorithms such as Depth
-
Buffer
algorithm, Painter’s

algorithm, Warnock’s algorithm, Scan
-
line algorithm)




















5
BTCS

8. MICROPROCESSORS LAB


1. Study of hardware, functions, memory, and operations of 8085 kit.

2. Program to perform integer addition (two and three numbers 8 bit)

3. Program to perform multiplication (two 8 bit numbers).

4. Program to p
erform division (two 8 bit numbers).

5. Transfer of a block data in memory to another place in memory in forward and



reverse order.

6. Swapping of two block data in memory.

7. Addition of 10 numbers using array.

8. Searching a number in an array.

9. So
rting of array (ascending, descending order).

10. Print Fibonacci sequence. (15 elements)

11. To insert a number at correct place in a sorted array.

12. Interfacing seven segment display using 8255.




















5 BTCS 9. DATABASE MANAGEMENT LAB


Stu
dent can use MySql (preferred open source DBMS) or any other Commercial DBMS tool
(MS
-
Access / ORACLE) at backend

and C++ (preferred) VB/JAVA at front end.

1. (a) Write a C++ program to store students records (roll no, name, father name) of a class
using f
ile handling.

(Using C++ and File handling).

(b) Re
-
write program 1, using any DBMS and any compatible language. (C++/MySQL) (VB
and MS
-
Access)

2. Database creation/ deletion, table creation/ deletion.

(a) Write a program to take a string as input from use
r. Create a database of same name. Now
ask user to input two

more string, create two tables of these names in above database.

(b) Write a program, which ask user to enter database name and table name to delete. If
database exist and table exist then

delete

that table.

3. Write a program, which ask user to enter a valid SQL query and display the result of that
query.

4. Write a program in C++ to parse the user entered query and check the validity of query.

(Only SELECT query with WHERE clause)

5
-

6. Create
a database db1, having two tables t1 (id, name, age) and t2 (id, subject, marks).

(a) Write a query to display name and age of given id (id should be asked as input).

(b) Write a query to display average age of all students.

(c) Write a query to display ma
rk
-
sheet of any student (whose id is given as input).