Rensselaer Polytechnic Institute | About RPI | Academics & Research | Student Life | Admissions | News & Information
* Information Technology at Rensselaer * IT Home
* *
* Undergraduate Graduate IT Careers IT Faculty IT Research IT News
RPI IT
Information Technology
Home > Graduate Program > Graduate Admissions and Tests
*

Graduate Program:
Student & Alumni Stories
Master's Program
Ph.D. Program
Admissions & Tests
Financial Aid

Related Links:
Graduate Video
RPI Catalog
RPI Admissions

*
Graduate Admissions and Tests

How to Apply:

Applicants are expected to have academic backgrounds and records that clearly indicate their potential to excel in a rigorous graduate program in IT. GRE scores are required. GMAT scores can be accepted in place of the GRE. Admissions applications and detailed instructions are available from Graduate Admissions.

IT applicants also complete the IT Background Evaluation Form (Word file, 94k) and send it to the Admissions Office with other materials or to the IT office via e-mail to gereg@rpi.edu.

Rensselaer Undergraduates: Co-Terminal MS Program Admission:

Rensselaer students with Junior year standing are eligible to apply for admission to the Master's degree. Both the BS and MS degrees would be completed simultaneously, usually at the end of the fifth year of study. Some students, using AP credit, transfer credit, or extra courses per term are able to finish in four and a half years. Funding for the additional study is offered by the Financial Aid office as one or two additional terms of undergraduate aid.

To apply for Co-terminal admission, students must complete the Co-terminal application form available on the Admissions Office web site. Applicants must have a minimum GPA of 3.0 and submit one faculty reference, a Statement of Background and Goals and a resume.

RPI undergraduates do not need to submit GRE scores to apply for the Co-terminal degree program. All students from other colleges must submit GRE scores.

Students with Senior standing can apply for regular MS admission using the Admissions Office on-line application process and request consideration for Teaching Assistantships. The GRE, two faculty references, the Statement of Background and Goals and a resume are required.

Program Prerequisites:

A three course prerequisite sequence in Computer Science that is equivalent to the Rensselaer courses listed below is required prior to enrolling for the Master’s in IT. We welcome applications from students with a wide variety of backgrounds. Students without the full computer science sequence may be able to complete the required courses via on-line course work or at colleges near their homes as preparation to undertake the IT master’s.

Rensselaer Prerequisite Sequence:

  • CSCI-1100 Computer Science I: Fundamentals of Computer Science
    An introduction to algorithm design and analysis, programming, and use of the World Wide Web for information dissemination and retrieval. Additional topics include basic computer organization; internal representation of scalar and array data; use of top-down design and subprograms to tackle complex problems; abstract data types. Enrichment material as time allows. Interdisciplinary case studies, numerical and nonnumerical applications.
  • CSCI-1200 Computer Science II: Data Structures
    Programming concepts: functions, parameter passing, pointers, arrays, strings, structs, classes, templates. Mathematical tools: sets, functions, and relations, O-notation, complexity of algorithms, proof by induction. Data structures and their representations: data abstraction and internal representation, sequences, trees, binary search trees, associative structures. Algorithms: searching and sorting, generic algorithms, iterative and recursive algorithms. Methods of testing correctness and measuring performance.
  • CSCI-2300 Introduction to Algorithms
    Data structures and algorithms, and the mathematical techniques necessary to design and analyze them. Basic data structures: lists, associative structures, trees. Mathematical techniques for designing algorithms and analyzing worst-case and expected-case algorithm efficiency. Advanced data structures: balanced trees, tries, heaps, priority queues, graphs. Searching, sorting. Algorithm design techniques: dynamic programming, greedy algorithms, divide-and-conquer, backtracking. Example graph, string, geometric, and numeric algorithms.
* *

Copyright © 2005 Rensselaer Polytechnic Institute