This is a second course in the topics of pure mathematics, particularly those most commonly used in the study of computing science and related applications. It includes proof techniques, models of computation, formal languages, analysis of algorithms, trees and advanced general graph theory with applications, finite state and automata theory, encryption, and an elementary introduction to mathematical structures such as groups, rings, and fields.

An introduction to database management systems, overviewing issues related to the design, organization, and management of databases. Topics include logical database design, entity relationship (ER) models, and formal relational query languages such as the Structured Query Language (SQL).

Operating system and control software at a low level, memory management, processor management, storage management, and system architecture are among the topics considered.

This course covers numerical techniques for solving problems in applied mathematics, including error analysis, roots of equations, interpolation, numerical differentiation and integration, ordinary differential equations, matrix methods and selected topics from among: eigenvalues, approximation theory, non-linear systems, boundary-value problems, numerical solution of partial differential equations.

This course looks at network protocols, network operating systems, and the construction and maintenance of server sites.

An introduction to assembly language, machine architecture, low-level components of the operating system, and other low-level issues.

Basic organization of programs, optimizing program structure, modularization, data structures, search and sorting algorithms, handling large data sets, analysis of algorithms.

An introduction to web application development using current web technologies, best practices, and standards. The modern web application framework will be studied.

A rigorous introduction to computing science and computer programming. Students will learn in- depth programming concepts by seeing how object oriented (OO) concepts are employed in the design and writing of code in a variety of notations. The emphasis is on the theory of OO programming and design of solutions, as well as implementation using an OO language such as Java or C++.

An introduction to those branches of pure mathematics which are most commonly used in the study of Computing Science and/or have other practical applications. Topics include logic, proofs, switching circuits, set theory, induction, functions, languages, finite automata, combinatorics, and algebraic structures.