List of Topics (By Week): 1. Course Introduction. Principles of working effectively and ethically in a team. 2. Algorithm design and analysis. Translating a written problem statement into a mathematical model that is suitable for algorithm development. Implementation of sequential instructions. 3. Implementation of sequential instructions continued. Utilization of standard library mathematical functions. Programming with defined constants. 4. Top-down design and modular programming (functions). 5. Programmer-designed functions continued. Passing parameters by value and by address. Comparison of functions in C with those in MATLAB. Pass by value, pass by address, and returning multiple values from programmer-defined functions. 6. Logical data. Selection constructs. Two-way selection, multi-way selection, principles of good selection design. 7-8. Repetition constructs, pre-test, post-test, and recursive iteration. 9. Input and output using files. Working with large quantities of data. Using composite data. 10-11. Arrays. Arrays and functions. Sorting and searching. 12. Strings. 13. Pointers. Dynamic memory allocation. 14-15. Advanced topics: structures, enumerations, and dynamic data structures, Connections to Fortran. 2006.03