Syllabus

Computer Science 130B

Data Structures and Algorithms II

 Spring 2017

 

Lecture: TH 9:30am - 10:45am

Room: PHELP 3515

Discussion: F 11:00 - 11:50pm (08029)

Room: GIRV 1112

Discussion: F 12:00 - 12:50pm (08037)

Room: GIRV 2129

Instructor: Yuan-Fang Wang

Office: Harold Frank Hall 3113

Office hours: TH 11:00am - 12:00pm

Phone: 893-3866

TA: Raymond Wong

Office Hours T 11-1, W 11-1, F 1-2 (in CSIL)

TA: Steven Munn

Office Hours M 1-3, W 1-3, F 2-3 (in CSIL)

Reader: Jungah Song

Office Hours: by appointment (in CSIL)

Grading:

Final exam:

June 13 Tuesday, 8:00am - 11:00am

Textbooks:

There are quite a few acceptable textbooks on algorithm designs. You can use any of those for reference (e.g., those from your CS130A class if they cover the topics we discuss in this course). As I do not follow any textbooks closely, I do not require you to buy any specific books for this course. The following books are good references (many others will do too).

Lab:

    CSIL Lab, Harold Frank Hall 1132

Topics to be covered:

General class policies and announcements:

Academic Honesty Policy

In this class, you are expected to subscribe to the highest standard of academic honesty. This means that every idea that is not your own must be explicitly credited to its author. Failure to do this constitutes plagiarism.

Plagiarism includes using ideas, code, and old solution sets from any other students or individuals, or any sources other than the required text, without crediting these sources by name. In this class, the homework includes several programming assignments. You are encouraged to discuss problems with your instructor and TA. You may not copy codes from other students, or give your codes to others under any circumstances.

Academic dishonesty will not be tolerated. Any student caught of academic dishonesty will be reported to the proper authority for disciplinary action. You will receive a failing grade for this course and may be suspended or dismissed from the university.