CS4335 Design and Analysis of Algorithms

Part I
Course Duration: One Semester
Credit Units: 3
Level: B4
Medium of Instrution: English
Pre!re"uisites: Nil
Pre!ursors:
CS2302 Data Structures and Algorithms /or
CS2364 Data Structures and Algorithms /or
CS2468 Data Structures and Data anagement /or
CS3334 Data Structures /or
EE233! Data Structures and Algorithms /or e"ui#alent
#"uivalent Courses: Nil
#$lusive Courses: Nil
Part II
%& Course Aims:
$his course aims to introduce the classic algorithms in #arious domains% and techni"ues &or
designing e&&icient algorithms'
'& Course Intended Learning (utomes )CIL(s*:
(state what the student is expected to be able to do at the end of the course according to a given
standard of performance)
Upon successful completion of this course, students should be able to:

+o& CIL(s ,eighting )if a--lia.le*
!' (ro#e the correctness and anal)*e the running time o&
the +asic algorithms &or those classic (ro+lems in
#arious domains,

2' a((l) the algorithms and design techni"ues to sol#e
(ro+lems,

3' anal)*e the com(le-ities o& #arious (ro+lems in di&&erent
domains'

3& /eahing and learning Ativities )/LAs*:
(designed to facilitate students' achievement of the CILs)
$eaching (attern.
!uggested lecture"laborator# mix: 2 hrs' lecture, ! hr' tutorial'
a/or techni"ues &or algorithm design and anal)sis are introduced through the stud) o& #arious
algorithms' 0n the tutorials% students are guided to a((l) the algorithms to sol#e di&&erent
(ro+lems' Assignments include +oth anal)tical and (rogramming e-ercises 1using C22 or similar
languages3'

IL( +o /LAs 0ours12ee3 )if
a--lia.le*
C04O ! Classroom lectures and assignments to achie#e 04O 5!
6eneral techni"ues 7ill +e taught in the lecture'
E-ercises 7ill +e gi#en in the tutorial and the lecturer
17ith the (artici(ation o& students3 7ill e#entuall) gi#e the
ans7ers' Assignments 7ill +e gi#en to the students'

C04O 2 4ectures% tutorial and e-ercises to achie#e 04O
52ethods 7ill +e taught in the lectures' E-am(les and
e-ercises 7ill +e gi#en in the tutorials' A set o& ne7
(ro+lems 7ill +e (ro#ided to students' 8or a su+set o&
ne7 (ro+lems% hints &or sol#ing the (ro+lems 7ill +e
gi#en' At least one assignment contains ne7 (ro+lems
that the students must tr) to sol#e using their o7n ideas'

C04O 3 $o achie#e 04O 53% the conce(ts related to N9:
com(leteness theor) and com(uta+ilit) are introduced in
the lectures' Some sim(le N9:hard (roo& 7ill +e gi#en in
the lecture'

4& Assessment /as3s1Ativities:
(designed to assess how well the students achieve the CILs)

IL( +o /y-e of assessment tas3s1ativities ,eighting )if
a--lia.le*
4emar3s
C04O ! (ro#e the correctness and anal)*e the running time
o& the +asic algorithms &or those classic (ro+lems in
#arious domains
$utorial e-ercises conducted in tutorials
Assignments as course7or; 1$he assignments &or
this (art is 60< o& course3' 8inal E-am = 7ill
contain "uestions a+out the +asic algorithms'

C04O 2 a((l) the algorithms and design techni"ues to sol#e
(ro+lems
$utorial e-ercises conducted in tutorials' Some
algorithms 7ill +e gi#en and the students 7ill +e
as;ed to estimate the running time o& the algorithms'
Some "uestions a+out ne7 (ro+lems 7ill +e
gi#en as assignments 1assignments &or this (art is
40< o& the course7or;3' $he students should +e
a+le to (ro#ide their o7n algorithms to sol#e the
(ro+lem' $his (art is used to identi&) good students'
>e e-(ect that a+out !/3 o& students can sol#e all
the gi#en (ro+lems
8inal E-am = 7ill contain ne7 (ro+lems as the
hardest (art' $o get A or A22% students must +e
a+le to sol#e some o& the ne7 (ro+lems'

C04O 3 anal)*e the com(le-ities o& #arious (ro+lems in
di&&erent domains
$utorial e-ercises conducted in tutorials
Some "uestions a+out N9:com(leteness conce(t
7ill +e gi#en as assignments' $his (art is #er) hard
&or students' Sim(le "uestions &or this (art are
suita+le &or our students'

5& 5rading of Student Ahievement: ?e&er to 6rading o& Courses in the Academic
?egulations 1Attachment3 and to the E-(lanator) Notes'
E-amination duration. 2 hours
9ercentage o& course7or;% e-amination% etc'. 30< C>, @0< E-am
6rading (attern. Standard 1A2AA:A83
8or a student to (ass the course% at least 30< o& the ma-imum mar; &or the e-amination must +e
o+tained'
Part III
6ey2ord Sylla.us:
Algorithm anal)sis' Algorithm design . di#ide:and:con"uer a((roach% greed) a((roach' 6ra(h
algorithms . gra(h searching% to(ological sort% minimum s(anning tree% shortest (aths%
+ac;trac;ing and its a((lications in games' String matching' D)namic (rogramming and longest
common su+se"uence' $heor) o& N9:com(leteness' $uring machines and the halting (ro+lem'
0ntroduction to com(utational com(le-it)'
4elated Lin3s
De(artment o& Com(uter Science