cse final upto 4h year syllabus 09.01.14

8/12/2019 CSE Final Upto 4h Year Syllabus 09.01.14

1/80


2/80

Syllabus for B.Tech( Computer Science & Engineering ) Up to Fourth YearRevised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 20 0!20 "

A. THEORYSl.

No

Field Theor Contact Hours!"ee# Cr. $ts

% T $ TotalH462( Economics for En ineers % 0 0 % %

2%'

CS62(CS62'CS62+

+esi n ) Analysis of Al orithm4icro rocessors ) 4icrocontrollers+iscrete 4athematics

%%%

((0

000

''%

''%

,

FreeElecti7eCS621ACS621)CS621CCS6218

Circuit Theory ) 3etwor8 (ECE"+ata Communication (ECE"+i ital Si nal &rocessin (ECE/b9ect /riented &ro rammin (:T"

% 2!( 0 %;' %;'

Total o Theor (3!( (3-( ). $RACT*CA%- CS6,(

CS6,'+esi n ) Analysis of Al orithm4icro rocessors ) 4icrocontrollers

00

00

%%

%%

22

1 CS6,+F.E.

CS6,1ACS6,1)CS6,1CCS6,18

&ro rammin &ractices usin C


3/80

Syllabus for B.Tech( Computer Science & Engineering ) Up to Fourth Year

Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 20 0!20 "

$roposed

Fourth Year - Se7enth Semester A. THEORYSl.No.

Field Theor Contact Hours!"ee# Cr. $ts% T $ Total

2CS32(CS32'

Software En . Com iler +esi n

%%

00

00

%%

%%

% CS32+

A. &attern Reco nitionB. Soft Com utin C. Artificial :ntelli ence+. :ma e &rocessin

% 2 0 % %

' CS321

A. +istributed / eratin SystemB. Cloud Com utinC. +ata 7arehousin and +ata 4inin+. Sensor 3etwor8sE. 4obile Com utin

% 0 0 % %

,

CS326

A. :nternet Technolo y (:T"B. 4icroelectronics ) >6S: +esi n (ECE"C. Control System (EE"+. 4odellin ) Simulation (4" % 0 0 % %

Total o Theor (6 (6 ). $RACT*CA%- H43 ( =rou +iscussion 0 0 % % 2

CS3,( Software En . 6ab 0 0 % % 2

1

CS3,+ A. &attern Reco nition B. Soft Com utinC. Artificial :ntelli ence+. :ma e &rocessin 0 0 % % 2

CS3,6 A. :nternet Technolo y (:T"B. 4icroelectronics ) >6S: +esi n (ECE"

C. Control System (EE"+. 4odellin ) Simulation (4" 0 0 % % 2

0CS3,' :ndustrial trainin ' w8s durin -th ! th

Sem!brea8 2CS3,1 &ro9ect! % 2

Total o $ractical (6 ('Total o Semester +2 '3

%


4/80



Fourth Year - Eighth Semester A. THEORYSl.No

.

Field Theor Contact Hours!"ee# Cr. $ts% T $ Total

H4 2( A. /r anisational BehaviourB. &ro9ect 4ana ement

2 0 0 2 2

2 CS 2( A. Advanced Com uter ArchitectureB. &arallel Com utinC. 3atural 6an ua e &rocessin+. Cry to ra hy ) 3etwor8 SecurityE. Business Analytics

% 0 0 % %

%

CS 2' A. Technolo y 4ana ement (#SS"B. Cyber 6aw ) Security &olicy (#SS" C. / tical 3etwor8in (ECE"+. 6ow &ower Circuits ) Systems (ECE"E. E!Commerce(:T" 5. Robotics(EE ) 4E" % 0 0 % %

Total o Theor ). $RACT*CA%' CS ,( +esi n 6ab ; :ndustrial roblem related

ractical trainin (7or8sho needed" 0 0 - - ', CS ,' &ro9ect!2 0 0 2 2 -- CS ,+ =rand >iva %

Total o $ractical ( (+Total o Semester '5 '(

'


5/80



SE ESTER - ***

Theor

:A%4ES & ETH*CS *N $ROFESS*ONH4-+2(Contracts;+%Credits- +

Science? Technolo y and En ineerin as 8nowled e and as Social and &rofessional Activities

Effects of Technological Growth:

Ra id Technolo ical rowth and de letion of resources? Re orts of the Club of Rome. 6imits of rowth@ sustainabledevelo ment

Ener y Crisis@ Renewable Ener y ResourcesEnvironmental de radation and ollution. Eco!friendly Technolo ies. Environmental Re ulations? EnvironmentalEthicsA ro riate Technolo y 4ovement of Schumacher* later develo mentsTechnolo y and develo in notions. &roblems of Technolo y transfer? Technolo y assessment im act analysis.#uman / erator in En ineerin ro9ects and industries. &roblems of man? machine? interaction? :m act of assemblyline and automation. #uman centered Technolo y.

Ethics of Profession:

En ineerin rofession@ Ethical issues in En ineerin ractice? Conflicts between business demands and rofessionalideals. Social and ethical res onsibilities of Technolo ists. Codes of rofessional ethics. 7histle blowin and beyond?Case studies.

Profession and Human Values:

>alues Crisis in contem orary society 3ature of values@ >alue S ectrum of a ood life&sycholo ical values@ :nte rated ersonality* mental healthSocietal values@ The modern search for a ood society? 9ustice? democracy? secularism? rule of law? values in :ndianConstitution.Aesthetic values@ &erce tion and en9oyment of beauty? sim licity? clarity4oral and ethical values@ 3ature of moral 9ud ements* canons of ethics* ethics of virtue* ethics of duty* ethics ofres onsibility.

Books:

. Ste hen # $n er? Controllin Technolo y@ Ethics and the Res onsible En ineers? ohn 7iley ) Sons? 3ew or8' (2nd Ed"2. +eborah ohnson? Ethical :ssues in En ineerin ? &rentice #all? En lewood Cliffs? 3ew ersey .%. A 3 Tri athi? #uman values in the En ineerin &rofession? 4ono ra h ublished by ::4? Calcutta -.

Code; $H-+2(Contacts; 1%Credit; +ector Calculus@. &hysical si nificances of rad? div? curl. 6ine inte ral? surface inte ral? volume inte ral! hysical e am les in t

conte t of electricity and ma netism and statements of Sto8es theorem and =auss theorem D3o &roof . E ression ofrad? div? curl and 6a lacian in S herical and Cylindrical co!ordinates. 26

,


6/80



4odule 2 @

Electricity2. Coulumbs law in vector form. Electrostatic field and its curl. =aussFs law in inte ral form and conversion todifferential form . Electrostatic otential and field? &oissonFs EGn. 6a laceFs eGn (A lication to Cartesian? S hericaand Cylindrically symmetric systems H effective + roblems" Electric current? drift velocity? current density?continuity eGuation? steady current. ,6

2.2 +ielectrics!conce t of olariIation? the relation +JK0Earyin 5ield@

%. 6orentI force? force on a small current element laced in a ma netic field. Biot!Savart law and its a lications?diver ence of ma netic field? vector otential? Am ereFs law in inte ral form and conversion to differential form5aradayFs law of electro!ma netic induction in inte ral form and conversion to differential form. %6

odule 1;

Electroma netic Theory@'. Conce t of dis lacement current 4a wellFs field eGuations? 4a wellFs wave eGuation and its solution for frees ace. E.4. wave in a char e free conductin media? S8in de th? hysical si nificance of S8in +e th? E.4. ener yflow? ) &oyntin >ector.

-64odule ,@Luantum 4echanics@

,. =eneralised coordinates? 6a ran eFs EGuation of motion and 6a ran ian? eneralised force otential? momenta and

ener y. #amiltonFs EGuation of motion and #amiltonian. &ro erties of #amilton and #amiltonFs eGuation of motion.'6

Course should be discussed along with physical problems of 1-D motion

,.2 Conce t of robability and robability density? o erators? commutator. 5ormulation of Guantum mechanics andBasic ostulates? / erator corres ondence? Time de endent SchrMdin erFs eGuation? formulation of time inde endeSchrMdin erFs eGuation by method of se aration of variables? &hysical inter retation of wave function N (normaliIatioand robability inter retation"? E ectation values? A lication of SchrMdin er eGuation H &article in an infinite sGwell otential ( !+ and %!+ otential well"? +iscussion on de enerate levels.

6odule 5;

-


7/80



Statistical echanics;

%. Conce t of ener y levels and ener y states. 4icrostates? macrostates and thermodynamic robability? eGuilibriummacrostate. 4B? 5+? BE statistics (3o deduction necessary"? fermions? bosons (definitions in terms of s in? e am les"? hysical si nificance and a lication? classical limits of Guantum statistics 5ermi distribution at Iero ) non!Ierotem erature? Calculation of 5ermi level in metals? also total ener y at absolute Iero of tem erature and total number of articles? Bose!Einstein statistics H &lanc8Fs law of blac8body radiation..

6)asic En7ironmental Engineering & Elementar )iologCode; CH+2(Contacts; +% = +Credits; +

>eneral

Basic ideas of environment? basic conce ts? man? society ) environment? their interrelationshi . 6

4athematics of o ulation rowth and associated roblems? :m ortance of o ulation study in environmentalen ineerin ? definition of resource? ty es of resource? renewable? non!renewable? otentially renewable? effect oe cessive use vis!O!vis o ulation rowth? Sustainable +evelo ment.

26

4aterials balance@ Steady state conservation system? steady state system with non conservative ollutants? stefunction. 6Environmental de radation@ 3atural environmental #aIards li8e 5lood? earthGua8e? 6andslide!causes? effects andcontrol;mana ement* Anthro o enic de radation li8e Acid rain!cause? effects and control. 3ature and sco e ofEnvironmental Science and En ineerin .

26Ecolog

Elements of ecolo y@ System? o en system? closed system? definition of ecolo y? s ecies? o ulation? commundefinition of ecosystem! com onents ty es and function. 6

Structure and function of the followin ecosystem@ 5orest ecosystem? =rassland ecosystem? +esert ecosystem? AGuatiecosystems? 4an rove ecosystem (s ecial reference to Sundar ban"* 5ood chain Ddefinition and one e am le of eachfood chain ? 5ood web. 26

Bio eochemical Cycle! definition? si nificance? flow chart of different cycles with only elementary reaction D/ y en?carbon? 3itro en? &hos hate? Sul hur . 6

Biodiversity! ty es? im ortance? Endemic s ecies? Biodiversity #ot!s ot? Threats to biodiversity? Conservation o biodiversity. 26


8/80


9/80


10/80



a" Binary 3umber System ) Boolean Al ebra (reca itulation " D 6 * BC+? ASC::? EB+:C? =ray codes and their

conversions D 6 * Si ned binary number re resentation with Fs and 2Fs com lement methods D 6 ? Binarithmetic? >enn dia ram? Boolean al ebra (reca itulation" D 6 * Re resentation in S/& and &/S forms D 64inimiIation of lo ic e ressions by al ebraic method. D26 ( 6"

b" Combinational circuits ! Adder and Subtractor circuits (half ) full adder ) subtractor" D26 * Encoder?+ecoder? Com arator? 4ulti le er? +e!4ulti le er and &arity =enerator D26 . ('6"

4odule ! %@ D 06. SeGuential Circuits ! Basic 5li !flo ) 6atch D 6 ? 5li !flo s !SR? ? +? T and 4aster!slave 5li 5lo s

D%6 ? ('6"2. Re isters (S:S/?S:&/?&:&/?&:S/" D26 ? Rin counter? ohnson counter D 6 ? Basic conce t of Synchrono

and Asynchronous counters (detail desi n of circuits e cluded"? D26 ? +esi n of 4od 3 Counter D26(-6"

4odule H '@ D-6. A;+ and +;A conversion techniGues H Basic conce ts (+;A @R!2!R only D26 A;+@ successive a ro imation D26 " ('6"2. 6o ic families! TT6? EC6? 4/S and C4/S ! basic conce ts. (26"

D Learning utcome @ The student must be able to convert from one number system to another? wor8 out roblemsrelated to Boolean al ebra? minimisation roblems etc. The student must also learn to differentiate between thecombinational and seGuential circuits and desi n sim le circuits"Total; +5 hours

Te9t?oo#s;4icroelectronics En ineerin ! Sedra ) Smith!/ ford.&rinci les of Electronic +evices ) circuits B 6 There9a ) Sedha S Chand

+i ital Electronics H harate H / ford+i ital Electronics H 6o ic ) Systems by .Bi mell ) R.+onovan* Cambrid e 6earnin .+i ital 6o ic and State 4achine +esi n (%rd Edition" H +. .Comer? /$&Re erence;Electronic +evices ) Circuit Theory H Boyelstad ) 3ashels8y ! :Bell!6inear :C ) /& A4& / ford&.Ra9a! +i ital Electronics! Scitech &ublications4orries 4ano! +i ital 6o ic +esi n! :R.&. ain 4odern +i ital Electronics? 2;e ? 4c =raw #ill #.Taub ) +.Shillin ? +i ital :nte rated Electronics! 4c =raw #ill. +.Ray Chaudhuri! +i ital Circuits!>ol!: ) ::? 2;e! &latinum &ublishersTocci? 7idmer? 4oss! +i ital Systems? ;e! &earson

.Bi nell ) R.+onovan!+i ital Electronics!,;e! Cena e 6earnin .

6each ) 4alvino +i ital &rinci les ) A lication? ,;e? 4c =raw #ill 5loyed ) ain! +i ital 5undamentals!&earson.

8ata Structure & AlgorithmCode; CS+2'Contacts; +%


11/80



%in#ed %ist /1%0 @Sin ly lin8ed list? circular lin8ed list? doubly lin8ed list? lin8ed list re resentation of olynomial and a lications.

odule -**; 3%B %inear 8ata StructureStac# and ueue /6%0 @

Stac8 and its im lementations (usin array? usin lin8ed list"? a lications.Lueue? circular Gueue? deGueue. :m lementation of Gueue! both linear and circular (usin array? usin lin8ed list"a lications.Recursion /'%0 @&rinci les of recursion H use of stac8? differences between recursion and iteration? tail recursion.A lications ! The Tower of #anoi? Ei ht Lueens &uIIle.

odule -***. (6%B Nonlinear 8ata structuresTrees /,%0;

Basic terminolo ies? forest? tree re resentation (usin array? usin lin8ed list".Binary trees ! binary tree traversal ( re!? in!? ost! order"? threaded binary tree (left? ri ht? full" ! non!recursive traversal orithms usin threaded binary tree? e ression tree.Binary search tree! o erations (creation? insertion? deletion? searchin ".#ei ht balanced binary tree H A>6 tree (insertion? deletion with e am les only".B! Trees H o erations (insertion? deletion with e am les only".>raphs /5%0 @=ra h definitions and conce ts (directed;undirected ra h? wei hted;un!wei hted ed es? sub! ra h? de ree? cuverte ;articulation oint? endant node? cliGue? com lete ra h? connected com onents H stron ly connectcom onent? wea8ly connected com onent? ath? shortest ath? isomor hism".=ra h re resentations;stora e im lementations H ad9acency matri ? ad9acency list? ad9acency multi!list.=ra h traversal and connectivity H +e th!first search (+5S"? Breadth!first search (B5S" H conce ts of ed es used in+5S and B5S (tree!ed e? bac8!ed e? cross!ed e? forward!ed e"? a lications.

4inimal s annin tree H &rimFs al orithm (basic idea of reedy methods".odule - *:. SearchingD Sorting /(2%0;

Sorting Algorithms /6%0; Bubble sort and its o timiIations? insertion sort? shell sort? selection sort? mer e sort? Guic8sort? hea sort (conce t of ma hea ? a lication H riority Gueue"? radi sort.Searching /'%0; SeGuential search? binary search? inter olation search.Hashing /+%0; #ashin functions? collision resolution techniGues.

Recommended ?oo#s;. P+ata Structures And &ro ram +esi n :n CQ? 2;E by Robert 6. ruse? Bruce &. 6eun .

2. P5undamentals of +ata Structures of CQ by Ellis #orowitI? Sarta9 Sahni? Susan Anderson!freed.%. P+ata Structures in CQ by Aaron 4. Tenenbaum.'. +ata StructuresQ by S. 6i schutI.,. P+ata Structures $sin CQ by Reema Thare9a.-. P+ata Structure $sin CQ? 2;e by A. . Rath? A. . a adev.

. :ntroduction to Al orithmsQ by Thomas #. Cormen? Charles E. 6eiserson? Ronald 6. Rivest? Clifford Stein.

%earning outcome;:deally this course should act as a rimer; re!reGuisite for CS ,0% (+esi n and Analysis of Al orithms". /ncom letion of this course? students are e ected to be ca able of understandin the data structures? theiradvanta es and drawbac8s?ho to implement them in C ? how their drawbac8s can be overcome andhat theapplications are and here the can ?e used . Students should be able to learn about the data structures;methods;al orithms mentioned in the course with a com arative ers ective so as to ma8e use of the mosta ro riate data structure; method;al orithm in a ro ram to enhance the efficiency (i.e. reduce the run!time" orfor better memory utiliIation? based on the riority of the im lementation. +etailed time analysis of the ra hal orithms and sortin methods are e ected to be covered in CS ,0% but it is e ected that the students will beable to understand at least the efficiency as ects of the ra h and sortin al orithms covered in this course. Thestudents should be able to convert an inefficient ro ram into an efficient one usin the 8nowled e atheredfrom this course.


12/80



Computer organiGationCode; CS+2+Contacts; +% irtual memory. +ata ath desi n for read;write access. D,6

odule 1 @ D 06+esi n of control unit ! hardwired and micro ro rammed control. D%6:ntroduction to instruction i elinin . D26:ntroduction to R:SC architectures. R:SC vs C:SC architectures. D26:;/ o erations ! Conce t of handsha8in ? &olled :;/? interru t and +4A. D%6

%earning Outcome;

Additional Tutorial Hours ill ?e planned to meet the ollo ing learning outcome.

Throu h this course? the students will be e osed to e tensive develo ment and use of com uter or aniIation basedconce ts for the future 8nowled e outcome of Advanced Com uter Architecture offered in subseGuent semester. Thestudents will be able to understand different instruction formats? instruction sets? :;/ mechanism. #ardware details?memory technolo y? interfacin between the C&$ and eri herals will be trans arent to the students. Students will beable to desi n hy othetical arithmetic lo ic unit.

Te9t )oo#;. 4ano? 4.4.? PCom uter System ArchitectureQ? :.

2. BehrooI &arhami P Com uter ArchitectureQ? / ford $niversity &ress

Re erence )oo#; . #ayes . &.? PCom uter Architecture ) /r anisationQ? 4c=raw #ill? 2. #amacher? PCom uter /r anisationQ? 4c=raw #ill? %. 3. senthil umar? 4. Saravanan? S. eevananthan? P4icro rocessors and 4icrocontrollersQ /$& '. Chaudhuri &. &al? PCom uter /r anisation ) +esi nQ? :? ,. & 3 Basu! PCom uter /r aniIation ) ArchitectureQ ? >i8as &ub

2


13/80



$ractical

$h sica %a?-'Code; $H-+,(Contacts; /+$0Credit; /'0=rou @ E eriments on Electricity and 4an entism

. +etermination of dielectric constant of a iven dielectric material.%. +etermination of resistance of ballistic alvanometer by half deflection method and study of variation of lo arithmic

decrement with series resistance.'. +etermination of the thermo!electric ower at a certain tem erature of the iven thermocou le.,. +etermination of s ecific char e (e;m" of electron by . . ThomsonFs method.=rou 2@ Luantum &hysics-. +etermination of &lanc8Fs constant usin hotocell.

. +etermination of 6andeF factor usin Electron s in resonance s etrometer.1. +etermination of StefanFs radiation constant

. >erification of BohrFs atomic orbital theory throu h 5ran8!#ertI e eriment.0. +etermination of Rydber constant by studyin #ydro en; #elium s ectrum

=rou %@ 4odern &hysics. +etermination of #all co!efficient of semiconductors.

2. +etermination of band a of semiconductors.%. To study current!volta e characteristics? load res onse? areal characteristics and s ectral res onse of hoto voltai

solar cells.

a" A candidate is reGuired to erform % e eriments ta8in one from each rou . :nitiative should be ta8en so that mos

of the E eriments are covered in a colle e in the distribution mentioned above. Em hasis should be iven on theestimation of error in the data ta8en.

b" :n addition a student should erform one more e eriments where he;she will have to transduce the out ut of any ofthe above e eriments or the e eriment mentioned in c into electrical volta e and collect the data in a com uter usin hoeni or similar interface.

c" :nnovative e eriment@ /ne more e eriment desi ned by the student or the concerned teacher or both.

3ote@5ailure to erform each e eriment mentioned in b and c should be com ensated by two e eriments mentioned in

the above list.At the end of the semester re ort should sent to the board of studies re ardin e eriments? actually erformed by the

colle e? mentioned in b and cE eriment in b and c can be cou led and arts of a sin le e eriment.

Recommended Te t Boo8s and Reference Boo8s@

5or Both &hysics : and ::. B. +utta Roy (Basic &hysics"

2. R. . ar (En ineerin &hysics"%. 4ani and 4eheta (4odern &hysics"'.. Arthur Baiser (&ers ective ) Conce t of 4odern &hysics"

&hysics : ( 0 ;20 ">ibration and 7aves

in sler and 5rey+.&. Roychaudhury 3. . Ba9a9 (7aves and /scillations"

. Bhattacharya

%


14/80



R.&. Sin h ( &hysics of /scillations and 7aves"A.B. =u ta (Colle e &hysics >ol.::"Chatto adhya and Ra8shit (>ibration? 7aves and Acoustics"

/ tics4Mler (&hysical / tics"A. . =hata8 E. #echt (/ tics"E. #echt (Schaum Series"5.A. en8ins and #.E. 7hite-. Chita Ran9an +as u ta ( +e ree &hysics >ol %"

Luantum &hysicsEisber and Resnic8

A. . =hata8 and S. 6o8enathanS.3. =hoshal (:ntroductory Luantum 4echanics"E.E. Anderson (4odern &hysics"#aliday? Resnic8 and Crane (&hysics vol.:::"Binaya8 +utta Roy DElements of Luantum 4echanics

Crystallo ra hy. S./. &illai (a. Solid state hysics b. &roblem in Solid state hysics"

2. A. . +e88er %. Aschroft and 4ermin'. Ali /mar ,. R.6. Sin hal-. a8 Tareen and Trn utty (Basic course in Crystallo ra hy

6aser and #olo ra hyA. . =hata8 and Thya ara9an (6aser"Tarasov (6aser"&. . Cha8raborty (/ tics"B. =hosh and .=. 4a9umder (/ tics"B.B. 6aud (6aser and 3on!linear / tics"Bhattacharyya DEn ineerin &hysics / ford

&hysics ::( %0 "

Classical 4echanics (5or 4odule ,. in %0 "#. =oldstein

A. . RoychaudhuriR.=. Ta8wal and &.S. &urani8 Rana and oa4. S ei el (Schaum Series"

.C. $ adhya (4echanics"

Electricity and 4a netismReitI? 4ilford and Christy+avid . =riffith+. Chatto adhyay and &.C. Ra8shitShadowitI (The Electroma netic 5ield"

Luantum 4echanicsEisber and Resnic8 A. . =hata8 and S. 6o8enathanS.3. =hoshal (:ntroductory Luantum 4echanics"E.E. Anderson (4odern &hysics"

'


15/80



#aliday? Resnic8 and Crane (&hysics vol.:::"Binaya8 +utta Roy DElements of Luantum 4echanics

Statistical 4echanicsSears and Sallin er ( inetic Theory? Thermodynamics and Statistical Thermodynamics"4ondal (Statistical &hysics"S.3. =hoshal ( Atomic and 3uclear &hysics"Sin h and Sin hB.B. 6aud (Statistical 4echanics"5. Reif (Statistical 4echanics"

+ilectricsBhattacharyya DEn ineerin &hysics / ford

Analog & 8igital ElectronicsCode; CS+,(Contact; +Cr; '

ANA%O>; At least an t o o the ollo ing

. +esi n a Class A am lifier 2. +esi n a &hase!Shift /scillator %. +esi n of a Schmitt Tri er usin ,,, timer.

8*>*TA% ; At least an i7e o the ollo ing

. +esi n a 5ull Adder usin basic ates and verify its out ut ; +esi n a 5ull Subtractor circuit usin basic atesand verify its out ut.2. Construction of sim le +ecoder ) 4ulti le er circuits usin lo ic ates.%. RealiIation of RS ; ; + fli flo s usin lo ic ates.'. +esi n of Shift Re ister usin ! ; + 5li 5lo .,. RealiIation of Synchronous $ ;+own counter.-. +esi n of 4/+! 3 Counter

. Study of +AC .

Any one e eriment s ecially desi ned by the colle e.

(+etailed instructions for 6aboratory 4anual to follow for further uidance. The details will be u loaded in the websitefrom time to time"

8ata Structure & AlgorithmCode; CS+,'Contacts; +Credits; '

E eriments should include but not limited to @

:m lementation of array o erations@

Stac8s and Lueues@ addin ? deletin elements Circular Lueue@ Addin ) deletin elements 4er in &roblem @

Evaluation of e ressions o erations on 4ulti le stac8s ) Gueues @

:m lementation of lin8ed lists@ insertin ? deletin ? invertin a lin8ed list. :m lementation of stac8s ) Gueues

usin lin8ed lists@

,


16/80



&olynomial addition? &olynomial multi lication

S arse 4atrices @ 4ulti lication? addition.

Recursive and 3onrecursive traversal of Trees

Threaded binary tree traversal. A>6 tree im lementation

A lication of Trees. A lication of sortin and searchin al orithms

#ash tables im lementation@ searchin ? insertin and deletin ? searchin ) sortin techniGues.

(+etailed instructions for 6aboratory 4anual to follow for further uidance. The details will be u loaded in the websitefrom time to time"

Computer organiGationCode; CS+,+Contacts; +Credits; '

. 5amiliarity with :C!chi s? e. .a" 4ulti le er ? b" +ecoder? c" Encoder b" Com arator

Truth Table verification and clarification from +ata!boo8.2. +esi n an Adder;Subtractor com osite unit .%. +esi n a BC+ adder.'. +esi n of a VCarry!6oo8!AheadF Adder circuit.

,. $se a multi le er unit to desi n a com osite A6$ .-. $se A6$ chi for multibit arithmetic o eration.. :m lement read write o eration usin RA4 :C.

1. (a" ) (b" Cascade two RA4 :Cs for vertical and horiIontal e ansion.(+etailed instructions for 6aboratory 4anual to follow for further uidance. The details will be u loaded in the websitefrom time to time"

SE ESTER - *:

Theor

N4 ER*CA% ETHO8SCode; /CS0 12(Contacts; '%


17/80



3umerical solution of ordinary differential eGuation@ EulerFs method? Run e! utta methods? &redictor!Correctormethods and 5inite +ifference method. (-"

Te t Boo8s@. C.Wavier@ C 6an ua e and 3umerical 4ethods.

2. +utta ) ana@ :ntroductory 3umerical Analysis.%. .B.Scarborou h@ 3umerical 4athematical Analysis.'. ain? :yen ar ? ) ain@ 3umerical 4ethods (&roblems and Solution".

References@. Bala urusamy@ 3umerical 4ethods? Scitech.

2. Baburam@ 3umerical 4ethods? &earson Education.%. 3. +utta@ Com uter &ro rammin ) 3umerical Analysis? $niversities &ress.'. Soumen =uha ) Ra9esh Srivastava@ 3umerical 4ethods? /$&.,. Srimanta &al@ 3umerical 4ethods? /$&.

Su?Iect Name; ATHE AT*CS

Code; 12(

Contacts; +%


18/80



odule *: Ad&anced Gra%h Theor": &lanar and +ual =ra hs. uratows8iFs ra hs. #omeomor hic ra hs. Eulers formula ( n ! e< r J 2" for connected lanar ra h and its eneralisation for ra hs with connected com onents. +etection of lanarity.=ra h colourin . Chromatic numbers of Cn? n ? m?nand other sim le ra hs. Sim le a lications of chromaticnumbers. $ er bounds of chromatic numbers (Statements only". Chromatic olynomial. Statement of four and fivecolour theorems./ (2% 0

odule : Alge#raic $tructures ; =rou ? Sub rou ? Cyclic rou ? &ermutation rou ? Symmetric rou ( S%"? Coset? 3ormalsub rou ? Luotient rou ? #omomor hism ) :somor hism( Elementary ro erties only".+efinition of Rin ? 5ield? :nte ral +omain and sim le related roblems./ ('%0Te't Books: . Baner9ee A.? +e S. . and Sen S.@ 4athematical &robability? $.3. +hur ) Sons.

2. =u ta S. C and a oor > @ 5undamentals of 4athematical Statistics? Sultan Chand ) Sons.%. 4a a S. . @#i her Al ebra (Abstract ) 6inear"? Sarat Boo8 +istributors.'. Sen 4. .? =hosh S. and 4u8ho adhyay &.@ To ics in Abstract Al ebra? $niversity &ress.,. 7est +.B.@ :ntroduction to =ra h Theory? &rentice #all.

(eferences: . Babu Ram@ +iscrete 4athematics? &earson Education.2. Bala8rishnan@ =ra h Theory (SchaumFs /utline Series"? T4#.%. Cha8raborty S. and Sar8ar B. .@ +iscrete 4athematics? /$&.

'. +as 3.=.@ Statistical 4ethods? T4#.,. +eo 3@ =ra h Theory with A lications to En ineerin and Com uter Science? &rentice #all.-. hanna >. and Bhambri S. . @ A Course in Abstract Al ebra? >i8as &ublishin #ouse.

. S ie el 4 R.? Schiller . . and Srinivasan R.A. @ &robability and Statistics (SchaumUs /utline Series"? T4#.1. 7ilson@ :ntroduction to ra h theory? &earson Edication.

Communication Engineering & Coding TheorCode; CS12(Contacts; +%Credits; +

4odule ! ; Elements of )ommunication s"stem* Analog +odulation , !emodulation* oise* $ ( Analog-to-8igital Con7ersion . (Basic ideas in brief" D1D+etails@ :ntroduction to Base Band transmission ) 4odulation (basic conce t"./L01 Elements of Communicationsystems (mention of transmitter? receiver and channel"* ori in of noise and its effect? :m ortance of S3R in systemdesi n./L01 Basic rinci les of 6inear 4odulation (Am litude 4odulation"./L01 Basic rinci les of 3on!linearmodulation (An le 4odulation ! 54? &4"./L01 Sam lin theorem? Sam lin rate? :m ulse sam lin ? Reconstructionfrom sam les? Aliasin./L01 Analo &ulse 4odulation ! &A4 (3atural ) flat to ed sam lin "? &74? &&4./L01Basic conce t of &ulse Code 4odulation? Bloc8 dia ram of &C4./L01 4ulti le in ! T+4? 5+4 ./L01

4odule ! 2; 8igital Transmission; D1D+etails@ Conce t of Luantisation ) Luantisation error? $niform Luantiser./L01 3on!uniform Luantiser? A!law ) Ylaw com andin (mention only"./L01 Encodin ? Codin efficiency./L01 6ine codin ) ro erties? 3RZ ) RZ?

A4:? 4anchester codin &C4? +&C4./L01 Baseband &ulse Transmission? 4atched filter (mention of its im ortance

and basic conce t only"? Error rate due to noise.2L01 :S:? Raised cosine function? 3yGuist criterion for distortion!less base!band binary transmission? Eye attern? Si nal ower in binary di ital si nals.2L01

4odule ! %; 8igital Carrier odulation & 8emodulation Techni@ues; D1

1


19/80



D+etails@ Bit rate? Baud rate./L01 :nformation ca acity? ShanonFs limit./L01 4!ary encodin ? :ntroduction to thedifferent di ital modulation techniGues ! AS ? 5S ? &S ? B&S ? L&S ? mention of 1 B&S ? - B&S.2L01:ntroduction to LA4? mention of 1LA4? - LA4 without elaboration./L01 +elta modulation? Ada tive deltamodulation (basic conce t and im ortance only? no details./L01 introduction to the conce t of +&C4? +elta4odulation? Ada tive +elta modulation and their relevance./L01 S read S ectrum 4odulation ! conce t only../L0 .

4odule ! ' ; *n ormation Theor & Coding @ D1D+etails@ :ntroduction? 3ews value ) :nformation content./L01 ? Entro y./L01 ? 4utual information./L01 ? :nformationrate ./L01 ? Shanon!5ano al orithm for encodin./L01 ? ShannonUs Theorem ! Source Codin Theorem./L01 ? ChannelCodin Theorem? :nformation Ca acity Theorem (basic understandin only"./L01 * Error Control ) Codin ! basic rinci le only../L01

Te t Boo8s@. An :ntroduction to Analo and +i ital Communications by Simon #ay8in* &ublished by 7iley :ndia.

2. +ata Communication and 3etwor8in by BehrouI A. 5orouIan? &ublished by Tata 4c=raw!#illReferences@

. Communication Systems 'th Edition by Simon #ay8in* &ublished by 7iley :ndia (Student Edition"2. &rinci les and Analo and +i ital Communication by erry + =ibson? &ublished by 4ac4illan.%. Communication Systems by A. B. Carlson? &ublished by 4c=raw!#ill.'. $nderstandin Si nals and Systems by ac8 =olten? &ublished by 4c=raw #ill.

%earning Outcome @ DThese are the minimum com etence to be develo ed* the students will be encoura ed to learnmore and acGuire better understandin .4odule ! @ The student will be able to differentiate between base!band transmission and modulation andcomputeantenna siGe from 8nowled e of carrier freGuency* (Tutorial@ To identify different communication rocesses based onthese two methods and a reciate their relative merit and demerit"* The learner will be able todetermine the carrier

and message re@uencies from the e ression for A4 si nals and An le modulated si nals. =iven an e ression for amodulated si nal? the student must be able torecogniGe the t pe o modulation . The ability to e lain each and every bloc8 of the &C4 system must be acGuired.

4odule !2@ The student must be able to a reciate the im ortance of di ital modulation over analo modulation inres ect of noise immunity (conce t"* The student will be able to com ute the codin efficiency of binary and decimalcodin systems* The relative merits and demerits of the different di ital modulation techniGues to be understood clearly*(Tutorial@ Students should be encoura ed to find out where these different modulation techniGues are used in everydaylife"* Ca ability to calculate si nal ower in di ital systems to be mastered.

4odule !%@ Ability to com ute bit rate and baud rate for different si nals to be develo ed* the student must be able tocom are between the channel ca acity in case of channels of varyin band!width and S3R value and redict thema imum data rate ossible* The learner must be able to com are the merits and short comin s of the basic di ital

modulation techniGues. (Tutorial@ 5ind out the area of a lication for each with reason for such a lication"4odule !'@ Student will be able to calculate the information content? entro y and information rate for iven situations*#e;she will be able to a reciate the im ortance of the different line codin and error codin techniGues. (Tutorial@ 5inout the ran e of a licability".

Formal %anguage & Automata TheorCode; CS12'Contacts; +%


20/80



5undamentals@ Basic definition of seGuential circuit? bloc8 dia ram? mathematical re resentation? conce t of transititable and transition dia ram (Relatin of Automata conce t to seGuential circuit conce t" +esi n of seGuencedetector? :ntroduction to finite state model D 265inite state machine@ +efinitions? ca ability ) state eGuivalent? 8th! eGuivalent conce t D 64er er ra h? 4er er table? Com atibility ra h D 65inite memory definiteness? testin table ) testin ra h. D 6+eterministic finite automaton and non deterministic finite automaton. D 6 Transition dia rams and 6an ua ereco niIers. D 65inite Automata@ 35A with [ transitions ! Si nificance? acce tance of lan ua es. D 6Conversions and EGuivalence@ EGuivalence between 35A with and without [ transitions. 35A to +5A conversion.D264inimiIation of 5S4? EGuivalence between two 5S4Fs ? 6imitations of 5S4 D 6A lication of finite automata? 5inite Automata with out ut! 4oore ) 4elay machine. D26

%earning outcome o Finite Automata;The student will be able to define a system and reco niIe the behavior of a system. They will be able to minimiIe asystem and com are different systems.

odule-'; %BRe ular 6an ua es @ Re ular sets. D 6Re ular e ressions? identity rules. ArdenFs theorem state and rove D 6Constructin finite Automata for a iven re ular e ressions? Re ular strin acce ted by 35A;+5A D 6&um in lemma of re ular sets. Closure ro erties of re ular sets ( roofs not reGuired". D 6=rammar 5ormalism@ Re ular rammars!ri ht linear and left linear rammars. D 6EGuivalence between re ular linear rammar and 5A. D 6:nter conversion? Conte t free rammar. D 6+erivation trees? sentential forms. Ri ht most and leftmost derivation of strin s. (Conce t only" D 6

%earning outcome o Regular %anguages and >rammar;Student will convert 5inite Automata to re ular e ression. Students will be able to chec8 eGuivalence between re ularlinear rammar and 5A.

odule-+; ,%BConte t 5ree =rammars? Ambi uity in conte t free rammars. D 64inimiIation of Conte t 5ree =rammars. D 6Choms8y normal form and =reibach normal form. D 6&um in 6emma for Conte t 5ree 6an ua es. D 6Enumeration of ro erties of C56 ( roofs omitted". Closure ro erty of C56? / denFs lemma ) its a lications D 6&ush +own Automata@ &ush down automata? definition. D 6Acce tance of C56? Acce tance by final state and acce tance by em ty state and its eGuivalence. D 6

EGuivalence of C56 and &+A? interconversion. (&roofs not reGuired". D 6:ntroduction to +C56 and +&+A. D 6

%earning outcome o $8A and conte9t ree grammar;Students will be able to minimiIe conte t free rammar. Student will be able to chec8 eGuivalence of C56 and &+A.They will be able to desi n Turin 4achine.

odule-1; 5%BTurin 4achine @ Turin 4achine? definition? model D 6+esi n of T4? Com utable functions D 6ChurchFs hy othesis? counter machine D 6Ty es of Turin machines ( roofs not reGuired" D 6$niversal Turin 4achine? #altin roblem D26

%earning outcome o Turing achine ;Students will be able to desi n Turin machine.

20


21/80



TEJT )OOKS;

P:ntroduction to Automata Theory 6an ua e and Com utationQ? #o croft #.E. and $llman . +.? &earsonEducation.

PTheory of Com uter Science P? Automata 6an ua es and com utationQ? 4ishra and Chandrashe8aran? 2nd edition?:.

P5ormal 6an ua es and Automata TheoryQ? C. .3a al? / ford

REFERENCES;2. PSwitchin ) 5inite AutomataQ? Z>: ohavi? 2nd Edn.? Tata 4c=raw #ill2.2 P:ntroduction to Com uter TheoryQ? +aniel :.A. Cohen? ohn 7iley2.% P:ntroduction to lan ua es and the Theory of Com utationQ? ohn C 4artin? T4#2.' PElements of Theory of Com utationQ? 6ewis #.&. ) &a adimitrou C.#. &earson? :.

Computer ArchitectureCode; CS12+Contacts; +%6: rocessor architectures. Array and vector rocessors. (-6"

4odule H '@ D 2 64ulti rocessor architecture@ ta onomy of arallel architectures* CentraliIed shared! memory architecture@

synchroniIation? memory consistency? interconnection networ8s. +istributed shared!memory architecture. Clustercom uters. (16"

3on von 3eumann architectures@ data flow com uters? reduction com uter architectures? systolic architectures. ('6"

6earnin /utcome@This course is a formidable rereGuisite for the course / eratin System to be offered in the subseGuent semester.Te t boo8s@ DTo be detailed

$ractical

Technical Report "riting & %anguage %a? $racticeCode; H41 (

Cr-'

>uidelines or Course E9ecution;

2


22/80



O?Iecti7es o this Course; This course has ?een designed;

(. To inculcate a sense o con idence in the students.'. To help them ?ecome good communicators ?oth sociall and pro essionall .+. To assist them to enhance their po er o Technical Communication. +etailed Course /utlines@

A. Technical (e%ort 3riting @ 26


23/80


24/80



h" 5li ht reservation system.

i" Boo8sho automation software. 9" Time mana ement software.

Computer ArchitectureCode ; CS 1,'Contacts ; +%Credits ;'

All laboratory assi nments are based on #ardware +escri tion 6an ua e (>#+6 or >erilo " Simulation.D&re!reGuisite@ The hardware based desi n has been done in the Analo ) +i ital Electronics laboratory and Com ute/r anisation laboratory

. #+6 introduction

2. Basic di ital lo ic base ro rammin with #+6%. 1!bit Addition? 4ulti lication? +ivision'. 1!bit Re ister desi n,. 4emory unit desi n and erform memory o eratons.-. 1!bit sim le A6$ desi n

. 1!bit sim le C&$ desi n1. :nterfacin of C&$ and 4emory

2'


25/80



SE ESTER :

TheorEconomics or EngineersH4-62(Contracts; +%Credits- +

odule-*. Economic +ecisions 4a8in H /verview? &roblems? Role? +ecision ma8in rocess.

2. En ineerin Costs ) Estimation H 5i ed? >ariable? 4ar inal ) Avera e Costs? Sun8 Costs? / ortunity Costs? Recurrin And 3onrecurrin Costs? :ncremental Costs? Cash Costs vs Boo8 Costs? 6ife!Cycle Costs* Ty es /f Estimate? Estimatin 4odels ! &er!$nit 4odel? Se mentin 4odel? Cost :nde es? &ower!SiIin 4odel? :m rovement ) 6earnin Curve? Benefits.

odule-**%. Cash 5low? :nterest and EGuivalence@ Cash 5low H +ia rams? Cate ories ) Com utation? Time >alue of 4oney? +ebt re aymen 3ominal ) Effective :nterest.'. Cash 5low ) Rate /f Return Analysis H Calculations? Treatment of Salva e >alue? Annual Cash 5low Analysis? Analysis &eriods*:nternal Rate /f Return? Calculatin Rate of Return? :ncremental Analysis* Best Alternative Choosin An Analysis 4ethod? 5uture7orth Analysis? Benefit!Cost Ratio Analysis? Sensitivity And Brea8even Analysis. Economic Analysis :n The &ublic Sector !Luantifyin And >aluin Benefits ) drawbac8s.

odule-***,. :nflation And &rice Chan e H +efinition? Effects? Causes? &rice Chan e with :nde es? Ty es of :nde ? Com osite vs Commod:nde es? $se of &rice :nde es :n En ineerin Economic Analysis? Cash 5lows that inflate at different Rates.-. &resent 7orth Analysis@ End!/f! ear Convention? >iew oint /f Economic Analysis Studies? Borrowed 4oney >iew oint? Effect/f :nflation ) +eflation? Ta es? Economic Criteria? A lyin &resent 7orth TechniGues? 4ulti le Alternatives.

. $ncertainty :n 5uture Events ! Estimates and Their $se in Economic Analysis? Ran e /f Estimates? &robability? oint &robability+istributions? E ected >alue? Economic +ecision Trees? Ris8? Ris8 vs Return? Simulation? Real / tions.

odule-*:

1. +e reciation ! Basic As ects? +eterioration ) /bsolescence? +e reciation And E enses? Ty es /f &ro erty? +e reciationCalculation 5undamentals? +e reciation And Ca ital Allowance 4ethods? Strai ht!6ine +e reciation +eclinin Balance+e reciation? Common Elements /f Ta Re ulations 5or +e reciation And Ca ital Allowances.

. Re lacement Analysis ! Re lacement Analysis +ecision 4a ? 4inimum Cost 6ife of a 3ew Asset? 4ar inal Cost? 4inimum Cost6ife &roblems.

0. Accountin H 5unction? Balance Sheet? :ncome Statement? 5inancial Ratios Ca ital Transactions? Cost Accountin ? +irect an:ndirect Costs? :ndirect Cost Allocation.

(eadings . ames 6.Ri s?+avid +. Bedworth? Sabah $. Randhawa @ Economics for En ineers 'e ? Tata 4c=raw!#ill 2. +onald 3ewnan? Ted Eschembach? erome 6avelle @ En ineerin Economics Analysis? /$& %. ohn A. 7hite? enneth E.Case?+avid B.&ratt @ &rinci le of En ineerin Economic Analysis? ohn 7iley '. Sullivan and 7ic8s@ En ineerin Economy? &earson ,. R.&aneer Seelvan@ En ineerin Economics? : -. 4ichael R 6indebur @ En ineerin Economics Analysis? &rofessional &ub

8esign & Anal sis o AlgorithmCode; CS62(Contact; +% < (TCredits; 1

Complexity Analysis: D26 Time and S ace Com le ity? +ifferent Asym totic notations H their mathematical si nificance

Algortihm Design Techniques: +ivide and ConGuer@ D%6 Basic method? use? E am les H Binary Search? 4er e Sort? Luic8 Sort and their com le ity. #ea Sort and its com le ity D 6 +ynamic &ro rammin @ D%6 Basic method? use? E am les H 4atri Chain 4ani ulation? All air shortest aths? sin le source shortest ath. Bac8trac8in @ D Basic method? use? E am les H 1 Gueens roblem? =ra h colorin roblem. =reedy 4ethod@ D%6 Basic method? use? E am les H na sac8 roblem? ob seGuencin with deadlines? 4inimum cost s annin ree by &rimFs and

rus8alFs al orithm.

2,


26/80



Lower ound Theory: D 6

/(nl n" bound for com arison sort

Dis!oint set manipulation: D26 Set mani ulation al orithm li8e $3:/3!5:3+? union by ran8.

"raph tra#ersal algorithm: $ecapitulation D 6 Breadth 5irst Search(B5S" and +e th 5irst Search(+5S" H Classification of ed es ! tree? forward? bac8 and

cross ed es H com le ity and com arison

%tring matching problem: D%6 +ifferent techniGues H 3aive al orithm? strin matchin usin finite automata? and nuth? 4orris? &ratt ( 4&" al orithm withtheir com le ities.

Amorti&ed Analysis: D%6 A re ate? Accountin ? and &otential 4ethod.

'etwor( )low: D%6 5ord 5ul8erson al orithm? 4a !5low 4in!Cut theorem (Statement and :llustration"

*atrix *anipulation Algorithm: D%6 StrassenFs matri mani ulation al orithm* a lication of matri multi lication to solution of simultaneous

linear eGuations usin 6$& decom osition? :nversion of matri and Boolean matri multi lication

'otion of '+-completeness: D%6 & class? 3& class? 3& hard class? 3& com lete class H their interrelationshi ? Satisfiability roblem? Coo8Fs

theorem (Statement only"? CliGue decision roblem

Approximation Algorithms: D%6 3ecessity of a ro imation scheme? erformance uarantee? olynomial time a ro imation schemes?

verte cover roblem? travellin salesman roblem.

Te t Boo8@. T. #. Cormen? C. E. 6eiserson? R. 6. Rivest and C. Stein? P:ntroduction to Al orithmsQ

2. A. Aho? .#o croft and .$llman PThe +esi n and Analysis of Al orithmsQ

+.E. nuth PThe Art of Com uter &ro rammin Q? >ol. %

on leiber and Eva Tardos? \Al orithm +esi n\

Reference@2., .4ehlhorn ? P+ata Structures and Al orithmsQ ! >ol. : ) >ol. 2.2.- S.Baase PCom uter Al orithmsQ

2. E.#orowitI and Shani P5undamentals of Com uter Al orithmsQ2.1 E.4.Rein old? .3iever elt and 3.+eo! PCombinational Al orithms! Theory and &racticeQ? &rentice #all?

icroprocessors & icrocontrollersCode; CS62'Contact; +% < (TCredits; 1

odule -( @ %B:ntroduction to 4icrocom uter based system. #istory of evolution of 4icro rocessor and 4icrocontrollers and their advanta es anddisadvanta es. D 6Architecture of 101, 4icro rocessor? &in descri tion of 101,. D26Address;data bus +emulti le in ? Status Si nals and the control si nals. D 6:nstruction set of 101, micro rocessor? Addressin modes? D%6

Timin dia ram of the instructions (a few e am les". D 6odule -' @ ,%B

Assembly lan ua e ro rammin with e am les? Counter and Time +elays?

2-


27/80



Stac8 and Subroutine? D-6:nterru ts of 101, rocessor(software and hardware"? :;/ +evice :nterfacin !:;/ 4a ed :;/ and 4emory 4a ed :;/ ? Serial (usinS:+ and S/+ ins and R:4? S:4 :nstructions" and &arallel data transfer?

D%6

odule +; (2%BThe 101- micro rocessor! Architecture? Addressin modes? :nterru ts D%6:ntroduction to 10, 4icrocontroller HArchitecture? &in +etails. D%6Addressin modes? :nstruction set? E am les of Sim le Assembly 6an ua e. D'6

odule -1; ,%B4emory interfacin with 101,? 101- D26Su ort :C chi s! 12,, ?12, ?12% ;12, ?12, D'6:nterfacin of 12,, &&: with 101, and 4icrocontroller 10, . D26Brief introduction to &:C microcontroller ( -51 " D 6

%earning Outcome;Additional Tutorial Hours ill ?e planned to meet the ollo ing learning outcome.

Throu h this course? the students will be e osed to hardware details of 101, micro rocessor with the related si nals and theirim lications. They will also learn ro rammin and interfacin of 101,. The students will understand the difference between thearchitecture of 101, and 101-. They will also be aware of the 10, architecture and its ro rammin . 6astly the students will have a basic idea on &:C microcontroller ( -51 "

TEWTS @. 4icro rocessors and microcontrollers ! 3. Senthil umar? 4. Saravanan and eevananthan

(/ ford university ress"2. 10, 4icrocontroller H . Ayala (Cen a e learnin "%. 4:CR/&R/CESS/R architecture? ro rammin and A lication with 101, ! R.=aon8ar (&enram international &ublishin 6T+."'.4icrocontrollers@&rinci les)A lications ? A9it &al? : 20 .,.3aresh =rover? P4icro rocessor com rehensive studies Architecture? &ro rammin and :nterfacin Q+han at Rai? 200%-. 10, 4icro rocessor H>. $dayashan8ara and 4.S 4alli8ar9unaswami (T4#".

. 4icro rocessor 101, and its :nterfacin S 4athur (:"1. An :ntroduction to 4icro rocessor and A lications H rishna ant (4acmillan"

Reference@. 101- 4icro rocessor H Ayala (Cen a e learnin "

2. The 101, 4icro rocessor? Architecture? &ro rammin and :nterfacin ! $day umar? B .S$mashan8ar (&earson"%. The W!1- &C Assembly lan ua e? +esi n and :nterfacin ! 4aIidi? 4aIidi and Causey (&EARS/3"'. The 10, microcontroller and Embedded systems ! 4aIidi? 4aIidi and 4c inley (&EARS/3",. 4icro rocessors H The 101-;1011? 10 1-;10%1-;10'1- and the &entium family H 3. B. Bahadure (:".-. The 10, microcontrollers H $ma Rao and Andhe &allavi (&EARS/3".

8iscrete athematicsCode; CS62+Contact; +%Credits; +4odule :@ :ntroduction to &ro ositional Calculus@ &ro ositions? 6o ical Connectives? Con9unction? +is9unction? 3e ation and thetruth table. Conditional Connectives? :m lication? Converse? Contra ositive? :nverse? Biconditional statements with truth table?6o ical EGuivalence? Tautolo y? 3ormal forms!C35? +35* &redicates and 6o ical Luantifications of ro ositions and relatede am les. 064odule ::@ Theory of 3umbers@ 7ell /rderin &rinci le? +ivisibility theory and ro erties of divisibility* 5undamental theorem ofArithmetic* Euclidean Al orithm for findin =.C.+ and some basic ro erties of =.C.+ with sim le e am les* Con ruences?

Residue classes of inte er modulo( "nn ,

and its e am les./rder? Relation and 6attices@ &/SET? #asse +ia ram? 4inimal ?4a imal? =reatest and 6east elements in a &/SET? 6attices and its ro erties? &rinci le of +uality? +istributive and Com lemented6attices. 064odule :::@ Countin TechniGues@ &ermutations? Combinations? Binomial coefficients? &i eon! hole &rinci le? &rinci les of inc

and e clusions* Recurrence relations@ 5ormulation;4odellin of different countin roblems in terms of recurrence relations?Solution of linear recurrence relations with constant coefficients ( u to second order" by (i" The iterative method (ii" Characteristicroots method (iii" =eneratin functions method. 06

2


28/80



4odule :>@ =ra h Colorin @ Chromatic 3umbers and its bounds? :nde endence and CliGue 3umbers? &erfect =ra hs!+efinition ande am les? Chromatic olynomial and its determination? A lications of =ra h Colorin .4atchin s@ +efinitions and E am les of &erfect 4atchin ? 4a imal and 4a imum 4atchin ? #allFs 4arria e Theorem (Statementonly" and related roblems. -Te ts@

. Russell 4erris? Combinatorics? 7iley!:nterscience series in +iscrete 4athematics and / timisation2. 3. Chandrase8aran and 4. $ma arvathi? +iscrete 4athematics? :%. =ary #a ard? ohn Schli f and Sue 7hitesides? +iscrete 4athematics for Com uter Science? CE3=A=E 6earnin'. =ary Chartrand and &in Zhan H :ntroduction to =ra h Theory? T4#Re erences;

1. . . Sharma? +iscrete 4athematics? 4acmillan. 7infried arl =rassmann and ean!&aul Tremblay? 6o ic and +iscrete 4athematics? &EARS/3.0. S. . Cha8raborty and B. . Sar8ar? +iscrete 4athematics? /W5/R+ $niversity &ress.

. +ou las B. 7est? :ntroduction to ra h Theory? :

Free Electi7eCircuit Theor & Net or# Code; CS621AContact; +% < (TCredits; 1

4odule Content #rs. a0 (esonant )ircuits @ Series and &arallel resonance D 6 ? (]" 4m%edance and Admittance )haracteristics*

ualit" actor* Half Power Points* Bandwidth F2L * Phasor diagrams* Transform diagrams F/L * Practical resonant and series circuits* $olution of Pro#lems FTutorial - /L .?0 esh Current Net or# Anal sis @ irchoffFs >olta e law? 5ormulation of mesh eGuations D 6 ?Solution of mesh eGuations by CramerFs rule and matri method D26 ? +rivin oint im edance? Transferim edance D 6 ? Solution of roblems with +C and AC sources D 6 .

'

-

2. a0 Node :oltage Net or# Anal sis @ irchoffFs Current law? 5ormulation of 3ode eGuations and solutionsD26 ? drivin oint admittance? transfer Admittance D 6 ? Solution of roblems with +C and AC sourcesD 6 .?0 Net or# Theorems @ +efinition and :m lication of Su er osition Theorem D 6 ? TheveninFs theorem? 3ortonFs theorem D 6 ? Reci rocity theorem? Com ensation theorem D 6 ? ma imum &ower Transfertheorem D 6 ? 4illmanFs theorem? Star delta transformations D 6 ? Solutions and roblems with +C andAC sources D 6 .

'

-

%. Gra%h of etwork @ Conce t of Tree and Branch D 6 ? tree lin8? 9unctions?. 0 4ncident matri'* Tie setmatri' F2L * !etermination of loo% current and node &oltages F2L .Coupled Circuits @ 4a netic cou lin ? olarity of coils? olarity of induced volta e? conce t of Self andmutual inductance? Coefficient of cou lin ? Solution of &roblems.Circuit transients @ +C transients in R!6 and R!C Circuits with and without initial char e?. 0 (-L-))ircuits* A) Transients in sinusoidal (-L* (-) and (-L-) )ircuits* $olution of Pro#lems F2L 5

'

'

2

'. %aplace trans orm @ Conce t of Com le freGuency D 6 ? transform of f(t" into 5(s" D 6 ? transform ofste ? e onential? over dam ed sur e? critically dam ed sur e? dam ed and un!dam ed sine functions D26 ?

ro erties of 6a lace transform D 6 ? linearity? real differentiation? real inte ration? initial value theoremand final value theorem D 6 ? inverse 6a lace transform D 6 ? a lication in circuit analysis? &artialfraction e ansion? #eavisideFs e ansion theorem? Solution of roblems D 6 .. 0 La%lace transform and 4n&erse La%lace transform F2L .T o $ort Net or#s @ Relationshi of Two ort networ8 variables? short circuit admittance arameters?o en circuit im edance arameters? transmission arameters? relationshi between arameter sets? networ8functions for ladder networ8 and eneral networ8.

1

'

/ld module viI. S&:CE deleted for consideration in Sessional Sub9ect.

$ro?lems or odule (a; E9. ( . A arallel R6C Circuit has RJ 00 /hms? 6J 0 m#? CJ 0 n5. 5ind resonant freGuency? bandwidth and Luality factor.E9. '. Two coils one of RJ 0., /hms?6J %2 m#? other of RJ .% /hms? 6J , m#? and two ca acitors of 2, micro 5 and -2 micro5 are in series with a resistance of 0.2' /hms. +etermine resonance freGuency and L of each coil.E9. +. :n a series circuit with RJ ,0 /hms? lJ 0.0, /hms and CJ 20 micro 5? freGuency of the source is varied till the volta e acrossthe ca acitor is ma imum. :f the a lied volta e is 00 >? find the ma imum volta e across the ca acitor and the freGuency at whithis occurs. Re eat the roblem with RJ 0 /hms.$ro?lems or odule (? and ' @E am les for mesh current in networ8s li8e T? ^? brid ed T and combination of T and ^.

21


29/80



See Anne9ure-( or the igures

$ro?lems or odule- 'a @E9.( . The networ8 of 5i . H 4od.' is in the Iero state until tJ 0when switch is closed. 5ind the current i (t" in the resistor R%.#ints@ the 5i . H 4od.' shows the same networ8 in terms of transform im edance with the Thevenin eGuivalent networ8.

.E9.' . 5ind the 3ortonFs eGuivalent circuit for the circuit 5i .2 H 4od.'.#ints@ As a st. ste ? short the terminals ab. This results in the Circuit of 5i .2.(a". By a lyin C6 at node a? we have?(0!2'";'< isc J 0* i.e iscJ A. To find out the eGuivalent 3ortonFs im edance R3? deactivate all the inde endent sources? resultin ina circuit of 5i .2.(b"? R3J (' 2";('< 2" J % /hms. Thus we obtain 3orton eGuivalent circuit of 5i .2 (c".

$ro?lems or odule '?;E9.(. +raw the ra h? one tree and its co tree for the circuit shown in 5i . H mod.,.#ints@ :n the circuit there are four nodes (3J '" and seven branches (BJ ". The ra h is so drawn and a ears as in 5i . (a".5i . (b" shows one tree of ra h shown in 5i . (a". The tree is made u of branches 2? , and -. The co tree for the tree of 5i . (b" ishown in 5i . (c". The co tree has 6J B!3< J !'< J ' 6in8s.E9.'. /a0. 5or the circuit shown in 5i .2! 4od.,? construct a tree so that i is a lin8 current. Assi n a com lete set of lin8 currents andfind i (t"./?0. Construct another tree in which v is a tree branch volta e. Assi n a com lete set of tree branch volta es and v (t".Ta8e i(t" J 2, sin 000t A? v(t"J , cos 000t.

Tutorials: . 0:Bold and 4talics .

Te t Boo8s@. >al8enbur 4. E. >an? P3etwor8 AnalysisQ? &rentice #all.;&earson Education

2. #ayt PEn Circuit AnalysisQ -;e Tata 4c=raw!#ill%. +.A.Bell! Electrical Circuits! / ford

Reference Boo8s@. A.B.Carlson!Circuits! Cena e 6earnin

2. ohn Bird! Electrical Circuit Theory and Technolo y! %;e! Elsevier (:ndian Re rint"%. S8illin #.#.@ PElectrical En ineerin CircuitsQ? ohn 7iley ) Sons.'. Edminister .A.@ PTheory ) &roblems of Electric CircuitsQ? 4c=raw!#ill Co.,. uo 5. 5.? P3etwor8 Analysis ) SynthesisQ? ohn 7iley ) Sons.-. R.A.+eCarlo ) &.4.6in! 6inear Circuit Analysis! / ford

. &.Ramesh Babu! Electrical Circuit Analysis! Scitech1. Sudha8ar@ PCircuits ) 3etwor8s@Analysis ) SynthesisQ 2;e T4#

. 4.S.Su8hi9a ) T. .3a Sar8ar! Circuits and 3etwor8s!/ ford0. Sivandam! PElectric Circuits and AnalysisQ? >i8as

. >. . Chandna? PA Te t Boo8 of 3etwor8 Theory ) Circuit AnalysisQ?Cyber Tech2. ReIa 5. 4. and Seely S.? P4odern 3etwor8 AnalysisQ? 4c.=raw #ill .%. 4. #. Rashid@ P:ntroduction to &S ice usin /rCA+ for circuits and electronicsQ? &earson;:'. Roy Choudhury +.? P3etwor8s and SystemsQ? 3ew A e :nternational &ublishers.,. +.Chatto adhyay and &.C.Ra8shit@ PElectrical CircuitsQ 3ew A e

2


30/80



8ata CommunicationCode; CS621)Contact; +% < (TCredits; 1

odule *;+ata Communication 5undamentals@ 6ayered 3etwor8 Architecture* 4ode of communication? to olo y? +ata and Si nal*Transmission 4edia@ =uided? $n uided* Transmission :m airments and Channel Ca acity* Transmission of +i ital +ata@ :nterfaces+TE!+CE? 4/+E4? Cable 4/+E4* The tele hone networ8 system and +S6 technolo y* (2%B

odule **;+ata 6in8 Control@ :nterfacin to the media and synchroniIation* Error Control@ Error +etection and Correction (Sin le bit? 4ulti bit"* 5low control@ Sto !and!7ait ARL? =o!Bac8!3 ARL? Selective!Re eat ARL+ata 6in8 &rotocols@ Synchronous? Asynchronous &rotocols? &oint!to!&oint &rotocol(&&&". ('%B

odule ***;

%0


31/80



Switchin Communication 3etwor8s@ Circuit switchin * &ac8et switchin * Routin in ac8et switched networ8s* W.2,* 5rame ReAT4? S/3ET. 23%

odule *:;Communication 3etwor8@ To olo y* 4edium Access Control TechniGues* :EEE CS4A;C+ based6A3s* :EEE Rin 6A3s* #i h S eed 6A3s H To8en Rin Based(5++:"* #i h S eed 6A3s H CS4A;C+ based* 7ireless 6A3s@Bluetooth* 23%B 3etwor8 Security@ :ntroduction to Cry to ra hy* $ser Authentication* 5irewalls.21%BRe erences;

a" +ata Communications and 3etwor8in ? BehrouI A. 5orouIan? T4# b" +ata and Com uter Communications? 7illiam Stallin s? :c" Com uter 3etwor8s? Andrew S. Tanenbaum? :

8igital Signal $rocessingCode; CS621CContact; +% < (TCredits; 1

O84%E *; ,% !iscrete-time signals:Conce t of discrete!time si nal? basic idea of sam lin and reconstruction of si nal? sam lin theorem? seGuences H eriodic? ene ower? unit!sam le? unit!ste ? unit!ram ? real ) com le e onentials? arithmetic o erations on seGuences%6

LT4 $"stems:+efinition? re resentation? im ulse res onse? derivation for the out ut seGuence? conce t of convolution? ra hical? analytical overla !add methods to com ute convolution su orted with e am les and e ercises? ro erties of convolution? interconnections 6T: systems with hysical inter retations? stability and causality conditions? recursive and non!recursive systems.-6

O84%E **; ((% I-Transform:+efinition? ma in between s! lane and I! lane? unit circle? conver ence and R/C? ro erties of Z!transform? Z!transform oseGuences with e am les and e ercises? characteristic families of si nals alon with R/Cs? convolution? correlation andmulti lication usin Z!transform? initial value theorem? &ersevalFs relation? inverse Z!transform by contour inte ration? ower ser) artial!fraction e ansions with e am les and e ercises. -6

!iscrete ourier Transform:Conce t and relations for +5T;:+5T? Twiddle factors and their ro erties? com utational burden on direct +5T? +5T;:+5T as lineartransformations? +5T;:+5T matrices? com utation of +5T;:+5T by matri method? multi lication of +5Ts? circular convolution?com utation of circular convolution by ra hical? +5T;:+5T and matri methods? linear filterin usin +5T? aliasin error? filterinof lon data seGuences H /verla !Save and /verla !Add methods with e am les and e ercises. ,6

ast ourier Transform:Radi !2 al orithm? decimation!in!time? decimation!in!freGuency al orithms? si nal flow ra hs? Butterflies? com utations in lace? bit reversal? e am les for +:T ) +:5 55T Butterfly com utations and e ercises. '6

O84%E ***; 6%ilter !esign:

Basic conce ts of ::R and 5:R filters? difference eGuations? desi n of Butterworth ::R analo filter usin im ulse invariant and bilinear transforms? desi n of linear hase 5:R filters? no. of ta s? rectan ular? #ammin and Blac8man windows.,6O84%E *:; 3%

!igital $ignal Processor:Elementary idea about the architecture and im ortant instruction sets of T4S%20C ,' -;- % rocessor? writin of small ro ramsin Assembly 6an ua e. '6PGA:

Architecture? different sub!systems? desi n flow for +S& system desi n? ma in of +S& al orithms onto 5&=A. %6

TEJT )OOKS;%. +i ital Si nal &rocessin H &rinci les? Al orithms and A lications? .=.&roa8is ) +.=.4anola8is? &earson Ed.'. +i ital Si nal rocessin H A Com uter Based A roach? S. .4itra? T4# &ublishin Co.,. +i ital Si nal &rocessin Si nals? Systems and 5ilters? A. Antoniou? T4# &ublishin Co.-. >6S: +i ital Si nal &rocessin Systems +esi n and :m lementation? 7iley :nternational &ublication.

. +i ital Si nal &rocessin with 5ield &ro rammable =ate Arrays? $.4eyer!Baese? S rin er.

REFERENCE )OOKS;%. +i ital Si nal &rocessin ? &. Rameshbabu? Scitech &ublications (:ndia".'. +i ital Si nal &rocessin ? S.Salivahanan? A.>allabra9 ) C. =nana riya? T4# &ublishin Co.,. +i ital Si nal &rocessin * A #ands on A roach? C. Schuler ) 4.Chu ani? T4# &ublishin Co.

%


32/80



-. +i ital Si nal &rocessin ? A. 3a oor ani? T4# Education

. +i ital Si nal &rocessin S. &oornachandra ) B. Sasi8ala? 4# Education1. +i ital Si nal &rocessin * S ectral Com utation and 5ilter +esi n Chi!Tson Chen? / ford $niversity &ress

. Te as :nstruments +S& &rocessor user manuals and a lication notes.0. +i ital Si nal &rocessin H A ractical A roach (second Edition" H Emmanuel C. :feacher ) Barrie 7. ervis? &earson

Education. Wilin 5&=A user manuals and a lication notes.

O?Iect Oriented $rogrammingCode; CS6218Contact; +% < (TCredits; 1

O?Iect oriented design (2 %BConce ts of ob9ect oriented ro rammin lan ua e? 4a9or and minor elements? /b9ect? Class? relationshi s amon ob9eca re ation? lin8s? relationshi s amon classes!association? a re ation? usin ? instantiation? meta!class? rou in constructs.O?Iect oriented concepts 1 %B+ifference between //& and other conventional ro rammin H advanta es and disadvanta es. Class? ob9ect? messa e assin ?inheritance? enca sulation? olymor hism)asic concepts o o?Iect oriented programming using La7a '' %B:m lementation of /b9ect oriented conce ts usin ava.

%anguage eatures to ?e co7ered;Class & O?Iect proprieties 5%BBasic conce ts of 9ava ro rammin H advanta es of 9ava? byte!code ) >4? data ty es? access s ecifiers? o erators? contstatements ) loo s? array? creation of class? ob9ect? constructor? finaliIe and arba e collection? use of method overloadin ? th8eyword? use of ob9ects as arameter ) methods returnin ob9ects? call by value ) call by reference? static variables ) methods?

arba e collection? nested ) inner classes? basic strin handlin conce ts! Strin (discuss charAt(" ? com areTo("? eGuals(eGuals: noreCase("? inde /f("? len th(" ? substrin ("? toCharArray(" ? to6owerCase("? toStrin ("? to$ erCase(" ? trim(" ? valumethods" ) Strin Buffer classes (discuss a end("? ca acity("? charAt("? delete("? deleteCharAt("? ensureCa acity("? etCharinde /f("? insert("? len th("? setCharAt("? set6en th("? substrin ("? toStrin (" methods"? conce t of mutable and immutable strcommand line ar uments? basics of :;/ o erations H 8eyboard in ut usin BufferedReader ) Scanner classes.

Reusa?ilit properties 5%B H Su er class ) subclasses includin multilevel hierarchy? rocess of constructor callin in inheritance?use of su er and final 8eywords with su er(" method? dynamic method dis atch? use of abstract classes ) methods? interfaces.Creation of ac8a es? im ortin ac8a es? member access for ac8a es.E9ception handling & ultithreading 5%B H E ce tion handlin basics? different ty es of e ce tion classes? use of try ) catchwith throw? throws ) finally? creation of user defined e ce tion classes.Basics of multithreadin ? main thread? thread life cycle? creation of multi le threads? thread riorities? thread synchroniIation? intethread communication? deadloc8s for threads? sus endin ) resumin threads.

Applet $rogramming /using s ing0 1%B H Basics of a let ro rammin ? a let life cycle? difference between a lication )a let ro rammin ? arameter assin in a lets? conce t of dele ation event model and listener? :;/ in a lets? use of re aint("

et+ocumentBase("? etCodeBase(" methods? layout mana er (basic conce t"? creation of buttons ( Button class only" ) te t fields.Te tboo8s;References@

. Rambau h? ames 4ichael? Blaha H \/b9ect /riented 4odellin and +esi n\ H &rentice #all? :ndia2. Ali Bahrami H \/b9ect /riented System +evelo ment\ H 4c =raw #ill%. &atric8 3au hton? #erbert Schildt H \The com lete reference! ava2\ H T4#'. R. +as H \Core ava 5or Be inners\ H >: AS &$B6:S#:3=,. +eitel and +eitel H \ ava #ow to &ro ram\ H -th Ed. H &earson-. :vor #ortonUs Be innin ava 2 S+ H 7ro

. E. Bala urusamy H \ &ro rammin 7ith ava@ A &rimer\ H %rd Ed. H T4#

$ractical8esign & Anal sis Algorithm %a?Code; CS6,(Contact; +$Credits; '$rogramming %anguage used ;C

%a? ;( ; 8i7ide and Con@uer ; M:m lement Binary Search usin +ivide and ConGuer a roach_ :m lement 4er e Sort usin +ivide and ConGuer a roach

%a? ;' ; 8i7ide and Con@uer ;

%2


33/80



M:m lement Luic8 Sort usin +ivide and ConGuer a roach_ 5ind 4a imum and 4inimum element from a array of inte er usin +ivide and ConGuer a roach

%a? ;+ ; 8 namic $rogramming ;M5ind the minimum number of scalar multi lication needed for chain of matri

%a? ;1 ; 8 namic $rogramming ;M:m lement all air of Shortest ath for a ra h ( 5loyed! 7arshall Al orithm "

_:m lement Travelin Salesman &roblem%a? ;6 ; 8 namic $rogramming ;

M:m lement Sin le Source shortest &ath for a ra h ( +i98stra ? Bellman 5ord Al orithm "%a? ;5 ; )runch and )ound ;

_:m lement , &uIIle &roblem%a? ;3 ; )ac#trac#ing ;

M:m lement 1 Lueen roblem%a? ; ; )ac#trac#ing /implement an one o the ollo ing pro?lem0;_=ra h Colorin &roblem

_#amiltonian &roblem%a? ;, ; >reed method/implement an one o the ollo ing pro?lem0 ;

_ na sac8 &roblem_ ob seGuencin with deadlines

%a? ;(2 ; >reed method /implement an one o the ollo ing pro?lem0 ;M4inimum Cost S annin Tree by &rimUs Al orithm_4inimum Cost S annin Tree by rus8alUs Al orithm

%a? ;(( ; >raph Tra7ersal Algorithm ;_:m lement Breadth 5irst Search (B5S"

_:m lement +e th 5irst Search (+5S"

icroprocessor & icrocontroller %a?Code; CS6,'Contact; +$Credits; '

Sl. No. E9periment Name No oHours

(

Study of &rewritten ro rams on 101, trainer 8it usin the basic instruction set (data transfer?6oad;Store? Arithmetic? 6o ical".OrD5amiliariIation with 101, simulator on &C. &ro rams usin basic instruction set (data transfer?6oad;Store? Arithmetic? 6o ical" on the simulator.

+

'

$rogramming using #it or Simulator or;,. Table loo8 u-. Co yin a bloc8 of memory

. Shiftin a bloc8 of memoryiv" &ac8in and un ac8in of BC+ numbers1. Addition of BC+ numbers

. Binary to ASC:: conversion and vice!versa ($sin Subroutine Call"0. BC+ to Binary Conversion and vice!versa

vii" Strin 4atchin ? 4ulti lication

(

+

&ro ram usin :3;/$T instructions and 12,, &&: on the trainer 8it e. . subroutine for delay?. =lowin all the 6E+s one by one with articular delayi. Readin switch state and lowin 6E+s accordin ly. +

1 Serial communication between two trainer 8its +

6

Study of &rewritten ro rams on 10, 4icrocontroller it usin the basic instruction set (datatransfer? 6oad;Store? Arithmetic? 6o ical".OrD

5amiliariIation with 10, Simulator on &C. Study of rewritten ro rams usin basic instructionset (data transfer? 6oad;Store? Arithmetic? 6o ical".

+

Total +2 hours /(2 classes each o + periods0

%%


34/80



$rogramming $ractices 4sing C


35/80



8S$ %a?Code; CS6,1CContact; +$Credits; '

Simulation %a?orator using standard Simulator;c" Sam led sinusoidal si nal? various seGuences and different arithmetic o erations.d" Convolution of two seGuences usin ra hical methods and usin commands! verification of the ro erties of convolution.e" Z!transform of various seGuences H verification of the ro erties of Z!transform.f" Twiddle factors H verification of the ro erties.

" +5Ts ; :+5Ts usin matri multi lication and also usin commands.h" Circular convolution of two seGuences usin ra hical methods and usin commands? differentiation between linear and

circular convolutions.i" >erifications of the different al orithms associated with filterin of lon data seGuences and /verla Hadd and /verla !

save methods. 9" Butterworth filter desi n with different set of arameters.

8" 5:R filter desi n usin rectan ular? #ammin and Blac8man windows.Hard are %a?orator using either 61(5 or 53(+ $rocessor and Jilin9 F$>A;

%. 7ritin ) e ecution of small ro rams related to arithmetic o erations and convolution usin Assembly 6an ua e ofT4S%20C ,' -;- % &rocessor? study of 4AC instruction.

'. 7ritin of small ro rams in >#+6 and downloadin onto Wilin 5&=A.,. 4a in of some +S& al orithms onto 5&=A.

OO$ %a?Code; CS6,18Contact; +$Credits; '

. Assi nments on class? constructor? overloadin ? inheritance? overridin2. Assi nments on wra er class? arrays%. Assi nments on develo in interfaces! multi le inheritance? e tendin interfaces'. Assi nments on creatin and accessin ac8a es,. Assi nments on multithreaded ro rammin-. Assi nments on a let ro ramminNote; 4se La7a or programming&referably download \ Ia7a ee sd#-5u1-Id#3- indo s.e9e \ fromhttp;!! .oracle.com!technet or#!Ia7a!Ia7aee!do nloads!Ia7a-ee-sd#-5u+-Id#-3u(-do nloads-6'++,(.html

SE ESTER :*+etailed syllabus further definin learnin outcome as er discussion in the wor8sho held on . .20 2 will be

u loaded shortly.Theor

$rinciples o anagement

H4-52(Contracts; '%Credits- '

odule-*. Basic conce ts of mana ement@ +efinition H Essence? 5unctions? Roles? 6evel.

2. 5unctions of 4ana ement@ &lannin H Conce t? 3ature? Ty es? Analysis? 4ana ement by ob9ectives* /r anisation Structure HConce t? Structure? &rinci les? CentraliIation? +ecentraliIation? S an of 4ana ement* /r anisational Effectiveness.

odule-**

%. 4ana ement and Society H Conce t? E ternal Environment? CSR? Cor orate =overnance? Ethical Standards.'. &eo le 4ana ement H /verview? ob desi n? Recruitment ) Selection? Trainin ) +evelo ment? Stress 4ana ement.,. 4ana erial Com etencies H Communication? 4otivation? Team Effectiveness? Conflict 4ana ement? Creativity?

Entre reneurshi .odule-***

%,


36/80



-. 6eadershi @ Conce t? 3ature? Styles.

. +ecision ma8in @ Conce t? 3ature? &rocess? Tools ) techniGues.1. Economic? 5inancial ) Luantitative Analysis H &roduction? 4ar8ets? 3ational :ncome Accountin ? 5inancial 5unction ) =oals?

5inancial Statement ) Ratio Analysis? Luantitative 4ethods H Statistical :nterference? 5orecastin ? Re ression Analysis?Statistical Luality Control.

odule-*:

. Customer 4ana ement H 4ar8et &lannin ) Research? 4ar8etin 4i ? Advertisin ) Brand 4ana ement.0. / erations ) Technolo y 4ana ement H &roduction ) / erations 4ana ement? 6o istics ) Su ly Chain 4ana ement?

TL4? aiIen ) Si Si ma? 4:S.

(eadings:

. 4ana ement@ &rinci les? &rocesses ) &ractices H Bhat? A ) umar? A (/$&".2. Essentials for 4ana ement H oontI? Revised edition? Tata 4c=raw #ill (T4#"%. 4ana ement H Stoner? ames A. 5. (&earson"'.4ana ement ! =human? Tata 4c=raw #ill(T4#"

8ata?ase anagement S stemCS-52(Contact; +%Credits; +

*ntroduction 1%B Conce t ) /verview of +B4S? +ata 4odels? +atabase 6an ua es? +atabase Administrator? +atabase $sers? Three Schemaarchitecture of +B4S.

Entit -Relationship odel 5%B

Basic conce ts? +esi n :ssues? 4a in Constraints? eys? Entity!Relationshi +ia ram? 7ea8 Entity Sets? E tended E!R features

Relational odel 6%BStructure of relational +atabases? Relational Al ebra? Relational Calculus? E tended Relational Al ebra / erations? >iews?4odifications /f the +atabase.

S % and *ntegrit Constraints %BConce t of ++6? +46? +C6. Basic Structure? Set o erations? A re ate 5unctions? 3ull >alues? +omain Constraints? Referential:nte rity Constraints? assertions? views? 3ested SubGueries? +atabase security a lication develo ment usin SL6? Stored rocedures and tri ers.

Relational 8ata?ase 8esign ,%B5unctional +e endency? +ifferent anamolies in desi nin a +atabase.? 3ormaliIation usin funtional de endencies? +ecom osition?Boyce!Codd 3ormal 5orm? %35? 3omaliIation usin multi!valued de edencies? '35? ,35

*nternals o R8) S 3%B&hysical data structures? Luery o timiIation @ 9oin al orithm? statistics and cost bas o timiIation. Transaction rocessinConcurrency control and Recovery 4ana ement @ transaction model ro erties? state serialiIability? loc8 base rotocols? two haloc8in .

File OrganiGation & *nde9 Structures 5%B5ile ) Record Conce t? &lacin file records on +is8? 5i ed and >ariable siIed Records? Ty es of Sin le!6evel :nde ( rimary?secondary? clusterin "? 4ultilevel :nde es? +ynamic 4ultilevel :nde es usin B tree and B< tree .Te t Boo8s@

. #enry 5. orth and SilberschatI Abraham? P+atabase System Conce tsQ? 4c.=raw #ill.2. Elmasri RameI and 3ovathe Sham8ant? P5undamentals of +atabase SystemsQ? Ben9amin Cummin s &ublishin .

Com any.%. Rama8rishnan@ +atabase 4ana ement System ? 4c=raw!#ill'. =ray im and Reuter Address? PTransaction &rocessin @ Conce ts and TechniGuesQ? 4ora an auffman &ublishers.,. ain@ Advanced +atabase 4ana ement System CyberTech-. +ate C. .? P:ntroduction to +atabase 4ana ementQ? >ol. :? ::? :::? Addison 7esley.

. $llman +.? P&rinci les of +atabase SystemsQ? =al ottia &ublication.Reference@

. ames 4artin? P&rinci les of +atabase 4ana ement SystemsQ? 1,? &rentice #all of :ndia? 3ew +elhi

%-


37/80



2. P5undamentals of +atabase SystemsQ? RameI Elmasri? Sham8ant B.3avathe? Addison 7esley &ublishin Edition%. P+atabase 4ana ement SystemsQ? Arun .4a9umdar? &ritimay Bhattacharya? Tata 4c=raw #ill

Computer Net or#sCS-52'Contact; +%Credits; +

odule *O7er7ie o 8ata Communication and Net or#ing; 1%B:ntroduction* +ata communications@ com onents? data re resentation (ASC::?:S/ etc."? direction of data flow (sim le ? half du le ? full du le "*networ8 criteria? hysical structure (ty e of connection? to olo y"? cate ories of networ8 (6A3? 4A3?7A3"* :nternet@ brief history? &rotocols andstandards* Reference models@ /S: reference model? TC&;:& reference model? their com arative study.$h sical %e7el; 5%B/verview of data(analo ) di ital"? si nal(analo ) di ital"? transmission (analo ) di ital" ) transmission media ( uided ) un uided"* Circuitswitchin @ time division ) s ace division switch? T+4 bus* Tele hone 3etwor8*

odule **8ata lin# %a er; 6%BTy es of errors? framin (character and bit stuffin "? error detection ) correction methods* 5low control* &rotocols@ Sto ) wait ARL? =o!Bac8! 3ARL? Selective re eat ARL? #+6C*

edium Access su? la er; 6%B&oint to &oint &rotocol? 6C&? 3C&? To8en Rin * Reservation? &ollin ? 4ulti le access rotocols@ &ure A6/#A? Slotted A6/#A? CS4A?CS4A;C+? CS4A;CA Traditional Ethernet? fast Ethernet(in brief"*

odule ***Net or# la er; %B:nternetwor8in ) devices@ Re eaters? #ubs? Brid es? Switches? Router? =ateway* Addressin @ :& addressin ? subnettin * Routin @ techniGuvs. dynamic routin ? $nicast Routin &rotocols@ R:&? /S&5? B=&* /ther &rocols@ AR&? :&? :C4&? :&>-*.Transport la er; 1%B&rocess to &rocess delivery* $+&* TC&* Con estion Control@ / en 6oo ? Closed 6oo cho8e ac8ets* Luality of service@ techniGues to im rove6ea8y buc8et al orithm? To8en buc8et al orithm?

odule *:Application %a er 6%B:ntroduction to +3S? S4T&? S34&? 5T&? #TT& ) 777* Security@ Cry to ra hy (&ublic? &rivate ey based"? +i ital Si nature? 5irewalls.

odern topics; 6%B:S+3 services ) AT4? +S6 technolo y? Cable 4odem@ Architecture ) / eration in brief 7ireless 6A3@ :EEE 102. ? :ntroduction to blue!tooth.Te't Books:

. B. A. 5orouIan H P+ata Communications and 3etwor8in (%rd Ed." P H T4#2. A. S. Tanenbaum H PCom uter 3etwor8s ('th Ed."Q H &earson Education;:%. 7. Stallin s H P+ata and Com uter Communications (,th Ed."Q H :; &earson Education'. Zhen ) A8htar? 3etwor8 for Com uter Scientists ) En ineers? /$&,. Blac8? +ata ) Com uter Communication? :-. 4iller? data Communication ) 3etwor8? >i8as

. 4iller? +i ital ) +ata Communication? aico1. Shay? $nderstandin +ata Communication ) 3etwor8? >i8as

(eference Books:. urose and Rose H P Com uter 3etwor8in !A to down a roach featurin the internetQ H &earson Education

2. 6eon? =arica? 7id9a9a H PCommunication 3etwor8sQ H T4#%. 7alrand H PCommunication 3etwor8sQ H T4#.

'. Comer H P:nternetwor8in with TC&;:&? vol. ? 2? %('th Ed."Q H &earson Education;:Operating S stemCS-52+Contact; +%Credits; +

*ntroduction 1%B:ntroduction to /S. / eratin system functions? evaluation of /.S.? +ifferent ty es of /.S.@ batch? multi! ro rammed? time!sharin ?real!time? distributed? arallel.

S stem Structure +%BCom uter system o eration? :;/ structure? stora e structure? stora e hierarchy? different ty es of rotections? o eratin systestructure (sim le? layered? virtual machine"? /;S services? system calls.

$rocess anagement (3%B Processes F L : Conce t of rocesses? rocess schedulin ? o erations on rocesses? co!o eratin rocesses? inter! rocescommunication.

%


38/80



Threads F2L : overview? benefits of threads? user and 8ernel threads.

)P scheduling F L : schedulin criteria? reem tive ) non! reem tive schedulin ? schedulin al orithms (5C5S? S 5? RR? riority"? al orithm evaluation? multi! rocessor schedulin .

Process $"nchroniJation F=L : bac8 round? critical section roblem? critical re ion? synchroniIation hardware? classical roblems of synchroniIation? sema hores. !eadlocks F7L : system model? deadloc8 characteriIation? methods for handlin deadloc8s? deadloc8 revention? deadloc8avoidance? deadloc8 detection? recovery from deadloc8.

Storage anagement (,%B

+emor" +anagement F=L : bac8 round? lo ical vs. hysical address s ace? swa in ? conti uous memory allocation? a in ?se mentation? se mentation with a in .

Virtual +emor" F L : bac8 round? demand a in ? erformance? a e re lacement? a e re lacement al orithms (5C5S6R$"? allocation of frames? thrashin .

ile $"stems F7L : file conce t? access methods? directory structure? file system structure? allocation methods (conti uous?lin8ed? inde ed"? free!s ace mana ement (bit vector? lin8ed list? rou in "? directory im lementation (linear list? hash tabefficiency ) erformance.

48 +anagement F7L : :;/ hardware? ollin ? interru ts? +4A? a lication :;/ interface (bloc8 and character devices? networ8devices? cloc8s and timers? bloc8in and nonbloc8in :;/"? 8ernel :;/ subsystem (schedulin ? bufferin ? cachin ? s oolin anddevice reservation? error handlin "? erformance.

!isk +anagement F L : dis8 structure? dis8 schedulin (5C5S? SST5? SCA3?C!SCA3" ? dis8 reliability? dis8 formattin ? boot bloc8? bad bloc8s.

$rotection & Securit 1%B=oals of rotection? domain of rotection? security roblem? authentication? one time assword? ro ram threats? system threathreat monitorin ? encry tion.

Te't Books 8 (eferences ;

. 4ilen8ovie 4.? P/ eratin System @ Conce t ) +esi nQ? 4c=raw #ill.2. Tanenbaum A.S.? P/ eratin System +esi n ) :m lementationQ? &ractice #all 3 .%. SilbersehatI A. and &eterson . 6.? P/ eratin System Conce tsQ? 7iley.'. +hamdhere@ / eratin System T4#,. Stallin ? 7illiam? P/ eratin SystemsQ? 4a well 4c4illan :nternational Editions? 2.-. +ietel #. 3.? PAn :ntroduction to / eratin SystemsQ? Addison 7esley.

$ro essional Electi7e*n ormation Theor & CodingCS-521AContact; +%Credits; +

Source Coding 3%B$ncertainty and information? avera e mutual information and entro y? information measures for continuous randomvariables? source codin theorem? #uffman cod

cse final upto 4h year syllabus 09.01.14

Documents