Department of Mathematical Sciences (CSC, MAT, STA) College of Arts & Sciences 383 Bryan Building Accelerated Master's Program for Mathematics Majors  Computer Science Courses (CSC)  Computer Science Major (BS)  Computer Science Minor  Honors in Computer Science  Honors in Mathematics  Major Requirements  Mathematics as Second Major  Mathematics Courses (MAT)  Mathematics Major (BA and BS)  Mathematics Major with Secondary SubjectArea Teacher Licensure  Mathematics Minor  Statistics Courses Faculty Paul F. Duvall, Professor and Head of Department Professor J.Vaughan; Associate Professors BlanchetSadri, Gentry, Herr, Kissling, Landman, Lea, Long, Ludwig, Sadri, T. Vaughan, Wang; Assistant Professors Byrd, Fabiano, Gadbury, Love; Instructor Kilgariff; Lecturers Blackmon, Bradley, Carter, Howell, Keith, Koehler, Montgomery, O'Connor, Sallez, Sen, Shelton, Weigel The Department of Mathematical Sciences offers undergraduate programs leading to the BA and BS degrees in Mathematics and the BS degree in Computer Science. The BS degree in Computer Science is accredited by the Computer Science Accreditation Commission of the Computing Sciences Accreditation Board. The Department also offers graduate programs leading to the MA degree in Mathematics (with specialities available in pure mathematics, applied mathematics, or applied statistics), and the MS degree in Computer Science. Mathematics and Computer Science are excellent majors for the student whose immediate objective is to acquire a strong liberal arts education. The goal of all of the Department's programs is to produce students who are both technically competent and sufficiently well grounded in theory that they can contribute to fundamental research in their chosen specialty. To give a professional direction to the student's liberal arts education, the mathematics major may elect a concentration in pure mathematics, applied mathematics, statistics or computer science, or seek secondary teacher certification. Students seeking secondary teacher licensure should see Teacher Education Programs. There are many opportunities for the undergraduate majors in the mathematical sciences in industry, government, business, and secondary school teaching. An undergraduate major in the mathematical sciences also provides excellent preparation for graduate studies in many areas, including actuarial sciences, computer science, economics, engineering, law, mathematics, operations research and statistics. The majors can be specialized to allow preparation for any of these goals. The department offices, classrooms, and study areas are located in the Bryan Building. Students have access to computing facilities including personal computer laboratories, and workstations. The campus is fully networked locally. The University is an Internet node, and students and faculty have access to the Internet's many features. Degree: Bachelor of Arts Required: 122 semester hours, to include at least 36 hours at or above the 300 course level Degree: Bachelor of Science Required: 122 semester hours, to include at least 36 hours at or above the 300 course level
Requirements College of Arts and Sciences Liberal Education Requirements (CLER) (5455 hours)All students must meet the AllUniversity Liberal Education Requirements (AULER). The College of Arts and Sciences, however, has established liberal education requirements for its programs which, while including those of AULER, contain additional requirements in several categories. Therefore, students following this program should adhere to the College requirements. Please note that students who satisfy the College Liberal Education Requirements (CLER) will also satisfy the AllUniversity Liberal Education Requirements (AULER). See a complete description of the College requirements and courses that meet those requirements. The mathematics major must complete courses as specified below, and must maintain a grade point average of at least 2.0 in MAT/CSC/STA courses required for the major. It is strongly recommended that students planning to pursue graduate study in Mathematics include at least two courses from MAT 591, 592, 595, 596, and two other courses from MAT 514, 515, 516, 517, 518, 531, 532, 540, 541, 542, 545, 546, 549, 556, 591, 592, 595, 596. Requirements for the Bachelor of Arts
Requirements for the Bachelor of ScienceThere are four concentrations in the Bachelor of Science degree: Pure Mathematics, Applied Mathematics, Computer Science, and Statistics. Students must select a concentration. Pure Mathematics Concentration
Applied Mathematics Concentration
Computer Science Concentration
Statistics Concentration
Mathematics Major with Secondary SubjectArea AOS Codes:
Students seeking secondary teacher licensure must satisfy the requirements for the BA or BS degree and must include in their program: CSC 322 or MAT 390; STA 271 or 351; MAT 504, 505, 513; one course chosen from: MAT 514, 515, 516, 517, 518, 519, 520, 521, 531,540, 549, 595, 596. Additional hours may be required for completion of the the degree. Please see teacher licensure requirements in Teacher Education Programs. Requirements for a Second Major in Mathematics are the same as for the Mathematics Major (BA or BS degree). Required: minimum of 15 semester hours The minor in mathematics consists of at least 15 hours of work, chosen as follows:
NOTE: All minor programs must be approved by the Department of Mathematical Sciences. Interested students should see Accelerated Master's Programs for Undergraduates for details about the BA or BS in Mathematics/MA in Mathematics program requirements. Requirements3 hours of HSS 490 (senior thesis), directed by a faculty member of the Department of Mathematical Sciences Qualifications
RecognitionThe designation "Honors in Mathematics" will be printed on the student's official transcript. Mathematics Courses (MAT) Degree: Bachelor of Science Required: 122 semester hours, to include at least 36 hours at or above the 300 course level AOS Code: U180The BS degree in Computer Science is accredited by the Computer Science Accreditation Commission of the Computing Sciences Accreditation Board. Requirements College of Arts and Sciences Liberal Education Requirements (CLER) (5455 hours)All students must meet the AllUniversity Liberal Education Requirements (AULER). The College of Arts and Sciences, however, has established liberal education requirements for its programs which, while including those of AULER, contain additional requirements in several categories. Therefore, students following this program should adhere to the College requirements. Please note that students who satisfy the College Liberal Education Requirements (CLER) will also satisfy the AllUniversity Liberal Education Requirements (AULER). See a complete description of the College requirements and courses meeting AULER/CLER requirements. Major Requirements
Supporting Discipline Requirements
Science Requirements
Students must maintain a grade point average of at least 2.0 in the core courses, required electives, and required supporting discipline courses. Because computer science courses change rapidly, it is recommended that the sequence 130, 230, 330 be completed within four (4) consecutive semesters. Required: minimum of 15 semester hours The minor in computer science consists of at least 15 hours of work, chosen as follows:
The Computer Science Minor requires 3 to 4 semesters to complete. NOTE: All minor programs must be approved by the Department of Mathematical Sciences. Requirements3 hours of HSS 490 (senior thesis), directed by a faculty member of the Department of Mathematical Sciences Qualifications
RecognitionThe designation "Honors in Computer Science" will be printed on the student's official transcript. For Undergraduates 101 Introduction to Computer Concepts (3:3).Introduction to computers and computing. Topics cover impact of computers on society, ethical issues, hardware, and software applications. (FA,SP) 130 Introduction to Computer Science (3:3).Pr. acceptable score on the mathematics placement test or a grade of at least C in MAT 119. Programming in a highlevel language. Emphasis on problem analysis, problemsolving techniques, and software design principles and techniques. (FA,SP) 230 Elementary Data Structures and Algorithms (3:3).Pr. grade of at least C in 130. Advanced syntax of high level language taught in CSC 130. Emphasis on modularization and abstraction. BigO analysis of algorithms. Design and use of abstract data types with various implementations. (FA,SP) 237 Programming Language Laboratory (1 to 3; 1 to 3).
Syntax and use of a programming language. Language covered announced at preregistration. 261 Computer Organization and Assembly Language (3:3).Pr. grade of at least C in 230 and in MAT 253. CPU, memory, I/O devices, digital logic design, psw. Number representations and machine language. Assembly language instruction types, registers, addressing, arithmetic, instruction format, opcodes, pseudoopcodes, assembler directives, system calls, and macros. (FA) 312 Ethics in Computer Science (1:1).Pr. grades of at least C in 230 and in MAT 253.
Historical and social context of computing, ethical responsibilities of the computing professional, intellectual property rights, and risks and liabilities. (SP) 322 Linear Programming (3:3).Pr. grade of at least C in MAT 310. Covers simplex computational procedure, minimum feasible solutions, artificialbasis technique, slack variables, perturbation techniques, cycling, parametric objective and dual problems, sensitivity analysis, and decomposition algorithms. 330 Advanced Data Structures (3:3).Pr. grades of at least C in 230 and in MAT 253. Static and dynamic data structures emphasizing binary trees and graphs. Advanced programming techniques. Advanced sorting and searching algorithms. Hashing techniques. Performance analysis. Methods of developing large applications programs. (FA,SP) 339 Concepts of Programming Languages (3:3).Pr. grade of at least C in 330. Concepts of blockstructured, objectoriented, functional, logic, and concurrent programming languages. Comparative study of syntactic and semantic features of these languages and writing programs using them. (SP) 340 Software Engineering (3:3).Pr. grade of at least C in in 330. Practical and theoretical concepts of software engineering. (SP) For Advanced Undergraduates and Graduate Students 521 Computer Graphics and Image Processing (3:3).Pr. grades of at least C in 330 and in MAT 353, or permission of instructor. Survey of graphics and image processing hardware, algorithms, data structures, and techniques. (Even SP) 523 Numerical Analysis and Computing (3:3).Pr. grades of at least C in 130, and in MAT 353 and MAT 293. Number systems and errors, solutions of nonlinear and linear systems, eigenvalue problems, interpolation and approximation, numerical differentiation and integration, solution of differential equations. (Even FA) 524 Numerical Analysis and Computing (3:3).Pr. grade of at least C in 523. Continuation of 523 with special topics in numerical analysis, emphasis on applied mathematics. (Odd SP) 529 Artificial Intelligence (3:3).Pr. grade of at least C in 330. Knowledge representations. Resolution refutation systems. Bestfirst search algorithms. Heuristic, minimax, alphabeta pruning techniques. Selected topics from machine learning, natural language processing, expert systems, neural networks. Functional or logic programming language. (Odd SP) 539 Introduction to Compiler Design (3:3).Pr. grades of at least C in 261 and 330 or permission of instructor. Successful completion of 553 helpful. Basic techniques of compiler design and implementation: lexical analysis, parsing, code generation. Sizable programming project implementing a compiler for a blockstructured language with strong typing. (Even SP) 553 Theory of Computation (3:3).Pr. grade of at least C in MAT 353 and programming experience. Finite state automata and regular expressions, contextfree grammars, pushdown automata and their use in parsing, overview of language translation systems, models for programming language semantics, computability and undecidability. (FA) 555 Algorithm Analysis and Design (3:3).Pr. grade of at least C in 330. Sequential algorithm design and complexity analysis. Dynamic programming. Greedy algorithms. Graph algorithms. Selected advanced topics from NPcompleteness; approximation, randomized, parallel, numbertheoretic algorithms; Fast Fourier Transform; computational geometry; string matching. (FA) 561 Principles of Computer Architecture (3:3).Pr. grades of at least C in 261, MAT 253 or permission of instructor. Hardware and software components of computer systems, their organization and operations. Topics: comparative instruction set architectures, microprogramming, memory management, processor management, I/O, interrupts, and emulation of processors. (FA) 562 Principles of Operating Systems (3:3).Pr. grades of at least C in 261 and 330 or permission of instructor. Successful completion of 561 helpful. Techniques and strategies used in operating system design and implementation: managing processes, input/output, memory, scheduling, file systems, and protection. (SP) 563 Basic Systems Administration Laboratory (1:0:3).Coreq. 562 and 567, or knowledge of operating systems and networks Installing operating systems, peripherals, hardware, and software. Backups, recompiling the kernel (loading/unloading modules), providing web services, and user administration. (FA/SP) 564 Intermediate Systems Administration Laboratory (1:0:3).Pr. 563. Topics selected from routing, firewall, Primary Domain Controller, Backup Domain Controller, Domain Controller trust, SAMBA, DNS round robin, and PPP connectivity setup. (FA/SP) 565 Advanced Systems Administration Laboratory (1:0:3).Pr. 564. Automated installation, software installation, systems programming, system administration in a large organization. Projects will include departmental or university computer system work. (FA/SP) 567 Principles of Computer Networks (3:3).Pr. grades of at least C in CSC 261 and 330 or equivalent courses. Hardware and software components of computer networks, their organization and operations. Topics: open system interconnection; local area networks; TCP/IP internetworking, routing, and packet switching; network programming. (SP) 570 Principles of Database and KnowledgeBase Systems (3:3).Pr. grade of at least C in CSC 330, or permission of instructor. Contemporary database and knowledgebase systems. Emphasis on relational, extended relational, deductive, and objectoriented models. Query processing, modeling and implementation of applications in these models. (FA) 580 Cryptography and Security in Computing (3:3).Pr. 330 and one of 561, 562, 567, or 570; or permission of instructor. Modern development of cryptography and secure encryption protocols. Program security and viruses. Operating system protection. Network and distributed system security. Database security. Administering security. (FA) 593, 594 Directed Study in Computer Science (1 to 3), (1 to 3). (FA,SP)For Undergraduates 100 Intermediate Algebra (3:3).
Real numbers and their properties, linear equations, systems of equations, polynomials and functions, fractional expressions, exponents and roots, quadratic equations, graphing, inequalities. (FA,SP) 112 Contemporary Topics in Mathematics (3:3).AULER/CLER: MT, CMT Selected topics from sets and logic, mathematical systems, statistics and probability, geometry and matrix algebra, consumer mathematics. Designed primarily for liberal arts students. (FA,SP) 119 College Algebra (3:3).AULER/CLER: MT, CMT Pr. an acceptable score on the mathematics placement test or a grade of at least C in 100. Review of elementary algebra, equations, inequalities, relations, functions, transformations, graphing, complex numbers, polynomial and rational functions. (FA,SP) 120 Calculus for Business and the Social Sciences (3:3).AULER/CLER: MT, CMT Pr. an acceptable score on the mathematics placement test or a grade of at least C in 119.
Limits and introductory differential calculus of the algebraic, exponential, and logarithmic functions of one variable. (FA,SP) 121 Analytic Trigonometry (3:3).AULER/CLER: MT, CMT Pr. an acceptable score on the mathematics placement test or a grade of at least C in 119. Review of relations, trigonometric (circular) functions and identities, exponential and logarithmic functions, solutions of triangles, equations of second degree and their graphs. (FA,SP) 191 Calculus I (3:3).AULER/CLER: MT, CMT Pr. a grade of at least C in 121 or permission of the instructor.
Limits and introductory differential calculus of the algebraic and transcendental functions of one variable. (FA,SP) 220 Plane and Solid Analytic Geometry (3:3).Pr. grade of at least C in 121 or equivalent.
Study of conic sections (including rotation of axes), graphing with polar coordinates, quadric surfaces, and vectors. (SP) 253 Discrete Mathematics I (3:3).Pr. grade of at least C in 121, acceptable score on mathematics placement test, or consent of instructor.
Mathematical reasoning techniques and concepts in computer science. Topics include sets, functions, sequences, relations, induction and recursion, boolean algebra, and elementary propositional and predicate logic, including proof techniques. (FA,SP) 292 Calculus II (3:3).Pr. a grade of at least C in 191 or permission of the instructor. A continuation of the study of differential calculus of the elementary transcendental functions, introductory integral calculus of the algebraic and transcendental functions of one variable, techniques of integration, indeterminate forms, improper integrals. (FA,SP) 293 Calculus III (3:3).Pr. grade of at least C in 292. Infinite series, Taylor's formula, conic sections, parametric equations, integration using polar coordinates, vectors, surfaces, vectorvalued functions. (FA,SP) 295 Proofs and Mathematical Structures (3:3).Pr. grade of at least C in 292.
An introduction to basic mathematical concepts needed for most upper level mathematics courses. The language and logic of proofs, basic set theory, relations, functions, numbers, counting, cardinalities, introduction to algebra. 303 Topics in Mathematics (3:3).
Primarily for students seeking grades 69 certification. Extensive study of rational, irrational and real numbers; selected topics from number theory; clock and modular arithmetic. Concrete models used to illustrate many of the mathematical concepts studied. 304 Introduction to the Foundations of Geometry (3:3).
Introductory course primarily for students seeking grade 69 certification. Designed to develop an understanding of the fundamental ideas of geometry. Includes both an intuitive and deductive study of points, lines, planes, curves, surfaces, congruences, parallelism, similarity and linear, angular, area, and volume measures. 310 Matrix Theory (3:3).Pr. grade of at least C in 292. Matrices, equivalence relations for square matrices, determinants, finite dimensional vector spaces, linear transformations, eigen vectors. (FA,SP) 311 Modern Algebra (3:3).Pr. grade of at least C in 310. Introduction to theory of groups, rings, integral domains and fields, including basic properties of polynomials. (FA,SP) 345 Vector and Tensor Analysis (3:3).Pr. grade of at least C in 293 and 390. Vectors, scalar fields, vector fields. Dot and cross product. Vector differentiation and integration. Gradient, divergence and curl. Green's theorem, divergence theorem, Stokes' theorem. Curvilinear coordinates. Tensor Analysis: Physical laws. Coordinate transformations. Contravariant and covariant vectors. Contravariant, covariant, and mixed tensors. Tensor fields. Symmetric and skewsymmetric tensors. Conjugate or reciprocal tensors. Associated tensors. Transformation laws of Christoffel's symbols. Tensor form of gradient, divergence, and curl. 353 Discrete Mathematics II (3:3).Pr. grade of at least C in 253 or permission of instructor. Problemsolving and modeling using techniques and concepts of Discrete Mathematics with applications to algorithms. Topics include elementary graph theory, combinatorics, difference equations, and linear algebra. (FA) 390 Ordinary Differential Equations (3:3).Pr. grade of at least C in 292. First order differential equations and linear equations of finite order, Laplace transforms, undetermined coefficients, variation of parameters, power series solutions near ordinary or regular singular points, applications, numerical methods. (SP) 394 Calculus IV (3:3).Pr. grade of at least C in 293. Partial differentiation, multiple integrals, vector calculus. (FA,SP) 395 Introduction to Mathematical Analysis (3:3).Pr. grade of at least C in 293, 310. Introduction to fundamental concepts of single variable calculus, including properties of real numbers, notion of limit, continuity, differentiation, integration, and infinite series. (FA) 493 Honors Work (36).See prerequisites, Honors Program.
For Advanced Undergraduates and Graduate Students 503 Problem Solving in Mathematics (3:3).Pr. grade of at least C in 191 and 303 or permission of instructor.
Investigates the nature of problem solving, covers procedures involved in problem solving, develops individual problem solving skills, and collects a set of appropriate problems. Required for middle grades mathematics concentration. 504 Foundations of Geometry for Teachers (3:3).Pr. grade of at least C in 292 or permission of instructor.
Primarily for students seeking teacher certification. Includes logic and axiom systems, history, plane and solid Euclidean geometry, proof strategies, introduction to nonEuclidean geometries, and transformational geometry. (FA) 505 Foundations of Mathematics for Teachers (3:3).Pr. grade of at least C in 292 or 303 or permission of instructor.
Primarily for students seeking teacher certification. Includes properties and algebra of real numbers; analytic geometry; polynomial, rational, exponential, logarithmic, and trigometric functions; complex numbers; concept of limits of functions. (SP) 513 Historical Development of Mathematics (3:3).Pr. grade of at least C in 292. Study of the historical development of mathematics, not a history of persons involved in development. (FA) 514 Theory of Numbers (3:3).Pr. grade of at least C in 311 or permission of instructor. An introductory course to both multiplicative and additive number theory. Divisibility, prime numbers, congruences, linear and nonlinear Diphantine equations (including Pell's equation), quadratic residues, numbertheoretic functions, and other topics. 515 Mathematical Logic (3:3).Pr. grade of at least C in 253 or 311 or permission of instructor. Formal languages, recursion, compactness, and effectiveness. Firstorder languages, truth, and models. Soundness and completeness theorems. Models of theories. (Odd SP) 516 Polynomial Rings (3:3).Pr. grade of at least C in 311. Rings, integral domains, fields, division algorithm, factorization theorems, zeros of polynomials, greatest common divisor, relations between the zeros and the coefficients of a polynomial, formal derivatives, prime polynomials, Euclidean rings, the fundamental theorem of algebra. 517 Theory of Groups (3:3).Pr. grade of at least C in 311. Elementary properties of groups and homomorphisms, quotients and products of groups, the Sylow theorems, structure theory for finitely generated Abelian groups. 518 Set Theory and Transfinite Arithmetic (3:3).Pr. grade of at least C in 311 or 395. The axioms of set theory, operations on sets, relations and function, ordinal and cardinal numbers. 519 Intuitive Concepts in Topology (3:3).Pr. grade of at least C in 311 or 395. Basic concepts, vector fields, the Jordan curve theorem, surfaces, homology of complexes, continuity. 520 NonEuclidean Geometry (3:3).Pr. grade of at least C in 311 or 395. Fifth postulate, hyperbolic geometries, elliptic geometries, consistency of nonEuclidean geometries, models for geometries, elements of inversion. 521 Projective Geometry (3:3).Pr. consent of instructor. Transformation groups and projective, affine and metric geometries of the line, plane, and space. Homogeneous coordinates, principles of duality, involutions, crossratio, collineations, fixed points, conics, ideal and imaginary elements, models, and Euclidean specializations. 522 Hilbert Spaces and Spectral Theory (3:3).Pr. grade of at least C in 311 or 395. Vectorspaces: basis, dimension, Hilbert spaces; preHilbert spaces, norms, metrics, orthogonality, infinite sums. Linear subspaces; annihilators, closed and complete subspaces, convex sets. Continuous linear mappings; normed spaces. Banach spaces, Banach algebras, dual spaces. ReiszFrechet theorem. Completion. Bilinear and seaquilinear maps. Adjoints. Operators in Hilbert space: isometric, unitary, selfadjoint, projection, and normal operations. Invariant subspaces. Continuous operators. Special theorems for a normal cooperator. 531 Combinatorial Analysis (3:3).Pr. grade of at least C in 253 or 295 or 311 or 395, or permission of instructor. The pigeonhole principle, permutations, combinations, generating functions, principle of inclusion and exclusion, distributions, partitions, recurrence relations. 532 Introductory Graph Theory (3:3).Pr. grade of at least C in 310 and any one of the courses 253, 295, 311, 395, 531. Basic concepts, graph coloring, trees, planar graphs, networks. 540 Complex Functions with Applications (3:3).Pr. grade of at least C in 293. The complex number system, holomorphic functions, power series, complex integration, representation theorems, the calculus of residues. 541, 542 Stochastic Processes (3:3), (3:3).Pr. grade of at least C in MAT 394 and either MAT 353 or STA 351, or equivalents. Markov processes, Markov reward processes, queuing, decision making, graphs and networks. Applications to performance, reliability, and availability modeling. 545 Differential Equations and Orthogonal Systems (3:3).Pr. grade of at least C in 293 and 390 or permission of instructor. An introduction to Fourier series and orthogonal sets of functions, with applications to boundary value problems. 546 Partial Differential Equations with Applications (3:3).Pr. grade of at least C in 545. Fourier integrals, Bessel functions, Legendre polynomials and their applications. Existence and uniqueness of solutions to boundary value problems. 549 Topics in Applied Mathematics (3:3).Pr. grade of at least C in 293 and 390 or permission of instructor.
Selected topics of current interest in applied mathematics. 556 Advanced Discrete Mathematics (3:3).Pr. grade of at least C in 253 or consent of instructor. Advanced topics in discrete mathematics and their uses in studying computer science. (Even SP) 591 Advanced Modern Algebra (3:3).Pr. grade of at least C in 311. Set theory: sets, mappings, integers. Group theory: normal subgroups, quotient groups, permutation groups, Sylow theorems. Ring theory: homomorphisms, ideals, quotient rings, integral domains, fields, Euclidean rings, polynomial rings. 592 Abstract Algebra (3:3).Pr. grade of at least C in 591 or 311 with permission of instructor. Fields: extensions, transcendental elements, roots of polynomials, Euclidean constructions. Galois theory, solvability by radicals. 593, 594 Directed Study in Mathematics (1 to 3), (1 to 3). (FA,SP)595, 596 Mathematical Analysis (3:3), (3:3).Pr. 395 or permission of instructor. Real number axioms, metric spaces, sequences, series, continuity, differentiation, the ReimannStieltjes integral. For Undergraduates 108 Elementary Introduction to Probability and Statistics (3:3).AULER/CLER: MT, CMT Pr. an acceptable score on the mathematics placement test or a grade of at least C in MAT 100.
Finite sample spaces, discrete probability, random variables, expected value, binomial distribution, independent trials, random samples, point estimation, hypothesis testing, and confidence intervals. (FA,SP) 271 Fundamental Concepts of Statistics (3:3).Pr. grade of at least C in MAT 119 or STA 108 or permission of department. Survey of basic descriptive and inferential statistics for undergraduates from any discipline. Graphical and descriptive techniques. Measures of central tendency, variability, correlation. Estimation. Normal tests, ttests, analysis of variance. Emphasis on statistical literacy and interpretation. (FA,SP) 351 Probability (3:3).Pr. grade of at least C in MAT 292. Basic probability theory; combinatorial probability, conditional probability and independent events; univariate and multivariate probability distribution functions and their properties. (FA) 352 Statistical Inference (3:3).Pr. grade of at least C in 351 or permission of instructor. Descriptive and inferential statistics. Emphasis on sampling distributions; theory of estimation and tests of hypotheses, linear hypothesis theory, regression, correlation and analysis of variance. (SP) For Advanced Undergraduates and Graduate Students 551, 552 Introduction to Probability and Mathematical Statistics (3:3), (3:3).Pr. grade of at least C in 351 and MAT 293 or permission of instructor. Events and probabilities (sample spaces), dependent and independent events, random variables and probability distribution, discrete and continuous distributions, expectation, moment generating functions, point estimation, multivariate normal distribution, testing hypotheses, confidence intervals, correlation and regression, small sample distributions. 571 Statistical Methods for Research I (3:3).Coreq. enrollment in 571L.
Introduction to statistical concepts. Basic probability, random variables, the binomial, normal and Student's t distributions, hypothesis tests, confidence intervals, chisquare tests, introduction to regression, and analysis of variance. (FA) 571L Statistical Methods Laboratory I (1:0:2).Coreq. enrollment in 571.
Using statistical software packages for data analysis. Problems parallel assignments in 571. (FA) 572 Statistical Methods for Research II (3:3).Pr. 571 and 571L or permission of instructor; coreq. enrollment in 572L. Statistical methodology in research and use of statistical software. Regression, confidence intervals, hypothesis testing, design and analysis of experiments, one and twofactor analysis of variance, multiple comparisons, hypothesis tests. (SP) 572L Statistical Methods Laboratory II (1:0:2).Pr. 571 and 571L or permission of instructor; coreq. enrollment in 572. Using statistical software packages for data analysis. Problems parallel assignments in 572. (SP) 573 Theory of Linear Regression (3:3).Pr. grade of at least C in 352 and MAT 310, or 662, or permission of instructor. Linear regression, least squares, inference, hypothesis testing, matrix approach to multiple regression. Estimation, GaussMarkov Theorem, confidence bounds, model testing, analysis of residuals, polynomial regression, indicator variables. 574 Theory of the Analysis of Variance (3:3).Pr. grade of at least C in 573 or permission of instructor. Multivariate normal distribution, oneway analysis of variance, balanced and unbalanced twoway analysis of variance, empty cells, multiple comparisons, special designs, selected topics from random effects models. 575 Nonparametric Statistics (3:3).Pr. grade of at least C in 352 or 572 or 662, or permission of instructor. Introduction to nonparametric statistical methods for the analysis of qualitative and rank data. Binomial test, sign test, tests based on ranks, nonparametric analysis of variance, nonparametric correlation and measures of association. (Even FA) 593, 594 Directed Study in Statistics (1 to 3), (1 to 3). (FA,SP).Please refer to The Graduate School Bulletin for additional CSC, MAT, and STA graduate level courses. 


