COMP171 Data Structures and Algorithm

Section L1, Spring 2006

 

Lectures: Tuesday & Thursday 9:00 ¨C 10:20  LTF

Office Hours: Wed 14:00 ¨C 16:00  Rm 3563

Qiang Yang (Email: qyang (at) cs dot ust dot hk )

 

| Schedule & Notes | Assignments and Tutorials  |Newsgroup |

 

Announcements:

Tutorials:  See TA's Tutorial Page

Course Description:  (From the HKUST course catalog)

Asymptotic notations. Performance measurement. Sorting and searching: algorithms and lower bound. Abstract data types and classes. Data structures: heaps, search trees, tries, and hashing. Graphs: representation, depth-first-search, and breadth-first-search. 

Textbook (available at the HKUST bookstore and on reserve in the library):

 

References:

  • Data Structures, Algorithms, and Applications in C++, Sahni (McGraw-Hill)
  • Data Structures and Algorithms in C++, Goodrich, Tamassia, and Mount (John Wiley & Sons)
  • Data Structures and the Standard Template Library, Collins (McGraw-Hill)
  • Introduction to Algorithms, Thomas H. Cormen, Charles Leiserson, Ronald Rivest (McGraw-Hill)
  • Thinking in C++ 2nd Edition by Bruce Eckel

Grading Scheme:

  • Two (2) Written Assignments 8% (4% each)
  • Three (3)  Lab Assignments 27% (9% each)
  • Midterm Exam 25%
  • Final Exam 40% (schedule: to be announced)

Assignments will be collected at the beginning of the class. We will use CASS - Course Assignment Submission System. 

Exam Schedule:

  • Midterm Exam: Thursday, March 30, 6:00 to 8:00pm.
  • Final Exam:  To be decided by the university.

 

Late Policy: For written and programming assignments, 20% will be deducted for one day late submissions. Assignments later than 1 day will not be accepted.

Illness: If you have a medical reason for handing in your assignment late or for missing an examination, you should let us know as soon as possible.

Midterm and Final: No make-ups will be given unless prior approval is granted by the instructor, or you are in unfavorable medical condition with physician's documentation on the day of the examination.

Collaboration: You are encouraged to collaborate in study groups. However, you must write up solutions on your own for written assignments, and write your own programs for programming assignments. You must also acknowledge your collaborators in your submitted assignment for each problem, whether or not they are classmates. Other cases will be dealt with as plagiarism.

Plagiarism: If you cheat on an assignment, both you and the person who helped you will receive a lower grade or the fail grade F. Please refer to the class notes for details.

University Policy: