Number of lectures per week: 3
Assessment: Assignments counting 15%
End-of-year Examination: One three hour examination
Mappings: partial, total, injective, surjective, bijective, invertible and Boolean
Graphs: complete, bipartite, Euler, Hamilton paths; Directed graph: adjacency matrix, finite relations; Trees: binary, height and nodes
Algebraic structures: semigroups, monoids and groups; Homomorphisms and isomophisms.
Grammars: phrase structure and Chomsky hierarchy; Languages: context free and regular; Machines: finite state acceptors
Fourier Series: orthonormal functions, Euler coefficients, half-range expansions, truncated series approximation.
Judith L. Gersting, Mathematical Structures for Computer Science, W. H. Freeman.
D. J. Cooke & H. E. Bez, Computer Mathematics, Cambridge University Press.
R. P. Grimaldi, Discrete and Combinatorial Mathematics, Addison-Wesley.
W. E. Boyce & R. C. DiPrima, Elementary Differential Equations, John Wiley.
May 13, 1999