Professional Documents
Culture Documents
2. COURSE DESCRIPTION
Content:
Sets: Sets, subsets, set operations, Venn diagrams, algebra of sets
Proofs: Mathematical statements, general and particular statements, converse and contra positive
of a statement. Methods of proof, direct proof, proof by contradiction, contra positive and
mathematical induction.
Number Systems: Natural, integer, rational, real and complex numbers. Mention the Peano
postulates for the natural numbers, ordering and well ordering. Mention the formal development
of the integers from the natural numbers, the rational numbers from the integers, the real numbers
from the rational and the complex numbers from the real numbers. The rational numbers as an
ordered field. The supremum and infimum and the completeness axiom of the reals, mention
Dedeking cuts. Rational exponents of positive real numbers; intervals, inequalities and absolute
values. Complex plane, De Moivre's theorem, nth roots, complex roots of real polynomials.
Countable and uncountable sets, cardinality.
Relations: Set products, ordered pairs, relations, inverse relations, equivalence relations,
partitions.
Functions of one variable: Definition, domain, range, and graph of a function. Arithmetic
operations on functions, composition of functions, polynomial and rational functions. Indicative
subjective and objective functions: inverse functions; monotone, bounded and unbounded
functions
Sequences: Convergence, sum, product and quotient rules of limits, monotone convergence
theorem.
Textbook:
Cappitt, D., Mathematical Analysis: An Introduction, UDSM, 1990.
Reference:
Parzynski, W. and Zipse, P., Introduction to Mathematical Analysis, McGraw-Hill. 1996
MT 114: COMPUTER PROGRAMMING 3 UNITS
Objectives:
By the end of this course a student will be able to:
Content:
Algorithm design: Flow charts, Pseudocode
Programming with C++: Application areas, Key features, Portability, Structured Programming,
Basic Input/Output operations
Fundamental data types: Characters, Integers, Float, Type-casting
Operators and Expressions: Arithmetic operators, Operator precedence
Conditions: If-else-if statement, Switch Statement
Iterations: while-loop, do-while-loop, for-loop, break command, continue command
Functions: Standard library functions, User defined functions, passing parameters
Data structures: Arrays and Strings, enumerations, structures, Introduction to pointers
File handling
Textbook
Kruse & Tondo , Data structure and Program designing in C++, Prentice-Hall, 1995
References:
John R. Hubbard, Schaum's Outline of Fundamentals of Computing with C++, McGraw-Hill
Trade, 1998
Byron S. Gottfried, Schaum's Outline of Programming with C, McGraw-Hill Trade, 1998
Objectives:
By the end of this course a student will have gain knowledge of:
Basic ideas of elementary probability and statistics
Concepts of calculus and differential equations
Matrices operations
Elementary Probability and Statistics: Events, Independent and dependent events, mutually
exclusive events, Definition of frequency, Frequency distribution, cumulative distribution, pie
chart, histogram. Raw data, class interval, class boundary, class marks and class marks. Mean,
Median, and Mode, Standard deviation, Normal distribution, introduction to Sampling
techniques.
Ordinary Differential Equations: Definition with examples of ordinary differential equations, first
order differential equations, separation of variables, homogeneous differential equation, exact
differential equation, integrating factors, introduction to second order differential equations.
Some applications of differential equations (population decay and growth, radioactive decay etc.)
Textbook:
Thomas and Finney, Calculus and Analytic Geometry, Addison-Wesley, 9th ed., 1996
Reference
E. Kreyzig: Advanced Engineering Mathematics, Wiley, 8th Ed, 1998
Bajpai, A. C, I. M. Calus & J. A. Fairley, Mathematics for Engineers and Scientists John Wiley &
Sons, 1973.
Content
Limits of functions: Epsilon-delta definition of limits; basic theorems on limits, elementary
functions and their limits; one-side limits, asymptotic limits; curve sketching.
Vector functions: Two and three dimensional distance. Vector valued functions of one variable
and the epsilon-delta concept of limit; continuity and differentiation.
Improper integrals: Improper integrals of first and second kind; mention applications of
integrals of exp(-x^2); introduction of integral transforms, including Laplace transforms and their
applications, gamma functions and it properties and relation to beta functions, analytic
continuation into the negative half of the x-axis
Infinite series: Convergence and convergence tests (comparison, integral and ratio test, etc);
alternating series conditional and absolute convergence. Power series and convergence;
differentiation and integration of power series; Taylor series, Maclaurin series.
Textbook:
Parzynski, W.&Zipse, P.: Introduction to Mathematical Analysis, McGraw-Hill, 1996.
Reference:
Cappitt, D., Mathematical Analysis: An Introduction, UDSM, 1990
Objective
By the end of this course a student will be able to:
State and prove theorems on linear algebra.
Apply techniques of applied linear algebra
Content:
1. Matrices
Definitions, Properties of matrix operations, Special Types of matrices (Triangular, Diagonal,
Identity, Symmetric, skew symmetric, and Orthogonal.), Elementary Row operations, Reduction to
Row echelon Forms, Computation of the inverse matrix by elementary row operations, rank of a
matrix
2. Determinants
Definition, Evaluating of determinants by row and column, Properties, Evaluating determinants by
Row Reduction, finding the inverse of a matrix by using the determinant.
6. Linear Transformations
Definitions, Kernel and Range, Inverse Linear transformations, Matrices of linear
transformations co-ordinate transformation, change of basis, rotation matrices, rotation of co-
ordinate axes.
Textbook:
Kolman, B.: Introductory Linear Algebra with Applications 4th ed.; Macmillan Publishing Co. NY,
1984.
Reference:
Anton, H.: Elementary Liner Algebra; Prentice-Hall International, Inc; New Jersey, 1997.
Objective
By the end of this course a student will be able to:
Prove theorems in Boolean algebra
Explain concepts applied in counting techniques
Describe the different kinds of graphs and their application in computer science
Content:
1. Boolean Algebra
Introduction, AND OR, and NOT operators, Boolean Functions, Laws of Boolean Algebra,
Duality, Abstract definition of A Boolean Algebra, Representing Boolean Functions, sum of
Product (SOP) AND Product of sums (POS) forms of Boolean functions NAND, NOR, XOR,
AND XNOR operators. Functional completeness, Logic gates: simplification of Boolean
functions, Karnough maps of up to 4 variables.
2. Enumerative Analysis
Introduction, Recurrence relations solving homogeneous and inhomogeneous recurrence
relations. Principle of inclusion - exclusion. Generating functions
Text Book:
Kenneth H. Rosen, "Discrete Mathematics and its applications" Mac Graw-Hill International
Editions, Singapore, 1995
Objectives:
By the end of this course a student will be able to:
Students to have basic concepts and computational techniques in the algebra of vectors, matrices
and complex numbers and their applications in science and engineering
To introduce students into techniques to evaluating limits and extend them to differentiability
To develop the necessary techniques for differential calculus
Content:
1. Vector Algebra
Scalars, vectors in R3, geometrical representation, addition and subtraction of vectors,
multiplication with scalar, Cartesian coordinates and vectors; Unit vectors i, j, k , dot (or scalar)
product, direction angles, projections, orthogonal vectors; cross (or vector) product, scalar triple
product, linear dependence and independence; lines and planes in R3; vector product of 3 or more
vectors.
2. Matrix Algebra
Matrix, addition and subtraction of matrices, multiplication , row reduced echelon, transpose of a
matrix; square matrices, singular and non-singular matrices, inverse matrices; orthogonal
matrices, system of linear equations, solution by Gauss-Jordan algorithm
3. Determinants
Determinant, evaluation of determinant of any square matrices.; elementary properties;
application in solving systems of linear equations; eigenvalues and eigenvectors, physical and
engineering applications
4. Complex Numbers
Field properties of complex numbers, Argand diagram, polar form, Euler's formulas, de Moivre's
theorem, nth roots , complex roots of real polynomial
6. Review of Differentiation
The derivative, differentiation of algebraic, trigonometric and composite functions; higher order
derivatives, second derivative tests for maximum and minimum, curve sketching, the L' Hospital's
rule, Applications in engineering and science.
Text books:
Thomas and Finney, Calculus and Analytic Geometry, Addison-Wesley, , 9th ed., 1996
Reference
E. Kreyzig: Advanced Engineering Mathematics, Wiley, 8th Ed, 1998
Bajpai, A. C, I. M. Calus & J. A. Fairley, Mathematics for Engineers and Scientists John Wiley &
Sons, 1973.
Objective:
At the end of the course a students will develop necessary analytical and numerical skills in
techniques of integration and solving ordinary equations
Content:
1. Review of Techniques of Integration
The indefinite and definite integrals, integration theorems (without proofs), integration by parts,
integration of powers of trigonometric functions (sine, cosine, tangent, cotangent, secant,
cosecant), integration by trigonometric substitution; evaluation of improper integrals;
Applications in Analysis, science and engineering.
2. Differential Equations
Meaning of solution, first order differential equations; graphical solution, separation of variables,
homogeneous and reducible to homogeneous differential equations, exact and reducible to exact
differential equations; linear initial value problems, second order differential equations with
constant coefficients; second order differential equations with variable coefficients (e.g. Bessel,
Legendre Differential Equations).
3. Sequences
Sequences, convergence, sum product and quotients.
4. Numerical Methods
Zeros of a function; methods of their determination: secant and regular falsi methods, Newton-
Raphson method; iteration finite differences; numerical differentiation and integration; numerical
methods for ordinary differential equations the Euler method, the modified Euler method, the
Runge-Kutta method (without derivation);.the trapezoidal rule , the Simpson rule (both with
derivation)
5. Infinite Series
Infinite series, convergence, tests for convergence; power series, interval of convergence,
differentiation and integration of power series; Taylor series, Maclaurin series, approximation of
function, Cherbyshev polynomials; applications.
6. Fourier Series
Periodic function, odd and even functions, Fourier series, Half range Fourier sine and cosine
series, analytic and numerical methods for finding Fourier coefficients; Application to science
and engineering.
Text books:
Thomas and Finney, Calculus and Analytic Geometry, Addison-Wesley, , 9th ed., 1996
Reference
E. Kreyzig: Advanced Engineering Mathematics, Wiley, 8th Ed, 1998
Bajpai, A. C, I. M. Calus & J. A. Fairley, Mathematics for Engineers and Scientists John Wiley &
Sons, 1973.
Objective:
At the end of the course a student will develop necessary concepts and techniques of differential
Integral calculus of several variables.
Content:
Function of Several Variables
Definition, Domain of definition and its sketching in the plane, Limits, continuity, partial
derivatives, differentiability, Composite functions and the chain rule.
2. The Jacobian Matrix and Determinant
Implicit function and simultaneous implicit functions theorems, Higher order partial derivatives,
Taylor theorem, Taylor series
3. Applications in Analysis
Extrema, extrema with constraints (using the Lagrange multipliers)
9. Integral Theorems
The Gauss (divergence) and Stokes theorems, change of variables in multiple integrals Mention
some physical applications in dynamics, electromagnetism etc.
Textbook:
W. Kaplan : Advanced Calculus Addis-Wesley Publ. Co., New York, 1991
References:
Apostol T. Calculus Volume II, Volume II; John Wiley & Sons, 1969.
Bourne, D E & Kendall P C: Vector Analysis and Cartesian Tensors, Chapman and Hall, London,
1992.
Leithold, L: The Calculus with Analytic Geometry, Herper Collins Publisher, 1990
Spiegel M R.: Advanced Calculus, Schaum Series, Mc Graw Hill Book Co., New York, 1962
MT 136: ORDINARY DIFFERENTIAL EQUATIONS I 2 UNITS
Objectives
At the end of the course a student will be able to
Describe how ordinary differential equations arise from a wide variety of problems.
Classify ordinary differential equations
Explain various techniques used to solve differential equations.
Use the Laplace method to solve differential equations.
Content:
1. Introduction
Definition of a Differential Equation, Some Basic mathematical models, Classification of
Differential equations: Ordinary and Partial Differential equations, Order, Degree, and Linearity
of Ordinary Differential equations. Solution of Ordinary Differential Equations.
Text Book:
Ross S.L, Introduction to Ordinary Differential Equations, John Willy & Sons, New York, 1989.
References
Massawe E.S. & Manja B.A., Elementary Ordinary Differential Equations For Sciences and
Engineering, University of Dar Es Salaam, 2001.
Boyce E.B, & DiPrima R.C, Elementary Differential Equations and Boundary Value Problems,
John Wiley & Sons, Inc., New York, 1986.
Derrick W.R. & Grossman S.I., Introduction to Differential Equations with Boundary Value
Problems, West Publishing Company, St. Paul, 1987.
Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons, New York, 1988
Objectives
At the end of the course a student will be able to
Identify real-life problems that can be modeled as linear programming problems.
Describe various techniques and algorithms for solving linear programming problems
Use computer package to solve linear programming problems
Course Outline
Introduction and Graphical Method
Background, History of Operation Research, Problem formulation, Objective function,
Constraints, Graphical representation, Graphical solution of LP problem
Simplex Method
Introduction, Standard LP Form, Feasible solution, Initial feasible solution, Slack and surplus
variables, The simplex procedure, Degeneracy and cycling, Unbounded solution, Infeasible
solution, Duality- Sensitivity analysis, Solving Linear Problem by using LINDO or TORA.
Game Theory
Introduction, Two person Zero sum and Constant sum Games: Saddle Points, Two person Zero
sum Games: Randomized strategies, Domination and Graphical Solution, Linear Programming
and Zero sum Games, Two-Person non Constant Sum Games, Introduction to n-Person Game
theory.
Textbook:
T.A. Hamdy: Operations Research: An introduction, Prentice Hall, 2002
Reference:
W. L. Winston, Operations Research: Application and Algorithms, Duxbury Press, 3rd ed., 1994.
Content:
Before the 17th Century
Numeral systems, Babylonian and Egyptian Mathematics, Pythagorean Mathematics, Duplication
Trisection and Quadrature, Euclid's elements, Greek Mathematics after Euclid, Hindu and
Arabian Mathematics, European Mathematics, 500 to 1600.
Textbook:
Eves H.W. Introduction to the History of Mathematics, Saunders, 1990
Objective
At the end of the course a student will be able
To describe the theory of first order partial differential equations.
To classify Partial differential equations into elliptic, parabolic and hyperbolic
To solve the three fundamental equations of classical mathematics through the method of
separations of variables and Fourier series.
Content:
Fourier Series
Periodic functions, odd and even functions, representation of functions by trigonometric series,
Fourier coefficients, convergence for piecewise smooth functions, cosine and sine series. Other
orthogonal functions. Mention of Sturn-Louiville Problems.
Textbook:
Pinsky, M.A., Partial Differential Equations and Boundary Value Problems with Applications,
McGraw-Hill, Boston, 1998.
References:
1. Humi M & Miller W.B, Boundary Value Problems and Partial Differential Equations,
PWS-KENT Publishing Company, 1992.
2. Logan J.D., Applied Mathematics, John Wiley & Sons, New York,1987.
Objective
At the end of the course a student will develop a a deeper understanding of the basic ideas of
linear algebra and their applications.
Content:
1. Euclidean n-space En
Vectors in Rn, Axioms of vectors addition and multiplication by scalar , Norm and distance (metric)
in En ; Matrix notation of vectors in Rn; Matrix formula for the inner product, Cauchy-Schwartz
Inequality Theorem, Triangle inequality.
4. Canonical Forms
Triangular form, Invariance, Invariant Direct sums, decomposition, primary
decomposition, Jordan canonical form
6. Orthogonal Bases
Orthogonal bases and QR decomposition, co-ordinates relative to Orthogonal bases, change
of orthogonal basis, Orthogonal Subspaces, Orthogonal co-ordinates transformation.
Objectives
At the end of the course a student will
Gain an understanding of the logical foundations of computer science.
Learn both the theoretical and practical aspects of using mathematical logic as a tool in computer
science
Content:
Propositional Calculus: Axiomatic system for propositional calculus, modus ponens, deduction
principle; completeness, consistency.
Predicate Calculus: Variables, constants, predicate letters, function letters, terms, atomic
formulae, well-formed formulae, qualifiers, free and bound variables. Interpretations,
satisfiability, truth models, logically valid proofs, logical implication, logical consequence. First
order theories, logical axioms, proper axioms, inference rules and their restrictions, deduction
principle. First order theories with equality, reflexivity of equality, substitutivity of equality, the
scope of an assumption in a demonstration.
Textbook
Hamilton, A.G., Logic for Mathematicians (2nd ed.), Cambridge: Cambridge University Press,
1988.
Contents:
1. Introduction to Probability
Outcomes, sample space, events. Definition of Probability, some counting rules (combinations,
permutations, multiplicative rules), conditional probability, independent, mutually exclusive
events (use of Venn diagrams), Bayes’ theorem.
2. Probability Distributions
Definition of random variables (discrete and continuous), probability distribution function,
probability density function (p.d.f), distribution functions, joint probability functions, joint
p.d.f’s, multivariate distributions (e. g bivariate), marginal distributions, conditional
distributions, independence. Moments (e.g., mathematical expectation, moment generating
function, product moments), variance and or covariance of random variables, Chebyshev
Inequality. Special probability distributions (Bernoul, Binomial, Geometrical, Hyper geometric,
Poisson, Exponential, Uniform, Normal, Gamma and Chi-square, t-distribution, F-distribution).
Functions of random variables.
5. Hypotheses testing
Choice of sample size for testing means, differences between means, variances and proportions.
Illustrations of the importance of hypothesis testing basing on practical examples, e.g. agriculture,
comparing educational methods.
Reference:
Sheldon M. Ross, A first course in probability, Prentice Hall, 7th edn., 2005
John Freund, Introduction to mathematical statistics, Wiley, 5th edn. 1999
3. S.C. Gupta, V.K. Kapoor, Fundamentals of Mathematical Statistics. New Delhi: Sultan
Cahand and Sons, 1982.
MT 249: MATHEMATICAL LOGIC AND FORMAL SEMANTICS 3 UNITS
Objectives:
At the end of the course a student will be able
To apply mathematical logic concepts in studying semantics of programming languages
To apply the Hoare semantics in computer science.
Content:
Review of Propositional logic and predicate logic, syntax, semantics,
Logic programming, First Order Logic, argument validity, axiomatic semantics, consistency and
completeness,
Methods of formal proofs, The method of Fitch, The Tableau method, Formal deductive systems
– System L, Natural Deduction, Resolution logic
Application in computer science: The Floyd-Hoare Logic for program specification and program
verification – Hoare’s notation, proof rules, verifier architecture, verification conditions and their
justification, application to real program codes
Delivery: 45 Lectures and 15 Tutorials.
Assessment: Course work 40%, Final Examination 60%
Reference:
Kenneth H. Rosen, Discrete Mathematics and its applications, McGraw-Hill, Inc. 2nd ed 1991.
R. D. Tennent, Specifying Software: A Hands on Introduction, Cambridge University Press (New
York), 2002
Mordechai Ben-Ari, Mathematical Logic for Computer Science, Springer; 2nd ed. 2001.
(Prequisite: MT 136)
Objectives:
At the end of the course a student will be able
To derive and apply simple numerical techniques for solving some basic mathematical problems.
To find solution of the 1st and 2nd order difference equation.
To derive and implement numerical schemes for ODEe such as Euler, Improved Euler and
Runge-Kutta.
Content:
1. Basic Concepts: Numerical versus analytical methods; direct versus iterative methods. Need
for numerical methods with illustrative examples. Desirable properties of numerical methods
(accuracy and stability for direct methods; convergence for iterative methods). Errors.
2. Errors: Absolute and relative errors: Precision and accuracy; significant figures and rounding
procedure: fixed point and floating point arithmetic; sources and types of errors; Amplification of
errors (stability); inherent and induced inability with illustrative examples.
3. Solutions of Scalar Nonlinear Equations: Find roots of f ( x ) = 0 , General iteration methods:
convergence criterion, order of convergence; Review bisection, secant, regula Falsi and Newton
Raphson Methods. Newton's method for finding roots of polynomials; Bairstows method for pairs
of real and complex roots. Interactive computing with MATLAB or MAPLE or
MATHEMATICA to find roots of a polynomial.
∫ f (x )dx = ∑W f ( X
a k =1
k k ) + E.
5. Linear Difference Equations: Solutions of the homogeneous 1st order variable coefficient
equation. Through treatment of the 2nd order constant coefficient equation, including finding
particular solutions of inhomogeneous equations by the method of undetermined coefficients.
Computer application:
Implementation The algorithms of Gaussian and Gauss Seidel as well as The LU decomposition
method for a system of linear equations.
Implementations Euler’s algorithm, Runge-Kutta (2nd and 4th
order), Improved Euler for ordinary differential equations using MATLAB, MAPLE and or
C++.
Textbooks:
Burden and Faires: Numerical Analysis, Pws-Kent Publishing Company, BOSTON, 1993.
Ross S.L, Introduction to Ordinary Differential Equations, John Willy & Sons, New York, 1989.
Reference:
Boyce E.B, & DiPrima R.C, Elementary Differential Equations and Boundary Value Problems,
John Wiley & Sons, Inc., New York, 1986.
Derrick W.R. & Grossman S.I., Introduction to Differential Equations with Boundary Value
Problems, West Publishing Company, St. Paul, 1987.
Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons, New York, 1988
Bajpai , Calus and Fairley: Numerical Methods of Engineering and Scientists, John Wiley &
sons, Chichester,1976.
Objectives:
After completing the course the student is expected to be able to;
Develop necessary techniques of differential calculus of several variables
Develop necessary techniques of differential and integral calculus of vector-valued functions
Understand the theory of complex analysis and how to interpret results from the theory in Real
Analysis, science and engineering
Use integral transforms and their applications in mathematics.
Content:
Functions of Several Variables: Function of several variables, limits, continuity, partial
derivatives, differentials; higher order partial derivatives, Taylor theorem and series, maxima and
minima of surfaces; Jacobian matrix and determinant, composite functions, extrema with
constraint; Applications in science and engineering.
Text books:
Thomas and Finney, Calculus and Analytic Geometry, Addison-Wesley, 9th ed., 1996
Reference
E. Kreyzig: Advanced Engineering Mathematics, Wiley, 8th Ed, 1998
Bajpai, A. C, I. M. Calus & J. A. Fairley, Mathematics for Engineers and Scientists John Wiley &
Sons, 1973.
Objectives
At the end of the course students are expected to be able to;
To derive solvable Mathematical formulation of Physical Problems in Mechanics
To identify optional methods of solution and interpret the solutions in relation to the
corresponding Physical problem.
To develop originality in thinking through an appreciation of work done by prominent
Mathematicians in the field of Mechanics and the linkages with real life situations as well as with
other fields of Science and Technology
To handle complicated problems in Mechanics with the aim of preparing the students for research
work.
Contents:
Mechanics of a Particle: Kinematics, Static and Dynamics of a particle,Mechanics of a system of
particles: Continuum hypothesis, Degrees of Freedom, Generalized Co-ordinates, Centre of mass
Centre of gravity. Linear and Angular Momentum, Motion of centre of mass Torque Kinetic and
Potential Energy, Impulse, Constraints, Virtual displacement, Virtual Work Static's of a system of
particles Conservative force field D'Alemberts Principle, Applications: Frameworks, Cables,
Friction, Projectiles, orbits, Impulsive Motion, Collisions, Vibrating systems. Plane mechanics of
a rigid body: Kinematics of a rigid body, rotation about a fixed axis, Euler's Theorem, Chasle's
Theorem, Static, Principle of Virtual work and S'Alemberts principle, Impulse, Potential energy,
Kinetic Energy and Angular Momentum, Conservation of Angular momentum, Conservation of
Energy, Stable equilibrium, Moment of Inertial, Radius of gyration, Couples, Motion about fixed
axis, Work and Power
Reference
J. L Synge, B. A. Griffith: Principles of Mechanics, McGraw-Hill Book Company, 2nd edn, 1949.
M.R Spiegel, Theoretical Mechanics, McGraw-Hill,1967
Objectives:
At the end of the course students should understand the basic ideas of elementary statistics and
facility in the basic techniques with emphasis on practical applications to science and engineering
Content:
Descriptive Statistics: Representation of data, frequency distributions, histograms, frequency
polygon, cumulative frequency polygon, measure of central tendency (mean, mode, median),
grouped and ungrouped data; dispersion
Regression Analysis and Correlation: The Least Square Line, Coefficient of Determination,
Coefficient of Correlation; Examples from science and engineering
Experimental Design and Analysis of Variance: One way ANOVA, comparing means, the
ANOVA model, the ANOVA table and the F test; multiple comparisons; two way ANOVA;
Introduction to experimental design: Product and System Reliability: Definition, failure time
distributions, hazard rates, life testing censored sampling,, estimating parameters of an
exponential failure time distribution, system reliability
Quality Control: Detecting process change; control charts: x chart, R-chart, Runs analysis, p-
chart, c-chart; tolerant limits, acceptance sampling for defectives
Textbook:
E. Kreyzig: Advanced Engineering Mathematics, Wiley, 8th Ed, 1998
References:
Thomas and Finney, Calculus and Analytic Geometry, Addison-Wesley, , 9th ed., 1996
Bajpai, A. C, I. M. Calus & J. A. Fairley, Mathematics for Engineers and Scientists John Wiley &
Sons, 1973.
Content:
Complex Numbers (Overview): Field properties, stereographic projection, Euler's formula, de
Moivre theorem
Functions: Sequences and limit of complex numbers; function of a complex variable; domain,
range, limits, continuity
Complex Integration: Contours and regions (review); simple smooth, piecewise smooth and
orientation of curve; simply and multiply-connected regions, orientation of boundary; Cauchy
Integral Theorem for simply and multiply-connected regions; their proofs assuming continuity of
f'(z). The Cauchy-Gousart Theorem (without proof).
Some Applications of Cauchy's Integral Theorem: Indefinite integral, Cauchy Integral Formulae,
Morera's Theorem, Cauchy inequalities, Liouville Theorem, the Fundamental Theorem of
algebra, Taylor Theorem and series, operations with power series.
Calculus of Residues: Laurent theorem and series, singularities of function; the residue, the
Cauchy Residue Theorem Application of Residue Theorem to real integrals of the type
f (cos t , sin t ) over [0,2 π ] and f ( x), f ( x) sin(mx), f ( x) cos(mx) over (−∞,+∞)
Conformal Mappings: Explorations with F(z), the transformation w=exp(z), the mappings
1
w = z 2 and w = z 2 , branches of the square root, the image of a rectangle, the single-valued
mapping w = log( z ) , the mapping w = (e z − 1) /(e z + 1) .
Textbooks:
A.S.A. Mshimba: Basic Complex Analysis Vol. I, University of Dar es salaam, 1984.
J E Marsden & M. Hoffman: Basic Complex Analysis, Freeman & Co., New York, 1972.
Objectives:
After course completion students must be able to
Formulate problems and how to reduce vague questions and ideas to precise mathematical
statements based on continuum theory.
Reduce these ideas to differential equations and boundary conditions.
Understand the fundamental principles that under such differential equations and boundary
conditions.
Content:
Introduction to Tensor and Matrix Algebra: Summation convention, Co-ordinate transformation,
dyadic product, properties of 2nd order tensors, eigenvalues and eigenvectors, invariants of 2nd
order tensors, deviatoric tensors, symmetric, antisymmetric and orthogonal tensors, the metric
tensor, physical components of tensors.
Particle Kinematics: LaGrange versue Eulerian viewpoints, the continuum Hypothesis, Bodies
and configuration, Displacement and velocity, time rate of change, acceleration.
Stress: Surface traction, components of stress, traction at any surface, Principal stress
components, principal axes of stress, stress invariants, some simple states of stress.
Motions and Deformation: Rigid body motions, deformation tensor, finite deformation and strain
tensor, some simple finite deformations, the rate of deformation tensor, velocity gradient and spin
tensor, some simple flows.
Linear Constitutive Equations: Constitutive laws for linear elasticity and Newtonian viscous
fluids.
Textbooks:
Y.C Fung, A First Course in Continuum Mechanics, Prentice Hall, 3rd ed,1994.
Reference:
G. Mase, Schaum's Outline of Continuum Mechanics, McGraw-Hill, 1969
Objectives:
At the end students are expected to be able to;
Gain new knowledge of Operations Research Mathematical Models.
Acquire knowledge of computer systems (Packages) used to solve Operations Research Problems
Gain in depth knowledge of Mathematical Techniques used in Analyzing Queuing, Inventory and
Simulation Problems
Develop practical applications of the learned methods particularly to Tanzania and her economy.
Content:
Markov Chains: Introduction to stochastic processes. Markov Chains Transition Probabilities.
Real life Applications. Software Applications
Queuing Theory: Basic elements of Queuing model-arrivals, number of service channels, queue
discipline. Roles of the Poisson and Exponential distributions. Modeling of queues, steady state
equations, measures of efficiency - average queue length, expected customer time in a system,
etc. motels with infinite and finite population. Optimization queues. Software Applications.
Inventory Control Models: Generalized Inventory Model. Deterministic EOQ. Inventory models-
lead time, production runs, Quantity discount. The continuous rate EOQ model-Back orders,
when to use EOQ models. Probabilistic Inventory Models, single period decision models.
Periodic review models.
Replacement and Maintenance: Failure data and failure trees. Optimal replacement policy.
Individual and group replacement. Component design application. Preventative maintenance
policies.
Delivery: 45 Lectures and 15 Tutorials.
Assessment: Course work 40%, Final Examination 60%
Textbooks:
Taha, H.A. "Operations Research" An Introduction", Macmillan Publishing Company, New
York, USA, 1987.
Reference:
Winston W.L. "Operations Research: Applications and Algorithms", Duxbury Press, California,
USA, 1987.
Wilkes M. "Operations Research: Analysis and Applications:, MacGraw-Hill Book Company,
New York, USA.
Objectives
At the end of the course the students should be able to;
Develop a deeper understanding to the basic concepts of Real Analysis, particularly the concepts
of convergence, continuity, differentiation, integration to sequences and series of functions.
Understand the basic concepts of compactness and connectedness, which are central not only to
further mathematical analysis courses, but to applications of mathematics in economics and other
areas such as optimisation.
Content:
Set and Relations: Basic notation for sets, relations and functions, equivalence relations and
equivalence classes, natural numbers, Infinity, Induction and Real numbers: Countable infinity,
uncountable infinity, the principle of induction, the real number system.
Sequences of numbers: Sequences, carely sequences, subsequences, limsup and liminf, special
sequences (power sequences, exponential sequences, root of n sequences, nth root sequence,
binomial sequence and Euler’s sequence).
Series of numbers: Series and convergence, convergence tests, special series (convergence tests:
divergence, comparison, limit comparison, Cauchy condensation, geometric series, p-series, root,
ratio, Abel’s convergence, alternating series, integral).
Topology: Open and closed sets, compact and perfect sets, connected and disconnected sets.
The integral: Riemann Integral, Riemann-Stietjes integral, measures, lebesgue integral, Riemann
vs lebesgue integral
References
Objectives:
After completion, students are expected to be able to derive mathematical formulations of
problems involving continuous media and identify deferent techniques to solve such problems.
Content:
Introduction: Fluid static; Conservation of mass and momentum; Ideal and Real fluids,
Specification of fluid motion; Streamlines, path lines.
Equations governing the motion of fluids: Vorticity; Vortex tube, Circulation, Newtonian and
Non-Newtonian fluids. Equations of motion in integral form. Equations of motion in differential
form; Navier Stokes equations; Dimensional analysis. Thermodynamics, Equation of state,
Energy equation, Bemoulli equation, Dimensional Analysis, Dimensionless parameters of fluid
motion
Newtonian flows: Viscous and Non-vescous (inviscid) flows, Laminar Boundary Layers.
Hydrodynamic Stability. Incompressible and Compressible flows. Rotational and irrotational
flows.
Applications for Newtonian flows: Exact solutions; Viscous one dimensional flows (Flow in
popes, Poisseuille flow between ,parallel plates), Viscous two-dimensional flows (Stream
function), Non-viscous two-dimensional potential flows (Flow in the presence of a circular
cylinder, the complex potential, sources, sinks and doublets).
Textbook:
M.E. O'Neill and F. Chorlton, Viscous and compressible fluid dynamics, Ellis Horwood, 1989.
Reference
G. K. Batchelor, An Introduction to Fluid Dynamics, Cambridge University Press, 2000.
F. Chorlton Textbook of Dynamics, 2nd ed. Wiley,1983
M. Thomson, Theoretical Hydrodynamics, Dover Publications; 5th ed ,1996
W.F. Hughes and J.A. Brighton, Theory and Problems of Fluid Dynamics (Schaum Series),
McGraw-Hill, 1991
Objectives:
After course completion students should be able to;
Understand the ideas of algebraic structure.
Show the power of generalization and abstraction.
Show the beauty of structure and symmetry within Mathematics.
Content:
Basic Concepts: Sets, index sets, Cartesian product, properties of integers, congruence modulo n,
equivalence relations and partitions, binary operations.
Groups: Definition and elementary properties of groups, subgroups, order, finite groups, Abelian
groups, cyclic groups, permutations, symmetric and alternating groups, homomorphism,
isomorphism, Cayley’s Theorem, cosets, Lagrange’s Theorem, normal subgroups, factors group,
First Isomorphism theorem.
Rings, Integral Domains and Fields: Definition and properties of rings, subrings, rings of integers
under modulo p, characteristic of a ring, matrix rings, zero-divisors, definition and properties of
integral domains, Fermat’s little theorem, definition and properties of fields, finite fields,
construction of field of quotients, homomorphism, ideals, factor rings, first isomorphism theorem
of rings, maximal and prime ideals.
Textbook:
Fraleigh, J.B. A First Course in Abstract Algebra, Addison Wesley
References
Herstein, I.N. Topics in Abstract Algebra,2nd edn., John Wiley &Sons
Allenby R.B.T. Rings, Fields and Groups. 2nd ed. Arnold 1991
Herstein, I.N. Abstract Algebra, Wiley, 1996.
Objectives:
At the end, students should be able to;
Gain knowledge of the concepts and techniques used in integer and non linear programming.
Understand in details, various techniques and algorithms for solving integer and nonlinear
programming problems and reading optimality.
Apply the techniques on areas and practical applications particular to Tanzania and her economy.
Content:
Integer Programming: Introduction to integer Programming. Formulation and classification of
integer programs: Pure, mixed and binary. Solution procedures of integer programming problems.
The branch and bound method for pure and mixed integer programming problems. Solving some
combinatorial optimization problems by the branch and bound algorithm e.g. The Traveling
Salesman Problem, and vehicles routing problem. Balaas zero one algorithm. Knapsack heuristic.
Cutting plane methods for pure and mixed integer programming problems. Software packages for
solving integer programming problems
Textbook:
Taha, H.A. Operations Research" An Introduction, Macmillan Publishing Company, New York,
USA, 1987
References:
Winston W.L. Operations Research: Application and Algorithms" Duxbury Press, 1987.
Salkin, H. Integer Programming", Addison-Wesley, Reading, Massachusetts, 1975.
Parker, R. and R. Rardin, Discrete Optimization, Academic Press, Orlando, Fla, 1988.
Objectives:
After completion of the course students should be able to;
Understand higher concepts on the theory of Complex Analysis
Gain knowledge to interpret the results of Complex Analysis and show the wide range of
applications of these results in Real Analysis and Physics
Content
Integration: Generalization of the residue theorem; variation of logarithm along contour, winding
number, the principle of the argument, Rouche's Theorem, Fundamental Theorem of Algebra, the
mapping of some elementary functions.
Many-Valued Functions: Branch points, cuts, Riemann surfaces; integrals involving many-valued
functions and their applications to real integrals
Analytic Functions: Analytic continuation, monodromy theorem (without proof), Schwarz
Reflection Principle, the analytic function and its continuation into the left-hand plane
Infinite Series and Infinite Products: Sequences and infinite series of complex numbers, tests for
convergence; uniform convergence of sequences and series. Tests for convergence; summation of
series, Mittag- Leffler expansion; infinite products, convergence and absolute convergence,
uniform convergence, tests for convergence, Weierstrass Product Theorem
Textbook
A.S.A. Mshimba: Basic Complex Analysis Vol. I, II
E. Marsden and M. J. Hoffman, Basic complex analysis, 2nd ed., San Francisco, 1986.
References
R.A Silverman . Introductory Complex Analysis. New York: Dover, 1984
L.V. Ahlfors: Complex Analysis McGraw-Hill, 1953
C. Caratheodory: Theory of Functions of a Complex Variable, Chelsea Publishing Co., 1954.
Objective:
At the end of the course a student will develop advanced theory of solutions of second order
linear partial differential equations using integral equations, Green's Functions and generalized
solutions.
Content:
The wave equation and the retarded potential: The characteristic of the wave equation, Kirchoff's
method of solution of Cauchy's problem
Properties of the potential of single and double layers: General remarks, properties of the
potential of a double layer, properties of the potential of a single layer, regular normal derivative,
normal derivative of the potential of a double layer, behavior of the potential at infinity.
Reduction of the Dirichlet and Neumann problems to integral equations: Formulation of the
problems and the uniqueness of their solutions, the integral equations for the formulated
problems.
The Laplace and Poisson equations in a plane: The principal solution, the basic problems, the
logarithmic potential
The theory of integral equations: General remarks, the method of successive approximation,
Volterra equations, equations with degenerate kernel, a kernel of special type, Fredholm's
Theorems, generalization of the results, equations with unbounded kernels of a special form.
Application of the theory of fredholm equations to the solutions of the Dirichlet and Neumann
problems: Derivation of the properties of integral equations, investigation of the equations.
Green's function: The differential operator with one independent variable, adjoint operators and
adjoint families, the fundamental lemma on the integral of adjoint equations, the influence
function, the generalized Green's function for a linear second order equation
Green's function for the Laplace operator: Green's function for the Dirichlet Problem, the concept
of Green's Function for the Neumann Problem.
Textbook
B.F.Schutz: Geometrical Methods of Mathematical Physics, New York, Academic Press-1980.
References:
R. Courant & D.Hilbert: Methods of Mathematical Physics Vol. I, II, Cambridge University
Press-1989.
R.Courant & K.O.Friedrichs: Supersonic Flow and Shock Waves, Cambridge University Press-
1948.
Objective:
After completing the course the student is expected to be able
To describe the connections of the basic ideas of linear algebra to multilinear algebra and their
applications.
Content:
Tensor Products: Modules, dual modules, tensor products of modules and their properties, p-fold
tensor products, contravariant and covariant tensors.
Exterior Algebra: Symmetric and antisymmetric tensors, exterior powers of vector spaces and
their properties, applications to determinants such as: products of compound matrices, Laplace
expansion by powers, Jacobi’s Theorem on the minors of the adjugate matrix, inner product
spaces and adjoint map, inner product induced on exterior power, volume of parallelepiped.
Integration on Manifolds: Smooth manifolds and maps, tangent bundle, derivative, differential
forms, exterior differentiation, induced forms, simplicies and chains, integration of forms over
chains, Stokes theorem, De Rham’s Theorem without proof, Change of Variable Theorem,
volume of oriented Riemannian manifold.
Applications in Mechanics: Phase space of mechanical systems, canonical form on phase space,
induced correspondence between 1-forms and vector fields, how closed forms lead to Hamilton’s
equation.
References
R. Abraham, Linear and Multilinear algebra, Benjamin Press, 1967
H. Flanders, Differential Forms, Academic Press,1963
S. Sternberg, Lectures on differential geometry. Prentice-Hall, 1964.
Objectives
After completing the course the student is expected to be able
To understand a data structure that is used to model a wide class of problems in Discrete
Mathematics.
To solve network optimization problems.
Content:
Introduction to Graph: Graphs and digraph, Simple graph, Digraphs, Presentation of Graphs and
Digraph in computer, Subgraph, Path, Cycles, Complete graphs, Bipartite graphs, Trees, Graph
Isomorphism, Connected graph, Spanning tree, Minimal Spanning Tree Problem, Shortest-Route
Algorithms, Eulerian and Hamiltonian Graphs, Chinese Postman Problem and Traveling
Salesman Problem, Matching and covering in bipartite graphs, perfect matching, Applications,
Coloring Problem, Chromatic Number, Chromatic index, independent sets, Vizing’s Theorem,
the timetabling problem, Networks, Flow through networks, the Max-Flow Min-Cut Theorem,
Network Problems, Networks in planning techniques: Critical Path method, earliest times, latest
time, critical path. Examples of applications of the critical path method
Textbook:
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Elsevier North-Holland, 1976
References:
M, Gondran and M. Minoux: Graphs and Algorithms, Wiley, 1984.
B. Carré: Graphs and Networks, Oxford University Press, New York, 1979.
T.A Hamdy: Operations Research: An introduction, Prentice Hall, 2002.
Objectives
After completing the course the student is expected to be able
Content:
Metric spaces, Definition of a metric, metric spaces, continuous functions, open discs,
neighbourhood, open sets, sequences, deleted open balls, accumulation points, closed sets,
derived sets, Cauchy’s sequences, complete spaces, subspaces, product spaces, homeomorphism,
equivalent metrics.
Topological spaces, axioms, continuity, homeomorphism, neighbourhoods, open sets, closed sets,
closure, interior, boundary, subspaces, product spaces, quotient spaces.
Linear Functionals, definition and examples, linear operators, algebraic dual space, second
algebraic dual space, algebraic reflexivity, canonical mapping, Zorn's lemma, extension of linear
functionals, the transpose of an operator, annihilators, range and null spaces
The Normed Conjugate Space, the normed conjugate of a normed space, the Hahn-Banach
theorem, the open mapping and closed graph theorems, Banach space projection, the second
normed conjugate and norm reflexivity.
Inner product, orthogonality, sesquilinear, Schwarz Lemma, the norm induced by an inner
product, complete inner product spaces, convex sets, direct sum, the orthogonal complement,
annihilator, orthonormal sets, Bessel inequality, Parseval's identity, total sets, Gram-Schmidt
orthogonalization, Riesz.’s Theorem
Operators in Hilbert Spaces, adjoint operators, self-adjoint operators, positive operators, normal
and unitary operators.
Textbooks
Kreyzig E: Introductory Functional Analysis with Applications, John Wiley & Sons, New York,
1999
References
Mendelson, B. Introduction to Topology, Blackie& Son Ltd, London, 1962
To develop some new mathematical formulation of physical problems when existing formulation
prove to be unsolvable.
To be able to handle complicated problems in Mechanics with the aim of preparing the students
for research work.
Content:
Space mechanics of a rigid body, general motion of a rigid body (degrees of freedom, angular
momentum), inertial (moments and products of inertial, moment of inertial matrix (tensor),
principal axes of inertia, ellipsoid of inertia (momental ellipsoid), equimomental systems,
potential and kinetic energy, euler's equations of motion euler angles.
Calculus of variations, hamilton's principle and derivation of lagrange's equations from hamilton's
principle, the principle of least action, small oscillations of conservative holonomic dynamical
systems.
Objective:
After completing the course the student is expected to be able To describe some basic concepts of
abstract algebra.
Content:
Groups, direct products, sylow theorems, generators, relations, free groups, finitely generated
groups, torsion groups, fundamental theorem of finitely generated abelian groups, subnormal and
normal series, jordan-holder theorem, solvable groups.
Rings, integral domain and fields, polynomial rings, division algorithm, factorization of
polynomials, irreducible polynomials, eisensteins criteria, principal ideals, principle ideal
domains, unique factorization domains, ascending chain condition, fundamental theorem of
arithmetic, euclidean domains, extension fields, splitting field, algebraic transcendental simple
and finite extensions, degree of extension, impossible geometric constructions, separable
extensions, finite fields, galois theory.
Textbook: Fraleigh, J.B. A First Course in Abstract Algebra, Addison Wesley, 2002.
References
Herstein, I.N. Topics in Abstract Algebra,2nd edn., John Wiley &Sons, 1975
Allenby R.B.T. Rings, Fields and Groups. 2nd ed. Arnold 1991
Gallian A, Contemporary Abstract Algebra 2nd ed., Heath & Co, 1990
Objective
After completing the course the student is expected to be able
To investigate compact and connected spaces and describe their applications in other branches of
Mathematics.
Content:
Connectedness and Compactness: Definition of connectedness, application to the real line,
Brouwer and Borsuk-ulan Theorems, definition to compactness, Heine-Borel Theorem, open
cover and finite subcover, definition of compactness, properties of compact spaces, compactness
for metric spaces, locally compact spaces.
Review of Point Set Topology: Bases, relative topology, weakest topology, separation Axioms,
T0, T1, T2, T3 and T4 spaces, separation by continuous functions, Urysohn’s Lemma and
Tietze’s Extension Theorem.
Textbook:
Mendelson, B. Introduction to Topology, Blackie& Son Ltd, London, 1962.
References
Kelley, J.L. General Topology, Van Nostrand, NY, 1967.
Lipschutz, S. Topology (Schaum series outline), McGraw-Hill Book Co; NY, 1965.
Singer & Thorpe: Lecture Notes on Elementary Topology and Geometry ; Springer-Verlag, NY,
1967.
Sutherland, W.A. Introduction to Metric and Topological Spaces. OUP; Oxford, 1975.
Content:
Solution of Nonlinear Scalar Equations f ( x ) = 0 : Acceleration of convergence: Aitken and
Steffensen's Techniques. Newton's method for solving systems of nonlinear equations.
approximation of functions, piecewise interpolation; Spline fitting; Richardsons Extrapolation;
Romberg Integration.
Systems of Linear Equations AX = B : Gaussian elimination with partial and total pivoting.
Iterative methods and convergence criteria Numerical eigenvalue problem, review of matrix and
vector norms
Initial Value Problems in O.D.E's: Finite difference methods: Single step and multi-step methods;
Runge Kutta and Predictor Corrector methods
Two-Point Boundary Value Problems in O.D.Es: Solution by both Finite Difference and Finite.
Element techniques, use of software packages
Linear Systems of O.D.E's: analysis based on spectral properties of coefficient matrix. Runge -
Kutta Methods.
Partial Differential Equations: Finite Difference methods for parabolic, hyperbolic and elliptic
problems.
Textbook:
Burden and Faires: Numerical Analysis, Pws-Kent Publishing Company, BOSTON, 1993
References:
E. Kendall. An Introduction to Numerical Analysis, Atkinson, 1989.
A. M. Cohen, Numerical Analysis.
C.F. Gerald, Applied Numerical Analysis, Addison-Wesley, 1984
J. C. Strikwerd, Finite Difference Schemes and partial differential equations, 2nd ed.,
Philadelphia, 2004.
Content:
Rings and Modules:Representations and modules for rings, Schur's Lemma, exact sequences,
projective modules, structure of semi-simple nogs with minimal condition.
Textbook
Burrow, M. :Representation Theory of Finite groups, NY, Academic Press, 1965
References:
Jans, J.P. Rings and Homology, Holt, Rinehart & Winston, NY, 1964.
Curtis and Reiner, Representation Theory of Finite groups and Associative Algebras, Interscience
Publishers, NY, 1962
To discuss and describe important concepts of number theory and their application to real life
problems such as smart cards
To analyse various techniques on how to study numbers and their properties.
To use the results from this course to solve contemporary problems in number theory.
Content:
The integers: basic properties, closure, laws, the well-ordering property, summation,
Products, mathematical induction, divisibility, division algorithm, primes, sieve of eratosthenes,
prime number theorem, some conjectures on primes, the twin prime conjecture
GCD algorithms, prime factorization, greatest common divisor, euclidean algorithm, the
fundamental theorem of arithmetic, least common multiple, the p2 is irrational, direct
factorization method, fermat factorization, fermat procedure, fermat numbers and fermat primes,
linear diophantine equation, applications
Multiplicative functions, the euler phi-function, arithmetic function, the sum and number of
divisors, perfect numbers and mersenne primes
Decimal fractions and continued fractions, decimal fractions, finite and infinite continued
fractions, periodic fractions, factoring using continued fractions.
Textbook
Burrow, M. :Representation Theory of Finite groups, NY, Academic Press, 1965
Hardy, G. H.; Wright, E. M.: An introduction to the theory of numbers, The Clarendon Press,
Oxford University Press, New York, 1979. 426 pp. ISBN 0-19-853170-2 and 0-19-853171-0.
References
Serre, Jean-Pierre: A course in arithmetic, Springer-Verlag, New York-Heidelberg, 1973. 115 pp.
Cohn, Harvey: Advanced number theory, Dover Publications, Inc., New York, 1980. 276 pp.
ISBN 0-486-64023-X
Ireland, Kenneth F.; Rosen, Michael I.: A classical introduction to modern number theory,
Springer-Verlag, New York, 1990.389 pp. ISBN 0-387-97329-X
Niven, Ivan; Zuckerman, Herbert S.; Montgomery, Hugh L.: An introduction to the theory of
numbers, John Wiley & Sons, Inc., New York, 1991.529 pp. ISBN 0-471-62546-9
Rosen, Kenneth H; Elementary Number Theory and its Applications, Addison-Wesley Publishing
Co., Reading, 1993 ISBN 0-201-57889-1.
Content:
Algebras and σ Algebras, Sequence of measurable functions, Lebesgue measure. Non
measurable sets. Integrable functions, convergence theorem. Function depending on a parameter.
Product measures. Measurable transformations
Textbook
H.L. Royden, Real Analysis, Collier Macmillan, 1988.
References
W. Rudin, Principles of mathematical analysis, John Wiley & Sons, 1989
P. Halmas, Measure Theory, Interscience Publishers, 1962