CS 138 Functional Programming and Data Abstraction
Computer Science (2009-2010)

An introduction to software abstractions via elementary programming patterns and abstract data types. Syntax and semantics of a functional programming language. Recursive data definitions. Functional abstraction and encapsulation. Study of lists, stacks, queues, trees as abstract data types. Appropriate choice of abstract data types and their implementations. [Offered: W]
Prerequisites: CS 137

Sections For Fall 2009

CS 138 is not held in Fall 2009

Sections For Spring 2009

CS 138 is not held in Spring 2009

Professors That Have Taught CS 138