M.Tech syllabus.doc

8/10/2019 M.Tech syllabus.doc

1/47

ACADEMIC REGULATIONS

COURSE STRUCTURE

AND

DETAILED SYLLABUS

MASTER OF TECHNOLOGY IN

COMPUTER SCIENCE AND ENGINEERING

1


2/47

M.Tech(CSE) Regular Two Year P.G. Degree Course(Applicable for he baches a!"ie! fro" #$1%$1')

#


3/47

Course Structure and Sya!"

M#Tec$# Co%&uter Sc"ence and En'"neer"n' (CSE)

I YEAR * I Se%ester

S. o Course co!e Subec Theor* +ab. Cre!is ,.M E.M M.M

1. 1%CSP11T$1 Progra""i-g usi-g p*ho- % $ % %$ $ 1$$#. 1%CSP11T$# A!/a-ce! Daa Srucures a-! Algorih"s % $ % %$ $ 1$$0. 1%CSP11T$0 Co"puer S*se" Desig- % $ % %$ $ 1$$%. 1%CSP11T$% A!/a-ce Daabases % $ % %$ $ 1$$

'.1%CSP11T$' bec rie-e! A-al*sis Desig- a-! Desig-

Paer-% $ % %$ $ 1$$

.1%CSP11E1a1%CSP11E1b

1%CSP11E1c1%CSP11E1!

Eleci/e&,Sofware E-gi-eeri-gArificial ,-ellige-ce

2or"al +a-guage a-! Auo"aa Theor*Gri! Co"pui-g

% $ % %$ $ 1$$

3.1%CSP11P$1

progra""i-g usi-g p*ho- a-! A!/a-ce!!aa srucures +ab

$ 0 # %$ $ 1$$

Co-ac perio!s4wee5 #% 0 #Toal

+,+-

+./ 0+/ ,//

S. o Course co!e Subec Theor* +ab.Cre!i

s,.M E.M M.M

1. 1%CSP1#T1$ Daa ware 6ousi-g a-! Daa "i-i-g % $ % %$ $ 1$$

#. 1%CSP1#T11 7a/a a-! 8eb Tech-ologies % $ % %$ $ 1$$0. 1%CSP1#T1# Mobile Co"pui-g % $ % %$ $ 1$$%. 1%CSP1#T10 A!/a-ce Co"puer -ewor5s % $ % %$ $ 1$$

'. 1%CSP1#T1% Sofware 9uali* Assura-ce a-! Tesi-g % $ % %$ $ 1$$

.1%CSP1#E#a1%CSP1#E#b1%CSP1#E#c1%CSP1#E#!

Eleci/e&,,Disribue! S*se"sClou! Co"pui-g,"age Processi-gCo"piler Co-srucio-

% $ % %$ $ 1$$

3.1%CSP1#P$#

Daa 8arehousi-g Daa Mi-i-g lab a-!78T +ab $ 0 # %$ $ 1$$

Co-ac perio!s4wee5 #% 0 #Toal +, +- +./ 0+/ ,//

I YEAR * II Se%ester

0


4/47


5/47

MADANAPALLE INSTITUTE OF TECHNOLOGY 3 SCIENCE

(AUTONOMOUS)

M# Tec$ I Year * I SEM 2CSE5

PROGAMMING USING PYTHON

290CSP99T/95Course Objective:

To "a5e he su!e- u-!ersa-! proble" sol/i-g ech-i:ues a-! heirapplicaio-s

Students will be able to understand the syntax and semantics of python.

Ge ac:uai-a-ces wih classes a-! obecs; sac5s a-! :ueues usi-g p*ho-.Learning Outcomes:

Afer co"pleio- of he course he su!e- will be able o Appl* proble" sol/i-g ech-i:ues o fi-! soluio-s o proble"s. Able o use p*ho- effeci/el* a-! i"ple"e- soluio-s usi-g i.

-i?; 2eaures of >-i? ; >-i? Co""a-!s @ PAT6;"a-; echo; pri-f; scrip; passw!; u-a"e; who; !ae; s*; pw!; c!; "5!ir; r"!ir; ls; cp; "/;r"; ca; "ore; wc; lp; o!; ar; gip. >-i? >iliies=& ,-ro!ucio- o u-i? file s*se"; /i e!ior;file ha-!li-g uiliies; securi* b* file per"issio-s; process uiliies; !is5 uiliies; -ewor5i-gco""a-!s; u-li-5; !u; !f; "ou-; u"ou-; fi-!; u-"as5; uli"i; ps; w; fi-ger; arp; fp; el-e;rlogi-.

UNIT II

INTRODUCTION TO PYTHON

Gett"n' Started; Introduct"on to Pyt$on& a- i-erpree! high le/el la-guage; 6ow P*ho-Ru-s Progra"s; Progra" E?ecuio-; E?ecuio- Mo!el Bariaio-s; The P*ho- ,-eraci/ePro"p; S*se" Co""a-! +i-es a-! 2iles; Mo!ule ,"pors a-! Reloa!s; The ,D+E >ser,-erface; Pyt$on 4ar"a!es< e:&ress"ons and state%ents= Balues a-! *pes; 5e*wor!s;peraors E?pressio-s; ,-eraci/e "o!e a-! scrip "o!e; Sri-g operaio-s; Co""e-s.Funct"ons 3 Modues;2u-cio- calls; T*pe co-/ersio- fu-cio-s; Mah fu-cio-s; A!!i-g-ew fu-cio-s; Defi-iio-s a-! uses; 2low of e?ecuio-; Para"eers a-! argu"e-s; Ra-!o"-u"bers; The i"e "o!ule; The "ah "o!ule. Cond"t"onas; Co-!iio-al e?ecuio-;

Aler-ai/e e?ecuio-; Chai-e! co-!iio-als; ese! co-!iio-als. Iterat"on; Mulipleassig-"e-; >p!ai-g /ariables; he while sae"e-; brea5; co-i-ue.

UNIT III

Str"n's; A sri-g is a se:ue-ce; Tra/ersal wih for loop; Sri-g slices; Sri-gs are i""uable;Searchi-g; +oopi-g a-! cou-i-g; Sri-g "eho!s; he i- operaor; Sri-g co"pariso-.Tu&es; Tuples are i""uable; Tuple assig-"e-; Tuples as reur- /alues; +iss a-! uples;D"ct"onar"es a-! uples; Co"pari-g uples; Se:ue-ces of se:ue-ces; Debuggi-g. L"sts;Tra/ersi-g a lis; +is operaio-s; +is slices; +is "eho!s. Recurs"on;Sac5 !iagra"s forrecursi/e fu-cio-s; ,-fi-ie. F"es;Persise-ce; Rea!i-g a-! wrii-g; 2ile-a"es a-! pahs.

UNIT I4

'

L T C

0 / 0


6/47

Casses and O!6ects; >ser&!efi-e! *pes; Aribues; ,-sa-ces as reur- /alues Met$ods;The i-i "eho!; The sr "eho!; peraor o/erloa!i-g; Pol*"orphis". In$er"tance;,"pora-ce; e?a"ples. E=ent $and"n'; e* press e/e-s; Mouse e/e-s. E:ce&t"ons;Cachi-g e?cepio-s; Raisi-g our ow- e?cepio-s; he fi-all* clause of he r* sae"e-.

UNIT*4De>"n"t"on and use o> Stac8s= Absrac !aa *pes; The Sac5 ADT; ,"ple"e-i-g sac5s wihP*ho- liss; pushi-g a-! poppi-g; >si-g a sac5 o e/aluae posfi?; Parsi-g; E/aluai-g

posfi?. ?ueues; The 9ueue ADT; +i-5e! 9ueue; Perfor"a-ce characerisics; ,"pro/e!+i-5e! 9ueue; Priori* :ueue.

Te:t Boo8s;

1. >-i? a-! shell Progra""i-g -i/ersi*; Ra-ce D. ecaise; College of 8illia" a-! Mar*; 8ile*.4.Head First Python,Paul Barry,Reill* .
http://it-ebooks.info/publisher/3/http://it-ebooks.info/publisher/3/http://it-ebooks.info/publisher/3/http://it-ebooks.info/publisher/3/


7/47


(AUTONOMOUS)


AD4ANCED DATA STRUCTURES AND ALGORITHMS

290CSP99T/+5

Course Objectives:

To !e/elop s5ills o !esig- a-! a-al*e li-ear a-! -o- li-ear !aa srucures.

De/elop algorih"s for "a-ipulai-g li-5e! liss;ssc5s;:ueues;rees;a-! graphs.

De/elop recursi/e algorih"s as he* appl* o rees a-! graphs.

To !e/elop a base for a!/a-ce! co"puer su!*.

Learning Outcomes:

Afer co"pleio- of he course he su!e- will be able o Su!* /arie* of a!/a-ce! absrac !aa *pe (ADT)a-! !aa srucures a-! heir

,"ple"e-aio-s.,!e-if* a-! appl* he suiable !aa srucure for he gi/e- real worl!proble".

UNIT*I

C Progra""i-g= becs; Class Defi-iio-; Class Me"bers; Access Co-rol; Class Scope;Co-srucors a-! !esrucors; para"eer passi-g "eho!s; ,-li-e fu-cio-s; ; !*-a"ic"e"or* allocaio- a-! !eal locaio- (-ew a-! !elee); e?cepio- ha-!li-g. 2u-cio- o/er+oa!i-g.bec&base! Progra""i-g= Ge-eric Progra""i-g& 2u-cio- a-! class e"plaes; ,-heria-cebasics; base a-! !eri/e! classes; i-heria-ce *pes; base class access co-rol; ru-i"epol*"orphis" usi-g /irual fu-cio-s .

UNIT II

Daa srucures&+i-ear a-! -o- li-ear !aa srucures; ADT co-cep; +i-ear +is ADT; Arra*Represe-aio-; +i-5e! represe-aio-;Represe-aio- of si-gle; wo !i"e-sio-al arra*s;sparse "arices a-! heir represe-aio-. Si-gl* li-5e! liss &i-serio-; !eleio-; searchoperaio-s; !oubl* li-5e! liss&i-serio-; !eleio- operaio-s; a-! circular liss.

UNIT III

Sac5 a-! 9ueue ADTs; arra* a-! li-5e! lis represe-aio-s; i-fi? o posfi? co-/ersio-usi-g sac5.,"ple"e-aio- of recursio-; Circular :ueue&i-serio- a-! !eleio-; De:ueue

ADT; arra* a-! li-5e! lis represe-aio-s; Priori* :ueue ADT; i"ple"e-aio- usi-g 6eaps;,-serio- i-o a Ma? 6eap; Deleio- fro" a Ma? 6eap.

UNIT I4

Searchi-g@+i-ear a-! bi-ar* search "eho!s; 6ashi-g&6ash fu-cio-s; Collisio- Resoluio-"eho!s&pe- A!!ressi-g; Chai-i-g Sori-g @


8/47

Graphs& Graphs er"i-olog*; Graph ADT; represe-aio-s; graph ra/ersals4search "eho!s&!fs a-! bfs;

Te:t Boo8s;

1. Daa Srucures a-! Algorih"s usi-g C; A-a-!a Rao A5epogu a-! Ra!ho5a RauPalagiri; Pearso- E!ucaio-.

#. Daa srucures; Algorih"s a-! Applicaio-s i- C; S.Sah-i; >-i/ersi* Press(,-!ia) P/.+!; #-! e!iio-; >-i/ersiies Press rie- +o-g"a- P/. +!.Re>erence Boo8s ;

1. Daa srucures a-! Algorih"s i- C; Michael T.Goo!rich; R.Ta"assia a-! .Mou-;8ile* su!e- e!iio-; 7oh- 8ile* a-! So-s.

#. Daa Srucures a-! Algorih" A-al*sis i- C; Mar5 Alle- 8eiss; Pearso-E!ucaio-. +!.; Seco-! E!iio-.

0. Daa Srucures a-! algorih"s i- C; 0r!E!iio-; A!a" Dro!e5; Tho"so-.%. Daa Srucures usi-g C a-! C; +a-gsa"; Auge-sei- a-! Ta-e-bau"; P6,.'. Proble" Sol/i-g wih C; The P; 2ourh E!iio- ; 8. Sa/ich; Pearso- e!ucaio-.. Daa Srucures usi-g C; D.S. Mali5; Ce-gage +ear-i-g. ,-!ia E!iio-.

F


9/47


(AUTONOMOUS)


COMPUTER SYSTEM DESIGN 290CSP99T/@5

Course Objectives:

To u-!ersa-! he !esig- of he /arious fu-cio-al u-is of !igial co"puers. To u-!ersa-! he basic processi-g u-i a-! how he* are co--ece! a-! how i

ge-eraes co-rol sig-als (usi-g har!wire! a-! "icro progra""e! approaches). To be fa"iliar wih "ulihrea!i-g a-! he co-ceps of "e"or* "a-age"e-

i-clu!i-g /irual "e"or*. To u-!ersa-! he issues relae! o file s*se" i-erface a-! i"ple"e-aio-; !is5

"a-age"e- wih proecio- a-! securi* "echa-is"s.Learning Outcomes:

Afer co"pleio- of he course he su!e- will be able o

Su!e-s will lear- abou co"puer perfor"a-ce; co"puer !esig-; a-! ra!e&offsbewee- cos a-! perfor"a-ce as well as bewee- har!ware a-! sofware.

Su!e-s will for"ulae a-! sol/e proble"s; u-!ersa-! he perfor"a-ce re:uire"e-sof s*se"s.

A he e-! of he course he su!e-s 5-ows he -ee! a-! re:uire"e- of a- i-erfacebewee- Ma- a-! Machi-e.

Su!e-s will be able o relae he feaures of operai-g s*se"s a-! he fu-!a"e-alheor* associae! wih process; a-! file "a-age"e-s co"po-e-s of !iffere-operai-g s*se"s.

Su!e-s will lear- abou a-! u-!ersa-! heoreical co-ceps a-! progra""i-gco-srucs use! for he operaio- of "o!er- operai-g s*se"s.

UNIT 9

Bas"c structure o> co%&uter;

Co"puer *pes ;fu-cio-al u-is ;


10/47

Processes and T$reads;processes; hrea!s; i-er process co""u-icaio-; classical ,PCproble"s; Dea!loc5s.

UNIT 1 4

F"e syste%= 2iles; !irecories; ,"ple"e-aio-; >-i? file s*se"Secur"ty;Threas; i-ru!ers;acci!e- !aa loss; basics of cr*pograph*; user auhe-icaio-.

Te:t Boo8s;

1.Co"puer rga-iaio- @ Car 6a"acher; I/o-5s Bra-esic; SafeaIa5*; BhE!iio-;McGraw 6ill.(>,T ,;,,;,,,)

#. Mo!er- perai-g S*se"s; A-!rew S Ta-e-bau" #-!e!iio- Pearso-4P6,(>,T ,B;B)

Re>erence Boo8s;

1. Co"puer rga-iaio- a-! Archiecure @ 8illia" Salli-gs Si?h E!iio-;pearso-4P6,.#. Morris Ma-o &Co"puer S*se" Archiecure @0r!E!iio-&Pearso- E!ucaio- .0. perai-g S*se" Pri-ciples& Abraha" Silbercha; Peer


11/47


(AUTONOMOUS)


AD4ANCE DATABASES

290CSP99T/05

Course Objectives ;

To "a5e he su!e- u-!ersa-! basic !aabase co-ceps; i-clu!i-g hesrucure of he relaio-al !aa "o!el.

Co-sruc si"ple a-! "o!erael* a!/a-ce! !aabase :ueries usi-g Srucure!9uer* +a-guage (S9+).

Describe a-! !iscuss selece! a!/a-ce! !aabase opics; such as !isribue!!aabase s*se"s a-! he !aa warehouse.

Learning Outcomes: Afer co"pleio- of he course he su!e- will be able o

Su!e- ca- able o wrie S9+ 9ueries o rerie/e he !aa fro" Daabase. Su!e- ca- able o !esig- he Daabases. Su!e- ca- effeci/el* use Reco/er* Tech-i:ues. Su!e- ca- able o wrie 2rag"e- :ueries.

UNIT*I

Daabases a-! Daabase >sers & Daabase S*se" Co-ceps a-! Archiecure; Daa Mo!els;

Sche"as; a-! ,-sa-ces; Dsi-g he E-i*&Relaio-ship Approach; ER Mo!elCo-ceps; E-i*&Relaio-ship (ER) Diagra"s & Relaio-al Mo!el Co-ceps; Relaio-al,-egri* Co-srai-s &2u-cio-al Depe-!e-cies a-! or"aliaio- for Relaio-al Daabases;2u-cio-al Depe-!e-cies; or"al 2or"s E+; Do"ai- Relaio-alCalculus; a-! 9si-g 6eurisics i- 9uer* pi"iaio-; >si-g Cos Esi"aes i- 9uer* pi"iaio-;Se"a-ic 9uer* pi"iaio- & Tra-sacio-s Processi-g Co-ceps; Tra-sacio- a-! S*se"Co-ceps; Desirable Properies of Tra-sacio-s; Sche!ules a-! Reco/erabili*; Serialiabili*of Sche!ules.

UNIT*I4

Co-curre-c* Co-rol Tech-i:ues = +oc5i-g Tech-i:ues for Co-curre-c* Co-rol;Co-curre-c* Co-rol Tech-i:ues


12/47

Reco/er* Tech-i:ues & Reco/er* Co-ceps; Reco/er* Tech-i:ues p!ae;Reco/er* Tech-i:ues p!ae; Sha!ow Pagi-g; Daabase Securi* a-!Auhoriaio- & ,-ro!ucio- o Daabase Securi* ,ssues & Discreio-ar* Access Co-rol>si-g Pri/ileges; Ma-!aor* Access Co-rol for Mulile/el Securi*.

UNIT*4

A!/a-ce! Daa Mo!eli-g Co-ceps = E-ha-ce!&ER(EER) Mo!el Co-ceps; EER&o&Relaio-al Mappi-g; Daa Absracio- a-! -owle!ge Represe-aio- Co-ceps; ,-egri*Co-srai-s i- Daa Mo!eli-g; Co-cepual Desig- of Tra-sacio-s; /er/iew of her DaaMo!els. Desig- @ !aabase frag"e-s; allocaio-; Tra-slaio- of global :ueries o frag"e-:ueries pi"iaio- of Access sraegies @ 2ra"ewor5; 7oi- :ueries; & Ma-age"e- ofDisribue! ra-sacio-s @ 2ra"ewor5 @ Suppori-g ao"ici* for !isribue! ra-sacio-s;Co-curre-c* co-rol for !isribue! ra-sacio-s; Archiecural aspecs.

Te:t Boo8s;

1.Ra"e El"asri Sha"5a- -i ,;,,;,,,;,B;B)

#.Abraha" Silbercha; 6e-r* 2. orh; S.Su!arsa-; Database System Concepts; 2ifhE!iio-; McGraw&6ill; #$$. (>-i ,; ,,)0.Sefa-o Ceri; Giuseppe Pelagai;Distributed Databases Principles and Systems; McGraw&6ill ,-er-aio-al E!iio-s; 1HF'. (>-i B)

Re>erence Boo8s;

1.Tho"as M. Co--oll*; Carol*- E. ll"a-; 7e-ifer 8i!o"; A 2irs Course i- Daabase S*se"s; Pearso- E !ucaio-Asia; #$$1.0 .Sefa-o Ceri; Giuseppe Pelagai; Disribue! Daabases Pri-ciples a-! S*se"s; McGraw&6ill ,-er-aio-al E!iio-s; 1HF'.%.Raesh ara-g; bec rie-e! ,-erfaces a-! Daabases; Pre-ice 6all of ,-!ia; #$$#.

1#


13/47


(AUTONOMOUS)


OBECT ORIENTED ANALYSIS AND DESIGN

3

DESIGN PATTERNS290CSP99T/5

Course Objectives ;

To ha/e clear i!ea o- he fu-!a"e-als of u"l; pri-ciples of "o!eli-g. To lear- o- graphical -oaio-s o be able o u-!ersa-! o- all he buil!i-g bloc5s

of u"l. To "a5e su!e-s o 5-ow abou how o !esig- he class "o!els a-! heir "o!eli-g

ech-i:ues. To lear- o- how o !e/elop >M+ !iagra"s for a- applicaio-. To lear- co-ceps of !esig- paer-s a-! !ocu"e- e!ior.

Learning Outcomes: Afer co"pleio- of he course he su!e- will be able o

Su!e-s will be sro-g i- he fu-!a"e-als of u"l; pri-ciples of "o!eli-g. Su!e-s will a-al*se a-! !esig- he applicaio- usi-g >M+ !iagra"s. Su!e-s will ge he abili* o !e/elop a-! !eplo* applicaio-s. The* will ge clear i!ea o- !esig- paer-s a-! !esig-i-g a !ocu"e- e!ior.

UNIT I

,-ro!ucio- o >M+= The "ea-i-g of bec rie-aio-; obec i!e-i*; E-capsulaio-;i-for"aio- hi!i-g; pol*"orphis"; ge-erosi*; i"pora-ce of "o!eli-g; pri-ciples of

"o!eli-g; obec orie-e! "o!eli-g;co-cepual "o!el of he >M+; Archiecure.

UNIT II


14/47

Desig-i-g A Docu"e- E!ior= A Case Su!* &Desig- proble"s; Docu"e- srucure;2or"ai-g; E"bellishi-g he >ser ,-erface; Suppori-g Muliple +oo5 a-! 2eel sa-!ar!s;Suppori-g Muliple 8i-!ow S*se"s; >ser peraio-s; Spelli-g Chec5i-g a-! 6*phe-aio-

Te:t Boo8s ;

1. The >-ifie! Mo!eli-g +a-guage >ser Gui!e


15/47


(AUTONOMOUS)

M# Tec$ I Year * I SEM2 CSE5

SOFT7ARE ENGINEERING

290CSP99E9a52Eect"=e*I5

Course Objectives :

To help su!e-s o !e/elop s5ills ha will e-able he" o co-sruc sofware of high:uali* @ sofware ha is reliable; a-! ha is reaso-abl* eas* o u-!ersa-!; "o!if*a-! "ai-ai-.

To foser a- u-!ersa-!i-g of wh* hese s5ills are i"pora-. To help su!e-s o !e/elop s5ills ha will e-able he" o co-sruc sofware of high

:uali* for real worl! applicaio-.

Learning Outcomes:


The abili* o a-al*e; !esig-; /erif*; /ali!ae; i"ple"e-; appl*; a-! "ai-ai-sofware s*se"s.

The abili* o appropriael* appl* !iscree "ahe"aics; probabili* a-! saisics; a-!rele/a- opics i- co"puer scie-ce a-! suppori-g !iscipli-es o co"ple? sofwares*se"s.

The abili* o wor5 i- o-e or "ore sig-ifica- applicaio- !o"ai-s. The abili* o "a-age he !e/elop"e- of sofware s*se"s.

UNIT I

So>tare< So>tare En'"neer"n'< and Process= The -aure of Sofware; The u-i:ue -aureof 8ebApps; Sofware e-gi-eeri-g& A la*ere! ech-olog*; The esse-ce a-! pri-ciples ofsofware e-gi-eeri-g pracice; Ge-eric process "o!el (fra"ewor5); Process paer-s;Process assess"e- a-! i"pro/e"e-; CMM,; Sofware "*hs. Process Modes; Prescripi/e

process "o!els= The waerfall "o!el; ,-cre"e-al process "o!els; E/oluio-ar* process

"o!els. The >-ifie! process; Aspec orie-e! sofware !e/elop"e-; Agile !e/elop"e-=Agile process; E?re"e progra""i-g.

UNIT II

So>tare Reu"re%ents ; ,-ro!ucio- o fu-cio-al a-! -o-&fu-cio-al re:uire"e-s;Re:uire"e-s e-gi-eeri-g aci/iies; Elicii-g re:uire"e-s; e!uirements modelin";Re:uire"e-s /ali!aio-; Sofware re:uire"e-s specificaio-(SRS); Re:uire"e-s"a-age"e-.Requirements modeing;Srucure! /iew= Daa "o!eli-g (ERD); 2u-cio-al"o!eli-g(D2D);


16/47

So>tare Arc$"tecture= Archiecure a-! is i"pora-ce; Archiecural S*les; Daa !esig-;Archiecural !esig-. Des"'n ; Srucure! /iew (Tra!iio-al /iew)= Archiecural "appi-gusi-g !aa flow (Call a-! reur- archiecure); ,-erface !esig-; 2u-cio- base! co"po-e-!esig-.bec orie-e! /iew= Archiecure; Class hierarchies; Message !esig-; Class base!co"po-e- !esig-. Per>or%"n' User Inter>ace Des"'n; Gol!e- rules; >ser i-erface

a-al*sis a-! !esig-; i-erface a-al*sis; i-erface !esig- seps.

UNIT*I4;

Pattern Based Des"'n; Desig- paer-s; Paer- base! sofware !esig-; Archiecuralpaer-s; Co"po-e- le/el !esig- paer-s; >ser i-erface !esig- paer-s. Test"n' ; Sofwareesi-g sraegies= A sraegic approach o sofware esi-g; Tes sraegies (>-i esi-g a-!i-egraio- esi-g) for co-/e-io-al a-! obec orie-e! sofware; Bali!aio- esi-g; S*se"esi-g; The ar of !ebuggi-g.Test"n' Con=ent"ona A&&"cat"ons; Sofware esi-gfu-!a"e-als; 8hie&


17/47


(AUTONOMOUS)


ARTIFICIAL INTELLIGENCE

290CSP99TE9!5

2Eect"=e*I5Course Objectives ;

To fa"iliarie su!e-s wih Arificial ,-ellige-ce ech-i:ues for buil!i-g well&e-gi-eere! a-! efficie- i-ellige- s*se"s.

To fa"iliarie su!e-s wih Paer-&!irece! i-fere-ce s*se"s a-! !iffere- *pes ofruh "ai-e-a-ce s*se"s will be !iscusse! i- le-gh fro" boh heoreical a-!applie! poi- of /iew.

So"e cui-g e!ge applicaio-s of hese A, s*se"s will also be !iscusse! o "a5esu!e- i"ple"e- i- real worl!.

Learning Outcomes

Afer co"pleio- of he course he su!e- will be able o >-!ersa-! !iffere-*pes of A, age-s.

-ow /arious A, search algorih"s (u-i-for"e!; i-for"e!; heurisic; co-srai-saisfacio-; ge-eic algorih"s).

>-!ersa-! he fu-!a"e-als of 5-owle!ge represe-aio- (logic&base!; fra"e&base!;se"a-ic -es); i-fere-ce a-! heore" pro/i-g .

-ow how o buil! si"ple 5-owle!ge&base! s*se"s.

De"o-srae wor5i-g 5-owle!ge of reaso-i-g i- he prese-ce of i-co"plee a-!4oru-cerai- i-for"aio-.

Abili* o appl* 5-owle!ge represe-aio-; reaso-i-g; a-! "achi-e lear-i-gech-i:ues o real&worl! proble"s.

Abili* o carr* ou i-!epe-!e- (or i- a s"all group) research a-! co""u-icae ieffeci/el* i- a se"i-ar sei-g.

UNIT I,-ro!ucio- @ Age-s @ Proble" for"ulaio- @ u-i-for"e! search sraegies @heurisics@ i-for"e! search sraegies @ co-srai- saisfacio-.

UNIT II

+ogical age-s @ proposiio-al logic @ i-fere-ces @ firs&or!er logic @ i-fere-ces i-

firs or!er logic @ forwar! chai-i-g @ bac5war! chai-i-g @ u-ificaio- @ resoluio-.

UNIT IIIPla--i-g wih sae&space search @ parial&or!er pla--i-g @ pla--i-g graphs @

pla--i-ga-! aci-g i- he real worl!.

UNIT I4>-cerai-* @ re/iew of probabili* & probabilisic Reaso-i-g @


18/47

Te:t Boo8s;

1. S. Russel a-! P. or/ig; JArificial ,-ellige-ce @ A Mo!er- ApproachK; Seco-!E!iio-; Pearso- E!ucaio-; #$$0.( >,T &,;,,;,,,;,B.B)

Re>erence Boo8s;1. Da/i! Poole; Ala- Mac5worh; Ra-!* Goebel; KCo"puaio-al ,-ellige-ce = alogicalapproachK; ?for! >-i/ersi* Press; #$$%.#. G. +uger; JArificial ,-ellige-ce= Srucures a-! Sraegies for co"ple? proble"sol/i-gK; 2ourh E!iio-; Pearso- E!ucaio-; #$$#.0. . ilsso-; JArificial ,-ellige-ce= A -ew S*-hesisK; Else/ier Publishers; 1HHF.

1F


19/47


(AUTONOMOUS)


FORMAL LANGUAGES 3 AUTOMATA THEORY

290CSP99E9c52Eect"=e*I5

Course Objectives :

To "a5e su!e- lear- he fu-!a"e-al co-ceps of for"al la-guages a-! auo"aa. To "a5e su!e- o co-sruc regular e?pressio-s; gra""ars; a-! auo"aa for

!iffere- le/els of for"al la-guages. To "a5e su!e- u-!ersa-! he relaio-ship bewee- Turi-g "achi-es a-! "o!er-

co"puers. To "a5e su!e- u-!ersa-! he li"iaio-s a-! u-!eci!able proble"s of "o!er-

co"puers.Learning Outcomes:

Afer co"pleio- of he course he su!e- will be able o >-!ersa-! !iffere- *pes of A, age-s. -ow /arious A, search algorih"s (u-i-for"e!; i-for"e!; heurisic;co-srai-

saisfacio- ; ge-eic algorih"s). >-!ersa-! he fu-!a"e-als of 5-owle!ge represe-aio- (logic&base!; fra"e&base!;

se"a-ic -es); i-fere-ce a-! heore" pro/i-g . -ow how o buil! si"ple 5-owle!ge&base! s*se"s. De"o-srae wor5i-g 5-owle!ge of reaso-i-g i- he prese-ce of i-co"plee a-!4or

u-cerai- i-for"aio-. Abili* o appl* 5-owle!ge represe-aio-; reaso-i-g; a-! "achi-e lear-i-g

ech-i:ues o real&worl! proble"s. Abili* o carr* ou i-!epe-!e- (or i- a s"all group) research a-! co""u-icae i

effeci/el* i- a se"i-ar sei-g.

UNIT I

Funda%entas ;Sri-gs; Alphabe; +a-guage; peraio-s; 2i-ie sae "achi-e; !efi-iio-s;fi-ie auo"ao- "o!el; accepa-ce of sri-gs; a-! la-guages; !eer"i-isic fi-ie auo"ao-a-! -o- !eer"i-isic fi-ie auo"ao-; ra-siio- !iagra"s a-! +a-guage recog-iers.F"n"te Auto%ata ; 2A wih N ra-siio-s & Sig-ifica-ce; accepa-ce of la-guages.Co-/ersio-s a-! E:ui/ale-ce = E:ui/ale-ce bewee- 2A wih a-! wihou N ra-siio-s;

2A o D2A co-/ersio-; "i-i"isaio- of 2SM; e:ui/ale-ce bewee- wo 2SMLs; 2i-ieAuo"aa wih oupu& Moore a-! Mela* "achi-es.

UNIT II

Re'uar Lan'ua'es ; Regular ses; regular e?pressio-s; i!e-i* rules; Co-sruci-g fi-ie

Auto%ata >or a '"=en re'uar e:&ress"ons< Con=ers"on o> F"n"te Auto%ata to Re'uare:&ress"ons# Pu%&"n' e%%a o> re'uar sets< cosure &ro&ert"es o> re'uar sets 2&roo>s

not re:uire!).

1H

L T C

0 / 0


20/47

Gra%%ar For%a"s% ; Regular gra""ars&righ li-ear a-! lef li-ear gra""ars; e:ui/ale-cebewee- regular li-ear gra""ar a-! 2A; i-er co-/ersio-; Co-e? free gra""ar; !eri/aio-rees; se-e-ial for"s. Righ "os a-! lef"os !eri/aio- of sri-gs.

UNIT III

Conte:t Free Gra%%ars ; A"bigui* i- co-e? free gra""ars. Mi-i"isaio- of Co-e?

2ree Gra""ars. Cho"s5* -or"al for"; Greibac5 -or"al for"; Pu"pi-g +e""a for Co-e?2ree +a-guages. E-u"eraio- of properies of C2+ (proofs o"ie!).Pus$ Don Auto%ata ;Push !ow- auo"aa; !efi-iio-; "o!el; accepa-ce of C2+;Accepa-ce b* fi-al sae a-! accepa-ce b* e"p* sae a-! is e:ui/ale-ce. E:ui/ale-ce ofC2+ a-! PDA; i-erco-/ersio-. (Proofs -o re:uire!). ,-ro!ucio- o DC2+ a-! DPDA.

UNIT I4

Tur"n' Mac$"ne ;Turi-g Machi-e; !efi-iio-; "o!el; !esig- of TM; Co"puable fu-cio-s;recursi/el* e-u"erable la-guages. ChurchLs h*pohesis; cou-er "achi-e; *pes of Turi-g"achi-es (proofs -o re:uire!).

UNIT 4 Co%&uta!""ty T$eory ;Cho"s5* hierarch* of la-guages; li-ear bou-!e! auo"aa a-!co-e? se-sii/e la-guage; +R($) gra""ar; !eci!abili* of; proble"s; >-i/ersal Turi-gMachi-e; u-!eci!abili* of poss. Correspo-!e-ce proble"; Turi-g re!ucibili*; Defi-iio- ofP a-! P proble"s; P co"plee a-! P har! proble"s.

Te:t Boo8s;

1.J,-ro!ucio- o Auo"aa Theor* +a-guages a-! Co"puaio-K. 6opcrof 6.E. a-!>ll"a- 7. D. Pearso- E!ucaio-. (>,T&,; ,,; ,,,)

#. ,-ro!ucio- o Theor* of Co"puaio- @Sipser #-! e!iio-Tho"so-(>,T&,B; B)

Re>erence Boo8s

1.,-ro!ucio- o Co"puer Theor*; Da-iel ,.A. Cohe-; 7oh- 8ile*. #,-ro!ucio- o la-guages a-! he Theor* of Co"puaio- ;7oh- C Mari-; T

0.JEle"e-s of Theor* of Co"puaio-K; +ewis 6.P. Papa!i"iio- CPearso- 4P6,. % .Theor* of Co"puer Scie-ce @ Auo"aa la-guages a-! co"puaio- &Mishra a-! Cha-!rashe5ara-; #-! e!iio-; P6,.

#$


21/47


(AUTONOMOUS)


GRID COMPUTING

290CSP99E9d52Eect"=e*I5

Course Objectives :

To u-!ersa-! he ge-esis of gri! co"pui-g. To u-!ersa-! he applicaio- of gri!computin".

Learning Outcomes:Afer co"pleio- of he course he su!e- will be able o

Su!e-s will u-!ersa-! he co-ceps of Gri! Co"pui-g. Su!e-s will 5-ow abou he applicaio-s a-! ech-ologies of gri! co"pui-g.

UNIT 9

INTRODUCTION AND O4ER4IE7 OF GRID COMPUTING

Earl* Gri! Aci/iies&Curre- Gri! Aci/iies&A- /er/iew of Gri! erence Boo8s

#1

L T C

0 / 0


22/47

1. Ah"ar Abbas; JGri! Co"pui-g= A Pracical Gui!e o ech-olog* a-! Applicaio-sK;Charles Ri/er "e!ia @ #$$0.#. 2ra-


23/47


(AUTONOMOUS)

M# Tec$ I Year * I SEM 2CSE5 290CSP99P/95

Course Objectives:

To !e/elop s5ills o !esig- a-! a-al*e he proble"s.

To i-culcae he progra""i-g s5ills of p*ho- la-guage.

To "a5e he su!e-s o feel co"for wih he obec orie-e! progra""i-g.

Learning Outcomes:


Su!e-s ca- lear- p*ho- la-guage co-srucs.

Su!e-s will lear- P co-ceps which will be helpful for he" i- furher se"esers. Su!e-s will ha/e basic i!ea o- !aa srucures.

LIST OF EPERIMENTS

7ee8 9

a) ,"ple"e- P*ho- scrip o rea! perso-Ls age fro" 5e*boar! a-! !ispla* wheherhe is eligible for /oi-g or -o.

b) ,"ple"e- P*ho- scrip o fi-! bigges -u"ber bewee- wo -u"bers.

7ee8 +

a) ,"ple"e- P*ho- Scrip o ge-erae pri"e -u"bers series up o -.b) ,"ple"e- P*ho- Scrip o chec5 gi/e- -u"ber is pali-!ro"e or -o.c) ,"ple"e- P*ho- scrip o pri- facorial of a -u"ber.

7ee8 @

a) ,"ple"e- P*ho- Scrip o perfor" /arious operaio-s o- sri-g usi-g sri-glibraries.

b) ,"ple"e- P*ho- Scrip o chec5 gi/e- sri-g is pali-!ro"e or -o.

7ee8 0

a) Defi-e a fu-cio- "a?ofhree() ha a5es hree -u"bers as argu"e-s a-!reur-s he larges of he".

b) 8rie a progra" which "a5es use of fu-cio- o !ispla* all such -u"bers whichare !i/isible b* 3 bu are -o a "uliple of '; bewee- 1$$$ a-! #$$$.

7ee8

a) Defi-e a fu-cio- which ge-eraes 2ibo-acci series up o - -u"bers.b) Defi-e a fu-cio- ha chec5s wheher he gi/e- -u"ber is Ar"sro-g.

7ee8 -

a) 8rie a progra" which acceps a se:ue-ce of co""a&separae! -u"bers fro"co-sole a-! ge-erae a lis a-! a uple which co-ai-s e/er* -u"ber.

#0

L T C

0 / 0


24/47

Suppose he followi-g i-pu is supplie! o he progra"=0%;3;'';00;1#;HF. The-; heoupu shoul! be= Q0%; 3; ''; 00; 1#; HF (0%; 3; ''; 00; 1#; HF).

b) 8ih a gi/e- uple (1;#;0;%;';;3;F;H;1$); wrie a progra" o pri- he firs half /aluesi- o-e li-e a-! he las half /alues i- o-e li-e.

7ee8 ,

a) 8rie a p*ho- scrip o perfor" basic !icio-ar* operaio-s li5e i-ser; !eleea-! !ispla*.

b) 8rie a p*ho- scrip o fi-! fre:ue-c* of wor!s i- a file usi-g !icio-aries.

7ee8 .

a) 8rie P*ho- scrip o !ispla* file co-e-s.b) 8rie P*ho- scrip o cop* file co-e-s fro" o-e file o a-oher.

7ee8

a) Defi-e a class -a"e! Reca-gle which ca- be co-sruce! b* a le-gh a-! wi!h. TheReca-gle class has a "eho! which ca- co"pue he area.

b) Defi-e a class -a"e! Circle which ca- co-sruce! b* ra!ius. The !eri/e! classesArea; Circu"fere-ce uses "eho!s calle! calArea(); calCirc() respeci/el* ocalculae area; circu"fere-ce of circle.

7ee8 9/

a) ,"ple"e- P*ho- scrip o !e/elop sac5 ADT a-! is operaio-s.b) ,"ple"e- P*ho- scrip o e/aluae posfi? e?pressio-.

7ee8 99

a5 ,"ple"e- P*ho- scrip o !e/elop :ueue ADT a-! is operaio-s.!5 ,"ple"e- P*ho- scrip o perfor" ree ra/ersals.

7ee8 9+

8rie a p*ho- scrip o !ispla* followi-g shapes usi-g urle.

a) !5

#%


25/47

7ee8 9@

8rie a p*ho- scrip o !ispla* followi-g shapes usi-g urle.

a5 !5

Ad=anced Data Structure La!

1. +i-5e! liss#. Mulisac5s0. Double E-!e! 9ueue (De:ues) Circular 9ueues%. Mi- 6eap'. Deaps. +efis 6eap3. AB+ TreeF.


26/47


(AUTONOMOUS)


DATA 7AREHOUSING AND DATAMINING

290CSP9+T9/5

Course Objectives ;

To !iffere-iae -+i-e Tra-sacio- Processi-g a-! -+i-e A-al*ical processi-g To lear- Muli!i"e-sio-al sche"as suiable for !aa warehousi-g To u-!ersa-! /arious !aa "i-i-g fu-cio-aliies To i-culcae 5-owle!ge o- !aa "i-i-g :uer* la-guages. To 5-ow i- !eail abou !aa "i-i-g algorih"s

Learning Outcomes:Afer co"pleio- of he course he su!e- will be able o

Abili* o appl* Desig- a !aa "ar or !aa warehouse for a-* orga-iaio- Abili* o appl* De/elop s5ills o wrie :ueries usi-g DM9+ Able o e?rac 5-owle!ge usi-g !aa "i-i-g ech-i:ues Abili* o a!ap o -ew !aa "i-i-g ools. Abili* o e?plore rece- re-!s i- !aa "i-i-g such as web "i-i-g; spaial&e"poral

"i-i-g.

UNIT I

Introduct"on ;Daa Mi-i-g; i-!s of Daa; Daa Mi-i-g 2u-cio-aliies; Classificaio- ofDaa Mi-i-g S*se"s; Pri"ii/es; Maor ,ssues i- Daa Mi-i-g. Data Pre&rocess"n'=

Descripi/e Daa Su""ariaio-; Daa Clea-i-g; Daa ,-egraio- a-! Tra-sfor"aio-; DaaRe!ucio-; Daa Discreiaio- a-! Co-cep 6ierarch* Ge-eraio-.

UNIT IIData 7are$ouse and OLAP Tec$noo'y= 8ha is Daa 8arehouse; A Muli!i"e-sio-alDaa Mo!el; Daa 8arehouse Archiecure; Daa 8arehouse ,"ple"e-aio-; 2ro" Daa8arehouse o Daa Mi-i-g. M"n"n' Freuent Patterns and Assoc"at"ons; "cat"on and Pred"ct"on;,ssues regar!i-g classificaio- a-! pre!icio-; classificaio-b* !ecisio- ree i-!ucio-;


27/47

A&&"cat"ons and Trends "n Data M"n"n'; Daa Mi-i-g Applicaio-s; = Daa Mi-i-g for2i-a-cial Daa A-al*sis; Daa Mi-i-g for he Reail ,-!usr*; Daa Mi-i-g for heTeleco""u-icaio- ,-!usr*; Daa Mi-i-g for ,T &,;,,;,,,;,B.B)

Re>erence Boo8s;

1.Margare 6 Du-ha"; Daa Mi-i-g ,-ro!ucor* a-! A!/a-ce! Topics; Pearso- E!ucaio-;#e; #$$.#.A"iesh Si-ha; Daa 8arehousi-g; Tho"so- +ear-i-g; #$$3.

#3


28/47


(AUTONOMOUS)

M# Tec$ I Year * IISEM 2CSE5

A4A AND 7EB TECHNOLOGIES

290CSP9+T995

Course Objectives : To "a5e he su!e-s beer u-!ersa-!i-g of web co-ceps. To lear- abou 7a/a a-! Apples. To 5-ow abou Swi-g co"po-e-s a-! Muli"e!ia progra""i-g. To su!* abou he -ee! a-! i"pora-ce of 7a/a R+ @ 6TM+ @ D6TM+ Casca!i-g S*le Shees @ Scripi-g +a-guages 7a/ascrip @

B


29/47

1. Deiel; Deiel a-! eio; J,-er-e a-! 8orl! 8i!e 8eb; 6ow o progra"K; Pearso-e!ucaio- Asia; #$$1.#. 7a/a # >-leashe! (Tech"e!ia @ SAMS)


30/47


(AUTONOMOUS)

M# Tec$ I Year * IISEM 2CSE5

MOBILE

COMPUTING

290CSP9+T9+5Course Objectives:

,-ro!ucio- of a- a!/a-ce! ele"e- of lear-i-g i- he fiel! of wirelessco""u-icaio-.

,-ro!uces he basic co-ceps a-! pri-ciples i- "obile co"pui-g.

E?pose he su!e-s o he co-ceps of wireless !e/ices a-! "obile co"pui-g.Learning Outcomes#


Su!e-s o u-!ersa-! he co-cep of "obile co"pui-g a-! archiecure of"obile co""u-icaio-.

Appl* he co-ceps of "obile co"pui-g o- co-/e-io-al wire! -ewor5s .

UNIT I

Introduct"on to Mo!"e Co%%un"cat"on and Co%&ut"n'; o/el applicaio-s @ A shorhisor* of wireless co""u-icaio-&A "a5e for "obile co""u-icaio-s.GSM; Mobile ser/ices; S*se" archiecure; Ra!io ,-erface; Proocols; +ocaliaio- a-!calli-g; 6a-!o/er; Securi*; ew !aa Ser/ices

UNIT II

27"reess5 Med"u% Access Contro; Moi/aio- for a specialie! MAC (6i!!e- a-!e?pose! er"i-als; ear a-! far er"i-als); SDMA; 2DMA; TDMA; CDMA.

UNIT III

Mo!"e Netor8 Layer; Mobile ,P (Goals; assu"pio-s; e-iies a-! er"i-olog*; ,P pac5e!eli/er*; age- a!/erise"e- a-! !isco/er*; u--elli-g a-! e-capsulaio-); D*-a"ic 6osCo-figuraio- Proocol (D6CP); Properies a-! Applicaio-s of a MAETs & Roui-g @DSDB @ DSR.

UNIT I4

Mo!"e Trans&ort and A&&"cat"on Layer; Tra!iio-al TCP & ,-!irec TCP & S-oopi-g TCP& Mobile TCP @ 2as rera-s"i42as reco/er* & Tra-s"issio-4i"e&ou freei-g & Seleci/erera-s"issio- @ Tra-sacio- rie-e! TCP @ 8ireless Applicaio- Proocol.

UNIT*4Protocos and Toos;


31/47

proocol(archiecure&wieless !aagra" proocol&wireless ra-spor la*er securi*&8irelesssessio- proocol&wireless applicaio- e-/iro-"e-&wireless "ar5up la-guage).

Te:t Boo8s ;

1. 7oche- Schiller; JMobile Co""u-icaio-sK; $ddison&%esley. (Chapers,;,,;,,,;,B;B);seco-! e!iio-; #$$%.

#. So"e-o/ic a-! Cacue; J6a-!boo5 of 8ireless ewor5s a-! Mobile Co"pui-gK;%iley; #$$#.

Re>erence Boo8s;

1. Rea -i/ersi* Press;cober #$$%.

#. A!elsei-; 2ra-5; Gupa; Sa-!eep S; Richar! ,,,; Gol!e-; Schwieber; +ore-;

J2u-!a"e-als of Mobile a-! Per/asi/e Co"pui-gK; ,S


32/47


(AUTONOMOUS)

M# Tec$ I Year * II SEM 2CSE5

AD4ANCED COMPUTER NET7ORS

290CSP9+T9@5

Course Objectives: To "a5e he su!e-s recall he basics of co"puer -ewor5s a-! o !iscuss

!iffere- co"puer -ewor5i-g proocols. To refresh he 5-owle!ge of -ewor5i-g !e/ices a-! lear- !aa li-5 la*er a-!

+A proocols i- !eail. To "a5e he su!e-s lear- he core co-ceps of cellular wireless -ewor5s. To i-ro!uce he co-ceps of opical -ewor5s a-! proocols i- opical

-ewor5s. To "a5e he su!e-s lear- wha is wireless se-sor -ewor5s a-! !iffere-

8S proocols

Learning Outcomes#Afer co"pleio- of he course he su!e- will be able o

Su!e-s will refresh heir 5-owle!ge i- basics of co"puer -ewor5s a-!TCP4,P a-! S, la*ers.

Su!e-s will lear- !iffere- li-5 la*er proocols a-! +A proocols. Su!e-s will lear- cha--el assig-"e-s; ha-!offs; allocaio-; cha--el

i-erfere-ce a-! power co-rol. The* will be able o su!* wha are opical -ewor5s a-! use of MP+S

proocol i- opical -ewor5i-g; a-! lear- abou opical swiches. The* will lear- abou 8ireless Se-sor ewor5s (8S); a-! 8S e-erg*

efficie- roui-g proocols.

UNIT I

Re="e o> Co%&uter Netor8s and Netor8"n' de="ces; 8ha is he ,-er-e; Theewor5 e!ge; The ewor5 core;Access ewor5s a-! Ph*sical "e!ia; ,SPs a-! ,-er-e Netor8"n' Protocos;'&la*er TCP4,P Mo!el; 3&+a*erS, Mo!el; ,-er-e Proocols a-! A!!ressi-g; E:ual&Sie! Pac5es Mo!el= ATM.Netor8"n' De="ces; Muliple?ers; Mo!e"s a-! ,-er-e Access De/ices; Swichi-g a-!Roui-g De/ices;Rouer Srucure.UNIT IIRout"n' and Internetor8"n';ewor5@+a*er Roui-g; +eas&Cos&Pah algorih"s; o-&+eas&Cos&Pahalgorih"s; ,-ra!o"ai- Roui-g Proocols; ,-er!o"ai- Roui-g Proocols;Co-gesio- Co-rol a ewor5 +a*er. Lo'"ca Address"n';,P/% A!!resses; ,P/ A!!resses& Internet Protoco; ,-er-ewor5i-g; ,P/%; ,P/; Tra-siio- fro" ,P/% o ,P/ @Mut"cast"n' Tec$n"ues and Protocos; ser Daagra" Proocol (>DP); Mobile Tra-spor Proocols; TCPCo-gesio- Co-rol A&&"cat"on Layer;Pri-ciples of ewor5 Applicaio-s; The 8eb a-!6TTP; 2ile Tra-sfer= 2TP; Elecro-ic Mail i- he ,-er-e; Do"ai- a"e S*se" (DS); P#P

0#

L T C

0 / 0


33/47

2ile Shari-g; Soc5e Progra""i-g wih TCP a-! >DP; ,TS&,; ,,; ,,,).#.Co"puer a-! Co""u-icaio- ewor5s; )ader F. *ir, Pearso- E!ucaio-; #$$3.(>,T&,B; B).

Re>erence Boo8s; 1.Daa Co""u-icaio-s a-! ewor5i-g;


34/47


(AUTONOMOUS)


SOFT7ARE ?UALITY ASSURANCE AND TESTING

290CSP9+T905Course Objectives:

8h* !o sofware esi-g The "ea-i-g of blac5&bo? esi-g a-! whie&bo? esi-g Sofware Tesi-g hroughou

he Sofware Process Sofware Tesi-g a-! E?re"e Progra""i-g. The Auo"aio- of Sofware Tesi-g Difficulies a-! +i"iaio-s of Sofware Tesi-g The -!ersa-! he effeci/el* sraegies of esi-g; he "eho!s a-! ech-ologies of

sofware esi-g Desig- es pla- a-! es cases.

Do auo"aic esi-g. Esablish a esi-g group a-! "a-age he whole esi-g proec. Clearl* a-! correcl* repor he sofware !efeci/es. Disi-guish relaio-ship bewee- he sofware esi-g.

UNIT I

So>tare ?ua"ty Assurance Fra%eor8 and Standards S?A Fra%eor8= 8ha is9uali* Sofware 9uali* Assura-ce; Co"po-e-s of Sofware 9uali* Assura-ce @So>tare ?ua"ty Assurance Pan; Seps o !e/elop a-! i"ple"e- a Sofware 9uali*Assura-ce Pla- @ ?ua"ty Standards; ,S H$$$ a-! Co"pa-io- ,S Sa-!ar!s; ; Malco"tare ?ua"ty Assurance Metr"cs and Measure%ent So>tare ?ua"ty Metr"cs=Pro!uc 9uali* "erics; ,-&Process 9uali* Merics; Merics for Sofware Mai-e-a-ce;E?a"ples of Meric Progra"s.

UNIT IIISo>tare ?ua"ty %etr"cs %et$odoo'y; Esablish :uali* re:uire"e-s; ,!e-if* Sofware:uali* "erics; ,"ple"e- he sofware :uali* "erics; a-al*e sofware "erics resuls;/ali!ae he sofware :uali* "erics @ So>tare ua"ty "nd"cators @ Funda%entas "nMeasure%ent t$eory #

UNIT I4

So>tare Test"n' Tec$n"ues


35/47

UNIT 4So>tare Test"n' Toos Ta?o-o"* of Tesi-g ools; Meho!olog* o e/aluaeauo"ae! esi-g ools; +oa! Ru--er; 8i- ru--er a-! Raio-al Tesi-g Tools; 7a/a Tesi-gTools; 7Mera; 7>,T a-! Cacus.Te:t Boo8s;

9# Effeci/e Meho!s for Sofware Tesi-g; #-! E!iio-; 8illia" E. Perr* ; Seco-!E!iio-;8ile* ,-!ia; #$$.

+# Sofware 9uali*; Mor!echai erence !oo8s;

1. Tesi-g a-! 9uali* Assura-ce for Co"po-e-&base! Sofware; b* Gao; Tsao a-! 8u;Arech 6ouse Publishers

#. Sofware Tesi-g Tech-i:ues; b*


36/47


(AUTONOMOUS)


DISTRIBUTED SYSTEMS

2 90CSP9+E+a 52Eect"=e II5

Course Objectives:

To e?plore !isribue! s*se"s pri-ciples asociae! wih co""u-icaio-; -a"i-g. To e?plore s*-chro-iaio-; !isribue! file s*se"s; s*se" !esig-; !isribue!

sche!uli-g; a-! se/eral case su!ies. To co/er boh fou-!aio-al co-ceps a-! as well as pracical !eplo*"e-s.

Learning Outcomes:

Afer co"pleio- of he course he su!e- will be able o 6ow !isribue! s*se"s "a* be co-sruce! usi-g a /arie* of ools a-! approaches.

Su!e-s will be able o !esig-; a-! i"ple"e- !isribue! sofware s*se"s i- 7a/ausi-g soc5es re"oe proce!ure cal l "echa-is"s a-! a/a RM,.

UNIT I

Characeriaio- of Disribue! S*se"s&,-ro!ucio-&E?a"ples&Resource Shari-g a-!he 8eb&Challe-ges.S*se" Mo!els&Archiecural&2u-!a"e-al.,-erprocessCo""u-icaio-&,-ro!ucio-&AP, for ,-er-e proocols&E?er-al !aa represe-aio- a-!"arshalli-g&&Clie-&ser/er co""u-icaio-&Group co""u-icaio-&Case su!*= ,-erprocessCo""u-icaio- i- >,O.

UNIT IIDisribue! becs a-! Re"oe ,-/ocaio-&,-ro!ucio-&Co""u-icaio- bewee-!isribue! obecs&Re"oe proce!ure calls&E/e-s a-! -oificaio-s&Case su!*= 7a/aRM,.perai-g S*se" Suppor&,-ro!ucio-&S la*er&Proecio-&Processes a-! hrea!s&Co""u-icaio- a-! i-/ocaio- S archiecure.

UNIT III

Disribue! 2ile S*se"s&,-ro!ucio-&2ile ser/ice archiecure&Case Su!*=Su- ewor52ile S*se"&E-ha-ce"e-s a-! furher !e/elop"e-s. a"e Ser/ices&,-ro!ucio-&a"eSer/ices a-! he Do"ai- a"e S*se"&Direcor*Ser/ices&Case Su!*= Global a"eSer/ice.

UNIT I4Ti"e a-! Global Saes&,-ro!ucio-&Cloc5s; e/e-s a-! process saes&S*-chro-ii-gph*sical cloc5s&+ogical i"e a-! logical cloc5s&Global saes&Disribue! !ebuggi-g.Coor!i-aio- a-! Agree"e-&,-ro!ucio-&Disribue! "uual e?clusio-&Elecio-s&Mulicas co""u-icaio-&Co-se-sus a-! relae! proble"s.

UNIT 4Disribue! Share! Me"or*&,-ro!ucio-&Desig- a-! i"ple"e-aio- issues&Se:ue-ialco-sise-c* a-! ,/* case su!* Release co-sise-c* a-! Mu-i- case su!*&herco-sise-c* "o!els.CR


37/47

Te:t Boo8s

1. George Coulouris; 7ea- Dolli"ore; Ti" i-!berg; ; Disribue! S*se"s= Co-cepsa-! Desig-; %h E!iio-; Pearso- E!ucaio-; #$$'.(>,T ,;,,;,,,;,B;B).

Re>erence Boo8s

1. A.S. Ta-e-bau" a-! M. B. See-; Disribue! S*se"s= Pri-ciples a-! Para!ig"s;

Seco-! E!iio-; Pre-ice 6all; #$$.#. M.+.+iu; JDisribue! Co"pui-g Pri-ciples a-! Applicaio-sK; Pearso- A!!iso-8esle*; #$$%.0. Mu5esh Si-ghal; JA!/a-ce! Co-ceps ,- perai-g S*se"sK; McGraw6ill Series i-Co"puer Scie-ce; 1HH%.%. a-c* A. +*-ch; Disribue! Algorih"s; The Morga- auf"a-- Series i- DaaMa-age"e- S*se"; Morga- auf"a-- Publishers; #$$$.

03


38/47


(AUTONOMOUS)


CLOUD COMPUTING

290CSP9+E+!5 2Eect"=e II5

Course Objectives:

The obeci/e focuses o- ech-ologies specific o he -ewor5e!; !isribue!!i"e-sio- of sofware a-! access o ser/ices a-! !aa.

, will suppor lo-g&er" research o- -ew pri-ciples; "eho!s; ools a-!ech-i:ues e-abli-g sofware !e/elopers i- he E> o easil* creaei-eroperable ser/ices base! o- ope- sa-!ar!s; wih sufficie- fle?ibili* a-!a a reaso-able cos

earning outcomes#Afer co"pleio- of he course he su!e- will be able o

,-ellige- a-! auo-o"ic "a-age"e- of clou! resources; e-suri-g agileelasic scalabili*. Scalable !aa "a-age"e- sraegies; a!!ressi-g he issuesof heeroge-ei*; co-sise-c*; a/ailabili*; pri/ac* a-! suppori-g securi*.

Tech-ologies for i-frasrucure /irualiaio-; cross plafor"s e?ecuio- as-ee!e! for ser/ice co"posiio- across "uliple; heeroge-eous e-/iro-"e-s;auo-o"ous.

Ma-age"e- of har!ware a-! sofware resources. ,-eroperabili* a"o-gs !iffere- clou!s; porabili*; proecio- of !aa i-

clou! e-/iro-"e-s; co-rol of !aa !isribuio- a-! lae-c*.Sea"less supporof "obile; co-e?&aware applicaio-s.

UNIT 9

E:a%"n"n' t$e 4aue Pro&os"t"on; De>"n"n' Coud Co%&ut"n' (CC >or s$ort);

Defi-iio- Clou! *pes characerisics of CC Role of ope- sa-!ar!s. Assessi-g he BalueProposiio-= Measuri-g he coul! /alue; A/oi!i-g capial e?pe-!iure; Toal cos ofow-ership; Specif*i-g S+As

UNIT +

Arc$"tecture and ty&es; Coud Arc$"tecture;CC sac5 Co--eci-g o he clou!.

Ser/ices a-! Applicaio-s b* *pe= ,aaS; PaaS; SasS; ,DasS; CaaS.

UNIT @

Pat>or%s; Absracio-s a-! Birualiaio-= >si-g /irualiaio- ech-ologies +oa!bala-ci-g a-! /irualiaio-; 6*per/isor; Machi-e i"age; pori-g applicaio-s.Ca&ac"ty &ann"n';!efi-i-g baseli-e a-! "erics ewor5 capaci*.Pat>or% as a Ser="ce;Defi-i-g ser/ice; PaaS applicaio- fra"ewor5s.

UNIT 0

Coud co%&ut"n' "t$ T"tans; Google a-! A"ao- web ser/ices; Microsof clou! ser/ices.

0F

L T C

0 / 0


39/47

UNIT

E:&or"n' Coud In>rastructures; Ma-agi-g he clou!= A!"i-israi-g he clou! Clou!"a-age"e- pro!ucs E"ergi-g clou! "a-age"e- sa-!ar!s.

Clou! Securi*= Securi-g he clou! securi-g !aa Esablishi-g i!e-i* a-! prese-ce.Ser="ces 3 A&&"cat"ons; Ser/ice rie-e! Archiecure= ,-ro!ucio- Defi-i-g SAco""u-icaio-s Ma-agi-g a-! "o-iori-g SA Relai-g SA a-! CC. Mo/i-gapplicaio-s o clou!. Clou! base! sorage. 8eb"ail ser/ices.

Te:t Boo8s;

1. Clou! Co"pui-g @


40/47


(AUTONOMOUS)

M# Tec$ I Year * I I SEM 2CSE5

IMAGE PROCESSING

290CSP9+E+c5

2Eect"=e II5

Course Objectives:

To lear- he fu-!a"e-als of ,"age Processi-g.

To lear- sa"pli-g a-! reco-srucio- proce!ures.

To lear- he /arious ra-sfor"s use! i- i"age Processi-g.

To su!* /arious co-ceps of i"age e-ha-ce"e-; reco-srucio- a-! i"age

co"pressio-.

To !esig- i"age processi-g s*se"s.

Learning Outcomes:


De/elops abili* o i!e-if*; for"ulae sol/e proble"s i-/ol/i-g i"ages.

De/elops abili* o !esig- co-!uc e?peri"e-s; a-al*e i-erpre i"age !aa.

To !esig- a sofware; Co"po-e- or process as per -ee!s specificaio-s.

, will !e"o-srae he s5ills o use "o!er- e-gi-eeri-g ools; sofwareLs e:uip"e-

o a-al*e proble"s.

De/elop co-fi!e-ce for self&e!ucaio- abili* for life&lo-g.

UNIT I

DIGITAL IMAGE FUNDAMENTALS

,-ro!ucio-; ,"age se-si-g ac:uisiio-; Co-cep of gra* le/els. Gra* le/el o bi-ar* i"ageco-/ersio-. Sa"pli-g a-! :ua-iaio-. Relaio-ship bewee- pi?els. ,"agi-g Geo"er*;operaio-s o- !igial i"age= arra* Bs "ari?; li-ear Bs -o-&li-ear; arih"eic operaio-s; sea-! logical operaio-s; spaial operaio-s; /ecor a-! "ari? operaio-s; probabilisic"eho!s.

UNIT II

IMAGE TRANSFORMS#&D 22T; Properies. 8alsh ra-sfor"; 6a!a"ar! Tra-sfor";Discree cosi-e Tra-sfor"; 6aar ra-sfor"; wa/ele ra-sfor"; 6oelli-g ra-sfor";co"pariso- of !iffere- i"age ra-sfor"s.

%$

L T C

0 / 0


41/47

UNIT III

IMAGE ENHANCEMENT

E-ha-ce"e- i- Spaial Do"ai-= Poi- processi-g. 6isogra" processi-g. Spaialfileri-g(S"oohi-g a-! sharpe-i-g); E-ha-ce"e- i- fre:ue-c* !o"ai-=


42/47


(AUTONOMOUS)


COMPILER CONSTRUCTION

2 90CSP9+E+d5

2Eect"=e*II5

Course Objectives: Thorough u-!ersa-!i-g of he o/erall archiecure of a "o!erco"piler.


43/47

UNIT*4

S*"bol Tables= S*"bol able for"a; orga-iaio- for bloc5 srucures la-guages; hashi-g;ree srucures represe-aio- of space i-for"aio-. erence Boo8s;

1. Co"piler !esig-= Theor*; Tools a-! e?a"ples b* seh D.


44/47


(AUTONOMOUS)


DATA 7AREHOUSING DATA MINING

3

A4A AND 7EB TECHNOLOGIES LAB

290CSP9+P/+5

Data 7are$ous"n' Data M"n"n' La!

Course Objectives:

Co"pare a-! co-ras !iffere- uses of !aa "i-i-g as e/i!e-ce! i- bohresearch a-! applicaio-.

E?plai- he /alue of fi-!i-g associaio-s i- "ar5e bas5e !aa. Characerie he 5i-!s of paer-s ha ca- be !isco/ere! b* associaio- rule

"i-i-g. Describe how o e?e-! a relaio-al s*se" o fi-! paer-s usi-g associaio-

rules.Learning Outcomes:

Afer co"pleio- of he course he su!e- will be able o E/aluae !iffere- "eho!ologies for effeci/e applicaio- of !aa "i-i-g. ,!e-if* a-! characerie sources of -oise; re!u-!a-c*; a-! ouliers i- prese-e! !aa. ,!e-if* "echa-is"s (o-&li-e aggregaio-; a-*i"e beha/ior; i-eraci/e /isualiaio-)

o close he loop i- he !aa "i-i-g process. Describe wh* he /arious close&he&loop processes i"pro/e he effeci/e-ess of !aa

"i-i-g.

Descr"&t"on; The busi-ess of ba-5s is "a5i-g loa-s. Assessi-g he cre!i worhi-ess of a-applica- is of crucial i"pora-ce. You ha/e o !e/elop a s*se" o help a loa- officer !eci!ewheher he cre!i of a cuso"er is goo!; or ba!. A ba-5s busi-ess rules regar!i-g loa-s "usco-si!er wo opposi-g facors. - he o-e ha-!; a ba-5 wa-s o "a5e as "a-* loa-s as

possible. ,-eres o- hese loa-s is he ba-5s profi source. - he oher ha-!; a ba-5 ca--o

affor! o "a5e oo "a-* ba! loa-s. Too "a-* ba! loa-s coul! lea! o he collapse of heba-5. The ba-5s loa- polic* "us i-/ol/e a co"pro"ise= -o oo sric; a-! -o oo le-ie-.

To !o he assig-"e-; *ou firs a-! fore"os -ee! so"e 5-owle!ge abou he worl! of cre!i.You ca- ac:uire such 5-owle!ge i- a -u"ber of wa*s.1. -owle!ge E-gi-eeri-g. 2i-! a loa- officer who is willi-g o al5. ,-er/iew her a-! r* oreprese- her 5-owle!ge i- he for" of pro!ucio- rules.#.


45/47

T$e Ger%an Cred"t Data=Acual hisorical cre!i !aa is -o alwa*s eas* o co"e b* because of co-fi!e-iali* rules.6ere is o-e such !aase; co-sisi-g of 1$$$ acual cases collece! i- Ger"a-*. cre!i !aase(origi-al)E?cel sprea!shee/ersio- of he Ger"a- cre!i !aa (Dow- loa! fro" web).,- spie of he fac ha he !aa is Ger"a-; *ou shoul! probabl* "a5e use of i for hisassig-"e-. (>-less *ou reall* ca- co-sul a real loa- officer U)

A few -oes o- he Ger"a- !aaseV DM sa-!s for Deusche Mar5; he u-i of curre-c*; worh abou H$ ce-s Ca-a!ia- (buloo5s a-! acs li5e a :uarer).V ow-selepho-e. Ger"a- pho-e raes are "uch higher ha- i- Ca-a!a so fewer people ow-elepho-es.V foreig-wor5er. There are "illio-s of hese i- Ger"a-* ("a-* fro" Turr5e*). , is /er*har! o ge Ger"a- ciie-ship if *ou were -o bor- of Ger"a- pare-s.V There are #$ aribues use! i- u!gi-g a loa- applica-. The goal is he classif* heapplica- i-o o-e of wo caegories; goo! or ba!.

Su!tas8s ; 2Turn "n your ansers to t$e >oo"n' tas8s5

1. +is all he caegorical (or -o"i-al) aribues a-! he real&/alue! aribues seperael*.

#. 8ha aribues !o *ou hi-5 "igh be crucial i- "a5i-g he cre!i assesse"e- Co"eup wih so"e si"ple rules i- plai- E-glish usi-g *our selece! aribues.

0. -e *pe of "o!el ha *ou ca- creae is a Decisio- Tree & rai- a Decisio- Tree usi-g heco"plee !aase as he rai-i-g !aa. Repor he "o!el obai-e! afer rai-i-g.

%. Suppose *ou use *our abo/e "o!el rai-e! o- he co"plee !aase; a-! classif* cre!igoo!4ba! for each of he e?a"ples i- he !aase. 8ha W of e?a"ples ca- *ou classif*correcl* (This is also calle! esi-g o- he rai-i-g se) 8h* !o *ou hi-5 *ou ca--oge 1$$ W rai-i-g accurac*

'. ,s esi-g o- he rai-i-g se as *ou !i! abo/e a goo! i!ea 8h* or8h* -o

. -e approach for sol/i-g he proble" e-cou-ere! i- he pre/ious :uesio- is usi-gcross&/ali!aio- Describe wha is cross&/ali!aio- briefl*. Trai- a Decisio- Tree agai-usi-g cross&/ali!aio- a-! repor *our resuls. Does *our accurac* i-crease4!ecrease 8h* (1$ "ar5s)

3. Chec5 o see if he !aa shows a bias agai-s foreig- wor5ers (aribue #$);orperso-al&saus (aribue H). -e wa* o !o his (perhaps raher si"ple "i-!e!) is ore"o/e hese aribues fro" he !aase a-! see if he !ecisio- ree creae! i- hose casesis sig-ifica-l* !iffere- fro" he full !aase case which *ou ha/e alrea!* !o-e. Tore"o/e a- aribue *ou ca- use he preprocess ab i- 8e5as G>, E?plorer. Di! re"o/i-ghese aribues ha/e a-* sig-ifica- effec Discuss.

F. A-oher :uesio- "igh be; !o *ou reall* -ee! o i-pu so "a-* aribues o ge goo!resuls Ma*be o-l* a few woul! !o. 2or e?a"ple; *ou coul! r* us ha/i-g aribues #;0; '; 3; 1$; 13 (a-! #1; he class aribue (-aurall*)). Tr* ou so"e co"bi-aio-s. (Youha! re"o/e! wo aribues i- proble" 3. Re"e"ber o reloa! he arff !aa file o ge allhe aribues i-iiall* before *ou sar seleci-g he o-es *ou wa-.)

%'


46/47

H. So"ei"es; he cos of reeci-g a- applica- who acuall* has a goo! cre!i (case 1)"igh be higher ha- accepi-g a- applica- who has ba! cre!i (case #). ,-sea! ofcou-i-g he "isclassifcaio-s e:uall* i- boh cases; gi/e a higher cos o he firs case(sa* cos ') a-! lower cos o he seco-! case. You ca- !o his b* usi-g a cos "ari? i-8e5a. Trai- *our Decisio- Tree agai- a-! repor he Decisio- Tree a-! cross&/ali!aio-resuls. Are he* sig-ifica-l* !iffere- fro" resuls obai-e! i- proble" (usi-g e:ual

cos)

1$. Do *ou hi-5 i is a goo! i!ea o prefer si"ple !ecisio- rees i-sea! of ha/i-g lo-gco"ple? !ecisio- rees 6ow !oes he co"ple?i* of a Decisio- Tree relae o he bias ofhe "o!el

11. You ca- "a5e *our Decisio- Trees si"pler b* pru-i-g he -o!es. -e approach is o useRe!uce! Error Pru-i-g & E?plai- his i!ea briefl*. Tr* re!uce! error pru-i-g for rai-i-g*our Decisio- Trees usi-g cross&/ali!aio- (*ou ca- !o his i- 8e5a) a-! repor heDecisio- Tree *ou obai- Also; repor *our accurac* usi-g he pru-e! "o!el. Does *ouraccurac* i-crease

1#. (E?ra Cre!i)= 6ow ca- *ou co-/er a Decisio- Trees i-o if&he-&else rules. Ma5e up*our ow- s"all Decisio- Tree co-sisi-g of #&0 le/els a-! co-/er i i-o a se of rules.There also e?is !iffere- classifiers ha oupu he "o!el i- he for" of rules & o-e suchclassifier i- 8e5a is rules.PART; rai- his "o!el a-! repor he se of rules obai-e!.So"ei"es us o-e aribue ca- be goo! e-ough i- "a5i-g he !ecisio-; *es; us o-e UCa- *ou pre!ic wha aribue ha "igh be i- his !aase -eR classifier uses a si-glearibue o "a5e !ecisio-s (i chooses he aribue base! o- "i-i"u" error). Repor herule obai-e! b* rai-i-g a o-e R classifier. Ra-5 he perfor"a-ce of %F; PART a-!o-eR.

Tas8 Resources;A-!rew Moores Daa Mi-i-g Tuorials(See uorials o- Decisio- Trees a-! CrossBali!aio-)

Decisio- Trees(Source= Ta-; MS>) To" Michells boo5 sli!es(See sli!es o- Co-cep +ear-i-g a-! Decisio- Trees) 8e5a resources=

o ,-ro!ucio- o 8e5a(h"l /ersio-) (!ow-loa!pp/ersio-)o Dow-loa! 8e5ao 8e5a Tuorialo AR22 for"ao >si-g 8e5a fro" co""a-! li-e

%


47/47

a=a and 7e! Tec$noo'"es La!

S#No# Na%e o> E:erc"se

1. ,"ple"e-aio- of Sac5 >si-g Arra*s Creaio- of college websie

#. ,"ple"e-aio- of 9ueue >si-g Arra*s 8or5i-g o- CSS

0. ,"ple"e-aio- of +is >si-g Arra*s Clie- si!e /ali!aio- usi-g 7a/ascrip

%. Towers of 6a-oi Displa*i-g

Documents

M.Tech syllabus.doc