Introduction to computers, problem solving and algorithm development. Design, code, debug and document programs using techniques of good programming style and C++ programming language. Laboratory experiments and examples will be used to illustrate and reinforce concepts taught in the lectures.

Continuation of CSI 1430. Introduction to basic aspects of arrays, pointers, classes, inheritance, polymorphism, virtual functions, linked lists, stacks, queues, and binary trees.

An introduction to the structure of computer systems and the relationship between software and hardware. Topics include computer organization and representation of information in a computer. An assembly language will be used for programming assignments to illustrate the relationship between high-level languages and machine operations and interpretation of software.

Software design and construction with abstract data types. Description, performance and use of commonly-used algorithms and data structures including lists, trees, and graphs.

Current relational database design concepts including ER diagrams and normalization. Database access techniques such as SQL and JDBC. Database issues including performance and security. Web-database applications.

The organization and structure of computer systems, basic concepts of an operating system, command line interpreter, script programming, and system calls. Programming projects in Unix and C programming language.

This course will provide a comprehensive introduction to computer algorithms taken from diverse areas of application. This course will concentrate on algorithms of fundamental importance and on analyzing the efficiency of these algorithms.

An engineering approach to software development emphasizing design patterns and techniques for enterprise application development. Completing software project applying development process.

Introduction to UML notation; constructing and interpreting use cases; interpreting UML models; introduction to design patterns; introduction to testing; introduction to configuration management; Java as a second language; and implementing a graphical user interface. Laboratory assignments and a small project illustrate and extend concepts from lectures.

Fundamentals of computer networking including data transmission, communication software, protocols, simple networks and internetworking.

This course provides an overview of cybersecurity threats, vulnerabilities, and defensive mitigations. The course will emphasize both theoretical concepts and practical application with critical thinking. Example topics include: authentication, access control, malware, intrusion, firewalls, encryption, software security, auditing/monitoring, and risk management.

This course provides additional depth and application of the cybersecurity concepts introduced in CSI 4323 (Introduction to Cybersecurity). Example topics include: penetration testing, cyber resilience, trusted computing, reverse engineering, network situational awareness, security architecture, incident handling, threat intelligence, and forensics.

Theoretical concepts that form the basis of computer science, including regular languages, context-free languages, Turing-decidable languages, nondeterminism, parsing, NP_Completeness, and undecidability.

Operating system design and implementation. Topics include process control and synchronization, memory management, processor scheduling, file systems, and security. Course projects implement parts of an operating system.

A semester-long project course in which students will create a computing system. The project requires applying information technology according to established design management practices, including technical presentations (oral and written) by all students.

Differential calculus of a single variable. Introduction to the definite integral and the Fundamental Theorem of Calculus.

Integral calculus of a single variable, differential equations, slope fields, and power series.

Vectors, matrix operations, linear transformations, fundamental properties of vector spaces, systems of linear equations, eigenvalues, and eigenvectors.

An introduction to the foundations of discrete structures as they apply to computer science, focusing on providing a solid theoretical foundation for further work. Topics include sets, ordered structures, graph and trees, functions, proof techniques, number systems, logic, Boolean algebra, etc.

Introduction to the fundamentals of probability, random variables, discrete and continuous probability distributions, expectations, sampling distributions, topics of statistical inference such as confidence intervals, tests of hypotheses, and regression.

Introduction to cryptology, the study of select codes and ciphers. Included is a historical context, a survey of modern crypto systems, and an exposition of the role of mathematical topics such as number theory and elliptic curves in the subject. Mathematical software will be available.

Preparation and delivery of the types of presentations employed in organizational and corporate settings.