This course allows students to pursue two threads of research in computer science. One thread is the discovery and analysis of previous work in the field. Students will select, read and collectively discuss papers from conferences and journals in CS. A survey paper on a topic of the student's choice will be required. The other thread is an independent project. Students will select a topic, lay out weekly goals, and meet with the instructor weekly. A final report and presentation will be required.

This course covers standard and novel techniques for mobile robot programming, including software architectures, reactive motion control, map building, localization and path planning. Other topics may include multiple robot systems, robot vision and non-traditional and dynamic robots. Students will implement various algorithms in simulation as well as on a real robot, and investigate and report on current research in the area. Course offered every other year.

Students perform professional work related to Computer Science for which they are paid. Students work full time during the term for which they are registered. 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. Co-op is an optional part of the MS in Computer Science degree. Graduate students are eligible to do a maximum of 364 days of co-op and students must register for co-op by the end of add/drop period for the appropriate term. See the CS graduate program coordinator or RIT's Office of Cooperative Education and Career Services for further details.

This course examines current topics in Intelligent Systems. This is intended to allow faculty to pilot potential new undergraduate offerings. Specific course details (such as prerequisites, course seminar, format, learning outcomes, assessment methods, and resource needs) will be determined by the faculty member(s) who propose a specific seminar course in this area. Specific course instances will be identified as belonging to the Intelligent Systems cluster, the Computational Vision and Acoustics cluster, the Security cluster, or some combination of these three clusters.

A student works with a faculty member to devise a plan of study on a topic in various areas of computing security. Deliverables, evaluation methods, and number of credits need to be specified in a written proposal. A final report and presentation in the form of a poster session is expected and graded at the end of the term.

This course serves as an introduction to computational thinking using a problem-centered approach. Specific topics covered include: expression of algorithms in pseudo code and a programming language; functional and imperative programming techniques; control structures; problem solving using recursion; basic searching and sorting; elementary data structures such as lists, trees, and graphs; and correctness, testing and debugging. Assignments (both in class and for homework) requiring a pseudo code solution and an implementation are an integral part of the course. An end-of-term project is also required.

Project capstone of the master's degree program. Students select from a set of possible projects and confirm that they have a project adviser. Students enroll in a required colloquium component that meets weekly, during which they present information, related to their projects. Projects culminate with delivery of a final report and participation in a poster session open to the public.

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.