Dept. of Computer Science, York University

Required Mathematics Courses

The introductory courses MATH1090.03 and MATH1300.03 , and MATH1310.03 are required of all Computer Science majors. If a student has not taken a grade 13 calculus credit or equivalent, MATH1500.03 must also be completed before taking MATH1300.03. In addition, some combination, or all of, the following mathematics courses will also be required, depending on the degree programme; MATH2090.03, MATH2320.03, and MATH2221.03.

MATH 1090.03 Introduction to Sets and Logic (formerly MATH1120.03)

Section A Mon, Wed, Fri 11:30
Section B Tues 9:30-11:30, Thurs 9:30
Section C Tues, Thurs 2:30-4:00

Section M Tues, Thurs 11:30-1:00

This course is an introduction to sets, functions, relations, logic, induction and proof techniques, and may include a smattering of basic combinatorics and graph theory. It should be of value to mathematics or computer science majors, and may also appeal to students wanting to apply mathematics to the social and management sciences.

The final grade will be based on class tests and a final examination (and possibly assignments).

Texts: t.b.a.

Prerequisites: One credit of OAC (Ontario Grade 13) mathematics or equivalent.

Degree Credit Exclusions: AS/SC/MATH1120.03.

The course is not open to students who have taken or are taking any mathematics course at 3000 or higher level, AK/MATH1409A.03, AK/MATH2400.06, AK/MATH2440.06, AK/MATH2441.03.

Course Director: t.b.a

MATH 1300.03 Differential Calculus With Applications

Section A Mon, Wed, Fri 8:30
Section B Tues, Thurs 10:00-11:30
Section C Mon, Wed, Fri 12:30
Section D Tues, Thurs 2:30-4:00 (back-up, not open for enrolment)

Section M Tues 12:30-2:30, Thurs 12:30

Topics include functions, limits, continuity, differentiation, mean-value theorem, curve sketching, maxima and minima, Riemann integration, antiderivatives, fundamental theorem of calculus.

The final grade may be based on assignments, quizzes, class tests and a final examination worth at least 30%.

Texts: t.b.a.

Prerequisites: OAC.Calculus or AS/SC/MATH1500.03 or equivalent.

Degree Credit Exclusions: AS/SC/MATH1000.03, AS/SC/MATH1013.03, SC/MATH1505.06, AS/MATH1530.03, AS/MATH1550.06, AS/ECON1530.03, SC/ACMS1030.06, SC/ACMS1050.06, AK/MATH1410.06, AK/MATH 1300.03, AK/MATH1550.06, AK/MATH1409B.03.

Course Director: t.b.a

MATH 1310.03 Integral Calculus with Applications

Section A Mon, Wed, Fri 9:30

Section M Mon, Wed, Fri 8:30
Section N Tues, Thurs 10-11:30
Section P Mon, Wed, Fri 12:30
Section Q Tues, Thurs 2:30-4:00 (back-up - not open for enrolment)

This is the second in a series of introductory calculus courses. It is designed to follow MATH 1300.03.

Topics include fundamental theorem of calculus, logarithmic and exponential functions, trigonometric functions, techniques of integration, applications of integration theory, l'Hôpital's rule, infinite sequences and numerical series.

The final grade may be based on assignments, quizzes, class tests, and a final examination worth at least 30%.

Texts: t.b.a.

Prerequisites: One of AS/SC/MATH 1000.03, AS/SC/MATH 1013.03, AS/SC/MATH 1300.03, or, for non-Science students only, one of AS/MATH 1530.03 and AS/MATH 1540.03; or AS/MATH 1550.06; or AS/ECON 1530.03 and AS/ECON 1540.03.

Degree Credit Exclusions: AS/SC/MATH 1010.03, AS/SC/MATH 1014.03, SC/MATH 1505.06, SC/ACMS1030.06, SC/ACMS1050.06, AK/MATH1310.03, AK/MATH1410.06.

Course Director: t.b.a

MATH 2090.03 Introduction to Mathematical Logic

Section M Mon, Wed, Fri 8:30
Section N Mon, Wed, Fri 2:30
Section P Mon, Wed, Fri 3:30 (back-up - not open for enrolment)

Logic is the "official" language of mathematics and is essential in establishing the foundations on which mathematics is built. In recent years, logic has also come to play a fundamental and major role in computer science. A knowledge of logic is now an absolute necessity for the computer professional. In this course we will introduce the student to the basics of mathematical logic and deductive reasoning. The course is primarily intended for Computer Science students but would be valuable to any student interested in formal reasoning. The topics covered will include the syntax and semantics of both propositional and predicate logic, an introduction to some axiomatic theories and a more detailed study of Peano arithmetic and induction.

There will be assignments using software for the PC computers; equipment will be available at the Steacie labs.

The final grade will be based on two class tests and a final examination (and possibly assignments).

Text: F.D. Portoraro, SYMLOG.

Prerequisite: AS/SC/AK/MATH1090.03 or AS/SC/MATH 1120.03 or any 2000-level MATH course (without second digit 5) or permission of the course director.

Course Director: t.b.a

MATH 2221.03 Linear Algebra with Applications I

Section A Mon, Wed, Fri 2:30
Section B Tues, Thurs 10:00-11:30
Section C Mon, Wed, Fri 10:30

Section M Mon, Wed, Fri 10:30

Linear algebra is a branch of mathematics which is particularly useful in other fields and in other branches of mathematics. Its frequent application in the engineering and physical sciences rivals that of calculus. Computer scientists and economists have long recognized its relevance to their discipline. Moreover, linear algebra is fundamental in the rapidly increasing quantification that is taking place in the management and social sciences. Finally, it is essential to higher mathematics courses in algebra, analysis, probability and statistics and geometry, where the ideas of linear algebra reappear.

This course and MATH2222.03 form a standard full-year introduction to linear algebra. While the presentation is not excessively theoretical, proofs will be presented and the student is expected to master concepts as well as results. Applications will be left mainly for MATH 2222.03.

Topics to be studied include: systems of linear equations and matrices, determinants, linear dependence and independence of sets of vectors in Rn, vector spaces, inner product spaces and the Gram-Schmidt process.

The final grade will be based on term work and a final examination(with possible weights of 60% and 40% respectively).

Texts: t.b.a.

Prerequisite or Corequisite: As prerequisite, one of SC/MATH 1505.06, AS/MATH 1540.03, AS/MATH 1550.06, AS/ECON 1540.03, or as prerequisite or corequisite: AS/SC/MATH 1000.03 or AS/SC/MATH 1013.03 or AS/SC/MATH 1300.03.

Degree Credit Exclusions: AS/SC/MATH1025.03, AS/SC/MATH2000.06; AS/SC/MATH 2021.03, SC/ACMS 1020.06; AK/MATH2220.06.

Course Director: t.b.a

MATH 2320.03 Discrete Mathematical Structures

Section A Mon, Wed, Fri 1:30
Section B Mon, Wed, Fri 2:30

This course is intended primarily, but not exclusively, for Computer Science students. It aims to provide an intensive introduction to a variety of algebraic and combinatorial structures which are needed in computer science. A student of mathematics should enjoy being introduced to this variety of mathematical topics, many of which are not covered elsewhere. The course does not require a previous knowledge of computer science.

In broad categories the topics to be covered include set theory (relations, functions, ...), combinatorics, graph theory and abstract algebra (posets, lattices, Boolean algebra, groups, ...). The emphasis will be on examples and on extracting common properties.

This course is a prerequisite for COSC 3101.03, COSC 3402.03, COSC 4101.03, COSC 4111.03.

The final grade may be based on two class tests (25% each), and a final examination (50%).

Texts: t.b.a.

Prerequisite: AS/SC/AK/MATH 1090.03 or AS/SC/MATH 1120.03 or any 2000-level MATH course (without second digit 5) or permission of the course director.

Degree Credit Exclusions: AK/MATH 2440.06, AK/MATH2442.03.

Course Director t.b.a.

Elective Courses

Students in Computer Science sometimes feel their study in this discipline is quite isolated from the other programmes in their Faculty, and place little emphasis on their choice of other courses, even though about a quarter of their courses are electives. This is a mistake - computer science supports applications in every information-using discipline, and in order to make creative and effective use of your skills in computing, you need to know much more of the natural world, the man-made world, and the world of ideas, than can be learned in courses in computing.

Mathematics and Economics are obvious choices for elective courses, but there are many other possibilities. Some of them (culled from last year's course offerings) are listed below, not as recommendations - your own interests may suggest quite different choices - but to show that there are courses whose announced content meshes with issues and problems studied in computer science.

Not only should you consider taking individual courses in other subjects but you should also consider taking a concentration of courses which together form a coherent or complementary package. Such a concentration may come from one discipline (one of the sciences, for example, because of their hierarchical structure) but it may also come from two or three disciplines on related concepts presented from different perspectives. It may also be necessary to take specific prerequisites before you can take a desired elective course; such combinations also form coherent concentrations.

Faculty of Arts
Calumet College Tutorial





Natural Science


Social Science

Faculty of Fine Arts

Faculty of Pure and Applied Science
Bethune College



Earth and Atmospheric Science


Kinesiology and Health Science


Physics and Astronomy


Courses Outside the Department and Double Speed Courses

The Department of Computer Science does not grant any credit to courses taken at double speed. A double speed course is one having more than 3 lecture hours per week.

Students wishing to take courses at Atkinson College or at another institution should consult the Director of Undergraduate Studies for advice. A list of equivalent courses at Atkinson College is available at the Office of Science Academic Services.

Return to the York Computer Science Home Page.