33CS1: Applied Mathematics

Unit 1:
Integral Transforms Fourier integral theorem, Fourier and Laplace transforms and their simple
properties. Simple applications of Laplace transforms tosol!e ordinar" differential e#uations
including simultaneous e#uation Application to one dimensional partial differential e#uations. The
$transform definition and properties, in!ersion, relation %ith Laplace transform, Application of
$transform to sol!e difference e#uations %ith constant coefficients.
Unit 2:
Comple& !aria'les Anal"tic function, Cauch"(iemann conditions, con)ugate, functions,
singularities, Cauch"*s integral theorem and integral formula +Statement onl", Ta"lor*s and
Laurent*s theorem+statement onl", (esidue
theorem, contour integration.
Unit 3:
Calculus of -ariations Ma&ima and Minima of functional, !ariation and its properties .uler*s
e#uation, functional dependent on first and second
order deri!ati!es, simple applications.
Unit 4:
Fourier Series /eriodic function and their Fourier e&pansion. .!en and odd function, change of
inter!al half range e&pansion. /artial 0ifferential .#uation: /artial0ifferential .#uation of first
order first degree, i.e Langrange*s form, Linear 1omogeneous /.0... of 2th order %ith constant
coeffient method of separation of !aria'les.
Unit 5:
Matrices In!erse of matri& '" partitioning method, In!erse of a matri& '" ad)oint method and its
use sol!ing 3 simultaneous e#uation, (an4 of matri&, Consistenc" of a s"stem of e#uation,
Linear dependence, linear and orthogonal transformations.
Unit 6:
Matrices Characteristic e#uation, .igen!alues, .igen!ectors, (eduction of a diagonal form,
Statement and !erification of Ca"le"1amilton theorem5 S"l!ester*s theorem, Association of
matrices %ith linear differential e#uation of second order %ith a constant coefficient,
0etermination of largest eigen!alue '" iteration method.
Text Books:
6 Ad!anced .ngineering Mathematics, 4re"$ig
6 1igher .ngineering Mathematics, 7.S. 8re%al
Reference Books:
6 Mathematics of .ngineers, Chandri4a /rasad
6 Ad!ance Mathematics for .ngineers, Chandri4a /rasad
6 Applied Mathematics for .ngineers, L.A. /ipes 9 1ar!ille
6 A Te&t 7oo4 of Applied Mathematics, /.2. :arti4ar 9 ;. 2. :arti4ar
33CS2: Programming Funamenta!s "n #C$
<2ITI
Introduction to programming, programming languages, algorithms, flo%charts. C: 0ata t"pes,
Identifiers, Storage class, Constant, =perators, e&pression, Statements, console I>= statements,
Selection statements: ifelse, s%itch, Iteration Statements: for, %hile, do%hile, ;ump statements:
return, go to, 'rea4, continue, comments.
<2ITII
Function, Call '" !alue, Call '" reference, calling functions %ith arra"s, arguments to main+,,
return statements, recursion, function protot"pes, inline 4e"%ord, preprocessor directi!es.
/ointers: pointer !aria'les, pointer operator, pointer e&pression, arra" of pointers, multiple
indirection, pointers to functions, d"namic allocation functions.
<2ITIII
Arra"s : single dimensional arra"s, t%o dimensional arra"s, multidimensional arra"s, !aria'le
length arra"s. Strings, arra"
of strings.
<2ITI-
Structures : arra" of structures, passing structure to function, structure pointers, structure %ithin
structures. <nions, 'itfields, enumerations, si$e of, t"pe def.
<2IT-
File I>= : Streams and files, file s"stem 'asics, fread, f%rite, fsee4, random access I>=, fprintf+,,
fscanf+,, standard streams.
<2IT 3 -I
Ad!anced Concepts in C: 0ifferent t"pes of pointers, (=M7I=S functions, .lementar" TS(s.
Te&t 7oo4s:
6 The Complete (eference C + ?th .dition, : 1er'ert Schildt @ TM1A
6 C 1o% to /rogram, ?th .dition '" 1. M. 0eitel 9 /. ;. 0eitel, /earson .ducation.
6 :riting TS(s through C : Bash%ant Canet4ar + 7/7,
(eference 7oo4s :
6 The C /rogramming Language : 0ennis (itchie 9 7rain Cernighan @/earsonA
6 /rogramming %ith C : C.(.-enugopal 9 S.(./rasad @TM1A
6 Let <s C : Bash%ant Canet4ar @7/7A
33CS3: %igita! Circuits & Funamenta! of
'icro(rocessor:
<2ITI:
Moti!ation for digital s"stems 3 Logic and 7oolean alge'ra, 2um'er S"stem: 7inar"
,1e&adecimal ,=ctal ,8ra". 8ates 9 truth ta'les, propositions, 0emorgan*s la% minimi$ation of
com'inational circuits using Carnaugh maps.
<2ITII:
Multiple&ers, 0emultiple&er , .ncoders ,0ecoders ,Code Con!erters, Adders , Su'tractor +1alf
,Full,,7C0 Adder>Su'tractor , ripple and carr" loo4ahead addition.
<2ITIII:
Storage elements, Flipflops and latches: 0, T, ;>C, S>( flipflops. Master Sla!e Con!ersion of
one of t"pe of F>F to another.
<2ITI-:
Counters, as"nchronous and s"nchronousdesign using state and e&citation ta'les.
<2IT-:
Introduction to mp DEDF, Addressing modes, Instruction Set of mp DEDF
<2IT-I:
Interrupts of DEDF, /rogramming of mp DEDF.
Te&t 'oo4s :
6 0igital 0esign 3rd .dition '" M. Morris Mano, /earson .ducation
6 0igital logic and Computer 0esign '" M. Morris Mano, /earson .ducation
6 0igital Cicuit 9 0esign 3(./.;ain
6 0igital circuit 9 design A./.8odse
6 Fundamental =f 0igital .lectronics A.Anand Cumar
6 D 'it microprocessor 9 controller 3-.;.-i'hute
6 D 'it Microprocessor 3 8aon4ar.
33CS4: Com)inatoria! T*eories
<2IT 1:
Com'inatorics: 7asic counting techni#ues, pigeonhole principle, recurrence relations,
generating functions. .&amples using ordinar" po%er series and e&ponential generating
functions, general properties of such functions.
0irichlet Series as generating functions. A general famil" of pro'lems descri'ed in terms of
Gcards, dec4s and handaH %ith solution methods using generating
functions.
<2IT II:
8enerating function proofs of the sie!e formula and of !arious com'inatorial identities. Certif"ing
com'inatorial identities. Some anal"tical methods and as"mptotic results. /ol"a*s counting
theorem. 7asics of graph theor". Introduction to pro'a'ilistic method in com'inatorics.
<2IT III:
2um'er Theor" .&amples of continued fractions. The stud" of the continued fractions. Alpha has
infinite continued fraction if alpha is irrational.
Formal logic: /ropositional logic: proof s"stem, semantics, completeness, compactness. Length
of proofs, pol"nomial si$e proofs, efficienc" of proof s"stems.
<2IT I-:
Alpha has periodic continued fraction if alpha is #uadratic irrational.
Application to appro&imation of irrationals '" rationals. 1ur%it$*s Theorem.
First order logic: models, proof s"stem, compactness, .&amples of formal proofs in sa", num'er
theor" or group theor". Some ad!anced topics.
<2IT -:
Application to solutions of /ell*s e#uation. /roof that means cosI+p & pi,>#J,for natural num'ers p
and #,are irrational+apart from o'!ious e&ceptions,. .&ample : CS application of logic,
introduction to modal and temporal logics, =r formal num'er theor" including incompleteness
theorem.
<2IT -I:
Liou!ille*s Theoram on alge'raic num'ers.Construction of transcendental num'ers.
.lements of proof theor" including cut elimination, =r $eroone la% for first order logic.
Te&t 7oo4:
6 2i!en, Kuc4erman and Montgomer", An Introduction to the Theor" of 2um'ers, +Fth
edition,,1LL1,:ile".
33CS1: +((!ie 'at*ematics
<nit 1:
Integral Transforms Fourier integral theorem, Fourier and Laplace transforms and their simple
properties. Simple applications of Laplace transforms tosol!e ordinar" differential e#uations
including simultaneous e#uation Application to one dimensional partial differential e#uations. The
$transform definition and properties, in!ersion, relation %ith Laplace transform, Application of
$transform to sol!e difference e#uations %ith constant coefficients.
<nit M:
Comple& !aria'les Anal"tic function, Cauch"(iemann conditions, con)ugate, functions,
singularities, Cauch"*s integral theorem and integral formula +Statement onl", Ta"lor*s and
Laurent*s theorem+statement onl", (esidue
theorem, contour integration.
<nit 3:
Calculus of -ariations Ma&ima and Minima of functional, !ariation and its properties .uler*s
e#uation, functional dependent on first and second
order deri!ati!es, simple applications.
<nit ?:
Fourier Series /eriodic function and their Fourier e&pansion. .!en and odd function, change of
inter!al half range e&pansion. /artial 0ifferential .#uation: /artial0ifferential .#uation of first
order first degree, i.e Langrange*s form, Linear 1omogeneous /.0... of 2th order %ith constant
coeffient method of separation of !aria'les.
<nit F:
Matrices In!erse of matri& '" partitioning method, In!erse of a matri& '" ad)oint method and its
use sol!ing 3 simultaneous e#uation, (an4 of matri&, Consistenc" of a s"stem of e#uation,
Linear dependence, linear and orthogonal transformations.
<nit N:
Matrices Characteristic e#uation, .igen!alues, .igen!ectors, (eduction of a diagonal form,
Statement and !erification of Ca"le"1amilton theorem5 S"l!ester*s theorem, Association of
matrices %ith linear differential e#uation of second order %ith a constant coefficient,
0etermination of largest eigen!alue '" iteration method.
Te&t 7oo4s:
6 Ad!anced .ngineering Mathematics, 4re"$ig
6 1igher .ngineering Mathematics, 7.S. 8re%al
(eference 7oo4s:
6 Mathematics of .ngineers, Chandri4a /rasad
6 Ad!ance Mathematics for .ngineers, Chandri4a /rasad
6 Applied Mathematics for .ngineers, L.A. /ipes 9 1ar!ille
6 A Te&t 7oo4 of Applied Mathematics, /.2. :arti4ar 9 ;. 2. :arti4ar
33CS2: Programming Funamenta!s "n #C$
<2ITI
Introduction to programming, programming languages, algorithms, flo%charts. C: 0ata t"pes,
Identifiers, Storage class, Constant, =perators, e&pression, Statements, console I>= statements,
Selection statements: ifelse, s%itch, Iteration Statements: for, %hile, do%hile, ;ump statements:
return, go to, 'rea4, continue, comments.
<2ITII
Function, Call '" !alue, Call '" reference, calling functions %ith arra"s, arguments to main+,,
return statements, recursion, function protot"pes, inline 4e"%ord, preprocessor directi!es.
/ointers: pointer !aria'les, pointer operator, pointer e&pression, arra" of pointers, multiple
indirection, pointers to functions, d"namic allocation functions.
<2ITIII
Arra"s : single dimensional arra"s, t%o dimensional arra"s, multidimensional arra"s, !aria'le
length arra"s. Strings, arra"
of strings.
<2ITI-
Structures : arra" of structures, passing structure to function, structure pointers, structure %ithin
structures. <nions, 'itfields, enumerations, si$e of, t"pe def.
<2IT-
File I>= : Streams and files, file s"stem 'asics, fread, f%rite, fsee4, random access I>=, fprintf+,,
fscanf+,, standard streams.
<2IT 3 -I
Ad!anced Concepts in C: 0ifferent t"pes of pointers, (=M7I=S functions, .lementar" TS(s.
Te&t 7oo4s:
6 The Complete (eference C + ?th .dition, : 1er'ert Schildt @ TM1A
6 C 1o% to /rogram, ?th .dition '" 1. M. 0eitel 9 /. ;. 0eitel, /earson .ducation.
6 :riting TS(s through C : Bash%ant Canet4ar + 7/7,
(eference 7oo4s :
6 The C /rogramming Language : 0ennis (itchie 9 7rain Cernighan @/earsonA
6 /rogramming %ith C : C.(.-enugopal 9 S.(./rasad @TM1A
6 Let <s C : Bash%ant Canet4ar @7/7A
33CS3: %igita! Circuits & Funamenta! of
'icro(rocessor:
<2ITI:
Moti!ation for digital s"stems 3 Logic and 7oolean alge'ra, 2um'er S"stem: 7inar"
,1e&adecimal ,=ctal ,8ra". 8ates 9 truth ta'les, propositions, 0emorgan*s la% minimi$ation of
com'inational circuits using Carnaugh maps.
<2ITII:
Multiple&ers, 0emultiple&er , .ncoders ,0ecoders ,Code Con!erters, Adders , Su'tractor +1alf
,Full,,7C0 Adder>Su'tractor , ripple and carr" loo4ahead addition.
<2ITIII:
Storage elements, Flipflops and latches: 0, T, ;>C, S>( flipflops. Master Sla!e Con!ersion of
one of t"pe of F>F to another.
<2ITI-:
Counters, as"nchronous and s"nchronousdesign using state and e&citation ta'les.
<2IT-:
Introduction to mp DEDF, Addressing modes, Instruction Set of mp DEDF
<2IT-I:
Interrupts of DEDF, /rogramming of mp DEDF.
Te&t 'oo4s :
6 0igital 0esign 3rd .dition '" M. Morris Mano, /earson .ducation
6 0igital logic and Computer 0esign '" M. Morris Mano, /earson .ducation
6 0igital Cicuit 9 0esign 3(./.;ain
6 0igital circuit 9 design A./.8odse
6 Fundamental =f 0igital .lectronics A.Anand Cumar
6 D 'it microprocessor 9 controller 3-.;.-i'hute
6 D 'it Microprocessor 3 8aon4ar.
33CS4: Com)inatoria! T*eories
<2IT 1:
Com'inatorics: 7asic counting techni#ues, pigeonhole principle, recurrence relations,
generating functions. .&amples using ordinar" po%er series and e&ponential generating
functions, general properties of such functions.
0irichlet Series as generating functions. A general famil" of pro'lems descri'ed in terms of
Gcards, dec4s and handaH %ith solution methods using generating
functions.
<2IT II:
8enerating function proofs of the sie!e formula and of !arious com'inatorial identities. Certif"ing
com'inatorial identities. Some anal"tical methods and as"mptotic results. /ol"a*s counting
theorem. 7asics of graph theor". Introduction to pro'a'ilistic method in com'inatorics.
<2IT III:
2um'er Theor" .&amples of continued fractions. The stud" of the continued fractions. Alpha has
infinite continued fraction if alpha is irrational.
Formal logic: /ropositional logic: proof s"stem, semantics, completeness, compactness. Length
of proofs, pol"nomial si$e proofs, efficienc" of proof s"stems.
<2IT I-:
Alpha has periodic continued fraction if alpha is #uadratic irrational.
Application to appro&imation of irrationals '" rationals. 1ur%it$*s Theorem.
First order logic: models, proof s"stem, compactness, .&amples of formal proofs in sa", num'er
theor" or group theor". Some ad!anced topics.
<2IT -:
Application to solutions of /ell*s e#uation. /roof that means cosI+p & pi,>#J,for natural num'ers p
and #,are irrational+apart from o'!ious e&ceptions,. .&ample : CS application of logic,
introduction to modal and temporal logics, =r formal num'er theor" including incompleteness
theorem.
<2IT -I:
Liou!ille*s Theoram on alge'raic num'ers.Construction of transcendental num'ers.
.lements of proof theor" including cut elimination, =r $eroone la% for first order logic.
Te&t 7oo4:
6 2i!en, Kuc4erman and Montgomer", An Introduction to the Theor" of 2um'ers, +Fth
edition,,1LL1,:ile".
33CS5: Princi(!es ,f 'anagement
<2IT I
2ature and Functions of Management, Management "esterda" and toda", /lanning and 0ecision
ma4ing.
<2IT II
Management Information S"stem: Introduction, Conceptual Foundations, Information S"stem
(e#uirement.
<2IT III:
Mar4eting Management: Mar4eting concept, Indian Mar4eting .n!ironment, Mar4et
segmentation, Mar4et /lanning, International Mar4etting.
<2IT I-
Financial Management
<2IT -
1uman (esource Management: 1uman (esource /lanning, (ecruitment, Selection, Training
and de!elopment, Securit", Safet" and 1ealth
<2IT -I
=rgani$ation 7eha!ior: =rgani$ation Structure and design. 0esigning .ffecti!e =rgani$ation,
Managing ;o' Stress, =rgani$ation 0e!elopment
Te&t'oo4s :
6 /rinciples of management , / C Tripathi and / 2 (edd"
6 Management Information S"stem,8ordan 0a!is and 1. =lison Mc8ra% 1ill /u'.
6 1uman (esources and /ersonal Management, :illiam :erther and Ceith 0a!is
6 Mar4eting Management, - S (amas%am" and S 2ama4umari
6 =rgani$ation 7eha!ior, 1igh Arnold and 0aniel Feldman Mc8ra% 1ill
6 Financial Management, Channa
33CS6: Com(uter -orks*o(
/ractical to 'e 'ased on follo%ing topics:
6 Stud" of /C 1ard%are:
6 7asic computer =rgani$ation
6 /C construction
6 Stud" of 7I=S and CM=S
6 :or4ing under 0=S and :I20=:S operating s"stems:
6 Internal and .&ternal 0=S commands.
6 7asics re#uired for %or4ing under :indo%s operating S"stem
6 Stud" of control panel.
. :or4ing under <2IO >LI2<O =perating S"stems:
6 Structure: <ni& Architecture
6 Features of <2IO operating s"stem
6 La"ered model of <2IO operating s"stem +stud" of 4ernel and Shell,
6 8eneral file commands and 0irector" commands
6 File structure and 0irector" structure
Introduction to 2et%or4ing Accessories:
6 Stud" of user connections.
6 Stud" of communication channels.
6 Stud" of net%or4 architecture +topologies,
6 Stud" of 2et%or4 T"pes.
7oo4s to (efer:
6 Computer Fundamentals 3 /radeep C.Sinha
6 Introduction to Computer Science '" ITL .SL, /earson .ducation.
6 Introdution to <2IO and shell programming '" M.8. -en4ateshmurth", /earson .ducation
6 <ni& Shell programming 3Besh%ant Canet4ar