In this course, the students will learn the formal definition of programming language syntax and semantics. They will be introduced to the functions of compilers and their design and implementation details. The course will reinforce the students' knowledge of context free grammars and automata and use this knowledge in designing lexical analyzers and translators for high level programming languages. Topics covered include lexical analysis, type checking, context analysis, and code generation. Prerequisites: CSC 231, CSC 250. {M}

This course will examine foundational principles and concepts applicable across different programming languages and paradigms. Numerous practical applications will illustrate and draw out the theoretical constructs under consideration in specific instances and contexts. Students will experience programming in multiple languages, and will be able to place each within the larger context and history of the discipline. Prerequisite: CSC 111 or the equivalent. {M}

Seminar: Explores the challenge of computer vision through readings of original papers and implementation of classic algorithms. This seminar considers techniques for extracting useful information from digital images, including both the motivation and the mathematical underpinnings. Topics range from low-level techniques for image enhancement and feature detection to higher-level issues such as stereo vision, image retrieval and segmentation of tracking of objects. Prerequisites: CSC 212, MTH 153

This class introduces the operation of logic and sequential circuits. Students explore basic logic gates (AND, OR, NAND, NOR), counters, flip-flops, decoders, microprocessor systems. Students have the opportunity to design and implement digital circuits during a weekly lab. Prerequisite: 231. Enrollment limited to 12.

This class introduces the operation of logic and sequential circuits. Students explore basic logic gates (AND, OR, NAND, NOR), counters, flip-flops, decoders, microprocessor systems. Students have the opportunity to design and implement digital circuits during a weekly lab. Prerequisite: 231. Enrollment limited to 12.

Automata and finite state machines, regular sets and regular languages; push-down automata and context-free languages; linear-bounded automata; computability and Turing machines; nondeterminism and undecidability. Prerequisites: 111 and MTH 153.

Reinforces programming skills learned in previous programming courses through working on a number of projects. Offers practice for developing modular, reusable, maintainable code. Students will gain more experience with design and development. Prerequisite: 212.

Explores elementary data structures (linked lists, stacks, queues, trees, graphs) and algorithms (searching, sorting) in a variety of contexts, including event-driven applications with a graphical user interface. Emphasizes object-oriented programming throughout, using the Java programming language. Prerequisite: CSC 111.

Explores elementary data structures (linked lists, stacks, queues, trees, graphs) and algorithms (searching, sorting) in a variety of contexts, including event-driven applications with a graphical user interface. Emphasizes object-oriented programming throughout, using the Java programming language. Prerequisite: CSC 111.

Explores elementary data structures (linked lists, stacks, queues, trees, graphs) and algorithms (searching, sorting) in a variety of contexts, including event-driven applications with a graphical user interface. Emphasizes object-oriented programming throughout, using the Java programming language. Prerequisite: CSC 111.