Problem solving and algorithm design methods. Syntax rules and syntax diagrams. Basic data types and control structures. Program tracing, testing, debugging, documentation, and verification. Subprograms, parameter passing, and modularity. Exception handling. Programming projects using a modern programming language such as C++. 3 credits. Fee.

Introduction to object-oriented design and programming. Object-oriented concepts such as inheritance, data abstraction, and encapsulation are covered. Topics also include recursion, string handling, and the basic searching and sorting algorithms. Programming projects using a modern programming language such as C++. Prerequisite: SCS131. Spring semester. 3 credits. Fee.

Gives general use of the Unix operating system, including navigation, email, file manipulation, and common Unix commands. This course will also cover use of the vi editor, programming with shell scripts, and programming with various languages such as Perl. This course uses Linux operating system platform. Fall semester. 3 credits. Fee.

Introduces the student to the process of relational database development, including data modeling, database design, database implementation, and database administration. Topics include: the relational model, E-R Model, relational database design, normal forms, functional dependencies, relational algebra and calculus, SQL, query processing, crash recovery, concurrency control, security, and integrity. Students are expected to complete a project using Microsoft Access. Spring semester, odd-numbered years. 3 credits. Fee.

The syntax and semantics of programming languages. Topics include formal specification syntax, declarations, binding, allocation, data structures and data types, control structures, control and data flow, the implementation and execution of programs, functional programming, and imperative programming. Other topics include non-procedural and logic programming. Programming projects will provide experience in a variety of high level languages. Writing Intensive course. Prerequisite: SCS220 or SCS290. Fall semester, odd-numbered years. 3 credits. Fee.

Concepts of boolean algebra, gates, simplification of logical expressions, karnaugh maps, flip-flops, clocked circuits, shift registers, counters, state diagrams, half-adders, full-adders, parallel binary adders, 1’s complement and 2’s complement addition, BCD adders, carry-look-ahead adders, multiplication, random- access memories, decoders, multiplexers, input-output devices, the control unit, and microprogramming. Students will learn the IBM PC assembly language. Prerequisites: SCS140 or SCS220, and SMA205. Spring semester, even-numbered years. 3 credits. Fee.

The topics in this course include: definitions and implementations of basic data structures including arrays, stacks, queues, and linked lists; recursion as an algorithm design tool; searching and sorting algorithms and their designs, implementations, and applications; advanced data structures including balanced trees, graphs, tree and graph traversal, and their applications; file management techniques including hashing and indexing. Students will use the programming language C++. Prerequisites: SCS140 and SMA205. Fall semester, odd-numbered years. 3 credits. Fee.

The concepts and methods of system analysis are introduced. A detailed case study is considered, processed from the initial specifics of the system requirements through analysis and design. Structured techniques are stressed,and communications skills are emphasized by required progress reports. Pre- or co-requisite: SCS220 or SCS290. Fall semester, even-numbered years. 3 credits.

Study of ethical questions that arise as a consequence of the development and implementation of computing technologies. Students will study the issues and problems that have arisen with the rapid growth of information technology and will explore ways of reaching wise solutions to these problems. Prerequisite: SCS131. Fall semester, even-numbered years. 1 credit.

An introduction to the fundamentals of operating systems. Topics include interprocess communication, process scheduling, deadlocks, memory management, virtual memory, file systems, and distributed systems. Formal principles are illustrated with examples from various operating systems. Prerequisites: SCS215, and SCS220 or SCS290. Spring semester, even-numbered years. 3 credits. Fee.

Real numbers, sets, relations, and functions. The calculus of one variable. Satisfies the Mathematics requirement of the Liberal Arts Curriculum. Graphing calculator required. Prerequisite: SMA120 or equivalent. Fall and spring semesters. 4 credits.

Continuation of SMA130. The calculus of one variable with applications, parametric equations, polar coordinates, and infinite sequences and series. Prerequisite: SMA130. Fall semester. 4 credits.

An introduction to sets, logic, methods of proof, and combinatorics. Prerequisite or corequisite: SMA130. Fall semester. 3 credits.

A study of vector spaces, linear mappings, determinants with applications. Prerequisite: SMA140. Spring semester, even-numbered years. 3 credits.

Designed to enable students to read as well as do research. Explores descriptive and inferential statistics. Treats small and large samplings with such parametric and non-parametric probability distributions as Z, t, F, and chi-squared. Uses statistical computer software. Satisfies the Mathematics requirement of the Liberal Arts Curriculum. Fall and spring semesters and ADP sessions 1, 3, and 4. Prerequisites: SMA100 or higher, sophomores or above. 3 credits.

Covers fundamental concepts of Object Oriented Programming using Java. Topics will include objects, classes, constructors, methods,and instance variables. Programming projects will also include linked lists, stacks, queues, searching, and recursion. Students will learn the basics of graphical user interfaces and Java applets. All programming is done in Java. Fall semester, even-numbered years. Prerequisite: SCS131. 3 credits. Fee.

Explains and demonstrates the technical procedures for preserving, capturing, recovering, and presenting digital evidence. Background check required. Pre- or Corequisite: SCS215. Fall semester. 3 credits. Fee.

Students will acquire a working knowledge of the basics to the three operating systems commonly used in industrial and academic settings: Windows, Apple OS, and Linux/Unix. The course covers the fundamental attributes of each operating system. Prerequisite: SCS110 or SCS112. Offered as needed. 3 credits. Fee.

Introduction to the design and analysis of computer algorithms. Topics include fundamental algorithms, mathematical tools for analyzing algorithms, and strategies for designing algorithms. Fundamental algorithms include graph algorithms and algorithms for sorting, searching, hashing, integer arithmetic, and selected combinatorial tasks. Mathematical tools include asymptotic notations and methods for solving recurrences. Algorithm design strategies include scanning, greedy method, divide and conquer, dynamic programming, and randomization. Prerequisites: SCS220 or SCS290, and SMA130. Fall semester, odd-numbered years. 3 credits.

Topics include: regular grammers, finite automata, context-free grammers, push-down automata, and Turing machines. Introductory treatment of computable and non-computable functions. Halting problems will also be covered. Prerequisite: SCS220 or SCS290. Spring semester, even-numbered years. 3 credits. Fee.

The software development process is described in detail including: the software life cycle and models of software development; requirements analysis and software design techniques, such as SADT and Jackson Design Methodology; techniques for software quality assurance, including design reviews, testing, metrics, and an introduction to program verification; software project planning, organization, and management. Students participate in a team programming project. Prerequisite: SCS300. Spring semester, odd-numbered years. 3 credits. Fee.

Study of a specified traditional, cutting-edge, and/or advanced topic in computer science. Permission required. Offered as needed. Repeatable for credit. 3 credits. Fee.

By arrangement. Repeatable for credit. Permission required. Variable credit.

Repeatable for credit. Permission required. Variable credit.

Through placement with cooperating area firms, the student gains practical experience and valuable insight into the future work environment. Repeatable for credit. Permission required. Variable credit.

Problem solving and algorithm design methods. Syntax rules and syntax diagrams. Basic data types and control structures. Program tracing, testing, debugging, documentation, and verification. Subprograms, parameter passing, and modularity. Exception handling. Programming projects using a modern programming language such as C++. 3 credits. Fee.

Introduction to object-oriented design and programming. Object-oriented concepts such as inheritance, data abstraction, and encapsulation are covered. Topics also include recursion, string handling, and the basic searching and sorting algorithms. Programming projects using a modern programming language such as C++. Prerequisite: SCS131. Spring semester. 3 credits. Fee.

Gives general use of the Unix operating system, including navigation, email, file manipulation, and common Unix commands. This course will also cover use of the vi editor, programming with shell scripts, and programming with various languages such as Perl. This course uses Linux operating system platform. Fall semester. 3 credits. Fee.

Covers fundamental concepts of Object Oriented Programming using Java. Topics will include objects, classes, constructors, methods,and instance variables. Programming projects will also include linked lists, stacks, queues, searching, and recursion. Students will learn the basics of graphical user interfaces and Java applets. All programming is done in Java. Fall semester, even-numbered years. Prerequisite: SCS131. 3 credits. Fee.

The topics in this course include: definitions and implementations of basic data structures including arrays, stacks, queues, and linked lists; recursion as an algorithm design tool; searching and sorting algorithms and their designs, implementations, and applications; advanced data structures including balanced trees, graphs, tree and graph traversal, and their applications; file management techniques including hashing and indexing. Students will use the programming language C++. Prerequisites: SCS140 and SMA205. Fall semester, odd-numbered years. 3 credits. Fee.

Introduces the student to the process of relational database development, including data modeling, database design, database implementation, and database administration. Topics include: the relational model, E-R Model, relational database design, normal forms, functional dependencies, relational algebra and calculus, SQL, query processing, crash recovery, concurrency control, security, and integrity. Students are expected to complete a project using Microsoft Access. Spring semester, odd-numbered years. 3 credits. Fee.

An introduction to the fundamentals of operating systems. Topics include interprocess communication, process scheduling, deadlocks, memory management, virtual memory, file systems, and distributed systems. Formal principles are illustrated with examples from various operating systems. Prerequisites: SCS215, and SCS220 or SCS290. Spring semester, even-numbered years. 3 credits. Fee.

Introduction to the design and analysis of computer algorithms. Topics include fundamental algorithms, mathematical tools for analyzing algorithms, and strategies for designing algorithms. Fundamental algorithms include graph algorithms and algorithms for sorting, searching, hashing, integer arithmetic, and selected combinatorial tasks. Mathematical tools include asymptotic notations and methods for solving recurrences. Algorithm design strategies include scanning, greedy method, divide and conquer, dynamic programming, and randomization. Prerequisites: SCS220 or SCS290, and SMA130. Fall semester, odd-numbered years. 3 credits.

Topics include: regular grammers, finite automata, context-free grammers, push-down automata, and Turing machines. Introductory treatment of computable and non-computable functions. Halting problems will also be covered. Prerequisite: SCS220 or SCS290. Spring semester, even-numbered years. 3 credits. Fee.

The software development process is described in detail including: the software life cycle and models of software development; requirements analysis and software design techniques, such as SADT and Jackson Design Methodology; techniques for software quality assurance, including design reviews, testing, metrics, and an introduction to program verification; software project planning, organization, and management. Students participate in a team programming project. Prerequisite: SCS300. Spring semester, odd-numbered years. 3 credits. Fee.

Study of a specified traditional, cutting-edge, and/or advanced topic in computer science. Permission required. Offered as needed. Repeatable for credit. 3 credits. Fee.

Fundamentals of data communications and computer networking including circuit and packet switching, network architectures and protocols, local/metropolitan/wide area networks, OSI protocols,TCP/IP Suite, X.25, ISDN, network management, and network programming. Prerequisites: SCS220 or SCS290, and SCS215. Spring semester, odd-numbered years. 3 credits. Fee.

Topics include problem solving, set theory, number theory, numerations systems and algebra review. Particular emphasis is placed on the successive development of real numbers and the employment of electronic resources. The first course in a sequence of two mathematics courses designed for students who are pursuing teacher certification in areas other than secondary mathematics. Prerequisite knowledge: This course requires a working knowledge of elementary algebra. Fall, spring, and summer. 3 credits.

Required for business and other specified majors. Topics include the analytic geometry of algebraic functions, exponential and logarithmic models, systems of linear equations, and linear programming. Satisfies the Mathematics requirement of the Liberal Arts Curriculum. Prerequisite knowledge: This course requires a working knowledge of intermediate algebra. Fall and spring semesters. 3 credits.

A study of elementary functions, their graphs, and applications, including polynomial, rational, algebraic, exponential, logarithmic, and trigonometric functions. Graphing calculator required. Prerequisite knowledge: This course requires a working knowledge of intermediate algebra. Fall semester. 4 credits.

Real numbers, sets, relations, and functions. The calculus of one variable. Satisfies the Mathematics requirement of the Liberal Arts Curriculum. Graphing calculator required. Prerequisite: SMA120 or equivalent. Fall and spring semesters. 4 credits.

Problem solving and algorithm design methods. Syntax rules and syntax diagrams. Basic data types and control structures. Program tracing, testing, debugging, documentation, and verification. Subprograms, parameter passing, and modularity. Exception handling. Programming projects using a modern programming language such as C++. 3 credits. Fee.

Introduction to object-oriented design and programming. Object-oriented concepts such as inheritance, data abstraction, and encapsulation are covered. Topics also include recursion, string handling, and the basic searching and sorting algorithms. Programming projects using a modern programming language such as C++. Prerequisite: SCS131. Spring semester. 3 credits. Fee.

Gives general use of the Unix operating system, including navigation, email, file manipulation, and common Unix commands. This course will also cover use of the vi editor, programming with shell scripts, and programming with various languages such as Perl. This course uses Linux operating system platform. Fall semester. 3 credits. Fee.

Covers fundamental concepts of Object Oriented Programming using Java. Topics will include objects, classes, constructors, methods,and instance variables. Programming projects will also include linked lists, stacks, queues, searching, and recursion. Students will learn the basics of graphical user interfaces and Java applets. All programming is done in Java. Fall semester, even-numbered years. Prerequisite: SCS131. 3 credits. Fee.

Introduces the student to the process of relational database development, including data modeling, database design, database implementation, and database administration. Topics include: the relational model, E-R Model, relational database design, normal forms, functional dependencies, relational algebra and calculus, SQL, query processing, crash recovery, concurrency control, security, and integrity. Students are expected to complete a project using Microsoft Access. Spring semester, odd-numbered years. 3 credits. Fee.

The concepts and methods of system analysis are introduced. A detailed case study is considered, processed from the initial specifics of the system requirements through analysis and design. Structured techniques are stressed,and communications skills are emphasized by required progress reports. Pre- or co-requisite: SCS220 or SCS290. Fall semester, even-numbered years. 3 credits.

Topics include problem solving, set theory, number theory, numerations systems and algebra review. Particular emphasis is placed on the successive development of real numbers and the employment of electronic resources. The first course in a sequence of two mathematics courses designed for students who are pursuing teacher certification in areas other than secondary mathematics. Prerequisite knowledge: This course requires a working knowledge of elementary algebra. Fall, spring, and summer. 3 credits.

Required for business and other specified majors. Topics include the analytic geometry of algebraic functions, exponential and logarithmic models, systems of linear equations, and linear programming. Satisfies the Mathematics requirement of the Liberal Arts Curriculum. Prerequisite knowledge: This course requires a working knowledge of intermediate algebra. Fall and spring semesters. 3 credits.

A study of elementary functions, their graphs, and applications, including polynomial, rational, algebraic, exponential, logarithmic, and trigonometric functions. Graphing calculator required. Prerequisite knowledge: This course requires a working knowledge of intermediate algebra. Fall semester. 4 credits.

Real numbers, sets, relations, and functions. The calculus of one variable. Satisfies the Mathematics requirement of the Liberal Arts Curriculum. Graphing calculator required. Prerequisite: SMA120 or equivalent. Fall and spring semesters. 4 credits.