CENG 242

Discrete Structures in Engineering

Units: 1.5

Hours: 3-0

Introduction to the use of recurrence relations and generating functions in engineering problems. Engineering modeling with graphs. Graph representation and traversal techniques, and their computational complexity. Use of branch-and-bound, divide-and-conquer, greedy, network flow, dynamic programming, approximation, and heuristic algorithms in Electrical and Computer Engineering applications.


  • May not be counted for credit towards a Computer Science degree program.


Undergraduate course in Computer Engineering offered by the Department of Electrical and Computer Engineering in the Faculty of Engineering.

Fall 2017 Spring 2018 Summer 2018

Note that not all courses are offered in every term. If a course is not offered, the schedule page will alert you that "No classes were found that meet your search criteria."