CS 3110

CS 3110

Course information provided by the Courses of Study 2014-2015.

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 covers techniques for analyzing program performance and correctness.

When Offered Fall, spring.

Prerequisites/Corequisites Prerequisite: CS 2110 or equivalent programming experience. Prerequisite or corequisite: CS 2800. Should not be taken concurrently with CS 3410 or CS 3420.

Distribution Category (MQR)

View Enrollment Information

Syllabi: none
  •   Regular Academic Session.  Choose one lecture and one discussion.

  • 4 Credits Stdnt Opt

  • 11218 CS 3110   LEC 001

    • TR Olin Hall 155
    • Clarkson, M

      George, M

  • Preference given to CS majors. If class is oversubscribed, non-CS majors will be moved to waitlist.

  • 11219 CS 3110   DIS 201

  • 11220 CS 3110   DIS 202

  • 11221 CS 3110   DIS 203

  • 12294 CS 3110   DIS 204

  • 12694 CS 3110   DIS 205

  • 12695 CS 3110   DIS 206

  • 12696 CS 3110   DIS 207

  • 12697 CS 3110   DIS 208