Mathematics 2320 is the successor MATH 1190, and the two courses could become the most vauable courses in your university career. They teach you how to think, read, and write logically and with perecion. Something many do not know how to do - most often they don't even know it. Math 2320 in particular focuses on a study of algorithms and their application to important types of probems

The York calendar describes the course as follows:

Growth of functions (0, Omega, Theta notation), complexity of algorithms; recurrence relations, divide-and-conquer, generating functions; graph theory, Euler and Hamilton paths, Dijkstra's algorithm; trees, binary search, spanning trees, Prim and Kruskal algorithms.

The supplemental calendar goes further

Consultion with the Departments of Computer Science and of Mathematics, and with the ITEC Program, has led to the following list of topics for emphasis: “Big O” notation, complexity of formulae and algorithms, modular arithmetic, recursive definitions, general inductions, counting principles, recurrence relations and methods for solving them, trees and simple graph theory. The emphasis will include examples arising from algorithms and the ability to carry out analysis, problem solving, proofs and calculations which will be required in upper level courses. The course does not require previous knowledge of computer science. A student of mathematics should enjoy this introduction to a variety of mathematical topics, many of which are not covered elsewhere. We will emphasize analysis, problem solving, and proofs.