A rigorous study of the principles of computer programming with emphasis on problem solving methods which result in correct, well-structured programs. Other topics: an introduction to data representation, data types and control structures, functions, and structured data types.

A continuation of problem solving methods and algorithm development. Topics include data structures and their implementation, algorithm development and programming. The emphasis is on program development and style.

Introduces networking technology and information security practices. Topics include network models and protocols as well as information security fundamentals. The course includes hands-on lab activities where techniques and procedures are demonstrated and implemented.

A study of the ethical, social and legal impacts of computers and their applications. Specific attention will be paid to professional responsibility, issues of privacy, property rights, legal issues and real risks. Corequisite: CSCI 1301.

A study of logic circuits and computer organization. Topics include Boolean algebra representation and minimization, logic gates, the design and analysis of combinational and sequential circuits, and registers, ALU and data paths.

A study of computer operating systems and related computer architecture topics. Topics include process management, scheduling, synchronization, deadlock, memory management, virtual memory, disk management, file systems, I/O and protection.

This course is centered around the concepts of the design and advanced features of programming languages. The differences between functional, imperative, and object-oriented programming will be discussed. Syntax specification, program evaluation, typing, abstract data types, and recursion will be discussed.

Study of computer systems and programming at the level of low-level programming languages. Students will have the opportunity to learn basic principles and fundamentals of machine language, assembly language and C. Topics include pointers, bit operations, and system programming in the C# language, and register operations, control structures, bitwise operations, subprograms, and addressing techniques in assembly language.

A study of the techniques for representation and manipulation of structured data within a digital computer. Programming assignments illustrating a variety of data structures.

This course offers an introduction to database systems as a key concept in information management. The course covers logical and physical database organization, data models, file structures, indexing, hashing, query optimization, and design issues. This course will cover the design and implementation of databases.

A study of the major theoretical topics needed for a well-rounded knowledge of computer science. These will include automata, formal languages, asymptotic, NP-completeness, formal verification and the design of algorithms.

Introduction to design and analysis of combinatorial algorithms. Use of asymptotics in evaluating algorithm’s efficiency and scalability. Application of induction and other mathematical techniques for proving correctness of algorithms. Data structures for simplifying algorithm design, such as hash tables, heaps, binary search trees. Advanced design and analysis methods, such as greedy algorithms, dynamic programming, amortized analysis.

The software development process is examined. Current tools and techniques of software system analysis, design, implementation, and maintenance are presented in conjunction with case studies and team-oriented projects. Topics include process modeling, logic modeling, object-oriented modeling, UML, software metrics, prototyping, and software security.

An individual or group project in the application of computer science. Emphasis is on the production of real-world software systems and may be conducted in cooperation with an external organization such as a commercial company or public agency.

A rigorous study of polynomial, exponential, logarithmic, and trigonometric functions, primarily intended to prepare science and mathematics majors for calculus.

An introduction to calculus including limits and continuity, derivatives of polynomial, rational, trigonometric, inverse trigonometric, exponential, and logarithmic functions, applications of derivatives, and basic integration.

A continuation of calculus including applications of integration, techniques of integration, improper integrals, sequences, series, and polar coordinates.

The course prepares computer science majors for advanced study by emphasizing components of discrete mathematics related to computer science. The topics include sets, functions and relations, logic, Boolean algebra, graph theory, proof techniques and matrices. Examples will emphasize computer science applications.