ECE 242

Discrete Structures in Engineering

Units: 1.5

Hours: 3-0-0

Formerly: CENG 242

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.

Notes:

  • Credit will be granted for only one of ECE 242, CENG 242.
  • May not be counted for credit towards a Computer Science degree program.

Prerequisites:

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

Schedules:
Summer 2018 Fall 2018 Spring 2019

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Before these dates the class schedule will show "No classes were found that meet your search criteria". If this message is shown after these dates, the course is not scheduled for the selected term.