Discrete Structures in Engineering
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.
- Credit will be granted for only one of ECE 242, CENG 242.
- May not be counted for credit towards a Computer Science degree program.
Undergraduate course in Electrical and Computer Engineering offered by the Department of Electrical and Computer Engineering in the Faculty of Engineering.