Mathematics Courses

2. Mathematics for Elementary Teachers (3 hours)
A course designed to deepen prospective elementary school teachers' understanding of mathematics. Using reasoning and logic to understand the connections between various mathematical ideas will be emphasized. (Normally offered each fall semester.)

7. Statistics (3 hours)
A study of topics essential to an understanding of statistics and their applications. Topics include probability, discrete and normal probability distributions, sample variability, the central limit theorem, and linear regression. (Normally offered each spring semester.)

8. Mathematics for Liberal Arts (3 hours)
An investigation of the application of mathematical reasoning and problem solving. Topics to be covered may include networks, linear programming, data sampling and analysis, voting systems, game theory, measurement analysis, and coding. (Normally offered each semester.)
Prerequisite(s): Appropriate placement score. 

10. College Algebra (3 hours)
A study of linear and quadratic equations and inequalities and their graphs; systems of equations and inequalities, algebraic exponential and logarithmic functions and their graphs. Other topics may be selected from sets, complex numbers, sequences and series, and probability. (Normally offered each semester.)
Prerequisite(s): Appropriate placement score. 

50. Pre-Calculus (4 hours)
A study of elementary functions, their graphs, and applications, including polynomial, rational, algebraic, exponential, logarithmic, trigonometric, and metric functions. Scientific calculators are required and graphing calculators are recommended. (Normally offered each semester.)
Prerequisite(s): Appropriate placement score or grade of “C” or better in Mathematics 10. 

60. Calculus for Management, Biological, and Social Sciences (4 hours)
A calculus course for non-mathematics majors. Topics include limits, continuity, differentiation, and integration with emphasis on relevant applications. (Normally offered each fall semester.)
Prerequisite(s): Appropriate placement score or grade of “C” or better in Mathematics 10.

65. Calculus for Biologists (4 hours)
A calculus course that emphasizes biological applications. Topics include Malthusian growth, limits, continuity, differentiation, optimization, differential equations, and integration. Assignments are given that involve spreadsheets and computer algebra systems. (Normally offered each spring semester.)
Prerequisite(s): Appropriate placement score or grade of “C” or better in Mathematics 10. 

90. Selected Topics (1, 2, or 3 hours)
A course designed to treat subject matter not covered in other standard courses or to provide study of subject matter introduced in other courses. The title, content, and credit hours will be determined by mutual interests of faculty and students.
Prerequisite(s): Permission of the instructor and the department chair.

105. Calculus I (5 hours)
An introduction to calculus of a single variable. Topics include limits, continuity, differentiation, and beginning integration with applications. Assignments are given that help build proficiency in the use of a computer algebra system. (Normally offered each semester.)
Prerequisite(s): Appropriate placement score or grade of “C” or better in Mathematics 50. 

106. Calculus II (5 hours)
A continuation of Mathematics 105. Topics studied include integration techniques and applications, differential equations, numerical approximations, sequences and series, and vectors. Assignments are given that help build proficiency in the use of a computer algebra system. (Normally offered each semester.)
Prerequisite(s): Permission of department or grade of “C” or better in Mathematics 105.

111. Introduction to Higher Mathematics (3 hours)
A study of mathematical induction and other methods of proof, recursion, formal logic, and set theory. (Normally offered each spring semester.)
Prerequisite(s): Grade of “C” or better inMathematics 105. 

135. Mathematical Problem Solving (1 hour)
A seminar on problem solving skills and their application to nontrivial problems. Students will have the opportunity to represent Nebraska Wesleyan in the Putnam Exam. May be repeated. (Normally offered each fall semester.)
Prerequisite(s): Grade of “C” or better in Mathematics 106 or permission of the instructor. 

190. Selected Topics (1, 2, or 3 hours)
A course designed to treat subject matter not covered in other standard courses or to provide study of subject matter introduced in other courses. The title, content, and credit hours will be determined by mutual interests of faculty and students.
Prerequisite(s): Permission of the instructor and the department chair.

200. Formal Languages and Automata
See Computer Science 200.

204. Calculus III (4 hours)
An introduction to multivariable calculus. Topics include vector-valued functions, functions of several variables, partial differentiation, multiple integrals, and analysis. Assignments are given that help build proficiency in the use of a computer algebra system. (Normally offered each fall semester.)
Prerequisite(s): Permission of department or grade of “C” or better in Mathematics 106. 

206. Mathematical Statistics I (3 hours)
Elementary mathematical theory and applications of basic probability to statistics. Topics studied include random variables, both discrete and continuous, and their probability distributions with applications of a practical nature to numerous fields. Also studied are multivariate probability distributions. (Normally offered fall of even-numbered years.)
Prerequisite(s): Grade of “C” or better in Mathematics 106.

207. Mathematical Statistics II (3 hours)
A continuation of Mathematics 206, with further applications of probability theory to statistical problems of estimation and hypothesis testing, including least squares estimation and correlation. Also studied is analysis of variance with numerous applications of this technique.
Prerequisite(s): Grade of "C" or better in Mathematics 206.

209. Number Theory (3 hours)
A study of fundamental concepts in number theory, including divisibility and factorization of integers, linear and quadratic congruencies, the quadratic reciprocity theorem, Diophantine equations, number-theoretic functions, and continued fractions. Additional topics may include Euler’s theorem and cryptography, perfect numbers and Mersenne primes, Pythagorean triples, and Fermat’s Last Theorem.
Prerequisite(s): Grade of “C” or better in Mathematics 106.

210. Linear Algebra (3 hours)
A study of vector spaces, determinants, linear transformations, matrices, and matrix equations, and their applications in the natural and social sciences. (Normally offered each spring semester.)
Prerequisite(s): Grade of “C” or better in Mathematics 106.

212. Numerical Analysis (3 hours)
An introduction to the numerical approximation of solutions of various types of problems. Topics include root finding, interpolation and numerical differentiation, and integration. Additional topics may be drawn from numerical solutions of ordinary differential equations and linear systems.
Prerequisite(s): Grade of “C” or better in Mathematics 106.

221. Geometry (3 hours)
Selected topics from Euclidean and non-Euclidean geometry, geometry as a mathematical structure, and geometry as a study of invariants of set transformations. (Normally offered fall of odd-numbered years.)
Prerequisite(s): Grade of “C” or better in Mathematics 111.

224. Differential Equations (4 hours)
A study of ordinary differential equations. Topics include first and higher order, and linear and nonlinear differential equations with applications. Additional topics may be chosen from systems of differential equations, transform techniques, and numerical methods. Use will be made of a computer algebra system. (Normally offered each spring semester.)
Prerequisite(s): Grade of “C” or better in Mathematics 106.

227. Mathematical Modeling (3 hours)
A course that explores applications of mathematics to real-world problems. One or more topics may be chosen from the non-inclusive list: dynamical systems, linear programming, queuing theory, game theory, numerical analysis, wavelets, coding theory, and partial differential equations. Computer-based exercises will be a component of the course.

230. Abstract Algebra I (3 hours)
A study of various algebraic systems arising in modern mathematics, such as groups and rings. (Normally offered fall of even-numbered years.)
Prerequisite(s): Grade of “C” or better in Mathematics 111 and any 200-level mathematics course.

231. Abstract Algebra II (3 hours)
A continuation of Mathematics 230. More study of groups, rings, and fields. Additional topics may be drawn from modules and finite fields.
Prerequisite(s): Grade of “C” or better in Mathematics 230.

240. Real Analysis (3 hours)
A formal approach to limits, continuity, differentiation, and integration with emphasis on the proofs of theorems. Additional topics may include topology, uniform continuity, and uniform convergence. (Normally offered spring of even-numbered years.)
Prerequisite(s): Grade of “C” or better in Mathematics 111 and 204.

290. Selected Topics (1, 2, or 3 hours)
Further study of a topic selected by the department, the selection based partially upon student demand. The title, content, and credit hours will be determined by current mutual interests of faculty and students. Possible topics include complex analysis, measure theory, topology, logic and set theory, advanced modeling, algebraic number theory, group theory and ring theory.
Prerequisite(s): Permission of the instructor and department chair.

295. Independent Study (1, 2, or 3 hours)
Individual study of a specific mathematical topic under the supervision of a faculty member. Independent study may not duplicate courses described in the catalog.
Prerequisite(s): Permission of the instructor and the department chair.

297. Internship (1-4 hours)
The student secures a firm to sponsor on-the-job training satisfactory to the sponsor, the faculty coordinator, and the student. The student submits a written report and the sponsor supplies a statement regarding the satisfactory completion of the internship. May be repeated up to a maximum of 4 credit hours. P/F only.
Prerequisite(s): 17 hours of mathematics courses and permission of the department chair.

299. Mathematics Seminar (3 hours)
A study of topics of special interest in mathematics. Students will be required to make at least three presentations including individual study of a specific mathematics topic under the supervision of the faculty. (Normally offered spring semester.)
Prerequisite(s): Major in mathematics, senior standing, grade of “C” or better in either Math 230 or 240, and permission of the instructor.

Computer Science Courses

10. Microcomputer Applications (2 hours)
A hands-on introduction to word processing, spreadsheets, databases, and presentation graphics. (Normally offered each semester.)

30. Introduction to Computing (3 hours)
An overview of the main ideas of computer science: the history of computing, the hardware and software of computers, the impact of computers on society, and problem-solving by algorithm creation (programs). Appropriate for all students, especially those who wish to explore computing in more depth. Weekly labs provide hands-on practice in solving problems, including the creation of simulations. (Normally offered each semester.)

40. Program Design (4 hours)
A disciplined approach to the development of programs to solve problems on a computer. Topics include data types, control structures, abstraction, and software development. A lab component introduces a high-level programming language and software tools. (Normally offered each semester.)
Corequisite(s): Computer Science 30 or permission of the instructor.

100. Discrete Mathematics (3 hours)
An introduction to fundamental concepts of discrete mathematics with application to computer science. Topics include sets, relations, functions, sequences, Boolean algebra, difference equations, combinatorics, and graph theory. (Normally offered each year.)
Prerequisite(s): Placement into Mathematics 105 or grade of “C” or better in Mathematics 50.

110. Unix (1 hour)
Introduction to the Unix operating system, Unix file system, Unix tools and utilities, and shell programming. A laboratory course. (Normally offered each year.)

120. Imperative Problem-Solving (2 hours)
Students solve algorithmically complex problems using an imperative language and will have the opportunity to represent NWU in the ACM Programming Contest. A laboratory course. May be repeated. (Normally offered each year.)
Prerequisite(s): Computer Science 40 with a grade of “C” or better.

130. Computer Architecture and Interfacing

See Physics 130.

140. Data Structures (4 hours)
A natural continuation of Computer Science 40 concentrating on the motivation, design, implementation, and utilization of abstract data types. Topics include linked lists, stacks, queues, trees, and recursion. A lab component is incorporated. (Normally offered each spring semester.)
Prerequisite(s): Grade of “C” or better in Computer Science 40.

190. Selected Topics (1, 2, or 3 hours)
An intermediate-level course designed to treat subject matter not covered in other computer science courses. The title, content, and credit hours will be determined by current mutual interests of students and faculty and availability of resources.
Prerequisite(s): Permission of the instructor and the department chair.

200. Formal Languages and Automata (3 hours)
An overview of formal models of computation and complexity classes. Topics include formal languages (finite automata, regular expressions, push-down automata, context-free grammars, and Turing machines), Church’s thesis, computability, non-determinism, and NP-completeness. Same as Mathematics 200. (Normally offered alternate years.)
Prerequisite(s): Grade of “C” or better in either Computer Science 100 or Mathematics 111 and junior standing.

205. Database Systems (3 hours)
An introduction to the design, implementation, and management of database systems. Topics include entity relation, relational, and object-oriented databases. A client-server database project is assigned. (Normally offered alternate years.)
Prerequisite(s): Grade of “C” or better in Computer Science 140.

210. Operating Systems (3 hours)
A study of the fundamental concepts of operating systems and distributed systems. Topics include process and storage management, protection and security, and the organization and coordination of systems having interacting processors. The material is illustrated by case studies. (Normally offered alternate years.)
Prerequisite(s): Grade of “C” or better in Computer Science 140.

230. Software Engineering I (3 hours)
Topics include design objectives, life-cycle model, reliability and risk assessment, maintenance, specification and design tools, implementation issues and strategies, and verification and validation. (Normally offered alternate years.)
Prerequisite(s): Grade of “C” or better in Computer Science 140.

235. Computer Networks (4 hours)
This course focuses on the communications protocols used in computer networks: their functionality, specification, verification, implementation, and performance. The course also considers the use of network architectures and protocol hierarchies to provide more complex services. Existing protocols and architectures will be used as the basis of discussion and study. Includes formal laboratory work. (Normally offered alternate years.)
Prerequisite(s): Grade of “C” or better in Computer Science 140. 

240. Compiler Construction (3 hours)
A capstone course in which students design and implement a compiler as an application of the principles of software engineering, formal language theory, algorithms and data structures. Topics include lexical analysis, parsing, symbol table management, code generation and optimization and use of compiler tools. (Normally offered alternate years.)
Prerequisite(s): Grades of “C” or better in Computer Science 140 and 200.

255. Algorithms (3 hours)
A systematic study of the analysis and design of algorithms, particularly those used for complex data structures and non-numeric processes. Topics include analysis of complexity, complexity classes, dynamic programming, automata-based algorithms, backtracking, and parallel algorithms. (Normally offered alternate years.)
Prerequisite(s): Grades of “C” or better in Computer Science 100 and 140.

260. Programming Languages (3 hours)
A survey of the principles and paradigms of programming languages. Topics include data types, scope and run-time storage, control structures, syntax, semantics, translation, and implementation. Paradigms discussed include: procedural, functional, logic, and object-oriented programming. (Normally offered alternate years.)
Prerequisite(s): Grade of “C” or better in Computer Science 140.

265. Artificial Intelligence (3 hours)
A study of the techniques and theory of artificial intelligence. Topics include the history and philosophy of AI, knowledge representation, state space search, logic programming, AI languages, expert systems, natural language understanding, machine learning, and neural networks.
Prerequisite(s): Grade of “C” or better in Computer Science 260.

290. Selected Topics (1, 2, or 3 hours)
An upper-level course designed to treat subject matter not covered in other computer science courses. The title, content, and credit hours will be determined by current mutual interests of students and faculty and availability of resources.
Prerequisite(s): Permission of the instructor and department chair.

295. Independent Study (1, 2, or 3 hours)
Individual study of a specific computer science topic under the supervision of a faculty member. Independent study may not duplicate courses described in the catalog.
Prerequisite(s): Permission of the instructor and the department chair.

297. Internship (3 hours)
The student secures a firm to sponsor on-the-job training satisfactory to the sponsor, the department, and the student. The student submits a written report and the sponsor supplies a statement regarding the satisfactory completion of the internship. P/F only.
Prerequisite(s): 17 hours in computer science and permission of the department chair.

299. Software Engineering II (3 hours)
A capstone course in which student teams undertake a large software project using contemporary software engineering techniques. (Normally offered alternate years.)
Prerequisite(s): Computer Science 230 with a grade of “C” or better and junior standing.