COM1002 Foundations of Computer Science

Aims/Description: In the first semester of this module, we will cover the topics in discrete mathematics that provide an essential foundation for later studies in the department. This includes topics such as sets, functions, sequences and relations, propositional and predicate logic, boolean algebra, combinatorics, induction, recursion, proof strategies, and graph theory. In the second semester of this module, we will cover the topics in continuous mathematics that provide an essential foundation for later studies in the department. This includes topics such as trigonometric, exponential and logarithmic functions, polynomials, limits and continuity, differential calculus of one and two variables, integration, series summation and power series, matrices, vector calculus and linear algebra.

Staff Contact: ZHUKOVSKII MAKSIM

Teaching Methods: Lectures, Tutorials, Independent Study

Assessment: Formal Exam

Notes: This unit forms part of an accredited degree programme

Information on the department responsible for this unit (Computer Science):

Departmental Home Page

Teaching timetable

NOTE The content of our courses is reviewed annually to make sure it's up-to-date and relevant. Individual modules are occasionally updated or withdrawn. This is in response to discoveries through our world-leading research; funding changes; professional accreditation requirements; student or employer feedback; outcomes of reviews; and variations in staff or student numbers. In the event of any change we'll consult and inform students in good time and take reasonable steps to minimise disruption.

URLs used in these pages are subject to year-on-year change. For this reason we recommend that you do not bookmark these pages or set them as favourites.

Teaching methods and assessment displayed on this page are indicative for 2025-26.