10/10/2014 CSCI 2100 Data Structures

https://appsrv.cse.cuhk.edu.hk/~taoyf/course/2100sum11/2100.html 1/3
CSCI2100DataStructures
OfferedbyYufeiTao,Summer2011.
TA
ChengSheng(email:csheng@cse,office:HoSinHang1019).
Briefdescription
Inthiscourse,wewillstudythefundamentaldatastructuresandalgorithms.Suchknowledgeallowsustowritefasterprograms,
especiallyoneswhoserunningtimehasattractiveworstcasebounds.Techniquesforanalyzingtheperformanceofalgorithmswillalso
bediscussedindetail.Topicstobecoveredincludesearchinginorderedlists,hashing,sorting,graphsearching,etc.
Announcements
Announcement9(27Jun):Themidtermsolutionsareout.Seethe"Exams"sectionbelow.Youcancometotheinstructor'sofficeto
collectyourpapers.
Announcement8(27Jun):ThefinalexamwilltakeplaceinERB804during9:30am11:30pmonJuly4.
Announcement7(22Jun):ThemakeuplectureonJune25willtakeplaceinRoom1021ofHoSinhangBldgasopposedto121as
mentionedinAnnouncement4.Theclassroomoftheothermakeuplecture(July2)remainsasbefore.
Announcement6(10Jun):TherewillbenotutorialonJune17.TheTAwillbeonconferenceleave.
Announcement5(9Jun):Theprojecthasbeenannounced.Seetheprojectpage.ThedeadlineisJune30,2011.
Announcement4(7Jun):TherewillbeamakeuplectureonJune25andJuly2,respectively.Forbothofthem,thetimeisfrom
1:30pmto4:15pm,andtheclassroomisHoSinhangBldg121.
Announcement3(30May):MidtermexaminationwillbeorganizedinthelectureofJune21.Thescopeoftheexamcoversallthe
materialsintheslidesfromLecture1toLecture7.
Announcement2(30May):TherewillbenolectureonJune14and17.Theinstructorwillbeonconferenceleave.Makeuplectures
willbearrangedlater.
Announcement1(24May):Pleasecheckoutthe"Suggestedexercises"sectionbelow.
Timeandvenues
Lectures
Tue 1:30pm4:15pm HoSinHang503
Fri 1:30pm4:15pm HoSinHang503
Tutorials
Fri 4:30pm5:15pm HoSinHang503
Gradingscheme
Codingassignment:20%
Midterm:30%
Final:50%
Textbook
Introductiontoalgorithms(3rdedition)
10/10/2014 CSCI 2100 Data Structures
https://appsrv.cse.cuhk.edu.hk/~taoyf/course/2100sum11/2100.html 2/3
Lecturenotes
Lecturenotesaresupplementary,andcannotreplacelectures.Lectureattendanceisvitaltograspagoodunderstandingofthematerials.
Ingeneral,noteswillbereleasedbySundayeveningeachweek.
Styleofteaching
Thenotesbelowcoverallthematerialsinthesyllabus.Basedonseveralfactors(suchashowfasttheclassislearning),theinstructor
may,andmostlikelywill,discussbonusmaterialsoutsidethesyllabus.Sincethesematerialsare"spontaneous",nolecturenoteswillbe
given,butpointerstoreadingswillbementioned,providedthatsuchreadingsexist.
ForstudentsthatdoNOTcometolectures
Youareobviouslymissingoutallthebonusmaterials(butperhapsyoudon'tcareanyway).Makesureyoustudyallthelecturenotes
yourselveswhichhavebeenwritteninaselfcontainedmannerevenifyoudonothaveatextbook!Foryourrelief,thescopesofall
examsarelimitedtothesyllabus.
Slides Suggestedreadings
Lecture1 Complexities(11pm,16May) Section3.1
Lecture2 Sorting1mergesort(11pm,16May) Sections2.12.3,4.34.5
Lecture3 Sorting2quicksort(11pm,16May) Sections7.17.4
Lecture4 Sorting3sortinglowerbound(11pm,16May) Section8.1
Lecture5
Sorting4countingsort(10:25pm,23May) Section8.2
BonusRadixsort Section8.3
BonusThekselectionproblem Sections9.19.3
Lecture6
Linkedlists(10:25pm,23May) Sections10.110.2
BonusDynamicarrayandcostamortizion Section17.4.1
Lecture7
Hashing(10:25pm,23May) Sections11.111.3
BonusProofoftheuniversalnessofthehashfunctionused Theorem11.5
BonusPerfecthashing Section11.5
Lecture8 Priorityqueue(a.k.a.heap)(11pm,5Jun) Chapter6
10/10/2014 CSCI 2100 Data Structures
https://appsrv.cse.cuhk.edu.hk/~taoyf/course/2100sum11/2100.html 3/3
Lecture9 AVLtree1(9:40pm,23Jun) Sections12.112.2
Lecture10 AVLtree2(9:40pm,23Jun)
Lecture11 AVLtree3(9:40pm,23Jun)
Lecture12 Graphbasics(1am,28Jun) 22.1
Lecture13 Breadthfirstsearch(1am,28Jun) 22.2
Lecture14 Depthfirstsearchandtopologicalsort(1am,28Jun) 22.322.4
Suggestedexercises
Thefollowingexercisesareselectedfromthetextbook.Whiletheywillnotbediscussedduringlectures,youareadvisedtotrythemon
yourown.Solutionstosomeoftheseexercisescanbefoundonthispage.Youarewelcometovisittheinstructor'sofficefor
discussion.Thissetofexercisesisnotmeanttobecomprehensive.Youshouldattemptasmanyexercisesinthetextbookaspossible.
Thelistwillgrowwithtime.
[Complexitiesandbinarysearch]Exercises2.21,2.22,2.37,3.11,3.12,3.14,3.24,3.28
[Sorting]Problems24,Exercises8.13,8.14,8.24,Problems83,85
[Linkedlist]Exercises10.26
[Hashing]Exercises11.25,11.35,Problem112.
[Priorityqueue]Exercises6.14,6.59,Problem63
[AVLtree]Exercises12.13,12.15,12.25,12.26,Problems122,131
[Graph]Exercises22.13,22.16,22.17,22.42,22.43,22.45
Exams
Midtermsolutions.
Finalexamsolutions.
Pastexams
Midtermexamofthespringsemester,2011.
Finalexamofthespringsemester,2011.
Tutorialslides
Pleasevisitthispage.