Undergraduate Major Computer Science (BS)

Using the logic introduced in Discrete Mathematics I, this course continues to develop theories in the areas of integers, mathematical induction, partial orders and equivalence relations, Hoare logic, number theory, sequences, and combinatorics.

The software life cycle is introduced, shifting emphasis away from programming as the primary activity of the software engineer and towards requirements analysis, specification, documentation, testing, verification, and validation. In the required laboratory, students will develop a software simulation of a game using graphics which is required to run successfully.

Students are individually responsible for the formal specification, design, implementation and proof of correctness of the abstract data type sets, bags, functions, sequences, stacks, queues, and strings. Special emphasis will be given to searching and sorting algorithms

Students are individually responsible for the design, formal specification, implementation, and proof of correctness of the abstract data types, trees and graphs. Special emphasis will be given to graph algorithms.

Computer architecture and organization are covered including instruction set design, floating point and integer arithmetic operations, number representations, datapath design, pipelining, control flow, memory hierarchy, caches, virtual memory and input/output. Students are introduced to a variety of commercial architectures such as x86 and ARM.

Basic algorithmic analysis and strategies are explored along with fundamental computing algorithms. Connections between regular languages and finite automata, context-free languages and pushdown automata, and Turing machines and computation are established. The complexity classes P and NP will also be introduced.

This course provides an in-depth overview of the field of data communications and its impact on information systems. Various types of equipment will be examined along with protocols and architectures offered by major vendors. Distributed system issues as well as local area network solutions are discussed.

This course explores the major components of an operating system. Topics covered include processes, threads, mutual exclusion and synchronization, deadlock and starvation, memory management, virtual memory, scheduling on single and multiprocessors, I/O management and scheduling, and file systems.

This course will give the student an overview of application development using data base management systems (DBMS). Conceptual database design, data modeling and data normalization will be presented and practiced. Structured query language (SQL) will also be practiced using MySQL or a similar tool. Relational databases will be examined, with an emphasis on those found in PC networks with client-server applications. Topics include: the rationale for using databases, the history of databases, logical definition and structure for efficient access, physical definition of the data, using SQL and QBE (query by example) to access databases, data security and backup strategies.

This course examines key aspects of embedded system design including microcontroller selection, assembly-language programming, the use of higher-level languages for system development, interfacing, transducers, and key supporting analog circuits.

This course focuses on 3D game programming using C++ and Unreal Engine. Game play, game loops, lighting, cameras, translation, rotation, movement, 3D physics, state machines, game artificial intelligence, object pooling and performance optimization techniques are covered through the implementation of a series of 3D games.

This course provides an introduction to the theories, methods and problems of AI. Knowledge representation, natural language processing, computer vision, neural networks, path finding (A*, navigation meshes) and machine learning will be covered. Discussion of concepts such as intelligence, cognition, personality, and the Winograd/Turing test will be addressed. Practical implementations will be explored in the context of game AI.

An examination of the relationship between hardware and software. The compiler writer's viewpoint as well as the architect's viewpoint are analyzed in various areas, including instruction set design and addressing modes. Advanced topics in operating systems, especially interrupt mechanisms, memory management and processor management are also discussed. Various commonly used architectures will be compared.

This course introduces the basic concepts and algorithms of three-dimensional interactive computer graphics. Topics include projection, vertex arrays, buffer objects, color perception, clipping, 2D/3D transformations, animation, culling, quaternions, convexity, interpolation, 3D surfaces, lighting, shading, texture mapping, pixel manipulation, and special effects. Practical implementation of the topics are realized with OpenGL programming and GLSL shader programming.

This course will examine theories of advanced graphics techniques used to aid research methods. Applied and theoretical algorithms including plotting of directed and undirected graphs with and without cycles, clustering algorithms, automatic layout techniques, graphics compression, and other research algorithms will be covered. Students will first understand theory and then program implementations of the graphical algorithms and concepts.