ECE 1148 - ALGORITHMIC THINKING

Minimum Credits: 3
Maximum Credits: 3
The course will cover the application of data structures and algorithms to solve complex engineering problems. Topics include: Asymptotic analysis of algorithms, efficient sorting algorithms, proofs, and discrete probability, divide and conquer techniques, dynamic programming, greedy algorithms, graphs and minimum cuts, breadth and depth first searching, shortest path algorithms and more. By way of several programming assignments and projects, students will gain the skills necessary to develop algorithmic solutions using these techniques.
Academic Career: Undergraduate
Course Component: Lecture
Grade Component: Letter Grade
Course Requirements: PREQ: ECE 0302; PLAN: Computer Engineering or Electrical Engineering

Click here for class schedule information.

Add to Portfolio(opens a new window)