**CS 010: PREVIEW OF COMPUTER SCIENCE**

The course presents a broad overview of Computer Science to provide students with an appreciation for and an understanding of the many different aspects of Computer Science. A comprehensive and rigorous exploration of computing is undertaken to lay a solid foundation to support further study. No background in Computer Science is assumed. The course is intended for both students who expect to major or minor in Computer Science as well as for those not planning on taking additional course work.

**CS 065: INTRODUCTION TO&NBSP;COMPUTER SCIENCE I**

An introduction to the field of computer science is provided emphasizing problem solving using a high-level programming language. Algorithms, basic data representation, language control structures, debugging, and program verification will be discussed. Objects will be introduced, used, and created. Prereq.: Four years of high school mathematics or MATH 020.

**CS 066: ****INTRODUCTION TO COMPUTER SCIENCE II**, 3 credit hrs.

This course extends the work of CS 065. This object of the course is to understand data abstraction in computer science and to learn how to implement user-defined data types in an object-oriented language. Sorting, searching and tree traversal algorithms are used and analyzed. Preparation for further study in computer science. Prereq.: CS 065 or equivalent.

**CS 073: ****COMPUTER LANGUAGE TOPICS**, 1-3 credit hrs.

Introduction to specific programming and special purpose computer languages for students who are already familiar with a high-level programming language. Prereq.: CS 065 or equivalent. Some topics may have additional prerequisites.

**CS 083: ****COMPUTER ETHICS**, 3 credit hrs.

This course examines the ethical and social issues arising from advances in computer technology, and the responsibility that computer professionals and users have with regards to computer use. The course will serve to increase understanding of issues related to ethics, professional conduct and social responsibility as they arise in the field of computer science. Students will be exposed to the history of the discipline from a social point of view, and to various frameworks from which ethical and professional decisions must be made within the discipline. Additionally, the course serves to develop 1) the ability to think clearly; 2) habits of professional responsibility and behavior; and 3) effective writing and presentation skills. Prereq .: Sophomore, junior, or senior standing required.

**CS 099: INDEPENDENT STUDY,**

Directed individual study in areas related to the student's needs or interests. Prereq.: Consent of department.

**CS 114: SYMBOLIC LOGIC** (cross-listed with PHIL 114),

Study of the concepts and techniques of modern formal logic, including axiomatic developments of the sentential calculus and an examination of the first-order predicate calculus in a system of natural deduction.

**CS 116: BIOINFORMATICS** (cross-listed with BIO 116), *3 credit hrs.*

The analysis of biological systems through the use of computational methods. Analyzing these systems often involves creating electronic databases of biological structures (protein sequences, genomes, DNA, etc.) and developing algorithms to analyze the data. Prereq.: CS 065 or consent of instructor.

**CS 130: ****COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE PROGRAMMING,** 3 credit hrs.

Computer organization and architecture; internal representation of programs and data; assembly language programming; addressing techniques; macros; assemblers; linking; input/output concepts. Prereq.: CS 065 or equivalent.

**CS 135: PROGRAMMING LANGUAGES,**

Principles of programming languages are studied from the perspectives of design and implementation. Syntactic and semantic features are examined in a variety of languages. Run-time structures for handling both data and control structures are introduced. The course concentrates on imperative and object-oriented paradigms, but also covers functional and logic languages. Prereq.: CS 066.

**CS 137: ****DATA STRUCTURES AND ALGORITHM ANALYSIS,** 3 credit hrs.

Formal and informal methods for analyzing the correctness and efficiency of algorithms. Implementation and analysis of advanced algorithms and data structures such as AVL trees, B-trees, hash-tables, heaps, and graph algorithms. Introduction to complexity theory and NP-Completeness. Prereq.: MATH 054, CS 066.

**CS 139: ****THEORY OF COMPUTATION**, 3 credit hrs.

Theoretical foundations of computing. Introduction to formal grammars, languages and automata theory. Mathematical analysis of the fundamental power and limitations of computing devices. Applications to pattern matching, problem specification, programming languages and compilers. Prereq.: MATH 054, CS 066.

**CS 140: ****COOPERATIVE EDUCATION,** 1-3 credit hrs.

Students who are in a work environment related to the major field of study may receive credit for applications of classroom knowledge to their job. The student meets regularly with the adviser to determine appropriate assignments. May be repeated up to a maximum of eight hours of credit. (Graded on a credit/no credit basis.) Prereq.: At least junior standing or consent of instructor.

**CS 143: ****ARTIFICIAL INTELLIGENCE,** 3 credit hrs.

Introduction to the theory, tools and methods of artificial intelligence. Topics include knowledge representation, predicate calculus, basic data structures, and problem solving strategies. A symbol manipulation language is used. Computer science aspects of artificial intelligence are emphasized. Applications from areas such as natural language understanding, vision or expert systems are examined. Prereq.: CS 066.

**CS 146: OBJECT-ORIENTED SOFTWARE/UML,**

Practical experience in state-of-the-art techniques for object-oriented software development, especially the use of "Unified Modeling Language (UML)." UML is now the de facto standard for expressing the intricate static and dynamic details of today's complex software products. The course focuses on learning to develop highly organized and maintainable programs, and on using UML and "Design Patterns" as a means for expressing their features and guiding their design. Team work is also stressed. Prereq.: CS 066

**CS 147:**** COMPUTER GRAPHICS,** 3 credit hrs.

Introduction to the drawing methods, geometrical transforms, and illumination models that are fundamental to computer graphics programming. The course is designed to be hands on in which students will implement several of the algorithms discussed in class using C/C++ and the OpenGL toolkit. Prereq.: CS 066.

**CS 150: DISCRETE STRUCTURES** (cross-listed with MATH 150),

Foundations of discrete mathematics and the problems that can be solved using finite processes and sets of elements that can be listed. Topics covered will include algorithms, graph theory, and combinatorics. Prereq.: CS 065 and MATH 101.

**CS 160: ****OPERATING SYSTEMS**, 3 credit hrs.

Introduction to the design, development and implementation of operating systems. Problems of resource allocation, concurrency, file system design, networking and the interface between hardware and software. Examination of actual operating system source code. Prereq.: CS 066.

**CS 161: COMPILER CONSTRUCTION**

This course provides an understanding of the various phases of the programming language translation process. Compiler principles and tools are examined, and applied to the development and implementation of a working language processor. Various parsing techniques are compared. Prereq.: CS 066.

**CS 165: INTRODUCTION TO NUMERICAL ANALYSIS** (cross-listed with MATH 165),

A practical introduction to numerical computing. The primary focus is the concepts and tools involved in modeling real continuous mathematical or engineering problems on the digital computer. The effects of using floating point arithmetic, error analysis, iterative methods for solving equations, and numerical integration and differentiation will be studied. Prereq.: CS 065, MATH 080 and 100.

**CS 167: MACHINE LEARNING **

Introduction to foundational and contemporary machine learning algorithms for classification, estimation, and clustering. Specific topics will vary but may include artificial neural networks, decision trees, instance-based learning, Bayesian learning, support vector machines, hidden Markov models, text categorization, and k-means clustering. Modern machine learning software and programming libraries will be utilized. Prereq: CS 066.

**CS 172: ****DIGITAL COMPUTER ORGANIZATION**, 3 credit hrs.

Exploration of how computers are constructed. Topics include the components of modern computer organization: the set of instructions, processor design and layout, clock speed, pipelining, access to cache, and virtual memory. Each one of these components will be studied in depth, in addition to basic digital circuits and combinational logic, with a focus on the decisions the must be made in order to develop an efficient computer. Prereq.: CS 130.

C**S 178: CLOUD COMPUTING AND DATABASE SYSTEMS**

This course will focus on how large amounts of data are stored, accessed, and ultimately analyzed. Cloud concepts, capabilities, and computing models will be explored and will include hands-on experiences with tools for working with large-scale distributed file systems (e.g., Hadoop). Students will also develop skills working with relational databases (e.g., SQL) and unstructured databases (e.g., no SQL). This courses will complement rather than overlap the existing course Database Management – IS 160. Prereq: CS 066.

**CS 188: SOFTWARE ENGINEERING**

This course provides an in-depth study of the design and development of software. The life cycle of software, various development strategies, requirements analysis, design tools, and testing methodologies will be covered. These concepts will be explored in theory as well as in practice; students will gain experience in conceiving, specifying, designing, developing and implementing a reasonably sized software solution alongside a team of students from computer science as well as students from graphic design and journalism. Prereq: CS 066.

**CS 191: COMPUTER SCIENCE CAPSTONE**

The purpose of a capstone is for students to undertake an independent project that applies and synthesizes what they have learned in their major. This course is typically taken in one of the student's final two semesters at Drake. One outcome will be a written project that can take several forms, for example a research paper, a software package, or lesson plans. A second outcome is a presentation of their work to the students and faculty of the department, usually during the last two weeks of the semester.

**CS 195: TOPICS IN COMPUTER SCIENCE**

Seminars in selected topics. Prereq.: Consent of instructor.

**CS 199: ****INDEPENDENT STUDY**, 1-3 credit hrs.

Directed individual study in areas related to the student's needs or interests. Prereq.: Consent of department.

**MATH 017: ****SPIRIT OF MATHEMATICS**, 3 credit hrs.

The nature of the topics will vary but will expose students to a wide variety of mathematics. Topics from advanced mathematics will be included but will be presented at a level appropriate to college students who do not have an extensive mathematical background. Topics considered for current versions of the course include financial mathematics, fractals, chaos, environmental mathematics, conceptions of space, the nature of infinity, encryption techniques and topics from the history of mathematics. Among the mathematical techniques that will be used: functions and equations (exponential, linear and quadratic); difference equations; equation solving techniques (algebraic and technological); problem solving and mathematical reasoning techniques; basic probability and statistics; graphical analysis; geometrical analysis; the concept of infinity. Prereq.: None.

**MATH 020: ****COLLEGE ALGEBRA**, 4 credit hrs.

Study of linear, exponential, power, logarithmic, and polynomial functions from an algebraic, graphical and numerical point of view; fitting functions to data; review of trigonometry; solutions to equations and systems of equations. Prereq.: Completion of high school mathematics through Algebra II/Trigonometry.

**MATH 024: ****STRUCTURE OF MATHEMATICS FOR ELEMENTARY EDUCATION I**, 3 credit hrs.

Basic concepts and structure of whole numbers, integers, rational numbers, decimals, and real numbers and operations on these number sets as they relate to the K-6 curriculum. Also proportional reasoning, algebraic reasoning, and statistics appropriate to the elementary school curriculum are discussed. Restricted to elementary education majors, or middle school endorsement. Prereq.: Completion of high school mathematics through Algebra II/Geometry.

**MATH 025: ****STRUCTURE OF MATHEMATICS FOR ELEMENTARY EDUCATION II**, 3 credit hrs.

Continuation of Math 24, with emphasis on the content strands of problem solving, number theory, probability, geometry, and measurement. Restricted to elementary education majors, or middle school endorsement. Prereq.: Completion of high school mathematics through Algebra II/Geometry.

**MATH 028: ****BUSINESS CALCULUS**, 3 credit hrs.

Brief algebra review, data analysis, limits, derivatives, integration, applications to business. Prereq.: MATH 020 or equivalent.

**MATH 045: ****MATH AND TECHNOLOGY**, 3-4 credit hrs.

Selected content from the elementary and secondary school mathematics curricula and the application of technology in teaching this material. Restricted to education majors. Prereq.: MATH 020 or equivalent, or consent of instructor.

**MATH 050: ****CALCULUS I**, 4 credit hrs.

Analytic geometry concepts; functions; continuity; limits; differentiation; applications of derivatives; definite integrals; techniques of integration. Prereq.: MATH 020 or equivalent and exposure to trigonometry.

**MATH 054: ****INTRODUCTION TO DISCRETE MATHEMATICS**, 3 credit hrs.

Number systems, algorithms, sets, logic, Boolean algebra, functions, combinatorics, probability, graph theory. Prereq.: MATH 020 or equivalent.

** MATH 061: GEOMETRY FOR 6-12 MATHEMATICS TEACHERS, 3 credit hrs.**This course is designed to develop students' Mathematical Knowledge for Teaching Geometry. Students will deepen their understanding of topics in Euclidean Geometry, including: the Triangle Inequality Theorem, points of concurrency in a triangle, special properties of quadrilaterals, geometric transformations, similarity, symmetry and tessellations, the Pythagorean Theorem, area and perimeter, and volume and surface area. Students will learn to use dynamic geometry software (DGS) in their exploration of these topics, and develop and critique geometric proofs. A strong emphasis will be placed on considering the pedagogical implications for teaching these topics, and how to use DGS to enhance students' learning.

**MATH 062: STATISTICS AND PROBABILITY FOR 6-12 MATHEMATICS TEACHERS, 3 credit hrs.**Statistics and Probability for 6-12 Mathematics Teachers

The subject matter of the course, statistics and probability, will be grounded in experiences that arise in the context of teaching in order to simultaneously build content and pedagogical knowledge with a focus on the use of real-world data and technology tools. The choice of activities will span the content required by the Common Core Standards of Mathematics for middle and high school with connections to more advanced content. Prereqs: Sophomore status and enrollment in either an education program or mathematics education major.

**MATH 070: ****CALCULUS II**, 4 credit hrs.

Functions; continuity; limits; differentiation; applications of derivatives; definite integrals; techniques of integration; applications of definite integrals; infinite series; plane curves; limits, continuity and differentiation for functions of several variables; multiple integrals. Prereq.: MATH 050.

**MATH 080: ****LINEAR ALGEBRA**, 3 credit hrs.

Systems of linear equations; vectors, linear independence, linear transformations; matrix operations, inverse of a matrix, determinants; null and column space of a matrix, rank; general vector spaces, basis of a vector space, dimension; eigenvalues and eigenvectors, diagonalization, orthogonality; applications. Prereq.: MATH 050.

**MATH 099: ****INDEPENDENT STUDY**, 1-3 credit hrs.

Directed individual study in areas related to the student's needs or interest. Prereq.: Consent of department.

**MATH 100: CALCULUS III**

Functions; continuity; limits; differentiation; applications of derivatives; definite integrals; techniques of integration; applications of definite integrals; infinite series; plane curves; limits, continuity and differentiation for functions of several variables; multiple integrals. Prereq.: MATH 070.

**MATH 101:**** MATHEMATICAL REASONING**, 3 credit hrs.

Logic; sets and mappings; methods of proof including direct and indirect proofs, induction, Delta-Epsilon arguments; axiomatic systems. Prereq.: MATH 070, 080. Note: This course is a prereq. for MATH 150, 153, 155, 157, 176, 184 and 187.

**MATH 110: ****MULTIVARIATE CALCULUS**, 3 credit hrs.

Properties of continuous mappings from Rn to Rm, differential forms, vector calculus. Line integrals. Stokes' theorem. Prereq.: MATH 080, 100.

**MATH 120: ****APPLIED DIFFERENTIAL EQUATIONS I**, 3 credit hrs.

Ordinary differential equations; systems of differential equations. Fourier series, integrals and harmonic analysis, partial differential equations, orthogonal functions. Bessel functions. Legendre functions. Prereq.: MATH 080, 100.

**MATH 121: ****APPLIED DIFFERENTIAL EQUATIONS II**, 3 credit hrs.

Continuance of MATH 120. Prereq.: MATH 120.

**MATH 125: MATHEMATICAL MODELING ,**

The construction, analysis and interpretation of mathematical models. Examples are drawn from a variety of areas. Student projects are required. Prereq.: MATH 070, 080.

**MATH 127: ****INTRODUCTION TO GAME THEORY**, 3 credit hrs.

Game Theory is the logical analysis of situations of conflict and cooperation. Topics will include zero-sum games and non-zero-sum two-person games, n person games, applications to economics, politics and nature. Prereq.: MATH 028 or MATH 050 or consent of instructor.

**MATH 131: INTRODUCTION TO PROBABILITY I** (cross-listed with ACTS 131),

An introduction to probability concepts, including definition of probability: independence; conditional probability; independence; random variables; specific discrete and continuous probability distributions; multivariate random variables; moments and moment generating functions; functions of random variables; sampling distributions; and central limit theorem. Prereq.: MATH 080, 100.

**MATH 132: INTRODUCTION TO PROBABILITY II** (cross-listed with ACTS 132),

Continuation of MATH 131. Specific probability models covered include Markov chains; the Poisson process and its relation to the exponential distribution; continuous-time Markov chains; and Brownian motion. Techniques of simulating probability models are also covered. Prereq.: MATH 131.

**MATH 140: ****COOPERATIVE EDUCATION**, 1-3 credit hrs.

Students who are in a work environment related to the major field of study may receive credit for applications of classroom knowledge to their job. The student meets regularly with the adviser to determine appropriate assignments. May be repeated up to a maximum of eight hours of credit. (Graded on a credit/no credit basis). Prereq.: At least junior standing or consent of instructor.

**MATH 144: ****TOPICS IN MATH EDUCATION**, 3 credit hrs.

Topics for elementary and secondary mathematics pre-service teachers include introduction to new and established curricular materials and development of classroom materials in the context of the National Council of Teachers of Mathematics "Principles and Standards for School Mathematics." Prereq.: None.

**MATH 145: METHODS OF TEACHING SECONDARY SCHOOL MATHEMATICS**

Instructional strategies and materials for teaching secondary school mathematics. Restricted to secondary education majors. Prereq.: Consent of instructor.

**MATH 150: DISCRETE STRUCTURES** (cross-listed with CS 150)

The course covers subjects in discrete mathematics with applications to computer science. Topics include algorithms, graph theory and combinatorics. Prereq.: CS 065 and MATH 101.

**MATH 153: ****MODERN GEOMETRY**, 3 credit hrs.

A rigorous approach to Euclidean and non-Euclidean geometries from a general, axiomatic point of view. Prereq.: MATH 101.

**MATH 155: INTRODUCTION TO ABSTRACT ALGEBRA I**

Introduction to groups, rings, integral domains and fields; homomorphisms and isomorphisms; properties of the integers; polynomial rings and factorization; field extensions. Prereq.: MATH 101.

**MATH 156: ****INTRODUCTION TO ABSTRACT ALGEBRA II**, 3 credit hrs.

Continuance of MATH 155. Prereq.: MATH 155.

**MATH 157: HISTORY OF MATHEMATICS**

An overview of the evolution of mathematics from ancient times through Newton and Leibniz. The conceptual development of mathematics will be emphasized. Prereq.: MATH 101.

**MATH 165: INTRODUCTION TO NUMERICAL ANALYSIS** (cross-listed with CS 165)

Error analysis, iterative methods for solving nonlinear equations, direct and iterative methods for solving linear systems, approximation of functions, derivatives, integrals. Prereq.: CS 065, MATH 080 and 100.

**MATH 176:**** ADVANCED LINEAR ALGEBRA**, 3 hrs.

Hermitian, unitary, normal, positive definite and nonnegative matrices; LU, QR and Choleski factorizations; equivalence, similarity, congruence and their respective canonical forms; norms; Schur triangular form, Jordan canonical form; applications. Prereq.: MATH 101.

**MATH 184: INTRODUCTION TO REAL ANALYSIS I**

Algebraic and topological properties of the real line. Limits, continuity, differentiation. Riemann integration, series. Prereq.: MATH 100, 101.

**MATH 185: ****INTRODUCTION TO REAL ANALYSIS II**, 3 credit hrs.

Continuance of MATH 184. Prereq.: MATH 184.

**MATH 187: ****COMPLEX ANALYSIS**, 3 credit hrs.

Algebraic and topological properties of the complex plane. Theory of analytic functions. Applications. Prereq.: MATH 100, 101.

**MATH 191: ****MATHEMATICS CAPSTONE**, 1 credit hr.

The purpose of a capstone is for students to undertake an independent project that applies and synthesizes what they have learned in their major. This course is typically taken in one of the student's final two semesters at Drake. One outcome will be a written project that can take several forms, for example a research paper or a software package. A second outcome is a presentation of their work to the students and faculty of the department, usually during the last two weeks of the semester.

**MATH 192: ****MATH SECONDARY EDUCATION CAPSTONE**, 1 credit hr.

The purpose of a capstone is for students to undertake an independent project that applies and synthesizes what they have learned in their major. This course should be taken prior to student teaching and may be taken in the second semester of the junior year. One outcome will be a written project that can take several forms, for example a research paper, an educational software package, or lesson plans. A second outcome is a presentation of their work to the students and faculty of the department, usually during the last two weeks of the semester.

**MATH 195: TOPICS IN THE MATHEMATICAL SCIENCES**

Seminars in selected topics. Prereq.: Consent of instructor.

**MATH 199: ****INDEPENDENT STUDY**, 1-3 credit hrs.

Directed individual study in areas related to the student's needs or interest. Prereq.: Consent of department.

**MATH 230: ****INDEPENDENT STUDY**, 1-3 credit hrs.

**MATH 245: ****TOPICS FOR SCHOOL MATHEMATICS**, 3 credit hrs.

Seminars in selected topics. Prereq.: Consent of instructor.

July 14, 2015

A new website provides comprehensive information and analysis of presidential campaigns in Iowa leading into the state’s first-in-the-nation caucuses.