Department of Mathematical, Computing, and Information Sciences

Operations and properties of real numbers, rates and proportions, units and measurement, elementary plane geometry, linear equations and inequalities, exponents and polynomials, factoring algebraic expressions, graphing in the cartesian plane, systems of equations and inequalities, rational and radical expressions, and functions. Institutional credit only. Grades: A, B, C, NC.

Operations and properties of real numbers, rates and proportions, units and measurement, elementary plane geometry, linear equations and inequalities, exponents, graphs, and radicals. (May not be repeated. Institutional credit only.) Grades: P, NC.

Prerequisite(s): Satisfactory score on the departmental placement test, or satisfactory performance in the appropriate developmental course, or MS 112 or higher.

This course gives an overview of topics in finite mathematics with applications, including set theory, logic, proportional reasoning, statistics, and finance. Credit will not be given for both MS 110 and MS 111.

Prerequisite(s): Admission to the honors program and at least one of the following

Advanced study of topics in finite mathematics with applications, including set theory, logic, proportional reasoning, statistics, and finance with an emphasis on writing, projects, and technology. Credit will not be given for both MS 110 and MS 111.

Prerequisite(s): Satisfactory score on the departmental placement test, or satisfactory performance in the appropriate developmental course.

First and second degree equations and inequalities; linear and quadratic functions and graphs; polynomial and rational functions; exponential and logarithmic functions; conic sections, and systems of equations.

Prerequisite(s): MS 112 with a "C" or better or satisfaction of MCIS Department placement criteria (see the MCIS Department website).

Trigonometric functions and inverses, applications, graphs, identities and equations, laws of sines and cosines, vectors and complex numbers.

Prerequisite(s): MS 112 with a "C" or better or MS 113 with a "C "or better or satisfaction of the MCIS Department placemnt criteria (see the MCIS Department website).

The course is an algebra-trigonometry composite providing the student with a mathematical foundation required for calculus or other courses requiring a similar mathematical background.

Prerequisite(s): MS 112 with a "C" or better or satisfaction of MCIS Department placement criteria (see the MCIS Department website).

An introduction to the ideas and techniques of the differential and integral calculus, matrix computations, probability theory, and Markov chains. Graphical, numerical, analytical, verbal, and coding representations and analyses of selected applications of these topics relevant to business, industry, management, life, and social sciences. Does not count towards a mathematics major or minor.

Prerequisite(s): MS 113 with a "C" or better or MS 115 with a "C" or better or satisfaction of MCIS Departmental placement criteria (see MCIS Department website).

Introduction to analytic geometry, functions and limits, differentiation with applications, indeterminate forms, antiderivatives, definite integrals, numerical integration, calculus of transcendental functions.

Prerequisite(s): MS 125 with a "C" or better.

Applications of integration, techniques of integration, improper integrals, infinite series, vectors in the plane and in 3-space.

Prerequisite(s): MS 112 with a "C" or better.

One of three mathematics courses designed for prospective elementary teachers. Problem solving, set theory, number theory, real number operations, historical development and structure of number systems. (Enrollment by advisement only.)

Prerequisite(s): MS 133 with a "C" or better.

One of three mathematics courses designed for prospective elementary teachers. A thorough study of geometry, measurement, and statistics. Problem solving and application are emphasized. (Enrollment by advisement only.)

Prerequisite(s): MS 133 with a "C" or better.

One of three mathematics courses designed for prospective elementary teachers. Logic, probability, principles of counting, algebraic reasoning and representation. (Enrollment by advisement only.)

Prerequisite(s): Satisfactory score on the departmental placement test, or satisfactory performance in the appropriate developmental course, or MS 110 or higher.

Numerical descriptive methods, axioms of probability, random variables, statistical inference, point and interval estimation of mean, and hypothesis testing.

Prerequisite(s): Satisfactory score on the departmental placement test, or satisfactory performance in the appropriate developmental course, or MS 110 or higher.

Numerical descriptive methods, axioms of probability, random variables, statistical inference, point and interval estimation of mean, and hypothesis testing. Concepts are reinforced with multiple hands-on experiences throughout the course. A final project serves as a comprehensive evaluation of statistical skills and knowledge.

Prerequisite(s): MS 126 with a "C" or better.

Polar coordinates, parametric equations, vector-valued functions, multivariate functions, multiple integrals, vector analysis.

Prerequisite(s): MS 113 or 115.

Basic theory of linear equations, matrices, real vector spaces, bases, dimension, linear transformations, determinants, eigenvalues, eigenvectors, inner product spaces, and the diagonalization of symmetric matrices.

Prerequisite(s): MS 126 with a "C" or better; and EH 102, EH 104, or EH 106.

Mathematical writing, including methods of proof, and fundamentals of sets and functions. May also include selected topics in algebra, analysis, number theory, or discrete mathematics. Students will be required to demonstrate mastery of selected precalculus material by independently completing a mastery-based tutorial and testing program with a satisfactory score. (Writing Intensive Course)

Prerequisite(s): MS 120 with a "C" or better or MS 125 with a "C" or better.

Provides a summary of introductory probability and statistics centered around data analysis examples and computer simulations. Includes discrete and continuous probability distributions, estimation, and hypothesis testing.

Prerequisite(s): MS 126 with a "C" or better.

Probability rules, discrete and continuous random variables and their probability distributions, expected value, variance, moment generating functions, multivariate probability distributions, and covariance.

Prerequisite(s): MS 125 with a "C" or better.

An introduction to the principal topics of elementary number theory, including divisibility, linear Diophantine equations, distribution of primes, congruences, Fermat's Theorem, and number theoretic functions.

Prerequisite(s): MS 125 with a "C" or better.

An introduction to counting techniques such as permutations and combinations, the inclusion-exclusion principle, recurrence relations, and generating functions. May also include topics from graph theory, combinatorial design, and discrete probability.

Prerequisite(s): MS 112 and 113 or equivalents.

For students pursuing certification in mathematics. Overview of secondary school mathematics for prospective and inservice teachers of mathematics. Department credit not given for mathematics majors or minors.

Prerequisite(s): MS 125.

Euclidean geometry including synthetic and analytic proofs, geometric constructions, properties of the triangle and circle; an introduction to non-Euclidean geometry.

Academic credit given to advanced undergraduate students who provide tutorial assistance in the mathematics department. Students will work under the guidance of an experienced mathematics instructor. Permission of department head required. Department credit not given for mathematics majors or minors. MS 331 and MS 332 may be repeated up to a maximum combined total of six semesters. GRADE: Pass/Fail.

Academic credit given to advanced undergraduate students provide tutorial assistance in the mathematics department. Students will work under the guidance of an experienced mathematics instructor. Permission of department head required. Department credit not given for mathematics majors or minors. MS 331 and MS 332 may be repeated for credit up to a maximum combined total of six semester hours. GRADE: Pass/Fail.

Prerequisite(s): MS 126 with a "C" or better.

The methods of solving differential equations of first or second order and higher order linear equations, including series solutions and selected applications.

Prerequisite(s): MS 126 with a "C" or better.

Matrices, linear systems, vector spaces with emphasis on algebraic structures.

Prerequisite(s): MS 352 and CS 230 (or a higher numbered computer science programming course) with a "C" or better in both.

Numerical analysis and computing with emphasis on methods adaptable to electronic computing machinery.

Prerequisite(s): Advanced standing and approval of instructor.

This course may be repeated for credit up to a maximum of three hours.

Topics, excursions, and requirements determined by department. May be duplicated for credit; however, only three (3) credits may be applied toward any major or minor. Infrequently scheduled and subject to minimum and maximum numbers. Advanced deposit required.

Prerequisite(s): MS 227.

Algebra and calculus of vectors, Stokes theorem, and divergence theorem; applications to geometry, mass potential functions, electricity, and fluid flow.

Prerequisite(s): MS 227 and 304.

Continuation of MS 304. The Central Limit Theorem, order statistics, functions of random variables, properties of estimators, confidence intervals, hypothesis testing, and least squares regression models.

Prerequisite(s): MS 227 and 300.

Real number system, elementary point set theory, limits, theory of continuous functions, differentiable functions. (Writing Intensive Course)

Prerequisite(s): MS 415.

Selected topics from advanced calculus, elements of partial differentiation including the general theorems, Jacobians, topics on the theory of integration. This course is eligible for Faster Master's.

Prerequisite(s): MS 323.

Selected topics from advanced Euclidean geometry, finite geometries, non-Euclidean geometry, and other geometries.

Prerequisite(s): MS 300 and 352.

Introduction to ring theory and related topics: elementary number theory (integer divisibility, congruence, and modular arithmetic), rings, integral domains, fields, ring homomorphisms and isomorphisms, polynomial rings, and if time permits, ideals and factor rings. (Writing Intensive Course)

Prerequisite(s): MS 300 and 352.

Introduction to group theory and related topics: groups, cyclic groups, subgroups, cosets and Lagrange's theorem, group homomorphisms and isomorphisms.

Prerequisite(s): MS 204 or MS 302 or ST 261.

Fundamental concepts of descriptive and inferential statistics, probability distributions, estimation and hypothesis testing. Statistical software and/or scripting used to facilitate analysis and interpretation of results. Emphasis on statistical techniques to analyze data.

Prerequisite(s): MS 415.

Undergraduate Prerequisite: MS 227 and 300 and 415. Graduate Fundamental operations with complex numbers, differentiation and integration theorems, mapping, series, and residues. This course is eligible for Faster Master's.

Prerequisites or corequisites for undergraduate: MS 415 or MS 441 or MS 451. Prerequisites for graduate: See Prerequisites for All Graduate Mathematics Courses. Goals include examining deeply the fundamental ideas of mathematics and connections among various branches of mathematics, exploring the historical development of major concepts, and further developing the habits of mind that define mathematical approaches to problems. This course is eligible for Faster Master's. (Writing Intensive Course)

Prerequisite(s): MS 415.

Basic topological concepts to include topological spaces, mapping, compactness, connectedness, and separation axioms. This course is eligible for Faster Master's.

Prerequisite(s): MS 227 and 344.

Standard methods of solution; separation of variables, Fourier Series, Laplace Transforms; selected applications. This course is eligible for Faster Master's.

Prerequisite(s): Requires a faculty recommendation and permission of the department head.

(1-6). This course allows the student to gain experience in a job involving mathematics. The department head will approve the number of credit hours based on the scope of the project. Repeatable up to a total of 6 credit hours. Grades: Pass/Fail.

Prerequisite(s): MS 302 or 304 or 415 or 441, senior standing, and approval of instructor.

A guided independent investigation of a topic outside the department's normal course offerings, to culminate in a written paper and oral presentation to the faculty.

A brief exposure to theory and operations of information technology. Concepts presented include computer systems, hardware and software. Hands-on experience with selected productivity software packages. (Department credit not given for CS/CIS majors and/or minors.)

Prerequisite(s): ACT score of 24 or above or SAT of 520 or above and basic computer proficiency.

Advanced coverage of the theory and operations of information technology. Hands-on experience with selected popular software packages for Web and program design. (Department credit not given for CS/CIS majors or minors.)

Lecture 1 hour, Lab 2 hours. Sets, functions, propositional logic, number systems, data representation, binary arithmetic. Problem solving tools and techniques. Control structures. Data structures. Implementation using a high-level language. (Open to any major, but required for CS/CIS majors.)

Prerequisite(s): CS 230 with a grade of C or better, MS 112 or higher level mathematics with a grade of C or better, and an overall GPA of 2.0 or higher.

Algorithmic problem solving. Modular programming. Strings, multi-dimensional arrays, records, dynamic linked lists. Documentation. Testing and debugging. Developing robust, user-friendly programs. Integral, scheduled laboratory. Lecture 2 hours, Lab 1 hours.

Prerequisite(s): CS 231.

Advanced problem solving. Efficiency and reuse. Abstract Data Types. Object-Oriented programming. Dynamic data structures: linked lists, queues, stacks. Recursive functions and procedures. Integral, scheduled laboratory. Lecture 2 hours, Lab 1 hour.

Prerequisite(s): CS 230 and MS 112 or higher.

Introduction to concepts, terminology and manipulative skills associated with combinatorial structures and logic. Sets and functions, partially ordered sets, trees and graphs, algorithms and induction. Boolean algebra and introduction to symbolic logic.

Prerequisite(s): CS 231.

Examination of micro-computers and their role in small to medium firms. Emphasis on applications, I/O operations and file handling in a laboratory environment.

Prerequisite(s): CS 231.

Introduction to database management systems using a current DBMS package; development of menu-driven database applications.

Prerequisite(s): EH 102 and CS 230.

Introduction to the writing tasks necessary of computer technology professionals. Covers skills necessary to prepare the technical reports, presentations, and documentation specific to the information technology environment. (Writing Intensive Course)

Prerequisite(s): MS 112 or higher and CS 201.

The use of spreadsheet software in modeling business problems. Extensive hands-on use of spreadsheets is required. (Department credit not given for CS/CIS majors or minors.)

An overview of how data science is used in organizations to solve problems and to create new opportunities. Provides an introduction to the tools and methods used to manage data and instruction in the analytics scripting language, R.

Prerequisite(s): CS 201.

Study of information security and digital forensics using practical case studies. Emphasis is on developing security policies, security management and practices, utilization of digital forensic tools and techniques, risk management, security project management, and protection mechanisms. Major components of the course are hands-on projects on digital forensic investigation and security management case studies. (CS 307 is cross-listed with EM 325, but only one course can be counted for credit.)

Prerequisite(s): CS 231.

A study of embedded system architectures, security, and digital forensics, the role of hardware abstraction layers and middleware, real-time OS issues such as concurrency, synchronization, and resource management, and the components and applications of industrial control systems. Laboratory activities include: ladder logic programming, embedded systems programming, and digital forensics for microcontrollers, mobile computing platforms, and industrial control systems.

Prerequisite(s): CS 201.

This course focuses on a rich variety of models and strategies for connecting individuals, businesses, governments, and other organizations to each other. The topics covered in the course will span value and supply chain concepts, varying business relationship types, as well as obligations for protection of individual privacy and organizational security.

Prerequisite(s): CS 232.

Introduction to the systems development life cycle, software development models, analysis and design techniques and tools, and validation and verification testing. Emphasis and experience will be on software engineering within a team environment.

Prerequisite(s): CS 309.

Study of the systems concept and its relationship to information requirements for decision making and management in traditional and e-commerce environments. (Writing Intensive Course)

Prerequisite(s): CS 310 and EH 102.

Introduction to writing, analyzing, and evaluating effective software documentation. Exposure to proposal writing. Emphasis on writing software user manuals.

Prerequisite(s): CS 201.

Step-by-step process of creating a well-designed website. Emphasizes web design techniques resulting in fast-loading and well-placed graphics, cohesive color and typography across platforms and browsers, clear navigational interface, and appropriate use of sound and video. Includes studio component where students analyze, design, and implement websites.

Prerequisite(s): CS 315 or CS 231.

A practical hands-on introduction to web scripting for writing client-side scripts. Topics include fundamentals of scripting as a web programming language, scripting techniques and programming concepts such as control structures, data structure, objects, event handling, and functions. Multiple scripting languagaes will be used for the hands-on projects.

Prerequisite(s): CS 232.

Design, analysis, and implementation of fundamental data structures: trees, heaps, and graphs. Basic algorithmic analysis and strategies. Basic computability and introduction to distributed algorithms.

Prerequisite(s): CS 232.

Digital logic; instruction set architecture and computer organization; memory systems; functional organization; interfacing and communication; multiprocessing and alternative architectures.

Prerequisite(s): One of (EH 102, EH 104, or EH 106) and one of (CS 201 or CS 230).

Principles of game design. Covers analysis of genres; gameplay; conceptual design; story and character development, effects of art, lighting, and sound; interface design; level design; and the business of game development.

Prerequisite(s): CS 230.

The course provides a fundamental background in bioinformatics, both theoretical (bioinformatics algorithms) and practical (databases and web-based tools used to study problems in biology), to students in computer science or in biological sciences. Introduction to the biological problems addressed in this course will be provided, as well as a formal definition of the computational problems and a deep exploration of the algorithms for solving these problems. Practical use of topics introduced in class is demonstrated by laboratory exercises and homework problems. Students are grouped for class projects such that each group contains at least one life scientist and one computer scientist. (CS 340 is cross listed with BY 340, but only one course may be taken for credit.)

Prerequisite(s): CS 232.

Overview of operating system concepts and structures. Study of process management including synchronization techniques for cooperating processes, main memory management including virtual memory systems, system resource allocation and deadlocks, file system implementation, secondary storage management and input/output subsystems.

Prerequisite(s): CS 232.

An introduction to solving business problems using structured programming techniques and methodology for both interactive and batch processing. Integral, scheduled lab. Lecture/2 hours, lab/1 hour.

Topics, excursions and requirements determined by department. May be duplicated for credit; however, only three (3) credits may be applied toward any major or minor. Infrequently scheduled and subject to minimum and maximum numbers. Advanced deposit required.

Prerequisite(s): CS 201 or equivalent.

Study of terminology and concepts of computer-based management information systems. Emphasis on applications for developing and managing World-Wide Web page information. (Department credit not given for CS/CIS majors and/or minors.)

Prerequisite(s): CS 310.

A study of application development for popular mobile computing platforms, such as smartphones and tablets. Topics and laboratory activities include: responsive screen layout and spacing; the use of sensors, cameras, and other mobile input devices; mobile resource management and optimization; and best practices for mobile security.

Prerequisite(s): CS 201.

How people, groups, organizations, communities and governments manage disasters in the immediate aftermath and recover from their effects, including social, physical, business, and infrastructure problems as well as intra and inter-organizational issues. (CS 412 is cross-listed with EM 411, but only one course can be counted for credit.)

Prerequisite(s): CS 488.

The course will present dynamic web based application architecture, web scripting languages syntax, principles and techniques for developing database driven web applications using multiple web scripting languages. Students will gain the experience in web scripting programming via the completion of a series of practical dynamic website projects.

Prerequisite(s): CS 331.

Survey of design and analysis of efficient algorithms. Introduces methods of describing algorithm time and space complexity and various problem-solving techniques.

Prerequisite(s): CS 310 or equivalent.

Undergraduate Prerequisite: CS 310. Graduate Introduction to technologies and tools for developing Web applications using Web Services, emphasizing organizational issues, challenges, and security concerns related to the effective deployment of those applications.

Prerequisite(s): CS 232.

Human-computer interface, human performance, diversity, and mental models, interaction devices, dialog styles, interface styles, error handling, documentation, and evaluation of software interface designs.

Prerequisite(s): CS 232 and MS 113 or equivalent.

Hardware and software components of computer graphic systems, input representation, and transformation of graphic information. Two-dimensional and three-dimensional transformations; perspective, hidden-line algorithms, shading. Interactive graphics. Survey of applications.

Prerequisite(s): CS 232 and CS 339.

Principles of game development. Covers relevant game mathematics and data structures; selected Al topics common to game development; programming techniques and optimization techniques; game engines; and software engineering and project management for game development.

Prerequisite(s): CS 331 or permission of instructor.

Introduction to the principles and methods used in artificial intelligence programs with a focus on autonomous agents.

Prerequisite(s): MS 444.

An overview of the principles and techniques used in Predictive Modeling. Modeling techniques will include, but not be limited to prediction (regression, decisions trees, neural networks), association rules (market basket analysis), segmentation (clustering, K-Means algorithm), and text mining.

Prerequisite(s): CS 350. Graduate Prerequisite

Study of the computer interconnection and protocols with emphasis on network layers, error detection/correction, and topologies; project approach utilized. Graduate Prerequisite: Undergraduate operating systems course or equivalent.

Prerequisite(s): CS 232.

Formal representations for language syntax and semantics, underlying language theory. Study of automata theory: finite automata, pushdown automata, and Turing machines.

Prerequisite(s): CS 201.

Identifies what constitutes critical infrastructure including cyber as well as physical infrastructure. Evaluation of strategies for promoting vulnerability assessments and risk reduction, and protection of critical infrastructures are examined. (CS 461 is cross-listed with EM 461, but only one course can be counted for credit.)

Prerequisite(s): CS 310 or approval of instructor.

An overview of legal, ethical, global and professional issues in computing. (Writing Intensive Course)

Prerequisite(s): Completion of CS 310 (B or above) or permission of the instructor.

This course is an advanced (honors) course that provides an overview of the legal, ethical, global and professional issues in computing. This course will enable students to identify ethical issues in technology, perform ethical analyses using a variety of ethical theories, and to critically read professional literature in the field. Students will develop an awareness of ethical issues in technology, including, but not limited to, the Internet (e.g. freedom of expression on the Internet), Intellectual Property rights, Privacy, Security, Reliability, Professional ethics, Employment issues and technology, and Plagiarism, and apply ethical theories to issues in those domains.

Prerequisite(s): Undergraduate operating systems course or equivalent.

Undergraduate Prerequisite: CS 350. Graduate Study of network security architectures and models, cryptography, authentication and authorization protocols, secure application and systems development, federal regulations and compliance. Emphasis is on security professional certification.

Prerequisite(s): CS 445.

Current topics such as Big Data, Project Management, Simulation and Optimization. Includes a capstone project where students implement methodologies and practices of data science to create competitive advantage. This course may take the form of an internship upon approval of the MCIS department head.

Prerequisite(s): CS 232.

Concepts and terminology associated with data structure, file organization, access methods, packaged systems, database design and database systems.

Prerequisite(s): CS 488.

Exposure to principles and techniques of business intelligence. Topics include, but are not limited to, data warehouse development using dimensional data modeling, extraction transformation loading (ETL), methodologies and implementation, reports, and dashboards.

Prerequisite(s): CS 310.

This course is a continuation of software engineering that emphasizes the entire software process, developing and using process and product metrics, and managing software projects. Both individual and team projects will develop student expertise.

Prerequisite(s): Requires a faculty recommendation and permission of the department head.

(1-6). Limited to CS or CIS majors with junior or senior standing. This course allows the student to gain experience in a job involving computer science. The department head will approve the number of credit hours based on the scope of the project. May be duplicated for credit for a total of six (6) semester hours.

Prerequisite(s): Senior status and approval of department head.

Exposes student to current or developing topics in computer science or computer information systems. Projects/topics are jointly selected by student and computer science instructor. This course can be taken multiple times of variable credit hours up to a total maximum of six credit hours, provided each course covers a different topic.