Skip to main content

Home  |  Courses  |  ENGS 66

ENGS 66 - Discrete Mathematics in Computer Science

Description

This course integrates discrete mathematics with algorithms and data structures, using computer science applications to motivate the mathematics. It covers logic and proof techniques, induction, set theory, counting, asymptotics, discrete probability, graphs, and trees.

Prerequisites

ENGS 20 or COSC 1 and COSC 10 or advanced placement

Cross Listed Courses

COSC 030

Distribution Code

QDS

Offered

Term
Time
Location / Method
Instructor(s)
Term: Fall 2024
Time: 9L
Location:

Cummings 200

Instructors:

A&S Faculty