Teaching Plan ForDSA

7/25/2019 Teaching Plan ForDSA

http://slidepdf.com/reader/full/teaching-plan-fordsa 1/3

G.H. Raisoni College Of Engineering and Management

Chas, Ahmednagar - 414008.

Deartment of Ele!troni!s " #ele!omm$ni!ation Engineering

Teaching Plan

%nit &o. &ame of %nit #oi! 'roosed Date Cond$!tion Date Remar(

1

Constants, variables and keywords in C 1

operators in C 1

1

1

1

structure, union 1

1

1

Dynamic memory management 1

1

)$*+e!t &ame Data structures & Algorithms )$*+e!t Code: 204184

&ame of )taff mem*erMr.N.V.Deshmukh ear 2016-17 )EM

Co$rse !" #" & $% 201'(

Co$rse O*+e!ties $o assess ho) the choice o* +ata structures a,+ algorithm +esig, metho+s imacts the er*orma,ce o* rograms. $o choose the aroriate +ata structure a,+ algorithm +esig, metho+ *or a seci*ie+ alicatio,. $o stu+ the sstematic )a o* sol/i,g rolems /arious metho+s o* orga,ii,g large amou,ts o* +ata. $o sol/e rolems usi,g +ata structures such as li,ear lists stacks 3ueues i,ar trees i,ar search trees a,+ grahs a,+ )riti,g rograms *or these solutio,s.

$o emlo the +i**ere,t +ata structures to *i,+ the solutio,s *or seci*ic rolems Co$rse O$t!omes, comletio, o* the course stu+e,t )ill e ale to :1. Discuss the comutatio,al e**icie,c o* the ri,cial algorithms such as sorti,g & searchi,g.2. 5rite a,+ u,+ersta,+ the rograms that use arras & oi,ters i, % . Descrie ho) arras recor+s li,ke+ structuresare rerese,te+ i, memor a,+ use them i, algorithms.4. mleme,t stacks & 3ueues *or /arious alicatio,s.'. ,+ersta,+ /arious termi,ologies a,+ tra/ersals o* trees a,+ use them *or /arious alicatio,s.6. ,+ersta,+ /arious termi,ologies a,+ tra/ersals o* grahs a,+ use them *or /arious alicatio,s.

&$m*er of

le!t$res

,tro+uctio, to % a,+Algorithm

control structure in c(decision, loop andcase)

Functions: Parameter passing call by value and callby reference, macros

arrays and string manipulation, tringmanipulations using !rrays

enumeration, bitwiseoperations , scope rules

functions and pointers, function returning pointer,pointer to function,pointer to pointer

!nalysis of algorit"m: fre#uency count and itsimportance in analysis of an algorit"m, $imecomple%ity & pace comple%ity of an algorit"m, 'ig

* notation



%nit &o. &ame of %nit #oi! 'roosed Date Cond$!tion Date Remar( &$m*er of

le!t$res

2 !earchi,g a,+ !orti,g

1

earc"ing met"ods: +inear, binary searc" and 1Fibonacci earc" 1

orting met"ods: 'ubble, insertion, 1

selection, merge 1

1

as"ing $ec"ni#ues 1

!tack a,+ ueues

tacks: Concept, 'asic tack operations 1

!rray representation of stacks, tack as !D$ 1

1

-ueue Concept, -ueue operations 1

!rray representation of #ueues, -ueue as !D$ 1

Circular #ueues 1

1

4 9i,ke+ 9ist

Concept of linked organi.ation, +inked list as !D$1

singly linked list 1stack using linked list, 1

#ueue using linked list 1

doubly linked list, circular linked list 1

1

1

' $rees

/ntroduction to trees: 'asic $ree Concepts 1

'inary $rees:Concept & $erminologies 1

0epresentation of 'inary $ree in memory 1

$raversing a binary tree

'inary earc" $rees ('$): 'asic Concepts 1

'$ operations2 1

6 rahs

'asic Concepts & terminology, 1

1

+inked representation of a grap",Pat" matri%, 1

perations on grap", $raversing a grap" 1

panning trees3 4inimum panning tree, 1

5ruskal*s !lgorit"m, Prim*s !lgorit"m2 1

6eed of searc"ing and sorting, w"y various met"odsof searc"ing and sorting

$ime comple%ity of eac" searc"ing andsorting algorit"m

tack !pplications: 0eversing data, !rit"metice%pressions conversion and evaluation2

!pplication of #ueues: Categori.ing data, imulationof #ueues

0epresentation and manipulations of polynomialsusing linked lists

comparison of se#uential linkedorgani.ation wit" linked organi.ation

e#uential representation of grap"s3 !d7acencymatri%



%nit &o. &ame of %nit #oi! 'roosed Date Cond$!tion Date Remar( &$m*er of

le!t$res

Di7kstra8s "ortest Pat" !lgorit"m 1

#O#A/ 4

#e2t 3oo(s

Referen!es 3oo(s

)$*+e!t Co-ordinator HOD 'rin!ial

DE)HM%H &. 5. 'rof. 3hoe 5.'. Dr.Harish 5an($dre

1. "llis ;oro)it !arta<!ah,i =>u,+ame,tals o* Data !tructures? algotia @ooks !ource. !@N:10: 0716782282. Bichar+ >. ilerg& @ehrou A. >oroua, Data !tructures A(seu+oco+e Aroach )ith % %e,gage 9ear,i,g seco,+ e+itio,. !@N-10: 0'4080

1. !emour 9ischut Data !tructure )ith % !chaumCs utli,es $ata Mcra);ill. !@N-10: 12'02642. " @algurusam - (rogrammi,g i, AN! % $ata Mcra)-;ill $hir+ "+itio,. !@N-10: 12'00461. e+i+ah9a,gsam Moshe E Auge,stei, Aaro, M $e,e,aum F Data structures usi,g % a,+ %GG - (; (ulicatio,s !eco,+ "+itio, . !@N 10: 81201177

Documents

Teaching Plan ForDSA