COMP171Data Structures and AlgorithmsSpring 2009
COMP171 Data Structures and Algorithms Spring 2009
Slide2LecturesLectures:L2:Wed&Friday3h-4h20pmL3:Mon&Wed9h-10h20Lecture notes and tutorial materialAssignments,testcasesand solutionsDownload course material before classTutorials:2A（Tues,1430-1620)2B（Thur,1000-11502C(Thur,18001950)3A（Fri,1800-1950）3B（Wed1800-1950)3C（Thur1300-1450）
Slide 2 Lectures Lectures: L2: Wed & Friday 3h-4h20pm L3: Mon & Wed 9h-10h20 Lecture notes and tutorial material Assignments, test cases and solutions Download course material before class Tutorials: 2A (Tues, 1430-1620) 2B (Thur, 1000-1150 2C (Thur, 1800 1950) 3A (Fri, 1800-1950) 3B (Wed 1800-1950) 3C (Thur 1300-1450)
Slide3TextbookDataStructures andAlgorithmAnalysisinC++,MarkAllenWeiss- Latest version = 3rd EditionSource codes areavailableonline- Available at library for 2-hour loan
Slide 3 Textbook Data Structures and Algorithm Analysis in C++, Mark Allen Weiss - Latest version = 3rd Edition - Source codes are available online - Available at library for 2-hour loan
Slide4Grading SchemeGrading is based onWrittenAssignments(2*5%=10%)ProgrammingAssignments(3*10%=30%)MidtermExamination(25%)FinalExamination(35%)
Slide 4 Grading Scheme Grading is based on Written Assignments (2*5%=10%) Programming Assignments (3*10%=30%) Midterm Examination (25%) Final Examination (35%)
Slide5Plagiarism Policy1st Time: both get 02nd Time: need to terminateMidtermorFinal:an automaticFAlLYou areencouragedto collaborate instudygroupsBut,youcannot copyor slightlychangeotherstudentssolutionsorcodesThe detection of plagiarism is computerized!
Slide 5 Plagiarism Policy 1 st Time: both get 0 2 nd Time: need to terminate Midterm or Final: an automatic FAIL You are encouraged to collaborate in study groups. But, you cannot copy or slightly change other students’ solutions or codes. The detection of plagiarism is computerized!