Master of Science degree applicants are expected to have attained a level of scholarship in the baccalaureate program equal to a grade point average of 3.0 or better, including adequate preparation in computer science and supporting courses in mathematics (see below for prerequisite requirements).
Ph.D. applicants should possess a bachelor's or master's degree with a major in computer science or related field. In addition, applicants are expected to have attained a level of scholarship equal to a 3.3 grade point average or better in the most recent degree, including adequate preparation in computer science and supporting courses in mathematics.
All applicants should use the following checklist:
Official transcripts from each college or university attended
three letters of recommendation
GRE-Graduate Record Examination scores. The department requires at least - verbal 450, quantitative 750, analytical writing 4.5 (Old exam format requirement is analytical score of 650). ( See exceptions on Home page under Special Announcements)
A statement of approximately 300 words describing the applicants academic and professional goals
The Computer Science Graduate Admission Evaluation Form
Graduate applications should be submitted on-line. There is a link to the on-line application on the WSU homepage . The Department of Computer Science does not accept any paper documents.
Students who do not have adequate background in Computer Science, should complete the course work as listed below. It is recommended that these students apply for post-bachelor admission, since the prerequisites consist of undergraduate course work. Graduate courses taken while in the post bachelor status, will not transfer to the master's or Ph.D. program.
PREREQUISITE COURSE WORK REQUIRED FOR ADMISSION
INTO THE GRADUATE PROGRAM IN COMPUTER SCIENCE
NOTE: Students with no prior experience in C or C++ should take an introductory C++ programming course such as CSC 2000 before taking CSC 2200.
CSC 1500 Fundamental Structures in Computer Science (3 Credits)
Prereq: CSC 1100 and MAT 2010; Coreq CSC 1501. Discrete mathematics for computer science. Algorithms and complexity; recursive algorithms; program correctness using the predicate calculus; reasoning about algorithms using mathematical induction; divide and conquer algorithms; recurrence relations; set properties and their computation; and computing with relations.
CSC 2200 Computer Science II (3 Credits)
Prereq: CSC 1500 and CSC 2110; Coreq CSC 2201. A study of the design and implementation of fundamental abstract data types of computer science (such as stacks, queues, trees, lists, hashing, and graphs) using an object-oriented language. Programming requirements include the implementation of the abstract data types using arrays and dynamic links; recursion; sorting and searching; hashing; and string processing.
CSC 3100 Computer Architecture and Organization (3 Credits)
Prereq: CSC 2200; Coreq CSC 3101. An introduction to the organization and architecture of computer systems. Digital logic and digital systems; Machine level representation of data and programs; Assembly level machine organization and programming; Register-level description of computer execution and the functional organization of a computer; Role and function of programming languages, libraries, and operating systems; Performance Evaluation; and Systems programming.
CSC 4420 Computer Operating Systems (3 Credits)
Prereq: CSC 4100; Coreq 4421. Operating system services; file systems; CPU scheduling; memory management; virtual memory; disk scheduling, deadlocks; concurrent processes.
CSC 4500 Introduction to Theoretical Computer Science (3 Credits)
Prereq: CSC 2200 or CSC 5050. Finite automata and regular expressions; context-free grammars; pushdown automata; Turing machines; hierarchy of formal languages and automata; computability and decidability.
MAT 2010 Calculus I (4 Credits)
Prereq: MAT 1800. Calculus as the study of change. Definitions, concepts, and interpretations of the derivative and the definite and indefinite integrals; differentiation, integration, applications.
MAT 2020 Calculus II (4 Credits)
Prereq: MAT 2010. Techniques of integration; approximate integration; improper integrals; applications of integration. Sequences and series. Approximating functions by polynomials and Taylor series.
MAT 2210 Elementary Probability and Statistics (4 Credits)
Prereq: MAT 2010. Counting techniques, discrete sample spaces and probability, random variables, mean and variance, joint distributions, the binomial and normal distributions, the central limit theorem, estimation and hypothesis testing.
MAT 2250 Elementary Linear Algebra (3 Credits)
Prereq: Math 2020. Topics include: systems of linear equations, matrices, vector spaces, inner products, linear transformations and eigenvalues. Applications presented.