| Course Descriptions | |||
| Mathematics | Computer Science | ||
Mathematics (MATH)
| 090 Fundamentals of Mathematics | 3 Credits | |
| Description: | Review of pre-algebra mathematics with an introduction to basic algebra. Topics include: integers; fractions; decimals; percents; signed numbers; exponents; algebraic expressions; linear equations; and graphing. Does not apply toward General Education requirements or graduation requirements. Lecture. Students taking this course must earn a grade of at least C- before enrolling in MATH 095. | |
| Prerequisites: | ||
| (Prerequisite for MATH 095) | ||
| 095 Fundamentals of Algebra | 3 Credits | |
| Description: | Review of elementary algebra topics typically studied in high school. Topics include: the real number system; sets; absolute value; linear equations and inequalities; relations and functions; polynomials; and quadratic equations. Does not apply toward General Education requirements or graduation requirements. Lecture. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 090 with a grade of at least C-. | |
| (Prerequisite for MATH 130 and MATH 150; Recommended for MATH 112 and CSCI 101) | ||
| 102 Intermediate Algebra | 2 Credits | |
| Description: | Review of intermediate algebra topics typically studied in high school. Topics include: rational expressions and equations; systems of linear equations and inequalities; rational exponents; radical expressions and equations; quadratic functions; graphing techniques; conic sections; exponential and logarithmic functions and equations. Lecture. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 095 with a grade of at least C-. | |
| (Prerequisite for MATH 115, MATH 151, and MATH 230; Recommended for CSCI 201) | ||
| 112 Introduction to Contemporary Mathematics | 3 Credits | |
| Description: | A liberal arts mathematics course presenting mathematics as a tool used by a wide range of professionals in modern society. Real-life examples are used to promote understanding of mathematics and its relationship to other areas of study. Mathematical problem solving is shown to influence everything from the success of savvy entrepreneurs to the fairness of voting practices. Examples such as the Traveling Salesman Problem and Arrow’s Impossibility Theorem are taken from management science, statistics, social science and computer science. Satisfies the Mathematics requirement for General Education. Lecture and Lab. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 095 (recommended). | |
| 115 Precalculus | 5 Credits | |
| Description: | Covers the algebra and trigonometry required for Calculus and Analytic Geometry. Topics include: review of intermediate algebra; composite and inverse functions; polynomial and rational functions; exponential and logarithmic functions; trigonometric functions, identities, and equations; the binomial theorem; fundamentals of analytic geometry; and the conic sections. Satisfies the Mathematics requirement for General Education. Lecture. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 102 with a grade of at least C-. | |
| (Prerequisite for MATH 240 and MATH 310) | ||
| 130 Elementary Statistics | 4 Credits | |
| Description: | Introductory course for students in all disciplines. Includes descriptive statistics, the binomial and normal distributions, confidence intervals, linear regression, correlation, the t-distribution, the Chi-square distribution, nonparametric tests of statistical inference, and understanding statistics in many different fields. Problems are taken from various fields dependent on statistical decision making. Satisfies the Mathematics requirement for General Education. Lecture and Lab. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 095 with a grade of at least C-. | |
| 150 Finite Mathematics for Business, Life and Social Sciences | 3 Credits | |
| Description: | Introduction to mathematics and problem-solving techniques especially appropriate in business, economics, biology, and the social sciences. Topics include: linear equations, linear functions, and graphs; systems of linear equations and matrices; linear inequalities, linear programming, and the simplex method; sets and counting techniques; fundamentals of probability. Satisfies the Mathematics requirement for General Education. Lecture. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 095 with a grade of at least C-. | |
| 151 Calculus for Business, Life, and Social Sciences | 3 Credits | |
| Description: | A short course in calculus including concepts and problem-solving techniques for students in business, economics, biology and the social sciences. Topics include algebraic, exponential and logarithmic functions; derivatives, and optimization problems; partial derivatives and Lagrange multipliers. Satisfies the Mathematics requirement for General Education. Lecture. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 102 with a grade of at least C-. | |
| 230 Foundations of Mathematics I | 3 Credits | |
| Description: | A first course in mathematical concepts and techniques designed to meet the mathematical needs of students in the Elementary Education program. Topics include: logic, sets and counting; numeration systems; natural numbers; integers; rational numbers; real numbers; and the arithmetic for these various systems. Lecture. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 102 with a grade of at least C-. | |
| (Prerequisite for MATH 231) | ||
| 231 Foundations of Mathematics II | 3 Credits | |
| Description: | Continuation of MATH 230. Topics include: concepts of algebra; fundamentals of two- and three-dimensional geometry; and an introduction to counting techniques, probability, and statistics. Lecture. | |
| Prerequisites: | Completion of MATH 230 with a grade of at least C-. | |
| 240 Calculus and Analytic Geometry I | 4 Credits | |
| Description: | A first course in the fundamentals of calculus. Topics include: real numbers; functions; limits; continuity; derivatives; integrals; and applications. Lecture. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of MATH 115 with a grade of at least C-. | |
| (Prerequisite for MATH 241; Recommended for CSCI 331/551) | ||
| 241 Calculus and Analytic Geometry II | 4 Credits | |
| Description: | Continuation of MATH 240. Topics include: conic sections; transcendental functions; techniques of integration; indeterminate forms; improper integrals; and infinite series. Lecture. | |
| Prerequisites: | A grade of C- or better in MATH 240. | |
| (Prerequisite for MATH 242, MATH 344, MATH 371/571, and MATH 380/580) | ||
| 242 Calculus and Analytic Geometry III | 4 Credits | |
| Description: | Continuation of MATH 241. Topics include: three-dimensional analytic geometry; vectors; partial derivatives; multiple integrals; line integrals; and surface integrals. Lecture. | |
| Prerequisites: | A grade of C- or better in MATH 241. | |
| (Prerequisite for CSCI 425/625, CSCI 347, MATH 370/570, MATH 425/625, MATH 440/640, and MATH 471/671; Recommended for MATH 371/571 and MATH 380/580) | ||
| 310 Introduction to Abstract Mathematics | 3 Credits | |
| Description: | Fundamentals of formal mathematics emphasizing mathematical writing and types of formal proof. Includes significant coverage of topics in logic, set theory and number theory. Lecture. | |
| Prerequisites: | MATH 115. | |
| (Prerequisite for MATH 315, MATH 320/520, MATH 344, MATH 362/562, MATH 370/570, MATH 440/640, and MATH 471/671) | ||
| 315 Linear Algebra | 3 Credits | |
| Description: | An introduction to the algebra and geometry of two- and three-dimensional space and extension to n-dimensional space. Topics include: line and coordinate vectors; systems of linear equations and their solution by reduction methods; matrix algebra; determinants; fundamentals of abstract vector spaces; linear independence, dimension theorems; linear transformations; eigenvalues and eigenvectors; diagonal matrices; quadratic forms; inner products; and Gram-Schmidt orthogonalization. Lecture. | |
| Prerequisites: | MATH 310. | |
| (Prerequisite for CSCI 425/625, MATH 455/655, and MATH 425/625; Recommended for CSCI 331/551 and MATH 440/640) | ||
| 320/520 Discrete Structures | 4 Credits | |
| Description: | Cross-listed as CSCI 320/520. Continuation of MATH 310. Investigation of concepts of noncalculus mathematics used in computer science, operations research, and other areas of applied mathematics. Topics include: set theory; logic; mathematical induction; relations and functions; recurrence relations; combinatorics; graph theory; and related algorithms. Lecture. | |
| Prerequisites: | MATH 310. | |
| (Prerequisite for CSCI 421/621, CSCI 425/625, MATH 421/621, and MATH 425/625) | ||
| 339 Teaching Mathematics and Computer Science in the Secondary School | 3 Credits | |
| Description: | General principles and problems of teaching mathematics in grades 6-12. Topics include: organizing teaching activities; teaching materials and resources; and current methodology. Student activities include classroom presentations, a formal paper, and 20-25 hours of laboratory experience. Lecture. | |
| Prerequisites: | Admission to the Teacher Education Program. | |
| 344/544 Differential Equations | 4 Credits | |
| Description: | Elementary theory and applications of ordinary differential equations, including series solutions. Lecture. | |
| Prerequisites: | MATH 241 | |
| 362/562 Topics in Geometry | 3 Credits | |
| Description: | Modern treatment of topics from Euclidean geometry with an introduction to other geometries. Appropriate for students in Elementary or Secondary Education. Lecture. | |
| Prerequisites: | MATH 310. | |
| 370/570 Probability | 3 Credits | |
| Description: | A first course in probability theory intended for students in mathematics, pre-engineering, and the sciences. Topics include: axioms of probability; combinatorial analysis; conditional probability; independence; discrete and continuous random variables; expectation; variance; limit theorems; pseudo-random numbers; simulation; Monte Carlo estimates; and Markov Chains. Lecture. | |
| Prerequisites: | MATH 241 and MATH 310. | |
| (Recommended for MATH 371/571 and MATH 380/580) | ||
| 371/571 Statistics | 4 Credits | |
| Description: | Calculus-based statistics emphasizing applications intended for students in applied mathematics, economics and the sciences. Topics include: estimation and prediction; hypothesis testing; linear and multiple regression; F and t tests; analysis of variance; and non-parametric statistics. Lecture. | |
| Prerequisites: | MATH 241 and MATH 310. MATH 242 and MATH 370 are recommended. | |
| 372 Actuarial Mathematics | 4 Credits | |
| Description: | An introductory course in actuarial science. Topics may include risk models, life tables, life insurance and annuities, and pension funding. | |
| Prerequisites: | MATH 370 or MATH 371. | |
| 380/580 Introduction to Mathematical Modeling | 4 Credits | |
| Description: | Applied mathematics course emphasizing probabilistic models. Topics include: discrete- and continuous-time Markov chains; Poisson processes; queuing theory; reliability theory; Brownian motion; and financial mathematics. Lecture. | |
| Prerequisites: | MATH 241 and one of MATH 370 or MATH 371. MATH 242 recommended | |
| 381 Special Projects | 1-4 Credits | |
| Description: | Various individual and small-group projects carried out under the supervision of one or more instructors. Requires weekly progress reports plus a final report and/or a final exam. May be repeated, but no more than a total of 4 credits may be earned from both MATH 381 and CSCI 381. Evaluation: Pass-Fail only. Independent study. | |
| Prerequisites: | Preliminary project plan and an independent study contract. | |
| 390 Mathematical Sciences Internship | 1-4 Credits | |
| Description: | Work in an approved position to gain experience in solving real problems using computer science, mathematics, and statistics. Interns may receive salaried appointments with cooperating companies. Credits do not apply to any major or minor in Mathematics and Computer Science. Evaluation: Pass-Fail only. Independent study. | |
| Prerequisites: | Prerequisite: Department approval. | |
| 391 Putnam Mathematical Competition | 1 Credit | |
| Description: | Preparation for the national Putnam Mathematics Contest. Includes review of previous examination problems and lectures on selected topics. May be repeated for a total of three credits. Pass-Fail only. Seminar. | |
| Prerequisites: | Consent of the instructor. | |
| 399 Mathematical Sciences Seminar | 1 Credit | |
| Description: | Cross-listed as CSCI 399. Students carry out individual investigations in current literature and present their findings to the entire department. Taken during senior year. Evaluation: Pass-Fail only. Seminar. | |
| Prerequisites: | Independent study contract. | |
| 421/621 Theory of Computation | 4 Credits | |
| Description: | Cross-listed as CSCI 421/621. Thorough introduction to automata, formal languages and computability. Topics include: models of computation; regular and context-free languages; finite and pushdown automata; Turing machines; unsolvable decision problems; fundamentals of computational complexity; and introduction to cryptography. Lecture. | |
| Prerequisites: | MATH 320. | |
| 425/625 Algorithm Design and Analysis | 4 Credits | |
| Description: | Study of the design and analysis of algorithms that are based on elementary data structures, such as queues, stacks, and trees. Some graph and network algorithms (shortest paths, connectivity, coloring, flows, matchings), geometric algorithms (convex hulls, range search, nearest neighbors), NP-complexity, approximation algorithms (vertex cover, traveling salesman, scheduling), and introduction to randomized algorithms. Introduction to algorithm design techniques, including greedy algorithms, divide-and-conquer, and dynamic programming. Lower and upper bounds of program complexity are analyzed. Introduction to algorithms used in the area of information security. Cross-listed as CSCI 425/625. Lecture. | |
| Prerequisites: | MATH 320 required, CSCI 202 recommended. | |
| 437/637 Cryptography | 4 Credits | |
| Description: | Study of the theory of cryptography and its use in computer security. Topics include: discrete probability spaces, Shannon's theory of information, unicity distance, perfect cryptoanalysis, (frequency analysis, index of coincidence), authentication and key exchange, public key cryptosystems, elementary number theory, primality checking, the RSA cryptosystem. Cross-listed as CSCI 437/637. Lecture. | |
| Prerequisites: | CSCI 201 and MATH 310. | |
| 440/640 Real Analysis | 4 Credits | |
| Description: | An introduction to the theory of real analysis. Topics include: the real and complex number systems; limits; continuity; convergence; function spaces; differentiation; Riemann integration; and Lebesgue integration. Lecture. | |
| Prerequisites: | MATH 242 and MATH 310. | |
| 455/655 Abstract Algebra | 4 Credits | |
| Description: | Introduction to the theory of algebraic structures. Topics include: groups; rings; fields; modules; homomorphisms; isomorphisms; quotient structures; applications to elementary number theory and algebraic coding. Lecture. | |
| Prerequisites: | MATH 310. | |
| 471/671 Introduction to Complex Variables | 4 Credits | |
| Description: | Analytic functions in the complex plane. Topics include: Cauchy-Riemann equations; analytic and meromorphic functions; contour integration; power series representation of analytic functions; the Residue Theorem; conformal mapping; analytic continuation; and applications. Lecture. | |
| Prerequisites: | MATH 242 | |
| 475/675 Numerical Analysis | 4 Credits | |
| Description: | Cross-listed as CSCI 475/675. Study of the theory and applications of computational techniques for mathematical solutions emphasizing rapid approximation and error analysis. Topics include: solution to equations in one variable; polynomial approximations to functions; error analysis; numerical differentiation and integration; numerical solutions to ordinary differential equations; boundary value problems. Lecture. | |
| Prerequisites: | MATH 242. | |
| 481/681 Special Topics | 1-4 Credits | |
| Description: | Investigation of one or more topics of current interest that are not covered in other courses. Not intended for independent study projects. May be repeated, but no more than a total of eight credits may be earned from both MATH 481 and CSCI 481. Lecture. | |
| Prerequisites: | Consent of the instructor. | |
Computer Science (CSCI)
| 101 Introduction to Computer Science | 3 Credits | |
| Description: | Cross-listed as LIBS 101. A survey of current topics and practical experience with computer software, and computer programming. Topics include: the history of computing; fundamentals of hardware and software; principles of system analysis and design; structured software development; and emerging issues such as artificial intelligence and human language processing. Laboratory exercises include: word processing; spreadsheets; databases; the Internet and World Wide Web. Satisfies the Mathematics requirement for General Education. Lecture. | |
| Prerequisites: | Students should have an acceptable score on the Mathematics Placement Test or have completed an appropriate remedial course. MATH 095 is recommended. | |
| 110 Introduction to Computer Programming I | 2 Credits | |
| Description: | Self-paced independent study in the fundamentals of computer programming. Each student may choose from several languages of current interest that are not offered in other courses. Students complete several programming exercises and projects. Independent study. | |
| Prerequisites: | Independent study contract. | |
| 111 Introduction to Computer Programming II | 2 Credits | |
| Description: | Self-paced independent study of intermediate-level computer programming. Each student may choose from several languages of current interest that are not offered in other courses. Students complete several programming exercises and projects. Independent study. | |
| Prerequisites: | Independent study contract. | |
| 170 Programming and Technology for the Teaching of Mathematics | 3 Credits | |
| Description: | Structured programming with computer languages and with graphic calculators likely to be used in secondary mathematics teaching. Use of software packages such as Maple and Geometer’s Sketchpad. Special web sites related to mathematics. Lecture and lab. | |
| Prerequisites: | MATH 115. | |
| 201 Introduction to Programming | 3 Credits | |
| Description: | A first programming course for students with a serious interest in computing. Topics include: formal languages; data types and variables; control structures; primitive and reference data types; methods and modular programming; introduction to abstract data types and classes; simple algorithms; and programming conventions and style. Satisfies the Mathematics requirement for General Education. Lecture and lab. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of an appropriate course. MATH 102 recommended. | |
| (Prerequisite for CSCI 202 and CSCI 250) | ||
| 202 Object-Oriented Programming | 3 Credits | |
| Description: | Continuation of CSCI 201. A programming course emphasizing the methodology of programming from an object-oriented perspective and software engineering principles. Topics include: data structure fundamentals; abstraction; pointer and reference variables; recursion; various important algorithms; and file processing techniques. Lecture and lab. | |
| Prerequisites: | CSCI 201. | |
| (Prerequisite for CSCI 303, CSCI 324/524, CSCI 331/551, CSCI 425/625, CSCI 410/610, and MATH 425/625) | ||
| 250 Internet Programming | 3 Credits | |
| Description: | Internet technologies for the World Wide Web such as HTML, DHTML, CGI, JavaScript and Java. Topics include: basics of HTML, page layout control with cascading style sheets, form processing, working with images and JavaScript based animation, fundamentals of CGI programming under Unix/Linux environment, working with multimedia objects, and Java applets. Lecture and lab. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of an appropriate course. MATH 201 recommended. | |
| 270 Cyber Security Essentials | 3 Credits | |
| Description: | Based on the System Administration and Network Security Institute (SANS) recommendations. Offer comprehensive coverage of the essentials that were determined by the collaborative work of security professionals. Includes topics ranging from network security and perimeter defence to encryption and risk management. | |
| Prerequisites: | ||
| 303/503 Algorithms and Data Structures | 4 Credits | |
| Description: | Continuation of CSCI 202. Concepts and techniques for various algorithms and related data structures of particular interest to computer scientists. Emphasis on proper implementation of abstract data types and analysis of the complexity of algorithms. Programming topics include: design of abstract data types; encapsulation; memory management; operator overloading; and inheritance. Lecture. | |
| Prerequisites: | CSCI 202. | |
| (Prerequisite for CSCI 451/651 and CSCI 470/670; Recommended for CSCI 331/551 and CSCI 410/610) | ||
| 320/520 Discrete Structures | 4 Credits | |
| Description: | Cross-listed as MATH 320/520. Continuation of MATH 310. Investigation of concepts of noncalculus mathematics used in computer science, operations research and other areas of applied mathematics. Topics include: set theory; logic; mathematical induction; relations and functions; recurrence relations; combinatorics; graph theory; and related algorithms. Lecture. | |
| Prerequisites: | MATH 310. | |
| (Prerequisite for CSCI 421/621, CSCI 425/625, MATH 421/621, and MATH 425/625) | ||
| 324/524 Assembly Language Programming | 4 Credits | |
| Description: | Fundamentals of Assembly Language programming under DOS, Windows, and Linux operating systems. Topics include: data representation and fundamentals of computer architecture, memory access and organization, arithmetic and logical operations, functions and procedures, bit and string manipulation, pattern matching, computer graphics, interrupt handling and combining assembler with high-level languages. Lecture and Lab. | |
| Prerequisites: | Acceptable score on the Mathematics Placement Test or completion of an appropriate course. MATH 102 recommended. | |
| (Prerequisite for CSCI 461/661; Recommended for CSCI 451/651) | ||
| 331/551 Computer Graphics and 3D Modeling | 3 Credits | |
| Description: | Data structures and algorithms used in computer graphics emphasizing programming rather than graphics design. Topics include: graphics algorithms; design and implementation of graphics applications; 2-D and 3-D modeling; and animation. Mathematical treatment of topics require an understanding of fundamental concepts in calculus and matrix algebra. Lecture and lab. | |
| Prerequisites: | CSCI 201. | |
| 347 Database Systems | 3 Credits | |
| Description: | Cross-listed as CIS 347. Overview of database design, development and use. Introduction to data modeling and data administration in a database environment. Emphasizes topics of current interest such as distributed database applications. Hands-on use of state-of-the-art database management system software. | |
| Prerequisites: | CIS 342 if not a CSCI major. | |
| 340 Software Development and Professional Practice | 4 Credits | |
| Description: | Combines a range of topics integral to the design, implementation and testing of a medium-scale software system with the practical experience of implementing such a project as a member of a programmer team. In addition to material on software engineering, this course includes material on professionalism and ethical responsibilities in software development, human-computer interaction, and information security essentials. Lecture. | |
| Prerequisites: | CSCI 303. | |
| 356 Information Management and Security | 3 Credits | |
| Description: | Information management (IM) olays a critical role in almost all areas where computers are used. This course discusses the representation, organization, transformation, and presentation of information, algorithms for efficient and effective access and updating of stored information, data modelling and abstraction; information security, privacy, and protection in a shared environmen. | |
| Prerequisites: | CSCI 201 recommended. | |
| 381 Special Projects | 1-4 Credits | |
| Description: | Various individual and small-group projects carried out under the supervision of one or more instructors. Requires weekly progress reports plus a final report and/or a final exam. May be repeated, but no more than a total of four credits may be earned from both MATH 381 and CSCI 381. Evaluation: Pass-Fail only. Independent study. | |
| Prerequisites: | Preliminary project plan and an independent study contract. | |
| 390 Mathematical Sciences Internship | 1-4 Credits | |
| Description: | Work in an approved position to gain experience in solving real problems using computer science, mathematics, and statistics. Interns may receive salaried appointments with cooperating companies. Credits do not apply to any major or minor in Mathematics and Computer Science. Evaluation: Pass-Fail only. Independent study. | |
| Prerequisites: | Department approval. | |
| 399 Mathematical Sciences Seminar | 1 Credit | |
| Description: | Cross-listed as MATH 399. Students carry out individual investigations in current literature and present their findings to the entire department. Taken during senior year. Evaluation: Pass-Fail only. Seminar. | |
| Prerequisites: | Independent study contract. | |
| 410/610 Programming Language Principles | 4 Credits | |
| Description: | Survey of programming languages of current interest with in-depth examination of important features and characteristics. Includes an investigation of fundamental programming language concepts and design issues related to the procedural, functional, and object-oriented paradigms. Students conduct programming exercises to discover and experiment with features of several languages and to implement interpreters and compilers for simple languages of their own design. Lecture. | |
| Prerequisites: | CSCI 303. | |
| 421/621 Theory of Computation | 4 Credits | |
| Description: | Cross-listed as MATH 421/621. Thorough introduction to automata, formal languages and computability. Topics include: models of computation; regular and context-free languages; finite and pushdown automata; Turing machines; unsolvable decision problems; fundamentals of computational complexity; and introduction to cryptography. Lecture. | |
| Prerequisites: | CSCI 320. | |
| 425/625 Algorithm Design and Analysis | 4 Credits | |
| Description: | Study of the design and analysis of algorithms that are based on elementary data structures, such as queues, stacks and trees. Some graph and network algorithms (shortest paths, connectivity, coloring, flows, matchings), geometric algorithms (convex hulls, range search, nearest neighbors), NP-complexity, approximation algorithms (vertex cover, traveling salesman, scheduling), and introduction to randomized algorithms. Introduction to algorithm design techniques, including greedy algorithms, divide-and-conquer, and dynamic programming. Lower and upper bounds of program complexity are analyzed. Introduction to algorithms used in the area of information security. Cross-listed as MATH 425/625. Lecture. | |
| Prerequisites: | CSCI 320 required, CSCI 202 recommended | |
| 437/637 Cryptography | 4 Credits | |
| Description: | Study of the theory of cryptography and its use in computer security. Topics include: discrete probability spaces, Shannon's theory of information, unicity distance, perfect cryptoanalysis, (frequency analysis, index of coincidence), authentication and key exchange, public key cryptosystems, elementary number theory, primality checking, the RSA cryptosystem. Cross-listed as MATH 437/637. Lecture. | |
| Prerequisites: | CSCI 201 and MATH 310. | |
| 451/651 Operating Systems | 4 Credits | |
| Description: | In-depth study of the concepts, issues and algorithms related to the design and implementation of operating systems. Topics include: process management; process synchronization and interprocess communication; memory management; virtual memory; interrupt handling; processor scheduling; device management; I/O; file systems; and introduction to networking and network security. Students conduct programming projects and case studies to investigate modern operating systems such as Solaris, Linux, and Windows. Lecture. | |
| Prerequisites: | CSCI 201 | |
| 461/661 Computer Architecture | 4 Credits | |
| Description: | In-depth study of fundamentals of computer hardware organization. Topics include: digital logic design; computer arithmetic; machine instructions and assembly language; memory management and design; storage system design; I/O modules; operating system support; structure and function of computer processors; RISC vs. CISC architecture; microprogrammed control; and computer security. Lecture. | |
| Prerequisites: | CSCI 324. | |
| 470 Net-centric Computing | 3 Credits | |
| Description: | Introduces the structure, implementation, and theoretical underpinnings of computer networking and the applications that have been enabled by that technology. Introduction to network security. Lecture. | |
| Prerequisites: | CSCI 201 | |
| 475/675 Numerical Analysis | 4 Credits | |
| Description: | Cross-listed as MATH 475/675. Study of the theory and applications of computational techniques for mathematical solutions emphasizing rapid approximation and error analysis. Topics include: solution to equations in one variable; polynomial approximations to functions; error analysis; numerical differentiation and integration; numerical solutions to ordinary differential equations; boundary value problems. Lecture. | |
| Prerequisites: | MATH 242. | |
| 481/681 Special Topics | 1-4 Credits | |
| Description: | Investigation of one or more topics of current interest that are not covered in other courses. Not intended for independent study projects. May be repeated, but no more than a total of eight credits may be earned from both MATH 481 and CSCI 481. Lecture. | |
| Prerequisites: | Consent of the instructor. | |
| 499 Capstone Project | 1-3 Credits | |
| Description: | Offers students the opportunity to integrate their knowledge of the undergraduate computer science curriculum by implementing a significant software system as part of a programming team. Independent Study. | |
| Prerequisites: | CSCI 340 and Independent learning contract. | |