Electrical and Computer Engineering (ECE) Courses>Discrete Structures in Engineering

ECE242 - Discrete Structures in Engineering

Description

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.

Units

1.5

Hours: lecture-lab-tutorial

3-0-0

Formerly

CENG 242

Note(s)

  • 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

  • Complete all of:
    • MATH101 - Calculus II (1.5)
    • MATH110 - Matrix Algebra for Engineers (1.5)

Course offered by

Department of Electrical and Computer Engineering

Course schedules

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

Use the buttons below to search the timetable. If the search results show 0 classes and the message ‘Please search again’, then the class is not scheduled for the selected term.