Mathematics and Computer Science he Mathematics and Computer Science Ma 315, Probability and Statistics TDepartment at Benedictine College is Ma 356, Modern Algebra I committed to maintaining a curriculum that Ma 360, Modern Algebra II or provides students with the necessary tools Ma 480, Introduction to Real Analysis to enter a career in their field with a broad, Ma 488, Senior Comprehensive solid knowledge of mathematics or computer Ma 493, Directed Research science. Our students are provided with the six hours of upper-division math electives knowledge, analytical, and problem solving and Cs 114, Introduction to Computer skills necessary to function as mathematicians Science I or Cs 230, Programming for or computer scientists in our world today. Scientists and Engineers The mathematics curriculum prepares stu- dents for graduate study, for responsible posi- Requirements for a major in tions in business, industry, and government, Computer Science: and for teaching positions in secondary and Cs 114, Introduction to Computer Science I elementary schools. Basic skills and tech- Cs 115, Introduction to Computer Science II niques provide for entering a career as an Ma 255, Discrete Mathematical Structures I actuary, banker, bio-mathematician, computer Cs 256, Discrete Mathematical Structures II programmer, computer scientist, economist, Cs 300, Information & Knowledge engineer, industrial researcher, lawyer, man- Management Cs 351, Algorithm Design and Data Analysis agement consultant, market research analyst, Cs 421, Computer Architecture mathematician, mathematics teacher, opera- Cs 440, Operating Systems and Networking tions researcher, quality control specialist, Cs 488, Senior Comprehensive statistician, or systems analyst. Cs 492, Software Development and Computer science is an area of study that Professional Practice is important in the technological age in which Cs 493, Senior Capstone we live. The computer science major at Bene- And one course in mathematics selected from dictine College provides a balanced approach Ma 131 or Ma 211. to the discipline, treating computing both as an art and as a tool for varied use. The major The requirements for a minor in prepares students for graduate study in the Mathematics: field of computer science or for employment Ma 131, Calculus I in an ever-expanding spectrum of occupations Ma 132, Calculus II dependent upon computing. The minor pro- Ma 250, Linear Algebra or vides a useful addition to many areas of study, Ma 255, Discrete Mathematical Structures I including mathematics, science, business, and and six additional hours of mathematics, three mass communications. of which must be upper-division. Requirements for a major in The requirements for a minor in Mathematics: Computer Science: Ma 131, Calculus I Cs 114, Introduction to Computer Science I Ma 132, Calculus II Cs 115, Introduction to Computer Science II Ma 233, Calculus III Ma 255, Discrete Mathematical Structures I Ma 250, Linear Algebra and two courses selected from Cs 256, Cs Ma 255, Discrete Mathematical Structures I 300, Cs 351, Cs 421, or Cs 440 204 For each of the above curricula, the stu- Those students planning to enroll in gradu- dent’s upper-division program is to be ate school in mathematics should include both planned with an advisor from the department Ma 360 and Ma 480 in their course of study. and approved by the chair of the department. Transfer students majoring in Math- Placement Procedure Information: ematics or Computer Science must take a The Department of Mathematics and minimum of 40% of the coursework required Computer Science has set up placement pro- for the major at Benedictine College. cedures to help students enroll in mathematics Transfer students pursuing a minor in Math- courses in which they will more likely be suc- ematics or Computer Science must take a cessful. minimum of 25% of the coursework required For further information on placement for the minor at Benedictine College. procedures, contact the chair of the Depart- ment of Mathematics and Computer Science. Admission to the Mathematics Major: In order to be admitted to the mathemat- ics major, a student must have completed Cs 101 at Benedictine College at least one required Computer Science Fundamentals (3) (F) mathematics course from the list above, and This course provides an introduction to com- must have a grade point average of at least 2.7 puter science and programming fundamen- in mathematics courses at Benedictine Col- tals for students who have had no previous lege. programming experience. Topics include hardware, networks, databases, artificial intel- Prospective Mathematics Teachers: ligence, operating systems, and the Internet. Those preparing to teach mathematics in The students will use a high level program- elementary schools should choose Ma 211, ming language to learn about variables, con- Ma 110, and Ma 111. In addition, those who ditional execution, user interaction, looping, choose mathematics as an area of concentra- and functions. There is an integral laboratory tion should take Ma 131, Ma 255, and Cs 114. component. (QA) Those preparing to teach mathematics in secondary schools must complete require- Cs 114 ments for a major in mathematics that Introduction to Computer Science I (4) includes Ma 360 and Ma 465. In addition, they (S) must take Ma 290 and Ma 457. The prospec- This course introduces the fundamental con- tive secondary teacher should consult with the cepts of computer programming from an chair of the department regarding additional object-oriented perspective. Topics covered mathematics content assessments that must be include simple data types and some simple completed prior to student teaching. The sec- data structures, message passing, subclasses, ondary teacher is required to take education inheritance, polymorphism, and conditional courses for a B.A. in Secondary Education to and iterative control structures. Through study receive certification and should consult with of object design, this course also introduces the chair of the Department of Education. the basics of software engineering. A closed lab is an integral part of this course. Prereq- Recommendations: A student should not uisite: Ready to take Pre-calculus or higher. attempt a mathematics or computer science (QA) course unless he or she received at least a ‘C’ in its prerequisite. For a natural world founda- tion, Pc 210 is recommended for mathematics majors. 205 Cs 115 Ma 255, focusing particularly on topics that Introduction to Computer Science II (4) contribute to further study of computer sci- (F) ence as a discipline. Topics include relations, This course continues the introduction of matrices, computational complexity, elemen- object-oriented programming begun in tary computability, discrete probability, recur- Cs 114, with an emphasis on algorithms, rence relations, and a continuation of the data structures, software engineering, and the study of graph theory begun in the previous social context of computing. A closed lab is course. Prerequisites: Ma 255, Cs 114. an integral part of the course. Prerequisite: Cs 114. Cs 300 Information and Knowledge Cs 198 Management (4) (F) Special Topics (1–4) This course uses the idea of information as These are topics not included in the regular a unifying theme to investigate a range of catalogue. They may be taken more than once issues focusing on database systems design if the subject matter varies sufficiently. Pre- and management. Topics include ER mod- requisite: Permission of instructor. eling, relational algebra and calculus, SQL, functional dependency theory, normalization Cs 200 techniques, query processing and optimiza- Programming Short Course (2) (D) tion, and other issues such as concurrency and This course is designed to provide the student security. A closed lab is an integral part of the with a working knowledge of a particular course. Prerequisites: Cs 115 and Ma 255. programming language. Students write pro- grams of moderate complexity in the given Cs 351 language. May be taken more than once if the Algorithm Design and Data Analysis (4) programming language is different. Prerequi- (S) site: Permission of instructor. This course introduces formal techniques to support the design and analysis of algorithms, Cs 230 focusing on both the underlying mathematics Programming for Scientists and theory and practical considerations of effi- Engineers (3) (S) ciency. Topics include asymptotic complexity This course introduces the fundamentals bounds, techniques of analysis, and algorith- of computer programming using C++. The mic strategies. A closed lab is an integral part focus of the course is programming for sci- of the course. Prerequisites: Cs 115 and Cs entific and engineering needs. Topics include 256. basic data types and data structures, pointers, expressions, iterative and conditional control Cs 398 structures, visualization, and object-oriented Special Topics (1–4) programming. Corequisite: Ma 131. Students These are topics not included in the regular who have received credit for Cs 115 may not catalogue. They may be taken more than once take this course without permission of instruc- if the subject matter varies sufficiently. Pre- tor. requisite: Permission of instructor. Cs 256 Cs 421 Discrete Mathematical Structures II (3) Computer Architecture (4) (F) (S) This course introduces students to the organi- This course continues the discussion of dis- zation and architecture of computer systems, crete mathematical structures introduced in beginning with the standard