COMP.1010 Computing I (3cr)
Introduction to computing environments: introduction to an integrated development environment; C, C++, or a similar language. Linear data structures; arrays, records, and linked lists. Abstract data types, stacks, and queues. Simple sorting via exchange, selection, and insertion, basic file I/O. Programming style documentation and testing. Ethical and social issues. Effective Fall 2013, Co-req 91.103 Computing 1 Lab.
COMP.1020 Computing II (3cr)
Computing II focuses on the implementation and applications of data structures, including arrays, linked lists, stacks, queues, trees, binary trees, binary search trees, heaps, graphs, and hash tables. Recursive approaches are used. Performance analysis is discussed. Attention is paid to programming style, documentation, and testing. This course includes extensive laboratory work. Effective Fall 2013, Co-req: Computing 2 Lab.
COMP.1030L Computing I Lab (1cr)
This is the lab class for COMP.1010 Computing I. This class must be taken with COMP.1010 Computing I in the same semester.
COMP.1040L Computing II Lab (1cr)
This is a lab class for 91.102 Computing II. This class must be taken with 91.102 Computing II in the same semester.
Requirements:
COMP.1020 Co-req.
ENGL.1010 College Writing I (3cr)
A workshop course that thoroughly explores the writing process from pre-writing to revision, with an emphasis on critical thinking, sound essay structure, mechanics, and academic integrity. Students will read, conduct rhetorical analyses, and practice the skills required for participation in academic discourse. Students will write expository essays throughout the semester, producing a minimum of four formal essays.
ENGL.1020 College Writing II (3cr)
A workshop course that thoroughly explores the academic research writing process with an emphasis on entering into academic conversation. Building on the skills acquired in College Writing I, students will learn to write extensively with source material. Key skills addressed include finding,assessing, and integrating primary and secondary sources, and using proper documentation to ensure academic integrity. Students will produce analytical writing throughout the semester, including a minimum of four formal, researched essays.
INFO.2030 Introduction to Programming with Python (3cr)
This course examines the fundamentals of computer programming while using the Python programming language. Python is a popular scripting language that is commonly used for a myriad of applications including machine learning, scientific computing, scripting, web applications, and data processing. Course topics will include programming fundamentals, such as Boolean logic, program organization, input and output, and loops. We'll cover the syntax of Python (the rules that govern the language) as well as industry standards best practices.
INFO.2670 C Programming (3cr)
Introduces students to the techniques of programming in C. The language syntax, semantics, its applications, and the portable library are covered. This course is an introductory course in programming. It does not assume previous programming experience.
Notes:
Students may not receive credit for both the
INFO.2110/INFO.2120 sequence and INFO.2670
This course qualifies for
free MSDNA software!
INFO.2680 C++ Programming (3cr)
This course will cover the C++ language and show the student how to use the language. We will cover class construction, operator overloading, virtual functions, templates, and introduce the student to the IO streams. Inheritance and its use in creating extendible libraries will be presented. Object-oriented concepts will be presented in the context of the C++ language and its support for object-oriented programming.
Notes:
This course qualifies for
free MSDNA software!
Requirements:
P: INFO.2670 or INFO.2120; requires C++ compiler software
INFO.2820 Python Programming (3cr)
This course introduces the fundamentals of Python including data types, expressions, control structures, file input and output, lists, dictionaries, functions, object oriented program design, simple graphics development, and the development of Graphical User Interfaces (GUIs) in Python. Students will problem solve, explore real-world software development challenges, and create practical and contemporary applications. This course assumes previous programming experience.
INFO.3600 Intro. to Data Structures with C (3cr)
This course introduces students to the fundamental concepts of data structures such as stacks, queues, linear and linked lists, trees, graphs, hashing, etc., using the C programming language. Algorithms for manipulating these structures, such as sorting and searching techniques, will also be covered.
Requirements:
INFO 2670 C Programming or INFO 2120 Intro to Programming with C- part II.
MATH.1310 Calculus I (4cr)
Serves as a first course in calculus. Functions, limits, continuity, derivatives, rules for differentiation of algebraic and transcendental function; chain rule, implicit differentiation, related rate problems, linearization, applied optimization, and curve sketching. Introduction to area and integration. Students are expected to have taken pre-calculus and trigonometry in order to be successful in this course.
Requirements:
Current ALEKS math placement 76-100, or MATH.1230 Precalculus II with a grade of 'C-' or higher.
MATH.1320 Calculus II (4cr)
Serves as a continuation of Calculus I. Integration and techniques of integration including the substitution method, integration by parts, trigonometric integrals, trigonometric substitution, integration of rational functions by partial fractions, numerical integration, and improper integrals. Volumes using cross-sections, the disk method, the washer method and the shell method. Arc length and surface area. Infinite series, power series, Maclaurin and Taylor series. Polar coordinates and areas and lengths in polar coordinates.
Requirements:
Pre-Req: MATH 1290 Calculus IB, MATH 1310 Calculus I, or a grade of CR in NONC CALC1.
MATH.2190 Discrete Structures I (3cr)
Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, relations and functions, recursion and generating functions, applications to computer science, and graph theory.
Notes:
Formerly MATH.3210
MATH.2210 Introduction to Linear Algebra (3cr)
Elementary set theory and solution sets of systems of linear equations. An introduction to proofs and the axiomatic methods through a study of the vector space axioms. Linear analytic geometry. Linear dependence and independence, subspaces, basis. Inner products. Matrix algebra. Applications of the above will also be discussed.
Requirements:
MATH 1320 pre-req
MATH.2220 Linear Algebra (3cr)
Linear transformations. Linear operators, change of basis, inner product and the diagonalization problem. Quadratic forms. Convex sets and geometric programming, input/output models for an economy, Markov chains, other applications of linear algebra.
MATH.2310 Calculus III (4cr)
Extends the concepts of Calculus I and II that deal with functions of a single variable to multi-variable functions, vector-valued functions and vector fields. Vectors and vector-valued functions, the dot and cross products, curves in space and the calculus of vector-valued functions. Multi-variable functions, limits, continuity, and differentiation. Partial derivatives, directional derivatives, the gradient, Lagrange multipliers and optimization. Double and triple integrals in Cartesian, polar and spherical coordinates. Vector fields and the fundamental theorems of vector calculus developed, line and surface integrals, Green's theorem, Stokes's theorem, and the divergence theorem.
Requirements:
MATH.1320 Calculus II, or MATH.2250 Calculus C.
MATH.2340 Differential Equations (3cr)
Topics include methods of solutions for linear and non-linear first order differential equations, linear second order differential equations, higher order linear differential equations, systems of first-order differential equations. Laplace transforms. Numerical methods. Applications to physical systems.
MATH.3220 Discrete Structures II (3cr)
Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings and fields, applications to coding theory, logic design, and sorting.
Requirements:
MATH.3210 pre-req
MATH.3850 Applied Statistics (3cr)
Introduction to experimental design, data analysis and formal statistical procedures from an applied point of view.
Requirements:
MATH 1320 pre-req
MATH.4110 Complex Variables I (3cr)
A first course in theory of analytic functions of one complex variable: complex differentiability and the Cauchy-Riemann equations, Cauchy Integral Theorem and Cauchy Integral Formula, Taylor and Laurent series, zeroes of analytic functions and uniqueness, the maximum modulus principle, isolated singularities and residues. Applications.
MATH.4350 History of Mathematics (3cr)
Examines ancient numeral systems, Babylonian and Egyptian mathematics, Pythagorean mathematics, duplication, trisection, and quadrature, Euclid's elements and Greek mathematics after Euclid, Hindu and Arabian mathematics, European mathematics from 500 to 1600, origins of modern mathematics, analytic geometry, the history of calculus. Also covers the transition to the twentieth century and contemporary perspectives.
MATH.5300 Applied Mathematics I (3cr)
Infinite Series, Complex Algebra, Ordinary Differential Equations, Special Functions, Fourier Series, Vector Spaces, Operators and Matrices.