MAD-MATHEMATICS: DISCRETE
 

MAD 3107         Discrete Mathematics and Applications              3

Prerequisite: COT 3100 or MHF 3202.

Introductory combinatorics, counting, graphs and trees, and their applications; relations and partial orders; some algorithms associated with applications of graphs, trees, and relations. (General Studies Course: MAT) and (Gordon Rule Course: Theoretical Math).

MAD 4401         Numerical Analysis                   3

Prerequisite: MAS 3105.

Numerical solutions of equations in one variable, interpolation and polynomial approximation, numerical differentiation and integration, numerical solutions of initial value and boundary value problems for O.D.E., direct methods for solving linear systems, iterative techniques in matrix algebra. Some problems solved with aid of computer. A computer language is required prior to this course. (Gordon Rule Course: Theoretical Math).

MAD 4605         Coding Theory             3

Prerequisite: MAS 3105.

Explores coding theory from a mathematical viewpoint. Focuses mainly on binary codes and codes over fields of characteristic 2. Introduces error-detecting and error-correcting codes and the construction, encoding and decoding of certain families of codes important in engineering and computer science. Offered concurrently with MAD 5608; graduate students will be assigned additional work.

MAD 5608         Coding Theory                3

Prerequisite: MAS 3105.

Explores coding theory from a mathematical viewpoint. Focuses mainly on binary codes and codes over fields of characteristic 2. Introduces error-detecting and error-correcting codes and the construction, encoding and decoding of certain families of codes important in engineering and computer science. Offered concurrently with MAD 4605; graduate students will be assigned additional work.

MAD 6405         Numerical Analysis I               3

Prerequisite: MAD 4401 and MAS 5107.

Theoretical treatment of numerical methods of linear algebra supplemented with use of computers; polynomial approximations, uniform approximations, least square approximations, error analysis for numerical solutions of linear equations, algebraic eigenvalue problems.