The School of Business and Technology

Course Descriptions

Computer Science
Mathematics

COMPUTER SCIENCE 

CSDP 150 Word Processing Workshop — 1 cr.

Introduction to current progress in word processing and/or office automation. This workshop involves considerable hands-on work with current equipment. It does NOT satisfy the General Education Area III requirement. It may be repeated up to six times (with different topics) for a maximum of six credits. Prerequisites: Vary depending on topic selected.

CSDP 151 Special Software Workshop — 1 cr.

Intensive introduction to various commercially available software packages such as spreadsheet and database packages, etc. This workshop involves considerable hands-on work with current equipment. It does NOT satisfy the General Education Area III requirement. This workshop may be repeated up to six credits. 

Prerequisites: Vary depending on the topic selected.

CSDP 152 Programming Techniques Workshop — 1 cr.

Intensive introduction to special programming techniques, e.g., handling disk files on microcomputers, and writing computer-assisted instruction materials, etc. This workshop involves considerable hands_on experience in the area chosen. It does NOT satisfy the General Education Area III requirement. This workshop may he repeated up lo six times (with different topics) for a maximum of six credits 

Prerequisites: Vary depending on the topic selected. 

CSDP 153 Programming Language Workshop — 1 cr.

Intensive introduction to special implementations of programming languages, e.g., hypertext, and operating systems languages, etc. This course involves considerable hands-on experience in the area chosen. It does NOT satisfy the General Education Area III requirement. This workshop may be repeated up to six times (with different topics) for a maximum of six credits. 

Prerequisites: Vary depending on the topic selected.

CSDP 154 Computer Hardware Workshop — 1 cr.

Intensive introduction to new hardware and hardware methodology in special area, e.g., microcomputer interacting with analogue devices, small-system data communications, etc. This course involves considerable hands-on experience in the area chosen. It does NOT satisfy the General Education Area I requirement. This workshop may be repeated up to six credits. 

Prerequisites: Vary depending on the topic selected.

CSDP 155 Computer Utilities Workshop — 1 cr.

Intensive introduction to special computer utilities and operating systems such as OS/2 and UNIX. This course involves considerable hands-on experience with the utilities or systems chosen. It does NOT satisfy the General Education Requirement in Area III. This workshop may be repeated up to six times (with different topics) for a total of six credits. 

Prerequisites: Vary depending on topic selected.

CSDP 220 Intro. to Computer Programming — 4 cr.

This course is designed to introduce the student to computers and to programming in a high level language. All of the Computer Science courses which follow depend upon this introductory course. Computer hardware, software algorithms, and programming methodology are introduced. The programming language C++ is used to learn input/output, arithmetic computation, control structures, subroutines and functions, string manipulation, arrays and pointers. Heavy emphasis is placed on the writing, correcting and running of programs in the computer laboratory. 

CSDP 222 Advanced Programming — 4 cr.

Review of advanced programming language features. Structured programming and correctness, top-down and object-oriented techniques; team projects and structured walkthroughs. Much of the work in this course involves the construction and running of more extensive programs and series of programs that accomplish realistic applications. 

Prerequisite: CSDP 220.

CSDP 240 Principles of Data Processing — 3 cr.

An introduction to the COBOL language and its business data processing environment; the four divisions, arithmetic, input/output, control statements, control-break logic, tables and searching logic. Assignments will involve extensive use of the computer. 

Prerequisite: CSDP 220.

CSDP 241 File Structures — 3 cr.

An introduction to the theory of file structures and the realization of this theory throughout programming; sequential direct, indexed sequential access methods: entry, updating and reports. The relationship between file structures and program structures. Extensive programming required. 

Prerequisites: CSDP 222 and CSDP 240.

CSDP 250 Introduction to Data Structures — 3 cr.

An introduction to the analysis and implementation of data structures and object-oriented programming styles. Topics may include search algorithms, sorting algorithms, linked lists, queues, stacks, binary trees, graphs and garbage collections. 

Prerequisite: CSDP 222.

CSDP 301 Machine and Assembly Languages — 3 cr.

Computer structure, machine and assembly language concepts, instruction execution, addressing techniques. Assembler systems, macro definitions and generation, conditional assembly, I/0 subroutine construction and interrupts. This course requires considerable actual assembly language programming.

Prerequisite: CSDP 222 or permission of the instructor.

CSDP 305 Software Engineering I — 3 cr.

This course will introduce methodologies and tools that are useful in software engineering. Structured Programming, software charts, Sequence selection and iteration structure charts. Building software machines, software module structures. Data flow diagrams, system dynamics, engineering system analysis, real-time data flow, introduction to object-oriented analysis. Computer Aided Software Engineering (CASE) will be introduced.

Prerequisite: CSDP 222 and CSDP 250 or permission of instructor.

CSDP 321 Introduction to Discrete Structures — 3 cr.

Group, graph, Boolean, prepositional and other algebraic structures through detailed study of automata and their relationship to formal languages. This course requires team created relatively large application programs. 

Prerequisites: CSDP 222 and MATH 110 or MATH 111 or permission of the instructor.

CSDP 341 Numerical Analysis — 3 cr.

Basic concepts, representation of numbers, error analysis, and iterative methods. Solution of non-linear equations, interpolation and approximation, numerical differentiation and integration, computer applications. 

Prerequisites: CSDP 220 and MATH 211.

CSDP 350 Linear Programming — 3 cr.

Models, model-building and operations research methods. Review of linear algebra and convexity, mathematical background. Graphic method, simplex computation procedures, special cases, degeneracy, duality and it's applications. Transportation, production, scheduling and inventory control problems. Parametric and integer programming instruction. Relationship to game theory. 

Prerequisites: CSDP 222 or permission of the instructor.

CSDP 398 Computer and Language Topics A — 3 cr.

A reading/research course recommended for all computer science majors. This course allows the student to get experience in new or otherwise unavailable programming languages as they develop (e.g., JAVA, MODULA-2, LISP, ADA, PROLOG). This course may be repeated (with different topics) for a maximum of 12 credits. Prerequisite: permission of the instructor.

CSDP 399 Computer and Language Topics B — 3 cr.

A reading/research course recommended for all computer science majors. This course allows the student to get experience in new or other unavailable programming languages as they develop (e.g., MODULA-2, LISP, ADA, JAVA, PROLOG). This course may be repeated (with different topics) for a maximum of 12 credits. Prerequisite: permission of the instructor.

CSDP 401 Operating Systems — 3 cr.

Instruction sets and microprogramming implementation, interrupts and recovery, addressing and memory management, implementation of procedures and relationship to overall system structure.

Prerequisites: CSDP 301 and CSDP 222.

CSDP 402 Computer Networks — 3 cr.

The OSI (Open Systems Interconnection) model including discussion and examples of various network layers. A general introduction to network protocols, communication protocols. 

Prerequisite: CSDP 250 or permission of instructor.

CSDP 403 Computer Language Theory — 3 cr.

The relationships between language structure, data structure and control structures, compiler languages (lexical analysis) versus interpreted languages. Considerations involved in the actual implementation of computer languages, e.g., run-time problems. 

Prerequisites: CSDP 301 and CSDP 222.

CSDP 404 Database Management Systems — 3 cr. 

Provide an introduction to the concepts and design principles used in database management systems. Entity-relationship data model, overview of principles of physical and logical database design, relational databases, query languages, transaction management, reliability and security.

Prerequisite: CSDP 250 or permission of instructor.

CSDP 405 Software Engineering II — 3 cr.

This course will expand software engineering skills using structured programming methodologies with object-oriented design. State of the art technique in software design and development of laboratory experience in applying the techniques covered. Structured design, structured programming, top-down design and development, segmentation and modularization techniques, iterative enhancement, design and code inspection techniques, correctness, and chief-programmer teams. Software engineering metrics, including measures of size, reuse, functionality, complexity, quality. Human factors issues in software design, reliability, team productivity, and project management. 

Prerequisite: CSDP 305. 

CSDP 442 Numerical Analysis II — 3 cr.

Numerical solution of systems of equations by direct and by iterative methods, evaluation of determinants, matrix inversion, calculation of eigenvalues. Numerical solution of ordinary differential equations, boundary value problems, and an introduction to the numerical solution of partial differential equations. 

Prerequisite: CSDP 341.

CSDP 450 Data Structures/Algorithms — 3 cr.

Growth of functions, recurrences, sorting and order statistics, linear and branched data structures; dynamic programming and greedy algorithms. B-trees and heap graph algorithms; special topics. 

Prerequisites: CSDP 301 and CSDP 321, or permission of instructor.

CSDP 451 Computer Organization — 3 cr.

Boolean algebra and combinatorial logic, digital circuit basics, data representation and transfer, and digital arithmetic. Digital storage and accessing, control functions, input-output facilities, system organization reliability. Description and simulation techniques. Multiprogramming, multi-process and real-time system. Alternate organizations. 

Prerequisites: CSDP 301 and CSDP 321.

CSDP 498 Selected Topics in Computer Sci. A — 3 cr.

A reading/research course recommended for all computer science majors. The grade for this course will be based primarily on a research project in an area of computer science chosen by the student and the instructor together. This course may be repeated (with different topics) for a maximum of 12 credits. Advanced undergraduate students may enroll in graduate-level computer science courses below CSDP 610 with permission of the Department.

CSDP 499 Selected Topics in Computer Sci. B — 3 cr.

A reading/research course recommended for all computer science majors. The grade for this course will be based primarily on a research project in an area of computer science chosen by the student and the instructor together. This course may be repeated (with different topics) for a maximum of 12 credits. Advanced undergraduate students may enroll in graduate-level computer science courses below CSDP 610 with permission of the Department.
 

MATHEMATICS

An introductory algebra course. Topics include the algebra of signed numbers, solving linear equations and inequalities, quadratic equations, operations on algebraic expressions, graphing. This course does not satisfy the General Education Requirement in Mathematics and does not count towards graduation requirements. In addition to regular classwork, this course requires the successful completion of the Arithmetic Basic Skills Test administered by the department. Students not receiving a satisfactory grade on this examination at entrance are required to attend special arithmetic skills laboratory sessions, in addition to their regular class work until they do pass this test with a satisfactory score. Prerequisite: Basic Skills in Mathematics Computation and Mathematics Concepts and Application.

MATH 102 Applications of College Mathematics — 3 cr.

Review of sets and logic, functions and graphing, solution of sets of linear equalities and inequalities with an introduction to linear programming, combinatorial principles and counting with application in the development of probability theory and statistics, numeration systems and computer mathematics. All topics are covered making use of current educational technology, both from the point of view of their significance within mathematics and of their applicability in modeling the world using mathematics. In addition to regular classwork, this course requires the successful completion of the Arithmetic Basic Skills Test administered by the department. Students not receiving a satisfactory grade on this examination at entrance are required to attend special arithmetic skills laboratory sessions, in addition to their regular class work until they do pass this test with a satisfactory score. 

Prerequisites: MATH 101 with a grade of at least "C" or two years of high school mathematics (Algebra I or higher) plus permission of the department (obtained by receiving a satisfactory score on the department placement test).

MATH 109 College Algebra — 3 cr. 

The purpose of the course is twofold: for students requiring quantitative mathematical skills but not trigonometry or calculus,it may be viewed as a terminal course; it also provides the algebraic and graphing skills necessary for satisfactory performance in relations and functions, graphing, solving systems of linear equations, the logarithmic and exponential functions. 

Prerequisites: MATH 101 with a grade of at least "C"; or two years of high school algebra plus permission of the department (obtained by receiving a satisfactory score on the departmental placement test).

MATH 110 Trigonometry and Analytic Geometry — 3 cr.

This course is intended for students majoring in mathematics, computer science, science, technology or engineering, or for students preparing to take calculus. Topics covered include the unit circle and graphs of the trigonometric functions, trigonometric identities, trigonometric equations, inverse trigonometric functions, complex numbers, and polar coordinates. 

Prerequisites: MATH 109 with a grade of at least "C", or three years of high school mathematics (Algebra I or higher) plus permission of the department (obtained by receiving a satisfactory score on the departmental placement test).

MATH 111H Hons. Elementary Mathematical Analysis — 4 cr.

A course which fulfills the General Education Requirement. This course covers the content of both MATH 109 and MATH 110. As such, it is limited to those students with three (3) years of secondary school mathematics (including Trigonometry) plus a score of at least 28 on the MH-Algebra Placement Test.

MATH 112 Calculus I — 4 cr.

The differential calculus of functions of one variable. Graphing and differentiating algebraic and transcendental functions. Limits, continuity and Mean Value Theorem and the applications. Max/min., related rate, and approximation applications. Introduction to integration.

Prerequisites: MATH 110 or MATH 111H with a grade of at least "C" or four years of high school mathematics (including Algebra I, II, Geometry, and Trigonometry) plus permission of the department (obtained by receiving a satisfactory score on the departmental placement test). 

MATH 210 Elementary Statistics — 3 cr.

Frequency and graphs of distributions, calculating averages from raw data and grouped data, the standard deviation, the Binomial, Poisson and normal distribution and their properties; Bayes Theorem and Bayesian inference. Regression and correlation in two variables. Times Series Analysis and application. 

Prerequisite: MATH 109 or MATH 110 or MATH 111H or consent of the instructor.

MATH 211 Calculus II — 4 cr.

Integral calculus of functions of one variable, techniques and theory of the Riemann integral, including the fundamental theorem and its application. Applications to area, volume, surface area work, centroids, arclength, etc., and polar coordinates. Advanced work with transcendental functions. 

Prerequisite: MATH 112.

MATH 212 Calculus III — 4 cr.

Multivariable differential and integral calculus. The chain rule and inverse function theorems for several variables with applications to maxima and minima, integration in polar, cylindrical, and spherical coordinate systems. Taylor's theorem, infinite series, convergence tests and applications. 

Prerequisite: MATH 211.

MATH 260 Statistics for Scientists — 3 cr.

A one-semester introduction to the methodology and application of statistics, intermediate between MATH 210 and the three-semester probability and statistics sequence available for departmental majors. Emphasis is placed on statistical methods commonly used in scientific and technical applications, their theoretical justification and limitations. 

Prerequisite: MATH 212.

MATH 301 College Geometry — 3 cr.

Basic concepts of Euclidean geometry such as distance congruence, similarity, triangles, parallelism, Pythagorean theorem, axiomatic geometry, Non-Euclidean geometry and comparison with Euclidean geometry. Essential as a part of the training of prospective teachers of secondary school mathematics. 

Prerequisite: MATH 110 or MATH 111H or consent of the instructor.

MATH 302 Number Theory — 3 cr.

Integers, divisibility, the Euclidean algorithm and its application, solution of Diophantine equations, prime numbers, congruences, quadratic residues, number theoretic functions, Moebius inversion and its applications. 

Prerequisite: MATH 110 or MATH 111H or consent of the instructor.

MATH 304 History of Math and Computer Science — 3 cr. 

The historical and cultural development of mathematics and computer science from ancient times to the present. Development of mathematical reasoning, style, philosophy, and techniques within cultural settings. Growth of computer hardware, software, and applications development styles.

Prerequisite: MATH 109 or MATH 110 or MATH 111H or permission of the instructor. This course does not satisfy the General Education Requirement in Mathematics.

MATH 309 Introduction to Probability — 3 cr.

Sample spaces, axioms and elementary theorems of probability, combinatorics, dependence, conditional probability, random variables, probability distributions, expectation, mean, variance, moment generating functions, Chebychev's inequality, and limit theorems (law of large numbers, central limit theorem). Examples of stochastic processes. Prerequisite: MATH 211.

MATH 310 Mathematical Statistics I — 3 cr.

Distributions of random variables and their properties, including such distributions as the binomial, Poisson, Gamma, Chi-square, normal and bivariate normal distributions. Transformation of variable for the discrete and continuous types, T and F distributions, moment generating functions. 

Prerequisites: MATH 211 and MATH 309.

MATH 321 Differential Equations — 4 cr.

First order equations for which exact solutions are obtainable with applications. Higher order linear differential equation systems of linear differential equations. Laplace transforms. Non-linear differential equations. Numerical applications. 

Prerequisite: MATH212.

MATH 322 Foundations of Mathematics — 3 cr.

Sets, relations, prepositional calculus, first order theory and its model theory. Completeness, incompleteness and independence theorems. Application to axiomatic systems. Applications to number theory, geometry, set theory or computer science. 

Prerequisite: MATH112 or permission of instructor.

MATH 342 Advanced Calculus — 4 cr.

Review of the reals, topology of Cartesian spaces, limits, convergence, continuity, differentiability, integration, infinite series and products, Fourier series and Laplace transforms.

Prerequisite: MATH 212.

MATH 410 Mathematical Statistics II — 3 cr.

Conditional distributions, point and interval estimation; the maximum likelihood and other point estimation techniques. Sufficiency, efficiency, unbiasedness, MVU, and other characteristics of point estimators Cramer-Rao and Rao-Blackwell theorems. Testing of hypothesis, Neyman-Pearson lemma, and power function. Regression and correlation analysis, analysis of variance and analysis of covariance techniques. 

Prerequisite: MATH 310.

MATH 411 Modern Algebra — 3 cr.

An axiomatic approach to the structures and systems of modern mathematics: groups, rings, fields, quotient structures, homomorphisms and isomorphisms. 

Prerequisite: MATH 211 or permission of instructor.

MATH 412 Linear Algebra — 3 cr.

Vector spaces, matrices and their algebra, linear transformations and normal forms and applications to systems of linear equations and determinants. 

Prerequisite: MATH 211.

MATH 440 Topology — 3 cr.

A beginning course in topology with emphasis on the development of mathematical maturity in the area. Open and closed sets, connectedness, compactness, continuous functions and homeomorphisms, separation properties, examples and pathologies. 

Prerequisite: MATH 212 or MATH 411 or permission of instructor.

MATH 442 Complex Analysis — 3 cr.

An introduction to complex variable calculus with applications; complex numbers, analytic functions, integrals, power series, residues and poles, Cauchy's theorem. Applications.

Prerequisite: MATH 212.

MATH 443 Real Analysis I — 3 cr. 

Analysis on the real line and in n-space from the abstract point of view: point set, completeness, convergence, differentiability, Riemann integration, measurable set and functions, Lebesque integration, differentiation vs. integration; interchange of order, Lebesque-Stieltjes integrals, dominated and other convergence theorems. 

Prerequisite: MATH 212 or permission of instructor.

MATH 444 Real Analysis II — 3 cr.

Continuation of MATH 443. Emphasis will be placed on uniform convergence of sequences and series of functions, improper integrals, differentiation and integration in higher dimensions, and Inverse and Implicit Functions theorems. Introduction to metric spaces and metric space topologies.

Prerequisite: MATH 443 or permission of instructor.

MATH 455 Mathematical Models — 3 cr.

Construction, development, and study of mathematical models for real applications, Markov chain models, models for linear optimization, selected case studies.

Prerequisite: MATH 441 or permission of instructor.

MATH 490 Senior Seminar — 1 cr.

A course designed for graduating seniors to acquaint them with research information and sources in the field of mathematics. Reports on current research problems from various fields of mathematics.

MATH 498 Selected Topics in Mathematics — 3 cr.

A reading course recommended for all mathematics majors. The grade for this course will be based primarily on a research project in an area of mathematics chosen by the student and the instructor. This course may be repeated (with different topics) for a maximum of 12 credits.

MATH 499 Selected Topics in Mathematics — 3 cr.

A reading course recommended for all mathematics majors. The grade for this course will be based primarily on a research project in an area of mathematics chosen by the student and the instructor together. This course may be repeated (with different topics) for a maximum of 12 credits.

Department of Mathematics and Computer Science

The University | Academics | The School of Agriculture and Natural Sciences | The School of the Arts and Professions | The School of Business and Technology | Courses | Faculty | Appendix