# Computer Science Course Descriptions

**MA 10000. An Introduction To Mathematical Sciences** *(Class 1, Cr. 1)* *Prerequisites: none.* This course is intended to: integrate freshman mathematics majors into the department, help them adjust to university life, assist them in developing their academic and intellectual capabilities; introduces them to contemporary issues in mathematics, provide an overview of the careers open to those with degrees in mathematics. This course must be taken Pass/No Pass only. Credit by exam is not available for this course. **MA 11500. Intermediate Algebra** *(Class 3, Cr. 3)* *Prerequisite: MA 02100 or a score of 016 College Level Mathematics CPI or 400 Math SAT or 400 ACT Math converted* The purpose of this course is to strengthen and expand students’ basic algebraic skills and problem-solving capabilities and to prepare them for higher mathematics courses. For the purposes of general education requirements MA 11500 is not a collegiate level mathematics course, and therefore cannot be used to satisfy the general education requirement for mathematics at Purdue University Calumet. **MA 13700. Mathematics For Elementary Teachers I*** (Class 3, Cr. 3)* *Prerequisites: A score of 83 Elementary Algebra or 400 Math SAT or 400 ACT Math converted* Designed for prospective elementary school teachers. Problem solving. Numerical reasoning including self-generated and conventional algorithms. Whole and fractional number systems, elementary number theory. (At Purdue University West Lafayette, not available for credit in the School of Science.) **MA 13800. Mathematics For Elementary Teachers II** *(Class 3, Cr. 3)* *Prerequisites: MA 13700 with a C or better* Continues the study of number systems through integers, rational numbers and real numbers. Quantitative and proportional reasoning as a foundation for algebraic reasoning. Elementary statistical and probabilistic reasoning. (At Purdue University West Lafayette, not available for credit in the School of Science.) **MA 13900. Mathematics For Elementary Teachers III** *(Class 3, Cr. 3)* *Prerequisites: MA 13700 with a C or better* Geometric, measurement and spatial reasoning in one, two and three dimensions as the basis for elementary school geometry. Metric and non-metric geometry, transformation geometry. (At Purdue University West Lafayette, not available for credit in the School of Science.) **MA 14700. Algebra And Trigonometry For Technology** *(Class 3, Cr. 3)* *Prerequisites: MA 04100 and MA 03100 or MA 11500 with a C- or better or College Level Math CPT of 51* *(Not open to students with credit in MA 15100 or 15300.)* MA 14700 and 14800 is a two semester sequence in algebra and trigonometry for students in technology. The emphasis is on technique and problem solving. MA 14700 concentrates on topics in algebra. **MA 14800. Algebra And Trigonometry For Technology II** *(Class 3, Cr. 3)* *Prerequisites: MA 14700 with a C- or better or College Level Math CPT of 76* *(Not open to students with credit in MA 15100, MA 15400, or MA 15900.)* Continuation of MA 14700. MA 14800 concentrates on trigonometry. **MA 15300. Algebra And Trigonometry I** *(Class 3, Cr. 3)* *Prerequisites: MA 03100 and MA 04100 or MA 11500 with a C- or better or College Level Math CPT 51* *(Not open to students with credit in MA 14700, 14800, or 15100.)* MA 15300 is College Algebra. The content of MA 15300, 15400 is similar to that of MA 15900 but the pace and emphasis is directed to students who do not intend to take MA 16300. **MA 15400. Algebra And Trigonometry II** *(Class 3, Cr. 3)* *Prerequisites: MA 15300 with a C- or better or College Level Math CPT of 76* *(Not open to students wit credit in MA 14800 or 15100.)* MA 15400 is Trigonometry and is a continuation of MA 15300. **MA 15900. Precalculus** *(Class 5, Cr. 5)* *Prerequisites: MA 03100 and MA 04100 or College Level Math CPT of 76* Algebra and Trigonometry topics designed to prepare students for calculus. **MA 16300. Integrated Calculus And Analytic Geometry I** *(Class 5, Cr. 5)* *Prerequisites: MA 15100 or MA 15900 with a C- or better or College Level Math CPT of 101* Topics from plane analytic geometry. Introduction to differentiation and integration. Applications. **MA 16400. Integrated Calculus And Analytic Geometry II** *(Class 5, Cr. 5)* *Prerequisites: MA 16300 with a C- or better* Continuation of MA 16300. Completion of introductory study of topics in plane analytic geometry and the calculus of one variable, infinite series. **MA 20500. Discrete Mathematics For Computer Technology** *(Class 3, Cr. 3)* *Prerequisites: MA 14700 or MA 15300 with a C- or better or College Level Math CPT of 76* The course covers topics in discrete mathematics which are essential to the discipline of computer technology. These include: logic, sequences, mathematical introduction, basic set theory, functions, recursion, relations, graphs, and trees. **MA 21400. Linear Algebra And Linear Programming** *(Class 3, Cr. 3)* Matrix algebra, systems of equations, topics from discrete mathematics. **MA 21900. Calculus For Technology I** *(Class 4, Cr. 4)* *Prerequisites: MA 14800 with a C- or better or College Level Math CPT of 101* *(Not open to students with credit in MA 16300, MA 22300 or MA 22500.)* MA 21900 and 22200 is a two semester sequence in the techniques of calculus for student enrolled in certain technical curricula. MA 21900 develops topics from analytic geometry and introduces differentiation and integration differentiation. The offering pattern depends on the term offered. **MA 22200. Calculus For Technology II** *(Class 3, Cr. 3)* *Prerequisites: MA 21900 or MA 22100 with a C- or better* *(Not open to students with credit in MA 22400 or 16400.)* Covers differentiation and integration of trigonometric, exponential, and logarithmic functions, infinite series, and first-order differential equations. **MA 22300. Introductory Analysis I** *(Class 3, Cr. 3)* *Prerequisites: MA 15400 with a C- or better or College Level Math CPT of 101* *(Students may not have credit in more than one of the following: MA 16300, MA 22100, MA 22300 or MA 22500.)* MA 22300 and 22400 form a two-course sequence and provide an introduction to the differential and integral calculus of one and several variables, and elementary differential equation, with applications to business, behavioral and biological sciences. **MA 22400. Introductory Analysis II** *(Class 3, Cr. 3)* *Prerequisites: MA 22300 with a C- or better* *(Not open to students with credit in MA 16400 or 22200.)* Continuation of MA 22300. **MA 22500. Calculus For Business And Mathematics** *(Class 3, Cr. 3)* *Prerequisites: MA 15300 with a C- or better or College Level Math CPT of 76* *(Not open to students with credit in MA 16300, MA 22100 or MA 22300.)* Functions and Limits. Differentiation and integration of algebraic functions of one variable. Applications of differentiation and integration. **MA 26100. Multivariate Calculus** *(Class 4, Cr. 4)* *Prerequisites: MA 16400 with a C- or better* Solid analytic geometry, partial differentiation, multiple integrals. **MA 26400. Differential Equations** *(Class 3, Cr. 3)* *Prerequisites: MA 26100 with a C- or better* *(Not open to students with credit in MA 26200.)* A first course in ordinary differential equations. First order differential equations, linear and nonlinear systems of differential equations, and second order differential equations. **MA 26500. Linear Algebra** *(Class 3, Cr. 3)* *Prerequisites: MA 16400 with a C- or better* *(Not open to students with credit in MA 26200.)* An introduction to linear algebra. Systems of linear equations, matrix algebra, vector spaces, determinants, eigenvalues, eigenvectors, diagonalization of matrices, applications. **MA 31200. Probability** *(Class 3, Cr. 3)* *Prerequisites: MA 26100 with a C- or better* A calculus-based introduction to0 probability theory and stochastic processes. Topics include probability spaces, random variables, distributions, expectation conditional probability, and discrete-state-space Markov chains. **MA 31500. Introduction To Abstract Mathematics** *(Class 3, Cr. 3)* *Prerequisites: MA 26100 with a C- or better* This course is a bridge from the mainly computational mathematics courses to the upper-level abstract courses. It focuses on the development of students’ abilities to construct proofs, examples and counterexamples. **MA 33000. Concepts in Geometry** *(Class 3, Cr. 3)* *Prerequisites: MA 26100 with a C- or better* Fundamental concepts in geometry. Euclidean, non-Euclidean (including spherical and hyperbolic geometry), and fractal geometry. **MA 34800. Discrete Mathematics** *(Class 3, Cr. 3)* *Prerequisites: MA 26500 with a C- or better* A problem-centered introduction to topics in discrete mathematics including induction, permutations, combinations graphs, recurrence relations and generating functions. **MA 35100. Elementary Linear Algebra** *(Class 3, Cr. 3)* *Prerequisites: MA 26100 with a C- or better* *(Not open to students with credit in MA 26500 or 35000.)* Systems of linear equations, finite dimensional vector spaces, matrices, determinants, applications to analytical geometry. **MA 40300. Mathematical Research** *(Class 1 to 3, Cr. 1 to 3) Experiential Learning* *Prerequisites: MA 26100 with a C- or better* Undergraduate research in the mathematical sciences under the direction of a faculty member. May be used to fulfill an experiential learning requirement. Variable credit 1-3. **MA 44600. Introduction Real Analysis** *(Class 3, Cr. 3)* *Prerequisites: MA 26500 and MA 26400 and MA 31500 with a C- or better* An introduction to basic concepts of real analysis. Topology of the real line, sequences, series, and various forms of convergence. Applications to derivatives and integrals. **MA 45300. Elements Of Algebra** *(Class 3, Cr. 3)* *Prerequisites: MA 26500 and MA 31500 with a C- or better* The topics discussed are: fundamental properties of groups, rings, integral domains, fields; homomorphisms; Abelian groups and modules. **MA 45400. Galois Theory** *(Class 3, Cr. 3)* *Prerequisites: MA 45300 with a C- or better* Field extensions and automorphisms. Galois Theory. **MA 47200. Introduction to Applied Mathematics** *(Class 3, Cr. 3)* *Prerequisites: MA 26500 and MA 26400 and CS 20600 all with a C or better* An introduction to the basic ideas and methods of applied mathematics. Topics taken from elementary partial differential equations, separation of variables and Fourier series, Fourier transforms, calculus of variations, applied linear algebra, numerical methods, modeling. **MA 48000. The Practicum In Applied Mathematics** *(Class 3, Cr. 3)* The practicum course consists of a small team (a faculty advisor and 1-4 students) working on a real problem obtained in conjunction with a local business or industry. Not more then two terms of MA 48000 and/or CS 48000 may be taken for credit. (This course is the same as CS 48000.) **MA 49000. Topics In Mathematics For Undergraduates** *(Class 0 to 5, Cr.1 to 5)* Supervised reading and reports in various fields. Open only to students with the consent of the department. **MA 51000. Vector Calculus** *(Class 3, Cr. 3)* *Prerequisites: MA 26400 and MA 26500* *(Not open to students with credit in MA 36200.)* Functions of several variables: partial derivative, differential; quadratic approximation, extrema; vector calculus, gradient; line, surface and volume integrals; divergence, curl, Laplacian, integral theorems; mappings, continuity, differentiability, inverse mapping; implicit functions; orthogonal coordinates. **MA 52500. Introduction To Complex Analysis** *(Class 3, Cr. 3)* *Prerequisites: MA 26400 or MA 26500* Complex numbers and complex-valued functions; differentiation of complex functions; power series, uniform convergence; integration, contour integrals; elementary conformal mapping. **MA 54000. Analysis I** *(Class 3, Cr. 3)* *Prerequisites: MA 44600* Real number system, basic topology, infinite series, continuity, differentiation, integration. **MA 54100. Analysis II** *(Class 3, Cr. 3)* *Prerequisites: MA 54000* Sequences and series of functions, uniform convergence, equicontinuous families, the Stone-Weierstrass Theorem, Fourier series, introduction to Lebesgue measure and integration. **MA 55300. Introduction To Abstract Algebra** *(Class 3, Cr. 3)* *Prerequisites: MA 45300* Basic properties of groups, rings, integral domains, fields, polynomials Solvable groups. Finitely generated abelian groups. Algebraic and transcendental field extensions. Separable extensions. Normal extension, galois theory. **MA 55400. Linear Algebra** *(Class 3, Cr. 3)* *Prerequisites: MA 26500 and MA 31500* Vector spaces, linear transformations, matrices. Solution of systems of linear equations. Determinant. Inner product spaces; orthogonal reduction of symmetric matrices. Direct sum decompositions, characteristic values, diagonal and nilpotent transformations, Jordan normal form. **MA 55600. Introduction To The Theory Of Numbers** *(Class 3, Cr. 3)* *Prerequisites: MA 26100* Divisibility, congruences, quadratic residues, diophantine equations, the sequence of primes. **MA 56000. Fundamental Concepts Of Geometry** *(Class 3, Cr. 3)* *Prerequisites: MA 26100* Foundations of Euclidean geometry, including Euclid’s elements and detailed study of an axiom system such as that of Hilbert. Independence of the parallel axiom and introduction to non-Euclidean geometry. **MA 57100. Elementary Topology** *(Class 3, Cr. 3)* *Prerequisites: MA 44600* General topological spaces and continuity. Connectedness. Separation. Compactness. Metric spaces. Function spaces. **MA 58100. Introduction To Logic For Teachers** *(Class 3, Cr. 3)* *Prerequisites: MA 26200* Sentential and general theory of inference and nature of proof; elementary axiom systems. **MA 58300. History Of Elementary Mathematics** *(Class 3, Cr. 3)* A survey of elementary mathematics before calculus. will be made to link the history of mathematics to that of other sciences and to the social history of the relevant periods. Some acquaintance with ancient history of Europe is desirable. **MA 58700. General Set Theory** *(Class 3, Cr. 3)* *Prerequisites: MA 45300 or MA 55000* *Set algebra. Functions and relations. Ordering relations. Transfinite induction. Cardinal and ordinal numbers. The axiom of choice. Maximal principles. The continuum hypothesis. Application to algebra, analysis and topology. ** MA 59800. Topics In Mathematics*

*(Class 0 to 5, Cr. 1 to 5)*

*Directed study and reports for students who wish to undertake individual reading and study on approved topics.*

**CS 10000. An Introducation To Computer Science** *(Class 1, Cr. 1)* *Prerequisite: none.* This course is intended to: integrate freshman computer science majors into the department; help them adjust to university life; assist them in developing their academic and intellectual capabilities; introduce them to contemporary issues in computer science; provide an overview of the careers open to those with degrees in computer science. This course must be taken Pass/No Pass only. Credit by exam is not available for this course. **CS 12300. Programming I: Java** *(Class 3, Cr. 3)* *Co-requisite: MA 15100 or MA 16300, or equivalent.* This course is an introduction to computer science and computer programming. The primary language for this course is Java. The topics of the course include: identifiers, basic data types, operators, expressions, control statements, methods, recursion, program structure, arrays, objects, classes, inheritance, polymorphism, and the design of simple graphical user interfaces. **CS 12400. Programming II: C++** *(Class 3, Cr. 3)* *Prerequisite: CS 12300 with C or better, or equivalent.* This course is an extension of CS 12300 that introduces the C++ programming language. The topics of the course include: functions, program structure, pointers, objects, classes and inheritance in C++, files, standard template library, streams and the preprocessor. **CS 20600. Computer Algebra and Programming** *(Class 3, Cr. 3)* *Prerequisite: MA 16400 with C or better.* Using a computer algebra system to solve mathematics problems, learning how to translate mathematical notation and procedures into the language of the computer algebra system. Learning the basic concepts of programming languages, comparing programming concepts with mathematical concepts. **CS 22300. Computer Architecture and Assembly Language** *(Class 3, Cr. 3)* *Prerequisite: CS 12400 with C or better, or equivalent.* An introduction to the fundamental concepts of computer architecture progressing from the digital logic level to the microarchitecture level and then to the instruction set level. Assembly language and the assembly process will also be included. **CS 27500. Data Structures** *(Class 3, Cr. 3)* *Prerequisite: CS 12400 with C or better, or equivalent.* Data structures describe the way that computer programs organize and store information. This course introduces the specification, representation and manipulation of the basic data structures common to much of computer programming, such as: linked lists, arrays, stacks, queues, strings, trees, graphs, search trees, heaps, hash tables, and B-trees. **CS 30200. Operating Systems** *(Class 3, Cr. 3)* *Prerequisite: CS 22300 and CS 275 with C or better, or consent of instructor.* An operating system manages all of the hardware and software resources of a computer. This course provides an introduction to the basic concepts and terminology of operating systems. Topics will include multiprogramming, CPU scheduling, memory management, file systems, concurrent processes, multiprocessors, security, and network operating systems. **CS 30900. Discrete Mathematical Structures** *(Class 3, Cr. 3)* *Prerequisite: MA 16400 with C or better.* This course is the study of finite and discrete mathematical structures relating to the theory of computation. Topics will include directed and undirected graphs and their relation to these structures, combinatorial problems inherent in computation, Boolean algebra, and recurrence relations. **CS 31600. Programming Languages** *(Class 3, Cr. 3)* *Prerequisite: CS 27500 with C or better.* The study of programming language features and their implementation in different types of programming languages. The design goals and motivations for various languages will be discussed. Topics will include a comparison of block-structured, object-oriented, functional, and logic programming languages. The advantages and disadvantages of each type of language will be considered. Specific examples of each type of language will be included. **CS 33200. Algorithms** *(Class 3, Cr. 3)* *Prerequisite: CS 27500 with C or better.* An algorithm is a procedure for solving a problem in a finite number of steps. Algorithms, along with data structures, form the fundamental building blocks of computer programs. The types of algorithms discussed will include sorting, searching, probabilistic, graph, and geometric algorithms. The following algorithm techniques are covered: backtracking, divide and conquer, branch and bound, greedy method, and dynamic programming. **CS 34200. Introduction to Computer-Based Biomedical Image Analysis** *(Class 4, Cr. 4)* *Prerequisite: MA 15400.* Introduction to image data acquisition, manipulation, and analysis. Biomedical materials to be analyzed include elcetrophoretic gels, bacterial agar plates, cells and tissues, x-ray films, and CAT scan images. Personal computer systems and the basic programming skill of C language also will be introduced. **CS 40400. Distributed Systems** *(Class 3, Cr. 3)* *Prerequisite: CS 30200 with C or better, or consent of instructor.* A distributed system is two or more computers working together as a single unit. These systems are essential to the understanding of present and future computer applications. This course will include the following topics: concurrent processing, threads, network programming, distributed file systems, remote procedure calls, sockets, distributed objects, client-server models, and Internet protocols. **CS 41000. Automata and Computability** *(Class 3, Cr. 3)* *Prerequisite: CS 27500 and CS 30900 with C or better, or MA 45300 and consent of instructor.* A finite automaton is a mathematical model for a computational system. Computer science embodies many examples of finite state systems. This course will cover the basic principles of deterministic and non-deterministic finite automata, Turing machines, formal language theory, regular expressions, context-free grammars, the halting problem, and unsolvability. **CS 41600. Software Engineering** *(Class 3, Cr. 3)* *Prerequisite: CS 30200 with C or better.* Software engineering is the study of the theory, methods, and tools which are needed to develop large, complex software systems. This course covers the specification, design, documentation, implementation, and testing of software systems. Software life cycle, principles of project management, and case studies are also covered. A group project will be assigned. **CS 42000. Senior Design Project** *(Class 3, Cr. 3)* *Prerequisite: Senior level standing in Computer Science major.* The objective of this course is to provide students with concrete experience in writing advanced computer programs for practical application in science or industry. The student develops the necessary software using appropriate techniques and prepares documentation for the use and support of the completed system. **CS 44200. Database Systems** *(Class 3, Cr. 3)* *Prerequisite: CS 27500 with C or better.* A database is a system whose purpose is to organize, retrieve, and maintain large amounts of information. This course introduces the concepts and structures used in designing and implementing database systems. Topics include hierarchical, network, relational, and object-oriented data models, database design principles, normalization, data dictionaries, query languages and processing. **CS 45500. Computer Graphics** *(Class 3, Cr. 3)* *Prerequisite: MA 26500 and CS 27500 with C or better.* Computer graphics provides a mechanism for creating and manipulating images by means of a computer. This course covers two-dimensional curve drawing, view transformations, geometric modeling, projections, ray tracing, surface patch, three-dimensional object rendering, shading, and animation. Windows programming using OpenGL and MFC will also be introduced. **CS 49000. Topics in Computer Science for Undergraduates** *(Class 1 to 5, Cr. 1 to 5)* Supervised reading and reports in various fields. Open to students only with the consent of the department. **CS 50200. Compiling and Programming Systems** *(Class 3, Cr. 3)* Basic principles of compilers and compiler design; control of translation, loading, and execution; symbolic coding systems; lexical and syntactic analysis, design and operation of assemblers and macroprocessors; design of interpretive systems. Students are expected to complete a large programming project as part of the course. **CS 50300. Operating Systems** *(Class 3, Cr. 3)* Basic principles of operating systems: addressing modes, indexing, relative addressing, indirect addressing, stack maintenance; implementation of multitask systems; control and coordination of tasks, deadlocks, synchronization, mutual exclusion; storage management, segmentation, paging, virtual memory; protection, sharing, access control; file systems; resource management; evaluation and prediction of performance. Students are expected to spend at least three hours per week gaining hands-on experience in using and modifying a small operating system. **CS 50500. Distributed Systems** *(Class 3, Cr. 3)* Foundations for building reliable distributed systems, including failure and system models, and basic communication and agreement problems; crash failures, recovery, partition, Byzantine failures; asynchronous systems, failure detectors, communication channels, wireless and sensor networks; software clocks, causality, and cuts. Examples of problems include reliable broadcast consensus, leader election, group communication, and replication. **CS 50700. Object-Oriented Design, Analysis and Programming** *(Class 3, Cr. 3)* This course provides a rigorous introduction to the concepts behind object-oriented programming such as encapsulation, information hiding, inheritance, dynamic binding and polymorphism. We also look at object-oriented design patterns and see how they can be implemented in different object-oriented programming languages. Java and/or C++ are used as the vehicle for illustrating and implementing these concepts. **CS 51000. Software Engineering** *(Class 3, Cr. 3)* Software life cycles, requirements engineering, software design, design of distributed systems, verification and validation, software architecture, process metrics and models, and research methods in software engineering. **CS 52500. Parallel Computing** *(Class 3, Cr. 3)* Parallel computing for science and engineering applications: parallel programming and performance evaluation, parallel libraries and problem-solving environments, models of parallel computing and run-time support systems, and selected applications. **CS 53500. Interactive Computer Graphics** *(Class 3, Cr. 3)* The principles of computer graphics and interactive graphical methods for problem solving. Emphasis placed on both development and use of graphical tools for various display devices. Several classes of graphics hardware considered in detail. Topics include pen plotting, storage tubes, refresh, dynamic techniques, three dimensions, color, modeling of geometry, and hidden surface removal. Part of the laboratory involves use of an interactive minicomputer graphics system. Knowledge of programming required. **CS 54100. Database Systems** *(Class 3, Cr. 3)* Fundamentals for the logical design of database systems. The entity-relationship model, semantic model, relational model, hierarchical model, network model. Implementations of the models. Design theory for relational databases. Design of query languages and the use of semantics for query optimization. Design and verification of integrity assertions, and security. Introduction to intelligent query processing and database machines. **CS 54300. Introduction to Simulation and Modeling of Computer Systems** *(Class 3, Cr. 3)* Simulation: discrete event simulation, process oriented simulation, generating random numbers, simulation languages, simulation examples of complex systems. Nondeterministic models: random variables, Poisson process, moment generating functions, statistical inference and data analysis. Modeling: elementary queuing models, networks of queues, applications to performance evaluation of computer systems. **CS 58000. Algorithm Design, Analysis, and Implementation** *(Class 3, Cr. 3)* Basic techniques for designing and analyzing algorithms: dynamic programming, divide and conquer, balancing. Upper and lower bounds on time and space costs, worst case and expected cost measures. A selection of applications such as disjoint set union/find, graph algorithms, search trees, pattern matching. The polynomial complexity classes P, NP, and co-NP; intractable problems. **CS 5xxxx. Computer Architecture** *(Class 3, Cr. 3)* This course develops an understanding of modern computer systems for the purpose of writing more reliable and better optimized programs. The system components covered are processor cores, memory hierarchy, multi-core systems, multiprocessors. Topics include instruction set architecture, pipelining, instruction level parallelism, superscalar architecture, branch prediction, out-of-order execution, interconnection networks, shared memory, cache coherence. Emphasis will be placed on how these topics influence program performance and code optimization. **CS 59000. Topics in Computer Science** *(Class 1 to 5, Cr. 1 to 5)* Directed study for students who wish to undertake individual reading and study on approved topics.

# Statistics Course Descriptions

**STAT 13000. Statistics and Contemporary Life** *(Class 3, Cr. 3) 3) General Education* Introduction to statistical ideas and their impact on various aspects of modern life. Topics will include the organization, manipulation, and understanding of numerical data, the art of data presentation, interpretation of statistical information as presented in the media, the concept of randomness in gambling and lotteries, and some discussion of statistical fallacies. **STAT 30100. Elementary Statistical Methods I** *(Class 3, Cr. 3)* *Prerequisites: MA 14700* A basic introductory statistics course with applications shown to various fields and emphasis placed on assumption, applicability, and interpretations, or various statistical techniques. Subject matter includes frequency distributions, descriptive statistics, elementary probability, normal analysis of variance, with emphasis on distribution applications, sampling distribution, estimation, hypothesis testing and linear regression. **STAT 31500. Introduction To Probability And Statistics** *(Class 3, Cr. 3)* Probability theory with a short-introduction to statistics. Not enough statistics to serve as a preparation for a second course in statistics. **STAT 33000. Biostatistics** *(Class 3, Cr. 3)* *Prerequisites: MA 15300 and BIOL 10100 and BIOL 10200 or BIOL 10800 and BIOL 10900* *(Not open to students with credit in BIOL 33000.)* This course will explore fundamental concepts of statistical methods and their application in biological research. The following topics will be included: experimental and sampling designs; descriptive statistics; basic probability and probability distribution; tests of hypothesis; one-way analysis of variance; linear regression. Emphasis will be placed on the collection, organization, analysis and interpretation of data from biological experiments and observations. **STAT 34500. Statistics** *(Class 3, Cr. 3)* *Prerequisites: MA 16400* Topics from exploratory data analysis and inferential statistics will be covered, along with a necessary introduction to probability. Statistical and probabilistic simulations will be used to enhance students’ understanding of randomness and variation. Extensive use of a statistical computer package will be required. **STAT 49000. Topics In Statistics For Undergraduates** *(Class 0 to 5, Cr. 1 to 5)* Supervised reading and reports in various fields. Open only to students with the consent of the department. **STAT 50100. Experimental Statistics I** *(Class 3, Cr. 3)* *Prerequisites: MA 15300 or MA 15900* *(Primarily intended for students who have not had calculus.)* *(Not open to students in mathematics, statistics, or computer science.)* *(Credit should not be allowed in more than one of STAT 30100, STAT 50100,or STAT 51100.)* Fundamental concepts and methods of statistics for students interested in the analysis of experimental data. Subjects include descriptive statistics, basic probability theory, normal distribution, tests of hypotheses and confidence intervals for normal and Bernoulli populations, contingency tables, tests of goodness-of-fit, linear regression and non parametric test. **STAT 50200. Experimental Statistics II** *(Class 3, Cr. 3)* *Prerequisites: STAT 50100* Continuation of STAT 50100. Subject matter includes multiple regression and analysis of variance, with emphasis on statistical inference and applications to various fields. **STAT 51100. Statistical Methods** *(Class 3, Cr. 3)* *Prerequisites: MA 26100* Descriptive statistics; elementary probability; sampling distributions; inference, testing hypotheses, and estimation; normal, binomial, poison, hypergeometric distributions; one way analysis of variance; contingency tables; regression. **STAT 51200. Applied Regression Analysis** *(Class 3, Cr. 3)* *Prerequisites: STAT 51100 or STAT 51700* Inference in simple and multiple linear regression, residual analysis, transformations, polynomial regression, model building with real data, nonlinear regression. One-way and two-way analysis of variance, multiple comparisons, fixed and random factors, analysis of covariance. Use of existing statistical computer programs. **STAT 51300. Statistical Quality Control** *(Class 3, Cr. 3)* *Prerequisites: STAT 51100 or STAT 51600* A strong background in control charts including adaptations, acceptance plans, sequential analysis, statistics of combinations, moments and probability distributions, applications. <!– **STAT 51400. Design Of Experiments** *(Class 3, Cr. 3)* *Prerequisites: STAT 51100 or STAT 51200* Fundamentals, completely randomized design; randomized complete blocks; latin square; multi-classification; nested factorial; incomplete block and fractional replications for 2n,3n,2m x 3n; confounding; lattice designs; general minded factorials; split plot; analysis of variance in regression models; optimum design. Use of existing statistical programs. –> **STAT 51600. Basic Probability and Applications** *(Class 3, Cr. 3)* *Prerequisites: MA 16400 or MA 22400* *Co-requisite: MA 26100* A first course in probability intended to serve as a background for statistics and other applications. Sample spaces and axioms of probability, discrete and continuous random variables, conditional probability and Bayes’ theorem, joint and conditional probability distributions, expectations, moments and moment generating functions, law of large numbers and central limit theorem. (The probability material in Course 1 of the Society of Actuaries and the Casualty Actuarial Society is covered in this course.) **STAT 51700. Statistical Inference** *(Class 3, Cr. 3)* *Prerequisites: STAT 51600 or STAT 51900* A basic course in statistical theory covering standard statistical methods and their applications. Estimation including unbiased, maximum likelihood and moment estimation; testing hypothesis for standard distributions, and contingency tables; confidence intervals and regions; introduction to non-parametric tests and linear regression. **STAT 53200. Elements Of Stochastic Processes** *(Class 3, Cr. 3)* *Prerequisites: STAT 51900* A basic course in stochastic models, including discrete and continuous time Markov Chains and brownian motion, as well as an introduction to topics such as Gaussian processes, renewal processes, replacement, and reliability problems.