CS - Computer Science

Create a foundation for computer science and the software development process. Emphasis on good design and programming techniques through practice in writing, running, and debugging programs. Study of a programming language which incorporates objects, structured control statements, classes, inheritance, strong data typing, and sub-programs with parameters. No programming experience expected.

Weekly three-hour laboratory to support CS 203.

Credit arranged.

Continue to build a computer science foundation. Study of intermediate programming language constructs: event handling, graphical user interfaces, threads, and networking. Introduction to the software engineering process and programming-in-the-large.

Continues the study of computer science and software engineering methodologies with the C programming language. Analysis of common data structures, time and space efficiency, stacks, queues, linked lists, trees, graphs, hash tables, recursion, searching, and sorting algorithms. Replaces CS 303.

Design, analysis and correctness proofs of important algorithms from areas such as combinatorics, seminumerical algorithms, data storage and retrieval, systems programming, and artificial intelligence. Includes a study of complexity theory. First offering in spring 2016, replaces CS 411.

Introduction to boolean and sequential logic. Introduction to computer system hardware including Arithmetic Logic Unit (ALU), main memory, cache memory, I/O devices, busses and interfaces, control unit, addressing techniques, and the MIPS assembly language. First offering in fall 2015.

Functions, structure, design, and problems of operating systems. Concepts and principles of operating system design and implementation including file system, CPU scheduling, memory management (including virtual memory), deadlocks in computer systems, concurrent processes and programming, threads, and protection. First offering in spring 2016, replaces CS 446.

Software lifecycle models. Requirements engineering. Planning and managing software projects. Software design methods. System integration, software quality assurance, testing, and validation. Software maintenance. First offering in spring 2016, replaces CS 441.

Comparative analysis of several modern high level languages in terms of data types and control structures, with emphasis on run-time behavior of programs.

Introduction to finite automata, Turing machines, formal languages, and computability. First offering in fall 2015, replaces CS 451.

Lexical analysis, syntactic analysis, type checking, and code generation. Introduction to optimization. First offering in spring 2016, replaces CS 452.

In-depth study of professional responsibility in the field of computer science. Students are expected to read journal papers, articles, and books, participate in class discussions, and give presentations. First offering in fall 2015, replaces CS 400.

Weekly three-hour laboratory to support CS 301.

Weekly 3-hour laboratory. Assembly language and systems programming.

Weekly 3-hour laboratory. Introduces UNIX commands and tools for software development and testing. Includes scripting languages. Replaces CS 373.

The course focuses on developing and practicing techniques for rapid programming in a small team environment: approaches to problem assessment, selection of data structures and algorithms, implementation, and testing. Students will hone their skills by working in small teams to produce correct solutions to a wide variety of computing problems under time constraints.

In-depth study of professional responsibility in the field of computer science. Students are expected to read journal papers, articles, and books, participate in class discussions, and give presentations.

Design, analysis and correctness proofs of important algorithms from areas such as combinatorics, seminumerical algorithms, data storage and retrieval, systems programming, and artificial intelligence. Includes a study of complexity theory.

The history and applications of artificial intelligence. Topics include: inference, knowledge representation, search, cognitive architecture, decision making under uncertainty, and machine learning. Course is taught in fall of odd-numbered years.

Algorithmic and analysis techniques for biological data such as DNA, RNA, proteins, and gene expression. Topics include molecular biology, alignment and searching algorithms, sequence evolution algorithms, genetic trees, and analysis of microarray data. This course is interdisciplinary and assumes programming skills. Course is taught in fall of odd-numbered years.

An examination of topics in computer graphics, including graphical output devices, line-drawing and clipping algorithms, representation and drawing of curves, techniques for transforming graphical images, and methods of modeling and rendering in three-dimensions. Course is taught in fall of even-numbered years.

The design and implementation of databases with an emphasis on the use of relational database management systems (DBMS). Query languages, table and index design, query evaluation, transaction management, tuning, security. Course taught in fall of even-numbered years.

Software lifecycle models. Requirements engineering. Planning and managing software projects. Software design methods. System integration, software quality assurance, testing, and validation. Software maintenance.

Students will design, develop, and evaluate a web-based application. Emphasis on human factors, security, databases. Course is taught in spring of odd-numbered years.

A broad first course in computer networks and internetworking. OSI and TCP/IP layered models, TCP/IP protocol suite, transmission media, local area networks, network and transport-layer protocols, internetworking, internet addressing and routing. Course is taught in spring of odd-numbered years.

Functions, structure, design, and problems of operating systems. Concepts and principles of operating system design and implementation including file system, CPU scheduling, memory management (including virtual memory), deadlocks in computer systems, concurrent processes and programming, threads, and protection.

This course will provide an introduction to the field of computer game design. The philosophy, objectives, and history of this field will be explored. In addition, the course will emphasize practical applications of some of the more prevalent techniques. Course is taught in spring of even-numbered years.

Cryptography, program security, security in operating systems, security in computer networks, security administration and policies. Course is taught in spring of even-numbered years.

Introduction to finite automata, Turing machines, formal languages, and computability.

Lexical analysis, syntactic analysis, type checking, and code generation. Introduction to optimization.

A major design experience based on the knowledge and skills acquired in earlier course work and incorporating appropriate standards and multiple realistic constraints. Projects have some combination of the following characteristics: realism, communication, exposure, teamwork, learning, and related opportunities. CS 483 and EGR 300 replace CS 480. Fee: $40.

Continuation of a major design experience based on the knowledge and skills acquired in earlier course work and incorporating appropriate standards and multiple realistic constraints. Projects have some combination of the following characteristics: realism, communication, exposure, teamwork, learning, and related opportunities. Replaces CS 481. Fee: $40.

Selected study or project in computer science for upper-division students. Must be arranged between the student and an individual faculty member and subsequently approved by the dean of engineering. No more than three hours of directed study taken at the University may be used for elective credits to satisfy degree requirements.

Credit arranged.

Credit arranged.

Faculty-directed student research. Before enrolling, a student must consult with a faculty member to define the project. May be repeated for credit.

Research, study, or original work under the direction of a faculty mentor, leading to a scholarly thesis document with a public presentation of results. Requires approval of thesis director, department chair, dean, and the director of the honors program, when appropriate.

In-depth study of professional responsibility in the field of computer science. Students are expected to read journal papers, articles, and books, participate in class discussions, and give presentations.

Design, analysis, and correctness proofs of important algorithms from areas such as combinatorics, seminumerical algorithms, data storage and retrieval, systems programming, and artificial intelligence. Includes a study of complexity theory.

The history and applications of artificial intelligence. Topics include: inference, knowledge representation, search, cognitive architecture, decision making under uncertainty, and machine learning. Course is taught in fall of odd-numbered years.

Algorithmic and analysis techniques for biological data such as DNA, RNA, proteins, and gene expression. Topics include molecular biology, alignment and searching algorithms, sequence evolution algorithms, genetic trees, and analysis of microarray data. This course is interdisciplinary and assumes programming skills. Course is taught in fall of odd-numbered years.

An examination of topics in computer graphics, including graphical output devices, line-drawing and clipping algorithms, representation and drawing of curves, techniques for transforming graphical images, and methods of modeling and rendering in three-dimensions. Course is taught in fall of even-numbered years.

The design and implementation of databases with an emphasis on the use of relational database management systems (DBMS). Query languages, table and index design, query evaluation, transaction management, tuning, security. Course is taught in fall of even-numbered years.

Software lifecycle models. Requirements engineering. Planning and managing software projects. Software design methods. System integration, software quality assurance, testing, and validation. Software maintenance.

Students will design, develop, and evaluate a web-based application. Emphasis on human factors, security, databases. Course is taught in spring of odd-numbered years.

A broad first course in computer networks and internetworking. OSI and TCP/IP layered models, TCP/IP protocol suite, transmission media, local area networks, network and transport-layer protocols, internetworking, internet addressing and routing. Course is taught in spring of odd-numbered years.

Functions, structure, design, and problems of operating systems. Concepts and principles of operating system design and implementation including file system CPU scheduling, memory management (including virtual memory), deadlocks in computer systems, concurrent processes and programming, threads, and protection.

This course will provide an introduction to the field of computer game design. The philosophy, objectives, and history of this field will be explored. In addition, the course will emphasize practical applications of some of the more prevalent techniques. Course is taught in spring of even-numbered years.

Cryptography, program security, security in operating systems, security in computer networks, security administration and policies. Course is taught in spring of even-numbered years.

Introduction to finite automata, Turing machines, formal languages, and computability.

Lexical analysis, syntactic analysis, type checking, and code generation. Introduction to optimization.

Credit arranged.

Credit arranged.

Credit arranged.

Faculty-directed student research. Before enrolling, a student must consult with a faculty member to define the project. May be repeated for credit.