CS 3110: Data Structures and Functional Programming

Cross-Listing: Not cross-listed.

An advanced programming course that emphasizes functional programming techniques and data structures. Programming topics include recursive and higher-order procedures, models of programming language evaluation and compilation, type systems, and polymorphism. Data structures and algorithms covered include graph algorithms, balanced trees, memory heaps, and garbage collection. Also covered are techniques for analyzing program performance and correctness.

Offered: Fall and Spring

Prerequisites: CS 2110 and 2111 or equivalent programming experience. Should not be taken concurrently with COM S 3410 or 3420.

Grade options: Letter or S/U

Credit hours: 4

Recent offerings:

• http://www.cs.cornell.edu/courses/cs3110/2009fa
• http://www.cs.cornell.edu/courses/cs3110/2009sp
• http://www.cs.cornell.edu/courses/cs3110/2008fa
  • Andrew Myers