ECE Course Outline

ECE2036

Engineering Software Design (3-3-4)

Prerequisites
ECE 2020/2030 [min C] and ECE 2025/2026* [ min C]* Prerequisites indicated with an asterisk may be taken concurrently with ECE2036
Corequisites
None
Catalog Description
Object-oriented software methods for engineering applications. Numerical analysis methods; simulations and graphical presentation of simulation results; analysis of numerical precision. Programming projects.
Textbook(s)
Deitel and Deitel, C++, How to Program (10th edition), Prentice Hall. ISBN 9780134448848 (required)

Eckel, Thinking in C++: Introduction to Standard C++, Volume One (2nd edition), Prentice Hall, 2000. ISBN 0139798099, ISBN 9780139798092 (required) (comment: text is available free on line at http://original.jamesthornton.com/eckel/)

Course Objectives - As part of this course, students:

  1. Identify, formulate, and solve complex engineering problems by applying principles of eng/sci/math. (primary focus)
  2. Apply eng design to produce solutions to needs with public health/safety/welfare, global/cultural/economic factors. ( moderate focus)
  3. Acquire and apply new knowledge as needed, using appropriate learning strategies. (moderate focus)
Course Outcomes - Upon successful completion of this course, students should be able to:

  1. Write a syntactically and semantically correct program using the object-oriented programming language chosen, such as C++.
  2. Define and develop a computer program to implement specific tasks associated with a well-defined engineering application.
  3. Choose the appropriate data structures to maintain the system state, and explain why the selected one is appropriate.
  4. Choose appropriate algorithms to maintain the progression of the system state, and explain why the selected algorithm is appropriate.
  5. Implement those data structures and algorithms using an object-oriented programming language such as C++.
  6. Use the developed program to analyze performance and behavior of the engineering application being studied .
  7. Create a class hierarchy of software objects with public inheritance and virtual functions to enable the use of polymorphism.
  8. Create class templates and function templates to be used in a generic programming style.
  9. Analyze the numerical error in floating-point calculations of linear equations of at least one multiplication and one addition.
  10. Use commonly available tools for software development, source code maintenance, and debugging.
  11. Implement their program using multiple threads in a shared memory, multiprocessor environment when appropriate.
  12. Recognize when and how an algorithm will benefit from parallelization.
Topical Outline
Required Topics:
   1.Review of C basic syntax, compilation, linking, libraries, etc.
   2.Defining and implementing classes, constructors, destructors etc.
   3.Member functions, virtual functions, pure virtual functions
   4.Argument passing variations (by value, by pointer, by reference)
   5.Managing dynamic memory (new, delete)
   6.Inheritance and subclassing
   7.Using common tools, gdb, make, gprof, valgrind, emacs etc.
   8.Floating Point precision and numerical analysis
   9.Introduction to Templates, including data structures and algorithms in the Standard Template Library
   10.Parallel processing and concurrency
Optional Topics:
   11.Exceptions
   12.Smart Pointers

Typical Programming Projects:
   1.One dimensional and two dimensional Fast Fourier Transforms, using the Cooley-Tukey algorithm
   2.Matrix multiplication using dynamic memory allocation for arbitrary sized matrices, and efficient representation for sparse matrices.
   3.Single variable numerical methods to solve first-order differential equations, using forward Euler, backward Euler, and Crank-Nicolson methods
   4.Embedded programming projects using sensor feedback, interupt driven I/O, PWM control of external devices, and graphical output
    5.   Optimal (and non-optimal) search for solving problems with multiple solutions, including heuristic algorithms for approaching NP-complete problems