The Volgenau School of Information Technology & Engineering

Please complete this department form and submit it with your

Office of Graduate Admissions & Enrollment Services complete application package to the Office of Graduate
The Engineering Building, Mail Stop 3D5 Admissions & Enrollment Services for the fastest admissions
4400 University Drive, Fairfax, Virginia 22030 decision!
Phone: 703-993-1512; Fax: 703-993-1242

MS in COMPUTER SCIENCE (and related courses) – ACADEMIC PREPARATION

SELF-EVALUATION FORM
Please fill out this self-evaluation form as accurately as possible to aid in determining the foundation coursework to be completed for the
Computer Science Masters-level related courses. Make the best match you can between graduate and undergraduate courses you have
already taken and the equivalent GMU courses. Descriptions of the GMU equivalent courses are included below the course title. When you
are admitted, you will be advised as to what foundation courses, if any, may be required.

Personal
Name:       GMU ID:      
Information
Educational Previous Major Field
           
Background Degree
Institution Graduation
           
Date:
Application Term: - Fall 20   Program:
Select One
Information - Spring 20  

Course Name, Course Date

Course Area (Equivalent GMU Textbooks – Grad
Number, Take
Course) Title & Author e
Where Taken n
Calculus I, Calculus II (MATH 113,                        
MATH 114)
• Functions, limits, the derivative, maximum and minimum problems, the
integral, and transcendental functions.
• Methods of integration, conic sections, parametric equations, infinite
series, and power series.
Discrete Mathematics and Logic                        
(MATH 125)
Introduces ideas of discrete mathematics and combinatorial proof techniques
including mathematical induction, sets, graphs, trees, recursion, and
enumeration
Data Structures (CS 310)                        
This course focuses on advanced object-oriented programming with an
emphasis on tools and techniques for developing moderate to large
programs. Topics include use and implementation of linear and nonlinear
data structures, and the design and analysis of elementary algorithms
Automata Theory and Formal                        
Languages (CS 330)
Abstract concepts that underlie much advanced work in computer science,
with major emphasis on formal languages, automata theory, models of
computation, logic, and proof strategies.
Computer Architecture, Assembly                        
Language and Systems
Programming (CS 367, CS 465)
Computer subsystems and instruction set architectures. Single-cycle,
multiple-cycle, and pipeline architectures. Memory hierarchy, cache, and
virtual memory input-output processing. Assembly and machine level
representation of high-level language programs, linking, exceptions,
interrupts, low-level programming in C/C++.