Course CSE215
Title Foundations of Computer Science
Credits 3
Course Coordinator

Himanshu Gupta


Introduction to the logical and mathematical foundations of computer science. Topics include functions, relations, and sets; recursion and functional programming; elementary logic; and mathematical induction and other proof techniques. This course is offered as both CSE 215 and ISE 215.

Prerequisite AMS 151 or MAT 125 or MAT 131
Course Outcomes
  • An ability to define and use discrete structures such as functions and sets.
  • To understand recursion as a computing paradigm.
  • An ability to use logic and basic proof techniques, such as mathematical induction.


Susanna Epp, "Discrete Mathematics with Applications", Brooks/Cole (Thomson), 4th ed., 2010, ISBN: 978-0495391326.

Major Topics Covered in Course
  • Logic (compound statements, quantifiers, etc.)
  • Proof methods
  • Mathematical Induction and Recursion
  • Set theory
  • Functions (at least: one-to-one, onto, composition)

Laboratory Projects
Course Webpage