COURSE SYLLABUS

Course Title Data Structures and Algorithm Analysis

Course Code IT 9
Course Credit Three (3)
Prerequisite IT 4 Programming
Instructor Anne !atima Pilayre
"#mail Address anne$atima%&yahoo'com
Consultation
Schedule
Day Time (oom
)ednesday 9*++ ,,*++ IT C"-T"(
I. COURSE DESCRIPTION
This course .ill %ro/ide students the $undamental conce%ts in data structures and algorithms' 0y learning the 1asics o$ data structures2
students .ill ha/e the 3no.ledge o$ conce%tual and concrete .ays o$ organi4ing data $or e$$icient storage and e$$icient mani%ulation' This course .ill
$ocus on creating a systematic .ay o$ accessing2 mani%ulating and organi4ing data2 thus2 needing the em%loyment o$ data structures in the design o$
e$$icient algorithms' The e$$iciency o$ algorithms can 1e attained 1y analy4ing thoroughly the $ormulated algorithm through determining ho. long an
algorithm .ill ta3e to sol/e a %ro1lem' This course .ill de/elo% the s3ills o$ the students in algorithm design that .or3s e$$iciently on a %articular
%rogram2 %rogram documentation and %rogram testing'
II. DESIRED LEARNING RESULTS
Expected DMCian Graduate Attribute Deired Learnin! Reu"t# 0y the end o$ the course2 the students are ena1led to*
5od !earing Inculcate .ithin themsel/es the /irtue o$ honesty 1y doing their .or3 .ith integrity
6no.ledgea1le 0e %ro$icient in im%lementing /arious algorithms and data structures
(ecogni4e the e$$iciency trade#o$$s o$ using /arious algorithms and data structures
7a/e a solid understanding o$ the design and analysis o$ $undamental data structures and algorithms
Talented89ersatile De/elo% their o.n a%%lications using the introduced algorithms and data structures
(ein$orce the theoretical as%ects co/ered in lectures 1y demonstrating s3ills in %rogramming
Demonstrate s3ills that are common to so$t.are de/elo%ment %ractices such as modular coding2 a%%ro%riate commenting o$
code de1ugging .ith Integrated De/elo%ment "n/ironment (ID") and incremental de/elo%ment'
Committed to Ser/e )or3 harmoniously .ith others
Page 1 of 7
Share their s3ills and a1ilities to attain a common goal
III. $INAL OUTPUT%$INAL PER$ORMANCE
At the end o$ the course2 the students are e:%ected to de/elo% their o.n a%%lications using the introduced data structures and a%%lying the a%%ro%riate algorithm to 1e
im%lemented on their desired a%%lication' The %ro;ect .ill 1e done 1y %air .hich .ill de/elo% the students< a1ility to .or3 .ith others harmoniously as .ell as disco/er their
ca%a1ility and s3ill in the .orld o$ In$ormation Technology 1y learning .ither they are suited $or gra%hical user inter$ace design or 1ac3#end analysis' The students< out%ut
.ill 1e %resented in the classroom .ith the instructor $or e/aluation'
Expected DMCian Graduate Attribute Rubric
A. G&d $earin!
C'aracteritic Exce""ent
()*
+er, Sati-act&r,
(.*
Sati-act&r,
(/*
Lac0in!
(1*
Sc&re
2&net, The su1mitted %ro;ect is
genuinely made'
The su1mitted %ro;ect is originally
made ho.e/er the conce%t is ta3en
$rom some1ody else or some.here
else'
The su1mitted %ro;ect is originally
made ho.e/er some o$ the codes
are ta3en $rom the internet'
The conce%ts o$ the %ro;ect as .ell
as the codes are ta3en $rom
some.here else li3e the internet'
B. 3n&4"ed!eab"e
C'aracteritic Exce""ent
()*
+er, Sati-act&r,
(.*
Sati-act&r,
(/*
Lac0in!
(1*
Sc&re
G&a" and Ob5ecti6e The o/erall o1;ecti/es o$ the
student %ro;ects ha/e 1een
clearly stated and the students
include quanti$ia1le targets and
antici%ated outcomes'
The o/erall o1;ecti/es o$ the
student %ro;ects ha/e 1een clearly
stated ho.e/er the students did not
include quanti$ia1le targets and
antici%ated outcomes'
An o1;ecti/e a1out the %ro;ect has
1een %resented 1ut is not clearly
coherent to the desired out%ut'
The o1;ecti/e o$ the %ro;ect is
only $or the sa3e o$ su1mission'
7uti-icati&n%Tec'nica"
Merit
The students ha/e ;usti$ied and
con/inced the %anel .hy their
%ro;ect is needed and the
%otential im%act o$ the %ro;ect is
large enough to account $or the
time and e$$ort o$ the student
and $rom the %anels'
The students ha/e ;usti$ied and
con/inced the %anel .hy their
%ro;ect is needed ho.e/er the
%otential im%act o$ the %ro;ect is not
enough to account $or the time and
e$$ort o$ the student and $rom the
%anels'
The students ha/e %resented some
reasons .hy their %ro;ect is needed
yet they .ere not a1le to con/ince
the %anels o$ its %otential im%act'
There is no ;usti$ication o$ the
im%act o$ the su1mitted %ro;ect'
I8pact &r Bene-it The students ha/e e:%lained
that their %ro;ect has the
%otential to ma3e a signi$icant
im%act and indicated target
grou% .hich .ill 1ene$it $rom the
The students ha/e e:%lained that
their %ro;ect has the %otential to
ma3e a signi$icant im%act ho.e/er
they .ere not a1le to indicate a
target grou% .hich .ill 1ene$it $rom
The students ha/e %resented that
their %ro;ect has the %otential
im%act 1ut .ere not a1le to
con/ince the %anels o$ its
;usti$ication'
There is no im%act or 1ene$it that
can 1e gain $rom the su1mitted
%ro;ect'
Page 2 of 7
%ro;ect' the %ro;ect'
Preentati&n The students ha/e %resented
their %ro;ect in a clear .ay and
the %resentation is
understanda1le to a non#e:%ert
audience'
The students ha/e %resented their
%ro;ect in a clear .ay ho.e/er the
%resentation is /ery technical and
requires e:%ertise or 3no.ledge o$
the %resented to%ic'
The students ha/e %resented their
%ro;ect .ith minor hel% $orm the
instructor on clari$ying some terms
that are used in the %resentation'
The students ha/e %resented
their %ro;ect 1y merely reading
the material that they ha/e
%re%ared'
Pr&-icienc, The students .ere a1le to
ans.er all the questions $rom
the %anels .ith strong
;usti$ication'
The students .ere a1le to ans.er
most o$ the questions .ith clear
;usti$ications'
The students .ere a1le to ans.er
some o$ the questions .ith
am1iguous ;usti$ications'
The students contri1uted minimal
ans.ers .ithout any
;usti$ications'
C. Ta"ented%+erati"e
C'aracteritic Exce""ent
()*
+er, Sati-act&r,
(.*
Sati-act&r,
(/*
Lac0in!
(1*
Sc&re
Output C&rrectne -o errors in e:%ected out%ut =inor errors in e:%ected out%ut =any errors in e:%ected out%ut >ut%ut is only correct in s%ecial or
single case
Output 9ua"it, Correct out%ut $ormat? /ery
/isually com%elling
Correct out%ut $ormat? some.hat
/isually com%elling
Some errors in out%ut $ormat Signi$icant errors in out%ut $ormat?
items are hard to identi$y
C&din! St,"e All identi$iers are descri%ti/e
and $ollo. naming
con/entions'
Style and %unctuation
guidelines are o1ser/ed'
Sim%le and elegant %rogram
constructs'
-aming2 style2 and %unctuation
are mostly correct and
consistent2 1ut occasional errors
are $ound'
Program constructs are
a%%ro%riate'
-aming2 style and %unctuation
guidelines are generally ignored'
Program constructs are
unnecessarily com%le:'
-aming is inconsistent and
misleading'
-o %unctuation guidelines are
o1ser/ed'
Program constructs are
e:cessi/ely com%le:2 requiring
signi$icant e$$ort to com%rehend'
Neatne % C"arit, Program layout2 indentation2
and se%aration are consistent
and attracti/e'
Source code is highly
reada1le
Program layout2 indentation2 and
se%aration are generally
consistent'
":ce%tions do not a$$ect
reada1ility'
=inimal attention is gi/en to
layout2 indentation2 and
se%aration'
7ori4ontal and /ertical s%acing
are mostly ine:istent'
Selections o$ code are /ery
di$$icult to read'
-o considerations are gi/en to
layout2 indentation2 and
se%aration'
7ori4ontal and /ertical s%acing
are ine:istent'
Program is unreada1le'
D&cu8entati&n Documentation is e:em%lary
and %ro/ides accurate
in$ormation at an a%%ro%riate
le/el o$ details'
All required elements are
%resent and $ollo. the
Documentation $ollo.s the
%rescri1ed $ormat 1ut includes
needed elements at a le/el that
is too general'
Documentation is acce%ta1le 1ut
ignores the %rescri1ed $ormat and
may lac3 one or more required
items'
The source code contains no
documentation'
Page 3 of 7
%rescri1ed $ormat'
D. C&88itted t& Ser6e
C'aracteritic Exce""ent
()*
+er, Sati-act&r,
(.*
Sati-act&r,
(/*
Lac0in!
(1*
Sc&re
C&""ab&rati&n &-
Idea
The student conce%tuali4e the
entire idea o$ the a%%lication
The student contri1utes to some o$
the idea a1out the a%%lication'
The student ;ust merely agrees .ith
the %resented idea a1out the
a%%lication 1y his8her grou% mate'
Student did not contri1ute
anything to the idea o$ the
%resented a%%lication'
C&&perati&n Al.ays %resent during grou%
meetings and actual
de/elo%ment tas3'
Al.ays %resent on actual
de/elo%ment tas3 and attends most
o$ the time during grou% meetings'
Seldom %resent on actual
de/elo%ment tas3 and actual
de/elo%ment tas3'
Al.ays una/aila1le on grou%
meetings and actual de/elo%ment
tas3'
2ar8&ni&u",
4&r0ed 4it' &t'er
Accom%lished the assigned tas3
all the time
Accom%lished assigned tas3 most o$
the time
Seldom accom%lished assigned tas3 Did no accom%lished the assigned
tas3
Participati&n
t&4ard t'e
c&8p"etene &-
t'e pr&5ect
Student com%letely contri1uted
to.ards the accom%lishment o$
the %ro;ect
Student contri1uted most to.ards
the accom%lishment o$ the %ro;ect
Student shared minimal insight Student did not share any insight
to.ards the com%leteness o$ the
%ro;ect
I+. ACCEPTABLE E+IDENCE%GRADING PROCEDURE
Pre"i8inar, Grade (PG* Midter8 Grade (MG* Se8i:-ina" Grade (S$G* $ina" Grade ($G* Se8etra" Grade (SG*
=ain Tas3 @A
7ands#on Acti/ity +A
Bui44es +A
Attendance ,+A
Prelim ":am @A
,++A
=ain Tas3 @A
Practical S3ills ":am +A
Bui44es +A
Attendance ,+A
=idterm ":am @A
,++A
=ain Tas3 @A
7ands#on Acti/ity +A
Bui44es +A
Attendance ,+A
Semi !inal ":am @A
,++A
!inal Pro;ect C+A
7ands#on Acti/ity +A
Bui44es +A
,++A
P5 @A
=5 @A
S!5 @A
!5 @A
SG 1;;<
POSSIBILITY# Pre"i8= Midter8 and Se8i:$ina" Peri&d 'a6e Si8i"ar Set &- Ae8ent
Pre"i8inar,%Midter8 Criteria $ina" Criteria
=ain Tas3 (=ay include minor tas3s connected to main tas3) 4+A !inal Tas3 (=ay include minor tas3s connected to main tas3) C+A
>ther Tas3s (7ome.or38 Class Acti/ities8 ":ercises8 Pro;ects)
+A
>ther Tas3s (7ome.or38 Class Acti/ities8 ":ercises8 Pro;ects)
,@A
)ritten Bui44es ,@A Class Partici%ation ((ecitation2 and other /er1al and non#
/er1al e/idence o$ student %artici%ation)
,@A
Class Partici%ation ((ecitation2 and other /er1al and non#/er1al
e/idence o$ student %artici%ation) ,@A
Page 4 of 7
Attendance ,+A Attendance ,+A
Total ,++A Total ,++A
+. LEARNING PLAN
Pre"i8inar, Peri&d
MAIN TAS3# Create a pr&!ra8 t'at i8p"e8ent t'e di--erent a"!&rit'8 intr&duced in t'e c"a
Enab"in! S0i"" $&ci Teac'in! Strate!ie% Learnin! Acti6itie Ae8ent Expected Output 2&ur
De/elo%ing the
%ro$iciency o$ students in
mani%ulating and
accessing array
(e/ie. on the conce%ts o$
>1;ect#>riented
Programming and Arrays'
Demonstration
Discussion 8 Decture
7ands#on ":ercise @
Enderstanding the
1asics o$ algorithms
De$inition o$ algorithm
The relationshi% o$
algorithm .ith
%rogramming
The relationshi% o$
algorithm .ith data
structures
Discussion 8 Decture Bui4 '@
Dearning the di$$erent
tools used to analy4e an
algorithm
De$inition o$ a running
time
(e/ie. on %seudo#code
The tools used to
analy4e the running time
o$ an algorithm
Pro/ing the e$$iciency o$
an algorithm 1ases on
the running time
Discussion Bui4 @
Enderstanding the
characteristic o$ /arious
algorithms and learning
the trade#o$$s o$ each
algorithm
Search Algorithm
# Sequential Searching
#0inary Searching
Sorting Algorithm
#=erge Sort
#Buic3 Sort
#0u11le Sort
Decture 8 Discussion
Demonstration
Bui4
7ands#on ":ercise
F'@
Page 5 of 7
#Insertion Sort
#Sha3er Sort
#Shell Sort
Midter8 Peri&d
MAIN TAS3# Create a !a8e pr&!ra8 t'at ue t'e c&ncept &- Lit= Stac0= 9ueue OR Lin0ed Lit
Enab"in! S0i"" $&ci Teac'in! Strate!ie% Learnin! Acti6itie Assessment ":%ected >ut%ut )ee38 7ours
0eing $amiliar .ith the
conce%ts o$ A1stract
Data Ty%es (ADT)
A1stract Data Ty%e Discussion Bui4
7ands#on ":ercise
'@
Dearning the
characteristics o$ the
di$$erent A1stract Data
Ty%es
Dist ADT
Stac3 ADT
Bueue ADT
Din3ed Dists ADT
Discussion Bui4
7ands#on ":ercise
F'@
Im%lementing the
di$$erent A1stract Data
Ty%es (ADT)
Dist ADT
Stac3 ADT
Bueue ADT
Din3ed Dists
Demonstration
Discussion
7ands#on Acti/ity ,+
Se8i:-ina" Peri&d
Main Ta0# I8p"e8entati&n &- t'e Tree ADT
Enab"in! S0i"" $&ci Teac'in! Strate!ie% Learnin! Acti6itie Assessment ":%ected >ut%ut )ee38 7ours
A%%reciating ho. trees
are used to im%lement
the $ile system o$ se/eral
%o%ular o%erating
systems
De$inition o$ a Tree
The Tree ADT
0inary Tree
0inary Search Tree
A9D Tree
S%lay Trees
Discussion
Demonstration
7ands#on Acti/ity
Bui4
'@
'@
'@
'@
@
@
$ina" Peri&d
Enab"in! S0i"" $&ci Teac'in! Strate!ie% Learnin! Acti6itie Assessment ":%ected >ut%ut )ee38 7ours
Enderstanding methods 5eneral idea o$ a hash Discussion 7ands#on Acti/ity
Bui4
@
@
Page 6 of 7
o$ im%lementing hash
ta1le
ta1le
7ash $unctions
Demonstration
Demonstrating the
3no.ledge and s3ills
learned in the class
Pro;ect De/elo%ment Su%er/ising the .or3 o$ the students !inal %ro;ect %resentation ,+
+I. COURSE POLICIES
A' "ach %rogram and home.or3 and assignment must 1e .or3 on indi/idually unless directed to .or3 in a team'
0' Programming acti/ities may 1e im%lemented using any other language ta3ing into consideration that that is your mastered language'
C' All %rograms must 1e com%iled or inter%reted2 other.ise no credit .ill 1e gi/en to %rograms that are not com%iled or inter%reted'
D' Assignments must 1e su1mitted 1e$ore the class 1egins? unless other.ise directed'
"' Assignments may 1e su1mitted u% to 3 days late2 .ith a %enalty o$ ,+A o$ the actual score o$ the assignment or acti/ity $or each day late' -o credit .ill 1e
gi/en a$ter 3 days'
!' S%ecial and ma3e#u% .ritten out%uts (long qui44es2 assignments2 seat.or3) .ill 1e gi/en only i$ you ha/e ;usti$ia1le reason8s $or $alling to su1mit them'
5' The use o$ cellular %hones is %rohi1ited during class hours2 unless a s%ecial %ermission to use it is granted' In addition2 the use o$ any electronic gadget is
%rohi1ited unless other.ise rele/ant to the class lesson8discussion'
7' Gou are encouraged to discuss your class#related concerns .ith your su1;ect#teacher
+II. BASIC TE>TBOO3
,' =ichael T' 5oodrich and (o1erto Tamasia2 Data Structures and Algorithms in Java, 3
rd
Ed
+II. RE$ERENCES
,' =ar3 Allen )eiss2 Data Structures and Algorithms in Java, 3
rd
Ed
' Ha%an In$ormation Processing De/elo%ment Cor%oration2 Internal Design and Programming
Pre%ared*
Anne !atima T' Pilayre
College o$ Com%uter Studies
!irst Semester2 SG +, # +,3
"ndorsed* A%%ro/ed*
Ho/anie Talaroc Dr' 5erald T' Concha
9ice Dean2 College o$ Com%uter Studies Dean2 College o$ Com%uter Studies
Page 7 of 7