Instructor: James R. Glenn, Ph.D.
Office: AKW 013
Office Phone: TBD
Office Hours: Tue 4-6pm and Thu noon-2pm, or by appointment, or drop by and see if I'm in
e-mail: [first name][dot][last name]@yale.edu
TF and ULA Hours: See Piazza
Course Home Page:
Piazza Page: https://piazza.com/yale/spring2018/cpsc365/home
Class Meeting: Lecture Tue, Thu 2:30 – 3:45pm in DL 220
Prerequisites: CPSC 202 and CPSC 223 or equivalent
Paradigms for algorithmic problem solving: greedy algorithms, divide and conquer, dynamic programming, and network flow. NP completeness and approximation algorithms for NP-complete problems. Algorithms for problems from economics, scheduling, network design and navigation, geometry, biology, and optimization. Provides algorithmic background essential to further study of computer science.
Students will be able to
Please see Yale College's Undergraduate Regulations and Definitions of Plagiarism, Cheating, and Documentation of Sources.
The implications for this course:
When discussing an assignment with other students, you may write on a board or a piece of paper, but you may not take that or any other written or electronic record away from the discussion. Moreover, you must engage in a full hour of mind- numbing activity (e.g., watching back-to-back episodes of Gilligan's Island) before you work on the assignment again. This will ensure that you can reconstruct what you learned from the discussion, by yourself, using your own brain.
You must write your solutions independently and report your collaborators for every problem set. Failure to list people with whom you have discussed a problem set is considered a violation of academic honesty.
Similarly, if your solution draws on books or web sites other that the required textbook and the course website then you must cite those sources as well.
Schedule (approximate and subject to change):