An introduction to the fundamental and emergent paradigms, both formal and pragmatic, of algorithms and computation. Topics include basic automata theory, functional programming, object-oriented design, and concurrent/parallel programming. The Scheme programming language is introduced. This course cannot be taken for credit after receiving credit for CS 380 . Prerequisites:CS 210 , CS 255 , MATH 250 . Spring (Group II)

Global Search Catalog Search
Choose Search Location

Search Keyword Field

Whole Word/Phrase
Advanced Search

Catalog Navigation

Catalog Home

The University

Academic Regulations and Procedures

Academic Honors and Distinctions

Degrees and Special Programs

Majors and Minors

Courses of Instruction

Student Engagement and Success and Non-Academic Regulations

Expenses and Financial Aid

Facilities

Prizes and Awards

Corporation (Board of Trustees)

University Personnel