DataStructuresandProgramming

Spring 2010

Instructor:
Class:Monday:9:1012AM,RoomBL112()
Office:BL525()
Phone:33663581
Email:yen@cc.ee.ntu.edu.tw
OfficeHours:Byappointment
ClassWebpage:http://cc.ee.ntu.edu.tw/~yen/courses/ds10.html
TA: 603 chiangchi@arbor.ee.ntu.edu.tw
PREREQUISITES:FamiliarityinC,C++,orJAVA.

ANNOUNCEMENTS:

(Updated 3:30 PM, 7/5)

(7/2) 5:00~6:00 603
E-mail ()

FinalexamwillbeheldonJune21.
:Chapter6:213225229250Chapter8:315331Chapter11:491513
Chapter12:525534540549,andclassnotes
Samplefinalexam:(Spring2007)(Fall2004:FinalExamSolutions)(Fall2003:Final
Exam; Solutions ) (Spring 2003) (Fall 2000: exam, solution)

Programmingassignments(Instructions)
Assignment#1(inputdata)(pdf)(ps)due:May17(Monday)
Assignment#2:(description)due:June27(Sunday23:59PM)

strict

Homework#1:(Solutions)Due:April12(Monday)
Homework#2:(Solutions)Due:May24(Monday)

MidtermexamwillbeheldonApril26.(midtermsolution)
:Chapter2:4363Chapter3:7174,83107Chapter4:113159Chapter12:
517525andclassnotes
Samplemidterms(Fall2000,Solutions)(Spring2003)(Fall2003,Solutions)(Fall2004)
(Spring2007,Solutions)

TOPICS:
PRELIMINARIES:(1)Introduction,(2)AsymptoticNotations,(3)AlgorithmAnalysis.
ABSTRACTDATATYPES:(4)Stacks,Queues,Lists,Listoperations,Listrepresentations,List
traversals,Doublylinkedlists.

TREES:(5,6)Treeoperations,Treerepresentations,Treetraversals,Threadedtrees,Binarytrees,
(7)AVLtrees,(8)(9)Splaytrees,(10)23trees,Btrees,Redblacktrees,Binomialtrees,(11)
AAtreesandmore.
HASHING:(25)Chaining,Openaddressing,Collisionhandling.
PRIORITYQUEUES:(12)Binaryheaps.(13)Binomialheaps.(14)Fibonacciheaps.(15a,15b)
Leftistheaps,Skewheaps,(16)Minmaxheaps..(17)Pairingheaps
AMORTIZEDANALYSIS(18,19,20)
SORTING:Insertionsort,Selectionsort,Quicksort,Heapsort,Mergesort,Shellsort,Lowerbound
ofsorting.
DISJOINTSETS:(21,22)Setoperations,Setrepresentations,Unionfind,Pathcompression.
GRAPHS:Graphoperations,Graphrepresentations,Basicgraphalgorithms,Algorithmdesign
techniques.
ADVANCEDDATASTRUCTURES:Tries,(24)Skiplists(23),Treaps,Topdownsplaytrees.
TEXTBOOK
MarkAllenWeiss,DataStructuresandAlgorithmAnalysisinC++.(3rdEd.)
AddisonWesley,2006

COURSEREQUIREMENTS:Therewillbehomework/programmingassignments,onemidterm
exam,andafinalexam.Theweightingswithinthesemestergradewillbe:

Homework+ProgrammingAssignment30%
Midterm35%
Finalexam35%

HOMEWORK:Onlyhomework/prog.assignments turned in by the due date is guaranteed to be

graded.Anyspecialcircumstancesthatcausedifficultyinmeetingthedeadlinesshouldbebroughtto
theattentionoftheinstructorinadvance.

CHEATING: With the exception of group assignments, the work (including homework,
programming assignments, tests) must be the result of your individual effort. This implies that one
studentshouldneverhaveinhis/herpossessionacopyofallorpartofanotherstudent'shomework.It
is your responsibility to protect your work from unauthorized access. Academic dishonesty has no
place in a university, in particular, in NTUEE. It wastes our time and yours, and it is unfair to the
majorityofstudents.Anyformofcheatingwillautomaticallyresultinafailinggradeinthecourse
andwillbereportedtotheDean'soffice.