Requirements/prerequisites: None

Duration:
Number of lectures per week: 2 lectures, 1 tutorial

Assessment: Regular programming assignments, counts 25%

End-of-year Examination: One 3-hour annual examination, counts 75%

Description:

More detailed information, problems sheets and problem sheet solutions can be found at

• Computer Architecture: memory/processor model, memory organization, data formats, binary, octal, decimal, and hexadecimal arithmetic.

• The C Compiler: declarations, input/output, assignment statements, precedence, if, while, and for statements, functions, argument passing in functions, pointers, arrays, system libraries, mathematical function libraries, memory allocation.

• Numerical Methods: Root Finding through Bracketing and Bisection, Newton Raphson method, Golden Section search in one dimension to find maxima and minima, Numerical solution of ordinary differential equations (initial value problems), Numerical Integration, Random Numbers, Matrices and vectors; Gaussian Elimination; eigenvalues and eigenvectors; Sorting and searching.

Reading List:

1. A Book on C, A. Kelly and I. Pohl (The Benjamin Cummings Publishing Company).

2. Practical C Programming, 3rd Edition, Oualine, (O'Reilly Publishing).

3. The C Programming Language, Kernighan and Ritchie (Prentice Hall)

4. Numerical Recipes in C, Press, Teukolsky, Flannery, and Vetterling (Cambridge University Press)

Oct 17, 2005