CS 3110

CS 3110

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

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

  • 11509 CS 3110   LEC 001

    • TR Olin Hall 155
    • Clarkson, M

      George, M

  • 11510 CS 3110   DIS 201

  • 11511 CS 3110   DIS 202

  • 11512 CS 3110   DIS 203

  • 13218 CS 3110   DIS 204

  • 13219 CS 3110   DIS 205

  • 13220 CS 3110   DIS 206

    • TR Bard Hall 140
    • Clarkson, M

      George, M

  • 13297 CS 3110   DIS 207

    • MW Olin Hall 216
    • Clarkson, M

      George, M

  • 13298 CS 3110   DIS 208

    • MW Olin Hall 145
    • Clarkson, M

      George, M

  • 13299 CS 3110   DIS 209

  • 13300 CS 3110   DIS 210

  • 13301 CS 3110   DIS 211