The Washington State University Catalog

Courses with the CPT_S Subject

The online catalog includes the most recent changes to courses and degree requirements that have been approved by the Faculty Senate, including changes that are not yet effective. Courses showing two entries of the same number indicate that the course information is changing. The most recently approved version is shown first, followed by the older version, in gray, with its last-effective term preceding the course title. Courses shown in gray with only one entry of the course number are being discontinued.

Courses

Computer Science (CPT_S / CPT S)

With the exception of the Computer Skills and Literacy courses, enrollment in 300-400-level computer science courses is restricted to certified majors or minors in computer science, computer engineering, or electrical engineering, and to juniors and seniors officially certified into other degree programs requiring these computer science courses.

111 Introduction to Algorithmic Problem Solving 3 (2-3) Elementary algorithmic problem solving, computational models, sequential, iterative and conditional operations, parameterized procedures, array and list structures and basic efficiency analysis.

111 (Effective through Spring 2014) Introduction to Algorithmic Problem Solving 3 (2-3) Elementary algorithmic problem solving, computational models, sequential, iterative and conditional operations, parameterized procedures, array and list structures and basic efficiency analysis.

121 Program Design and Development 4 (3-3) Course Prerequisite: MATH 106 with a C or better, or MATH 108, 171, 172, 182, 201, 202, 206, 220, 273, 315, or ALEKS math placement score of 70% or higher. Formulation of problems and top-down design of programs in a modern structured language for their solution on a digital computer.

121 (Effective through Spring 2014) Program Design and Development 4 (3-3) Course Prerequisite: MATH 106 with a C or better, or MATH 108, 171, 172, 182, 201, 202, 206, 220, 273, 315, or ALEKS math placement score of 70% or higher. Formulation of problems and top-down design of programs in a modern structured language for their solution on a digital computer.

122 Data Structures 4 (3-3) Course Prerequisite: CPT S 121 with a C or better. Advanced programming techniques: data structures, recursion, sorting and searching, and basics of algorithm analysis.

122 (Effective through Spring 2014) Data Structures 4 (3-3) Course Prerequisite: CPT S 121 with a C or better. Advanced programming techniques: data structures, recursion, sorting and searching, and basics of algorithm analysis.

223 Advanced Data Structures 3 Course Prerequisite: CPT S 122 with a C or better; MATH 216 with a C or better or concurrent enrollment. Advanced data structures, object oriented programming concepts, concurrency, and program design principles.

223 (Effective through Spring 2014) Advanced Data Structures 3 Course Prerequisite: CPT S 122 with a C or better; MATH 216 with a C or better or concurrent enrollment. Advanced data structures, object oriented programming concepts, concurrency, and program design principles.

224 Programming Tools 2 Course Prerequisite: CPT S 122 with a C or better. Debugging tools, scripting languages, UNIX programming tools.

224 (Effective through Spring 2014) Programming Tools 2 Course Prerequisite: CPT S 122 with a C or better. Debugging tools, scripting languages, UNIX programming tools.

260 Introduction to Computer Architecture 3 Course Prerequisite: CPT S 223 with a C or better or concurrent enrollment. Computer systems architecture; logic, data representation, assembly language, memory organization and trends.

260 (Effective through Spring 2014) Introduction to Computer Architecture 3 Course Prerequisite: CPT S 223 with a C or better or concurrent enrollment. Computer systems architecture; logic, data representation, assembly language, memory organization and trends.

302 Professional Skills in Computing and Engineering 3 Course prerequisite: Certified major in Computer Science, Computer Engineering, or Electrical Engineering; junior standing. Foundation in computing and engineering professional development. (Crosslisted course offered as CPT S 302, E E 302). Credit not granted for both CPT S/E E 302 and CPT S 401.

317 Automata and Formal Languages 3 Course Prerequisite: CPT S 122 with a C or better; MATH 216 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Finite automata, regular sets, pushdown automata, context-free language, Turing machines and the halting problem.

317 (Effective through Spring 2014) Automata and Formal Languages 3 Course Prerequisite: CPT S 122 with a C or better; MATH 216 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Finite automata, regular sets, pushdown automata, context-free language, Turing machines and the halting problem.

322 [M] Software Engineering Principles I 3 Course Prerequisite: CPT S 223 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Introduction to software engineering; requirements analysis, definition, specification including formal methods; prototyping; design including object and function oriented design.

322 (Effective through Spring 2014) [M] Software Engineering Principles I 3 Course Prerequisite: CPT S 223 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Introduction to software engineering; requirements analysis, definition, specification including formal methods; prototyping; design including object and function oriented design.

323 Software Design 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 322 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Practical aspects of software design and implementation using object-oriented, aspect-oriented and procedural programming.

323 (Effective through Spring 2014) Software Design 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 322 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Practical aspects of software design and implementation using object-oriented, aspect-oriented and procedural programming.

355 Programming Language Design 3 Course Prerequisite: CPT S 223 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Design concepts of high-level programming languages; survey of existing languages, experience using some languages.

355 (Effective through Spring 2014) Programming Language Design 3 Course Prerequisite: CPT S 223 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Design concepts of high-level programming languages; survey of existing languages, experience using some languages.

360 Systems Programming 4 (3-3) Course Prerequisite: CPT S 223 with a C or better; CPT S 260 with a C or better or E E 234 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Implementation of sys-tems programs, concepts of computer operating systems; laboratory experience in using operating system facilities.

360 (Effective through Spring 2014) Systems Programming 4 (3-3) Course Prerequisite: CPT S 223 with a C or better; CPT S 260 with a C or better or E E 234 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Implementation of sys-tems programs, concepts of computer operating systems; laboratory experience in using operating system facilities.

401 [T] Computers and Society 3 Course Prerequisite: Junior standing. Skills and literacy course. Ethical and societal issues related to computers and computer networks; computers as enabling technology; computer crime, software theft, privacy, viruses, worms. Credit not granted for both CPT S 401 and CPT S/E E 302.

401 (Effective through Summer 2014) [T] Computers and Society 3 Course Prerequisite: Junior standing. Skills and literacy course. Ethical and societal issues related to computers and computer networks; computers as enabling technology; computer crime, software theft, privacy, viruses, worms. Credit not granted for both CPT S 401 or 402.

401 (Effective through Spring 2014) [T] Computers and Society 3 Course Prerequisite: Junior standing. Skills and literacy course. Ethical and societal issues related to computers and computer networks; computers as enabling technology; computer crime, software theft, privacy, viruses, worms. Credit not granted for both CPT S 401 or 402.

402 (Effective through Summer 2014) [M] Social and Professional Issues in Computer Science 3 Course Prerequisite: CPT S 121 with a C or better; certified in Computer Science. Social, legal, ethical and professional issues that arise in the context of computing. Credit not granted for both CPT S 401 or 402.

402 (Effective through Spring 2014) [M] Social and Professional Issues in Computer Science 3 Course Prerequisite: CPT S 121 with a C or better; certified in Computer Science. Social, legal, ethical and professional issues that arise in the context of computing. Credit not granted for both CPT S 401 or 402.

421 Software Design Project I 3 (0-9) Course Prerequisite: CPT S 322 with a C or better; CPT S 323 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Large-scale software development including requirements analysis, estimation, design, verification and project management.

421 (Effective through Spring 2014) Software Design Project I 3 (0-9) Course Prerequisite: CPT S 322 with a C or better; CPT S 323 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Large-scale software development including requirements analysis, estimation, design, verification and project management.

422 [M] Software Engineering Principles II 3 Course Prerequisite: CPT S 322 with a C or better; CPT S 323 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Dependable software systems; software verification and validation, testing; CASE environments; software management and evolution.

422 (Effective through Spring 2014) [M] Software Engineering Principles II 3 Course Prerequisite: CPT S 322 with a C or better; CPT S 323 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Dependable software systems; software verification and validation, testing; CASE environments; software management and evolution.

423 [CAPS] [T] Software Design Project II 3 (1-6) Course Prerequisite: CPT S 421 with a C or better; CPT S 422 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering; junior standing. Laboratory/group design project for large-scale software development, requirements analysis, estimation, design, verification techniques.

423 (Effective through Summer 2014) [CAPS] [T] Software Design Project II 3 (1-6) Course Prerequisite: CPT S 421 with a C or better; CPT S 422 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Laboratory/group design project for large-scale software development, requirements analysis, estimation, design, verification techniques.

423 (Effective through Spring 2014) [CAPS] [T] Software Design Project II 3 (1-6) Course Prerequisite: CPT S 421 with a C or better; CPT S 422 with a C or better or concurrent enrollment; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Laboratory/group design project for large-scale software development, requirements analysis, estimation, design, verification techniques.

427 Computer Security 3 Course Prerequisite: CPT S 360 with a C or better; MATH 216 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Computer security concepts, models and mechanism; encryption technology, formal models, policy and ethical implications. Credit not granted for both CPT S 427 and CPT S 527. Offered at 400 and 500 level.

427 (Effective through Spring 2014) Computer Security 3 Course Prerequisite: CPT S 360 with a C or better; MATH 216 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Computer security concepts, models and mechanism; encryption technology, formal models, policy and ethical implications. Credit not granted for both CPT S 427 and CPT S 527. Offered at 400 and 500 level.

430 Numerical Analysis 3 Course Prerequisite: MATH 315; CPT S 121, CPT S 251, or MATH 300. Fundamentals of numerical computation; finding zeroes of functions, approximation and interpolation; numerical integration (quadrature); numerical solution of ordinary differential equations. (Crosslisted course offered as MATH 448, CPT S 430, CPT S 530). Required preparation must include differential equations and a programming course. Offered at 400 and 500 level.

430 (Effective through Spring 2014) Numerical Analysis 3 Course Prerequisite: MATH 315; CPT S 121, CPT S 251, or MATH 300. Fundamentals of numerical computation; finding zeroes of functions, approximation and interpolation; numerical integration (quadrature); numerical solution of ordinary differential equations. (Crosslisted course offered as MATH 448, CPT S 430, CPT S 530). Required preparation must include differential equations and a programming course. Offered at 400 and 500 level.

434 Neural Network Design and Application 3 Course Prerequisite: CPT S 122 with a C or better; STAT 360 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Hands-on experience with neural network modeling of nonlinear phenomena; application to classification, forecasting, identification and control. Credit not granted for both CPT S 434 and CPT S 534. Offered at 400 and 500 level.

434 (Effective through Spring 2014) Neural Network Design and Application 3 Course Prerequisite: CPT S 122 with a C or better; STAT 360 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Hands-on experience with neural network modeling of nonlinear phenomena; application to classification, forecasting, identification and control. Credit not granted for both CPT S 434 and CPT S 534. Offered at 400 and 500 level.

438 Scientific Visualization 3 Course Prerequisite: CPT S 223 with a C or better; CptS 224 with a C or better; MATH 172 or 182 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Data taxonomy, sampling, plotting, using and extending a visualization package, designing visualization and domain-specific techniques. Offered at 400 and 500 level.

438 (Effective through Spring 2014) Scientific Visualization 3 Course Prerequisite: CPT S 223 with a C or better; CptS 224 with a C or better; MATH 172 or 182 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Data taxonomy, sampling, plotting, using and extending a visualization package, designing visualization and domain-specific techniques. Offered at 400 and 500 level.

439 Critical Infrastructure Security: The Emerging Smart Grid 3 Course Prerequisite: Senior standing. Smart electric grid, communication networks, distributed computing, fault tolerant computing, cyber security, analyzing interdependencies between the smart grid components, smart grid standards and protocols. (Crosslisted course offered as E E 439, CPT S 439).

440 Artificial Intelligence 3 Course Prerequisite: CptS 122 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. An introduction to the field of artificial intelligence including heuristic search, knowledge representation, deduction, uncertainty reasoning, learning, and symbolic programming languages. Credit not granted for both CPT S 440 and CPT S 540. Offered at 400 and 500 level.

440 (Effective through Spring 2014) Artificial Intelligence 3 Course Prerequisite: CptS 122 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. An introduction to the field of artificial intelligence including heuristic search, knowledge representation, deduction, uncertainty reasoning, learning, and symbolic programming languages. Credit not granted for both CPT S 440 and CPT S 540. Offered at 400 and 500 level.

442 Computer Graphics 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 224 with a C or better; MATH 220 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Raster operations; transformations and viewing; geometric modeling; visibility and shading; color. Credit not granted for both CPT S 442 and CPT S 542. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

442 (Effective through Spring 2014) Computer Graphics 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 224 with a C or better; MATH 220 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Raster operations; transformations and viewing; geometric modeling; visibility and shading; color. Credit not granted for both CPT S 442 and CPT S 542. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

443 Human-Computer Interaction 3 Course Prerequisite: Junior standing; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Concepts and methodologies of engineering, social and behavioral sciences to address ergonomic, cognitive, social and cultural factors in the design and evaluation of human-computer systems. Credit not granted for both CPT S 443 and CPT S 543. Offered at 400 and 500 level.

443 (Effective through Spring 2014) Human-Computer Interaction 3 Course Prerequisite: Junior standing; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Concepts and methodologies of engineering, social and behavioral sciences to address ergonomic, cognitive, social and cultural factors in the design and evaluation of human-computer systems. Credit not granted for both CPT S 443 and CPT S 543. Offered at 400 and 500 level.

450 Design and Analysis of Algorithms 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 317 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Analysis of data structures and algorithms; computational complexity and design of efficient data-handling procedures.

450 (Effective through Spring 2014) Design and Analysis of Algorithms 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 317 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Analysis of data structures and algorithms; computational complexity and design of efficient data-handling procedures.

451 Introduction to Database Systems 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 224 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Introduction to database concepts, data models, database languages, database design, implementation issues.

452 Compiler Design 3 Course Prerequisite: CPT S 317 with a C or better; CPT S 355 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Design of lexical analyzers, syntactic analyzers, intermediate code generators, code optimizers and object code generators.

452 (Effective through Spring 2014) Compiler Design 3 Course Prerequisite: CPT S 317 with a C or better; CPT S 355 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Design of lexical analyzers, syntactic analyzers, intermediate code generators, code optimizers and object code generators.

453 Graph Theory 3 Course Prerequisite: MATH 220 or MATH 230. Graphs and their applications, directed graphs, trees, networks, Eulerian and Hamiltonian paths, matrix representations, construction of algorithms. (Crosslisted course offered as MATH 453, CPT S 453). Required preparation must include linear algebra. Required preparation must include linear algebra. Offered at 400 and 500 level.

453 (Effective through Spring 2014) Graph Theory 3 Course Prerequisite: MATH 220 or MATH 230. Graphs and their applications, directed graphs, trees, networks, Eulerian and Hamiltonian paths, matrix representations, construction of algorithms. (Crosslisted course offered as MATH 453, CPT S 453). Required preparation must include linear algebra. Required preparation must include linear algebra. Offered at 400 and 500 level.

455 Introduction to Computer Networks 3 Course Prerequisite: CptS 360 with a C or better or EE 234 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Concepts and implementation of computer networks; architectures, protocol layers, internetworking and addressing case studies. (Crosslisted course offered as CPT S 455, E E 455).

455 (Effective through Spring 2014) Introduction to Computer Networks 3 Course Prerequisite: CptS 360 with a C or better or EE 234 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Concepts and implementation of computer networks; architectures, protocol layers, internetworking and addressing case studies. (Crosslisted course offered as CPT S 455, E E 455).

460 Operating Systems and Computer Architecture 3 Course Prerequisite: CPT S 360 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Operating systems, computer architectures, and their interrelationships in micro, mini, and large computer systems.

460 (Effective through Spring 2014) Operating Systems and Computer Architecture 3 Course Prerequisite: CPT S 360 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Operating systems, computer architectures, and their interrelationships in micro, mini, and large computer systems.

464 Distributed Systems Concepts and Programming 3 Course Prerequisite: CPT S 360 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Concepts of distributed systems; naming, security, networking, replication, synchronization, quality of service; programming middleware. Credit not granted for both CPT S 464 and CPT S 564. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

464 (Effective through Spring 2014) Distributed Systems Concepts and Programming 3 Course Prerequisite: CPT S 360 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Concepts of distributed systems; naming, security, networking, replication, synchronization, quality of service; programming middleware. Credit not granted for both CPT S 464 and CPT S 564. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

466 Embedded Systems 3 (2-3) Course Prerequisite: CPT S 360 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. The design and development of real-time and dedicated software systems with an introduction to sensors and actuators. Credit not granted for both CPT S 466 and CPT S 566. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

466 (Effective through Spring 2014) Embedded Systems 3 (2-3) Course Prerequisite: CPT S 360 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. The design and development of real-time and dedicated software systems with an introduction to sensors and actuators. Credit not granted for both CPT S 466 and CPT S 566. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

470 Concepts in Biotechnology 3 Course Prerequisite: [B] or [BSCI] GER or UCORE with a C or better; concurrent enrollment in E E 415, E E 416, CPT S 421, CPT S 423, ENTRP 496, ENGR 420, or ENGR 421; certified major in Electrical Engineering, Computer Science, or Computer Engineering. Fundamentals of biological sciences and biotechnology for engineers and computer scientists. (Crosslisted course offered as E E 470, CPT S 470).

470 (Effective through Spring 2014) Concepts in Biotechnology 3 Course Prerequisite: [B] or [BSCI] GER or UCORE with a C or better; concurrent enrollment in E E 415, E E 416, CPT S 421, CPT S 423, ENTRP 496, ENGR 420, or ENGR 421; certified major in Electrical Engineering, Computer Science, or Computer Engineering. Fundamentals of biological sciences and biotechnology for engineers and computer scientists. (Crosslisted course offered as E E 470, CPT S 470).

471 Computational Genomics 3 Course Prerequisite: CptS 450 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Fundamental algorithms, techniques and applications. Credit not granted for both CPT S 471 and CPT S 571. Offered at 400 and 500 level.

471 (Effective through Spring 2014) Computational Genomics 3 Course Prerequisite: CptS 450 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Fundamental algorithms, techniques and applications. Credit not granted for both CPT S 471 and CPT S 571. Offered at 400 and 500 level.

481 Python Software Construction 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 224 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Intensive introduction to the python language; user interface, building and using extension modules; C interfacing; construction of a major project.

481 (Effective through Spring 2014) Python Software Construction 3 Course Prerequisite: CPT S 223 with a C or better; CPT S 224 with a C or better; certified major in Computer Science, Computer Engineering, or Electrical Engineering. Intensive introduction to the python language; user interface, building and using extension modules; C interfacing; construction of a major project.

483 Topics in Computer Science V 1-4 May be repeated for credit. Course Prerequisite: Certified major in Computer Science, Computer Engineering, or Electrical Engineering. Required background preparation varies with course offering, see instructor. Current topics in computer science or software engineering. Required preparation: Varies with course offering, see instructor.

483 (Effective through Spring 2014) Topics in Computer Science V 1-4 May be repeated for credit. Course Prerequisite: Certified major in Computer Science, Computer Engineering, or Electrical Engineering. Required background preparation varies with course offering, see instructor. Current topics in computer science or software engineering. Required preparation: Varies with course offering, see instructor.

490 Work Study Internship V 1-9 May be repeated for credit; cumulative maximum 9 hours. Course Prerequisite: Computer Science major; by permission only. Experience in programming and systems analysis in a working environment under supervision of industrial or governmental professionals and faculty. S, F grading.

490 (Effective through Spring 2014) Work Study Internship V 1-9 May be repeated for credit; cumulative maximum 9 hours. Course Prerequisite: Computer Science major; by permission only. Experience in programming and systems analysis in a working environment under supervision of industrial or governmental professionals and faculty. S, F grading.

499 Special Problems V 1-4 May be repeated for credit. Independent study conducted under the jurisdiction of an approving faculty member; may include independent research studies in technical or specialized problems; selection and analysis of specified readings; development of a creative project; or field experiences. S, F grading.

499 (Effective through Spring 2014) Special Problems V 1-4 May be repeated for credit. Independent study conducted under the jurisdiction of an approving faculty member; may include independent research studies in technical or specialized problems; selection and analysis of specified readings; development of a creative project; or field experiences. S, F grading.

500 Proseminar 1 Faculty research interests, departmental computer systems, computer science research, report preparation. S, F grading.

500 (Effective through Spring 2014) Proseminar 1 Faculty research interests, departmental computer systems, computer science research, report preparation. S, F grading.

516 Algorithmics 3 Discrete structures, automata, formal languages, recursive functions, algorithms, and computability.

516 (Effective through Spring 2014) Algorithmics 3 Discrete structures, automata, formal languages, recursive functions, algorithms, and computability.

527 Computer Security 3 Computer security concepts, models and mechanism; encryption technology, formal models, policy and ethical implications. Credit not granted for both CPT S 427 and CPT S 527. Offered at 400 and 500 level.

527 (Effective through Spring 2014) Computer Security 3 Computer security concepts, models and mechanism; encryption technology, formal models, policy and ethical implications. Credit not granted for both CPT S 427 and CPT S 527. Offered at 400 and 500 level.

530 Numerical Analysis 3 Fundamentals of numerical computation; finding zeroes of functions, approximation and interpolation; numerical integration (quadrature); numerical solution of ordinary differential equations. (Crosslisted course offered as MATH 448, CPT S 430, CPT S 530). Required preparation must include differential equations and a programming course. Offered at 400 and 500 level.

530 (Effective through Spring 2014) Numerical Analysis 3 Fundamentals of numerical computation; finding zeroes of functions, approximation and interpolation; numerical integration (quadrature); numerical solution of ordinary differential equations. (Crosslisted course offered as MATH 448, CPT S 430, CPT S 530). Required preparation must include differential equations and a programming course. Offered at 400 and 500 level.

531 Advanced Matrix Computations 3 Advanced topics in the solution of linear systems and eigenvalue problems, including parallel matrix computations. (Crosslisted course offered as MATH 544, CPT S 531). Required preparation must include numerical analysis. Required preparation must include numerical analysis. Cooperative: Open to UI degree-seeking students.

531 (Effective through Spring 2014) Advanced Matrix Computations 3 Advanced topics in the solution of linear systems and eigenvalue problems, including parallel matrix computations. (Crosslisted course offered as MATH 544, CPT S 531). Required preparation must include numerical analysis. Required preparation must include numerical analysis. Cooperative: Open to UI degree-seeking students.

534 Neural Network Design and Application 3 Hands-on experience with neural network modeling of nonlinear phenomena; application to classification, forecasting, identification and control. Credit not granted for both CPT S 434 and CPT S 534. Offered at 400 and 500 level.

534 (Effective through Spring 2014) Neural Network Design and Application 3 Hands-on experience with neural network modeling of nonlinear phenomena; application to classification, forecasting, identification and control. Credit not granted for both CPT S 434 and CPT S 534. Offered at 400 and 500 level.

538 Scientific Visualization 3 Data taxonomy; sampling; plotting; using and extending a visualization package; designing visualizations; domain-specific techniques.

538 (Effective through Spring 2014) Scientific Visualization 3 Data taxonomy; sampling; plotting; using and extending a visualization package; designing visualizations; domain-specific techniques.

540 Artificial Intelligence 3 An introduction to the field of artificial intelligence including heuristic search, knowledge representation, deduction, uncertainty reasoning, learning, and symbolic programming languages. Credit not granted for both CPT S 440 and CPT S 540. Offered at 400 and 500 level.

540 (Effective through Spring 2014) Artificial Intelligence 3 An introduction to the field of artificial intelligence including heuristic search, knowledge representation, deduction, uncertainty reasoning, learning, and symbolic programming languages. Credit not granted for both CPT S 440 and CPT S 540. Offered at 400 and 500 level.

542 Computer Graphics 3 Raster operations; transformations and viewing; geometric modeling; visibility and shading; color. Credit not granted for both CPT S 442 and CPT S 542. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

542 (Effective through Spring 2014) Computer Graphics 3 Raster operations; transformations and viewing; geometric modeling; visibility and shading; color. Credit not granted for both CPT S 442 and CPT S 542. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

543 Human-Computer Interaction 3 Concepts and methodologies of engineering, social and behavioral sciences to address ergonomic, cognitive, social and cultural factors in the design and evaluation of human-computer systems. Credit not granted for both CPT S 443 and CPT S 543. Offered at 400 and 500 level.

543 (Effective through Spring 2014) Human-Computer Interaction 3 Concepts and methodologies of engineering, social and behavioral sciences to address ergonomic, cognitive, social and cultural factors in the design and evaluation of human-computer systems. Credit not granted for both CPT S 443 and CPT S 543. Offered at 400 and 500 level.

548 Advanced Computer Graphics 3 Solid modeling, visual realism, light and color models, advanced surface generation techniques.

548 (Effective through Spring 2014) Advanced Computer Graphics 3 Solid modeling, visual realism, light and color models, advanced surface generation techniques.

550 Parallel Computation 3 Parallel machine models, principles for the design of parallel algorithms, interconnection networks, systolic arrays, computational aspects to VLSI. Required preparation must include differential equations and a programming course.

550 (Effective through Spring 2014) Parallel Computation 3 Parallel machine models, principles for the design of parallel algorithms, interconnection networks, systolic arrays, computational aspects to VLSI. Required preparation must include differential equations and a programming course.

553 Graph Theory 3 Graphs and their applications, directed graphs, trees, networks, Eulerian and Hamiltonian paths, matrix representations, construction of algorithms. (Crosslisted course offered as MATH 453, CPT S 453). Required preparation must include linear algebra. Required preparation must include linear algebra. Offered at 400 and 500 level.

553 (Effective through Spring 2014) Graph Theory 3 Graphs and their applications, directed graphs, trees, networks, Eulerian and Hamiltonian paths, matrix representations, construction of algorithms. (Crosslisted course offered as MATH 453, CPT S 453). Required preparation must include linear algebra. Required preparation must include linear algebra. Offered at 400 and 500 level.

555 Computer Communication Networks 3 Packet switching networks; multi-access and local-area networks; delay models in data networks; routing and flow control. (Crosslisted course offered as E E 555, CPT S 555).

555 (Effective through Spring 2014) Computer Communication Networks 3 Packet switching networks; multi-access and local-area networks; delay models in data networks; routing and flow control. (Crosslisted course offered as E E 555, CPT S 555).

557 Advanced Computer Networks 3 ATM networks, optical WDM networks, and wireless/mobile networks; access, transport, and routing protocols.

557 (Effective through Spring 2014) Advanced Computer Networks 3 ATM networks, optical WDM networks, and wireless/mobile networks; access, transport, and routing protocols.

560 Operating Systems 3 Structure of multiprogramming and multiprocessing; efficient allocation of systems resources; design implementation and performance measurement.

560 (Effective through Spring 2014) Operating Systems 3 Structure of multiprogramming and multiprocessing; efficient allocation of systems resources; design implementation and performance measurement.

561 Computer Architecture 3 Parallel and distributed processors; multiprocessors; interconnection topologies; language-directed architecture; special-purpose architecture.

561 (Effective through Spring 2014) Computer Architecture 3 Parallel and distributed processors; multiprocessors; interconnection topologies; language-directed architecture; special-purpose architecture.

562 Fault Tolerant Computer Systems 3 Fault tolerance aspects involved in design and evaluation of systems; methods of detection and recovery; multicast, middleware, and reconfiguration. (Crosslisted course offered as CPT S 562, E E 562).

562 (Effective through Spring 2014) Fault Tolerant Computer Systems 3 Fault tolerance aspects involved in design and evaluation of systems; methods of detection and recovery; multicast, middleware, and reconfiguration. (Crosslisted course offered as CPT S 562, E E 562).

564 Distributed Systems Concepts and Programming 3 Concepts of distributed systems; naming, security, networking, replication, synchronization, quality of service; programming middleware. Credit not granted for both CPT S 464 and CPT S 564. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

564 (Effective through Spring 2014) Distributed Systems Concepts and Programming 3 Concepts of distributed systems; naming, security, networking, replication, synchronization, quality of service; programming middleware. Credit not granted for both CPT S 464 and CPT S 564. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

566 Embedded Systems 3 (2-3) The design and development of real-time and dedicated software systems with an introduction to sensors and actuators. Credit not granted for both CPT S 466 and CPT S 566. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

566 (Effective through Spring 2014) Embedded Systems 3 (2-3) The design and development of real-time and dedicated software systems with an introduction to sensors and actuators. Credit not granted for both CPT S 466 and CPT S 566. Offered at 400 and 500 level. Cooperative: Open to UI degree-seeking students.

570 Machine Learning 3 Introduction to building computer systems that learn from their experience; classification and regression problems; unsupervised and reinforcement learning.

570 (Effective through Spring 2014) Machine Learning 3 Introduction to building computer systems that learn from their experience; classification and regression problems; unsupervised and reinforcement learning.

571 Computational Genomics 3 Fundamental algorithms, techniques and applications. Credit not granted for both CPT S 471 and CPT S 571. Offered at 400 and 500 level.

571 (Effective through Spring 2014) Computational Genomics 3 Fundamental algorithms, techniques and applications. Credit not granted for both CPT S 471 and CPT S 571. Offered at 400 and 500 level.

572 Numerical Methods in Computational Biology 3 Computational methods for solving scientific problems related to information processing in biological systems at the molecular and cellular levels.

572 (Effective through Spring 2014) Numerical Methods in Computational Biology 3 Computational methods for solving scientific problems related to information processing in biological systems at the molecular and cellular levels.

573 Bioinformatics Software Development 3 Provides programming skills needed to address current computational problems in bioinformatics; emphasis on mathematical development and software design.

573 (Effective through Spring 2014) Bioinformatics Software Development 3 Provides programming skills needed to address current computational problems in bioinformatics; emphasis on mathematical development and software design.

580 Advanced Topics in Computer Science 3 May be repeated for credit.

580 (Effective through Spring 2014) Advanced Topics in Computer Science 3 May be repeated for credit.

595 Directed Study in Computer Science V 1 (0-3) to 3 (0-9) May be repeated for credit; cumulative maximum 6 hours. Current topics in computer science.

595 (Effective through Spring 2014) Directed Study in Computer Science V 1 (0-3) to 3 (0-9) May be repeated for credit; cumulative maximum 6 hours. Current topics in computer science.

600 Special Projects or Independent Study V 1-18 May be repeated for credit. Independent study, special projects, and/or internships. Students must have graduate degree-seeking status and should check with their major advisor before enrolling in 600 credit, which cannot be used toward the core graded credits required for a graduate degree. S, F grading.

600 (Effective through Spring 2014) Special Projects or Independent Study V 1-18 May be repeated for credit. Independent study, special projects, and/or internships. Students must have graduate degree-seeking status and should check with their major advisor before enrolling in 600 credit, which cannot be used toward the core graded credits required for a graduate degree. S, F grading.

700 Master's Research, Thesis, and/or Examination V 1-18 May be repeated for credit. Independent research and advanced study for students working on their master's research, thesis and/or final examination. Students must have graduate degree-seeking status and should check with their major advisor/committee chair before enrolling for 700 credit. S, U grading.

700 (Effective through Spring 2014) Master's Research, Thesis, and/or Examination V 1-18 May be repeated for credit. Independent research and advanced study for students working on their master's research, thesis and/or final examination. Students must have graduate degree-seeking status and should check with their major advisor/committee chair before enrolling for 700 credit. S, U grading.

702 Master's Special Problems, Directed Study, and/or Examination V 1-18 May be repeated for credit. Independent research in special problems, directed study, and/or examination credit for students in a non-thesis master's degree program. Students must have graduate degree-seeking status and should check with their major advisor/committee chair before enrolling for 702 credit. S, U grading.

702 (Effective through Spring 2014) Master's Special Problems, Directed Study, and/or Examination V 1-18 May be repeated for credit. Independent research in special problems, directed study, and/or examination credit for students in a non-thesis master's degree program. Students must have graduate degree-seeking status and should check with their major advisor/committee chair before enrolling for 702 credit. S, U grading.

800 Doctoral Research, Dissertation, and/or Examination V 1-18 May be repeated for credit. Independent research and advanced study for students working on their doctoral research, dissertation and/or final examination. Students must have graduate degree-seeking status and should check with their major advisor/committee chair before enrolling for 800 credit. S, U grading.

800 (Effective through Spring 2014) Doctoral Research, Dissertation, and/or Examination V 1-18 May be repeated for credit. Independent research and advanced study for students working on their doctoral research, dissertation and/or final examination. Students must have graduate degree-seeking status and should check with their major advisor/committee chair before enrolling for 800 credit. S, U grading.

 Student Affairs   Schedules of Classes   Commencement   Student Degree Audit
 Transfer Courses   Right To Know   Veteran's Affairs   Summer Session
 
Office of the Registrar, PO Box 641035, Washington State University, Pullman WA 99164-1035, 509-335-5346, bitter@wsu.edu
Copyright © Board of Regents, Washington State University