Concordia University, Nebraska

Courses

Mathematics course descriptions

Junior standing or higher is recommended for 300 or 400 level college courses in mathematics.

Math-132 Intermediate Algebra (3)

An overview of fundamental algebraic concepts. Real and complex numbers, algebraic expressions, equations and inequalities, functions, polynomials, rational expressions, graphing, exponential and logarithmic functions, systems of equations and matrices. Prerequisite: one year of high school algebra.

Math-142 Survey of Contemporary Mathematics (3)

Selected topics which may include graph theory, apportionment, fair division, voting methods, bin packing, cryptography and coding, probability and statistics, game theory, financial mathematics, non-Euclidean geometry, dynamics of growth, tessellations and symmetry. Open to students with fewer than three years of high school mathematics or those with departmental permission.

Math-151 Pre-Calculus Mathematics (3)

A study of elementary functions, their graphs and application, including polynomials, rational algebraic functions, exponential, logarithmic and trigonometric functions.

Math-175 Finite Mathematics (3)

Introduction to finite mathematics through the study of logic, sets, probability, statistics, game theory, vectors, matrices, and linear programming. Many applications.

Math-182 Calculus with Applications (3)

An overview of calculus. Topics include limits, continuity, differentiation, exponential growth and decay, integration and the fundamental theorem of calculus. Applications to business, life sciences and social sciences will be emphasized. Prerequisite: four years of high school mathematics or equivalent.

Math-184 Calculus and Analytical Geometry I (4)

A beginning course in the analysis of functions including analytic geometry. A study of limits, techniques and applications of differentiation, basic integration and transcendental functions. Prerequisite: four years of high school mathematics or equivalent.

Math-186 Calculus and Analytical Geometry II (4)

A continuation of Math-184. Topics studied include integration, analytical geometry and vectors in two-dimensional space, and techniques of integration. Prerequisite: Math-184 or instructor’s permission.

Math-201 Concepts of Mathematics I (3)

An activities approach to problem solving, systems of numeration, properties of whole numbers, integers, fractions, real numbers, and numerical operations, number theory and statistics. Only available to Early Childhood and Elementary Education students.

Math-222 Introduction to Statistics and Probability (3)

The fundamentals of elementary statistics, data collection and analysis, probability, distributions, sampling, hypothesis testing, correlation and regression.

Math-252 Mathematical Structures (3)

A transition course which introduces students to logic, set theory, and the axiomatic method. This course is designed for students continuing to higher level mathematics courses.

Math-284 Calculus and Analytical Geometry III (4)

A continuation of Math-186. A study of analytic geometry in three-dimensional space, partial differentiation, multiple integration and infinite series. Prerequisite: Math-186.

Math-301 Concepts of Mathematics II (3)

An activities approach to studying mathematics concepts in probability, functions and algebra, and numerous topics in geometry. Geometrical topics include two- and three-dimensional geometry, constructions, congruences, motion and coordinate geometry symmetries and concepts of measurement. Prerequisite: Math 201 or one semester of calculus.

Math-305 Mathematics for Elementary/Middle Level Teachers (3)

An activity approach to teaching and learning mathematics concepts in geometry, probability, statistics, logic, and calculators. Special attention is devoted to various grade levels on which various topics are presented and how they can be presented. Prerequisite: three hours of college level mathematics and junior level standing, or permission of the arts and sciences division or education division.

Math-315 History of Mathematics (1)

The development of mathematics through-out various civilizations. It is designed to create an appreciation for our present mathematical system and an understanding of how our present mathematical system came to be what it is today. Prerequisite: Math- 252 and three semesters of college mathematics.

Math-318 Seminar in Mathematics (1-3)

Math topics of interest, readings and problems in mathematics. Some topics included are transfinite numbers, angle tri-section, game theory, and sequences of complex numbers. Prerequisite: 15 hours of college mathematics or permission of instructor.

Math-321 Numerical Analysis (3)

An introduction to the basic algorithms of numerical analysis. Topics include floating point arithmetic, interpolation and approximation, numerical integration, systems of linear equations, solution of non-linear equations, and solution of ordinary differential equations. Assignments using Mathematica will give experience in applying selected algorithms. Prerequisite: CS-131 and 141, and Math-384 are strongly recommended. Same as CS-321.

Math-322 Foundations of Statistics (3)

A study of mathematical statistics including probability distributions sampling theory, point estimation, methods of correlation and regression, and the principles of statistical inference. Prerequisite: Math-284.

Math-323 Foundations of Statistics II (3)

A study of mathematical statistics including sampling theory, point estimation, game and decision theory, hypothesis testing, experimental design, methods of correlation and regression, ANOVA, and non-parametric tests. Prerequisite: Math-322.

Math-332 Abstract Algebra I (3)

An introduction to algebraic structures with an emphasis on groups, subgroups, and group isomorphisms. A brief introduction to rings, domains and fields. Prerequisite: Math-252 and upper level standing.

Math-333 Linear Algebra (3)

Linear algebraic structures, their theory and application. Matrices, determinants, linear transformations, programming, vectors and vector spaces, dependence, inner products, row operations and echelon systems. Prerequisite: Math-284; Math-252 is recommended.

Math-335 Number Theory (3)

Mathematical induction, greatest common divisor, fundamental theorem of arithmetic, prime and composite integers, and congruences. Prerequisite: Math-252 and three semesters of college mathematics.

Math-342 Abstract Algebra II (3)

A continuation of Math-332 with an emphasis on polynomials over integral domains and polynomials over field. Prerequisite: Math- 332 or equivalent.

Math-348 Discrete Mathematics (3)

See CS-348.

Math-365 Foundations of Geometry (3)

An introduction to the general study of geometries including projective, finite, and non-Euclidean geometries. Prerequisite are high school geometry, three semesters of college mathematics and Math-252.

Math-382 Real Analysis I (3)

Properties of the real number system, sequences, limits, continuity, the derivative, Riemann integral, the Fundamental Theorem of Calculus and series. Prerequisite: Math 252 and 284.

Math-383 Real Analysis II (3)

Selected topics from limits, continuity, properties of the derivative, the Riemann, integral and the fundamental theorem of the Calculus. A natural continuation of Real Analysis I. Prerequisite: Math-382.

Math-384 Differential Equations (3)

A study of ordinary differential equations, first and higher order, systems linear and non-linear, their solutions and applications, including La Place Transforms. Prerequisite: Math-284.

Math-402 Practical Math Labs and Activities for Elementary Teachers (3)

This course is designed to give the elementary teacher practice in analyzing math materials for math activities and in writing and building these activities for the classroom. Emphasis will be on topics in geometry as: relationships in the triangle, on parallel lines, and in the circle; other elementary math topics will be investigated. Prerequisite: consent of instructor.

Math-475 Mathematical Modeling (3)

This course is an introduction to mathematical modeling of deterministic and stochastic dynamical systems. Differential equations, matrices, elementary probability and statistics will be applied to the development and analysis of continuous and discrete models that arise in the physical, biological, social and management sciences. Prerequisites: Math-322, 333, and 384.

Computer Science course descriptions

CS-121 Programming and Applications (3)

The first half of the semester is spent in development of skill in translating problems into algorithms as simple programs in a high-level programming language. The second half of the semester includes projects related to word processing, databases, electronic spreadsheets and graphics.

CS-131 Computer Programming I (3)

The development of skill in translating problems into algorithms and implementing these algorithms into a high-level programming language. An emphasis will be placed on good programming style including structured programming techniques. An overview of the organization and operation of a computer system will be given.

CS-141 Computer Programming II (3)

Continued development of discipline in program design, writing, testing and debugging with C++ as the high level programming language. Algorithms to be studied include internal sorting and searching methods, string processing, and the manipulation of data structures: arrays, stacks, queues, and linked lists. Prerequisite: CS-131.

CS-231 Introduction to Computer Systems (3)

An introduction to the architecture of a computer system at the hardware register level. In addition to a general discussion of the organization of a central processing unit specific examples of both CISC and RISC architectures are discussed in detail. Prerequisite: CS-141.

CS-241 Introduction to Computer Organization (3)

An introduction to logic design including properties of gates and flipflops, the design of simple logical networks, representation of information as digital signals, and implementation of arithmetic operations. The mechanics of information transfer and logical control within a computer system will be studied. Laboratory work circuits and breadboards is an essential component of this course. Prerequisite: CS-141.

CS-251 Introduction to File Processing (3)

Storage, manipulation, and retrieval of information stored in large files on bulk storage devices such as disks and tapes. Organization of file systems including relational databases is a key topic. Algorithms for manipulating data structures appropriate to file processing are discussed Prerequisite: CS-141.

CS-261 Operating Systems and Computer Architecture I (3)

An introduction to the concepts of operating systems with an emphasis on the inter-relationship between the operating system and the hardware architecture of the computer system. Prerequisites: CS-231, 241 (251 is recommended).

CS-321 Numerical Analysis (3)

See Math-321.

CS-324 Computer Graphics (3)

An introduction to the generation and manipulation of graphical images on computer displays. Both 2D and 3D graphics are covered with an emphasis on hierarchical modeling. Topics include clipping, representation of curves and surfaces, 2D and 3D transformations, hidden edge and surface elimination, shading and others. Prerequisite: CS-141 or equivalent.

CS-334 Organization of Programming Languages (3)

An applied course in programming language constructs emphasizing the run-time behavior of computer programs. The course provides an introduction to formal and theoretical aspects of programming languages and will include a comparison of many current languages. Prerequisite: CS-141 (CS-231 and CS-251 are highly recommended.)

CS-344 Data Structures and Algorithm Analysis (3)

A course which will apply analysis and design techniques to non-numeric algorithms which act on data structures. Algorithm analysis and design criteria will be utilized in the selection of methods for data manipulation in such areas as database management, memory management, and system design. Prerequisite: CS-141.

CS-348 Discrete Structures (3)

An applied course in discrete mathematical structures emphasizing their application to computer science. The course will relate mathematical concepts such as sets, trees, graphs, logic, combinatorics, relations and groups to computer science problems and applications. Computer science topics integrated into the course include data structures, algorithm design and algorithmic analysis and testing. Prerequisite: CS-141. Math-252 is strongly recommended.

CS-351 Database Design and Management (3)

Principles for the design and management of database systems including data and storage models; relational, hierarchial, and network models and associated access operations, relational algebra and calculus; inquiry languages; normalization; logical and physical database design; distributed systems; and concurrency, integrity, and security issues. Emphasis on database planning and implementation through applications using a database system. Prerequisite: CS-251.

CS-361 Operating Systems and Computer Architecture II (3)

A course to continue the development of operating systems and computer architecture. Concurrent processes, name management, resource allocation, protection and access implementation, and advanced implementations of pipelining, parallelism, user interface considerations, networking, and distributed systems will be studied. Prerequisite: CS-261.

CS-39x Seminar in Computer Science (3)

Current topics in the constantly and rapidly changing field of computer science will be the focus of this course. Possible topics include Database Design, Artificial Intelligence, Networks, Microcomputer Applications, Software Design and Development, Automata and Formal Languages, and Compiler Design. Prerequisite: CS-141.

CS-399 Computer Science Internship (3)

Students gain experience in a computer science-related field while working in an internship position under the direct supervision of a computer professional. Students should consult with the computer science faculty and the Office of Career Services to obtain the undergraduate internship/practicum packet and review the required process. This course may be used to satisfy the 128 hours necessary for graduation. Prerequisites: 18 hours of computer science, junior standing and permission of the computer science faculty.

CS-442 Management Information Systems Design and Development (3)

See Bus-442

Mathematics and computer science pages are reviewed by the department.
© 2009 Concordia University, Nebraska
800 N. Columbia Ave. Seward, NE 68434
800-535-5494
Login