This course provides an introduction to the design and analysis of algorithms. It covers a variety of classical algorithms and data structures and their complexity and will equip students with the intellectual tools to design, analyze, implement, and evaluate their own algorithms.

This course provides an introduction to the theory of computation, including formal languages, grammars, auto-mata theory, computability, and complexity.

Students perform professional work related to Computer Science for which they are paid. Students must complete a student co-op work report for each term for which they are registered; students are also evaluated each term by their employer. A satisfactory grade is given for co-op when both a completed student co-op work report and a completed, corresponding employer evaluation are received and when both documents are generally consistent. When registered for co-op, students are considered by RIT to have full-time status. In order to register for co-op for either fall or spring semester, we expect that students will work a minimum of 14 weeks and work a minimum of 35 hours per week.

This course provides an introduction to the theory of computation, including formal languages, grammars, automata theory, computability, and complexity. This course serves as a bridge course for graduate students and cannot be taken by undergraduate students without permission from the CS Undergraduate Program Coordinator. Note: Students who complete CSCI 262 or CSCI 263 may not take CSCI 661 for credit.

This course provides an introduction to the design and analysis of algorithms. It covers a variety of classical algorithms and their complexity and will equip students with the intellectual tools to design, analyze, implement, and evaluate their own algorithms. Note: students who take CSCI-261 or CSCI-264 may not take CSCI-665 for credit.