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)