CSCI 303: Algorithms
Fall 2019
Meeting place: McGlothlin-Street Hall 020
Meetings: 8:00-9:20 (Tu. and Th.)
Instructor: Qun Li (liqun@cs)
Office: McGlothlin-Street 118
Office Hours:
2-5PM Tuesday
Course Description:
A systematic study of algorithms, their complexity and
implementation. A survey of methods for achieving high algorithmic
efficiency by using good data structures and sophisticated algorithm
designs. We will cover advanced data structures, sorting algorithms,
graph algorithms, dynamic programming, and so on.
Textbook:
Data Structures and Algorithms in C++, 4th edition, by Mark A. Weiss
Course work (tentative):
There will be in class quizzes accounting for 6% of the final grade.
There will be weekly homework assignments including programming
assignments, accounting for 40% of your final grade.
There will be a midterm exam. It is worth 14% of your final grade.
The final exam accounts for 40% of your final grade.
Honor code:
Honor code applies to this class. Students are encouraged to work
together to do homework problems. What is important is a student's
eventual understanding of homework problems, and not how that is
achieved. Students may consult any source, except for another
student's final draft, in learning how to do homework problems.
Students must state what sources they have consulted, with whom they
have collaborated, and from whom they have received help.