## Department Course

# College Algebra (MATH097)

This course is designed for students who intend to take admit in college of Law without fulfilling their college mathematics requirement. The course contains all the elements that are necessary for success in their courses. Algebraic skills will be developed throughout the course. Intensive treatment of algebra will be covered. Topics include problem solving with equations, inequalities, functions and their graphs, equations involving polynomial and rational functions, exponential and logarithmic functions. Finally, topics include linear system and basic operation of matrices.

### Credit Hours : 0

### Course Learning Outcomes

At the end of the course, students will be able to :- Solve different types of equations: quadratic, cubic, rational, exponential, and logarithmic equations using different methods.
- Identify algebraically and graphically various properties of functions.
- Describe basic algebraic operations on functions.

# Pre-Calculus for CBE and CAVM (MATH098)

This course is designed for students who intend to take calculus for students from colleges of CBE and CAVM in their undergraduate studies and have joined the university without fulfilling their college mathematics requirement. The course contains all the elements that are necessary for success in calculus and in other undergraduate mathematics courses. Algebraic and analytic skills will be developed throughout the course. Intensive treatment of algebra, geometry and trigonometry will be covered. Topics include problem solving with equations, inequalities, distance, circles and triangles, functions and their graphs, equations involving polynomial and rational functions, exponential and logarithmic functions, trigonometric functions, and their inverses. Finally, topics include linear system and basic operation of matrices.

### Credit Hours : 0

### Course Learning Outcomes

At the end of the course, students will be able to :- Solve different types of equations: quadratic, cubic, rational, exponential, logarithmic, and trigonometric equations using different methods.
- Identify algebraically and graphically various properties of functions.
- Describe basic algebraic operations on functions.
- Write the decomposition of a rational function into simple fractions.
- Evaluate trigonometric functions at a given angle and verify trigonometric identities.
- Perform basic matrix operations and solve 2 × 2 linear systems of equations.

# Pre-Calculus for COS, COE, and CIT (MATH099)

This course is designed for students who intend to take calculus I for Science or Calculus I for Engineering course in their undergraduate studies and have joined the university without fulfilling their college mathematics requirement. The course contains all the elements that are necessary for success in calculus and in other undergraduate mathematics courses. Algebraic and analytic skills will be developed throughout the course. Intensive treatment of algebra, geometry and trigonometry will be covered. Topics include problem solving with equations, inequalities, distance, circles and triangles, functions and their graphs, equations involving polynomial and rational functions, exponential and logarithmic functions, trigonometric functions, and their inverses. Finally, topics include linear system and basic operation of matrices.

### Credit Hours : 0

### Course Learning Outcomes

At the end of the course, students will be able to :- Solve different types of equations: quadratic, cubic, rational, exponential, logarithmic, and trigonometric equations using different methods.
- Identify algebraically and graphically various properties of functions.
- Describe basic algebraic operations on functions.
- Write the decomposition of a rational function into simple fractions.
- Evaluate trigonometric functions at a given angle and verify trigonometric identities.
- Perform basic matrix operations and solve 2 × 2 linear systems of equations.

# Calculus I (MATH105)

Elementary functions, limits, continuity, limits involving infinity, tangent lines, derivative of elementary functions, differentiation rules, chain rule, implicit differentiation, linear approximation, l'Hospital rule. Graph sketching (extrema, intervals of monotonicity, concavity), optimization. Antiderivatives, definite integrals, Fundamental Theorem of Calculus, integration by substitution, area between curves, improper integrals.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain some important concepts of calculus (such as limit, continuity, derivative and integral).
- Compute limits, derivatives, linear approximations, and integrals using various techniques.
- Apply calculus to geometry and to real world problems (Such as graph sketching, optimization, related rates, area computation).
- Use technology to investigate limits, graphs, and integrals.
- Justify some general results in single-variable calculus from a theoretical point of view.

# Calculus II (MATH110)

Integration techniques (by parts, by use of trigonometry, by partial fractions), volume and area of solids of revolution, arc length. Parametric curves: velocity vector, enclosed area, arc length. Curves in polar coordinates: enclosed area, conic sections. Sequences, series, convergence tests, alternating series, absolute convergence, power series, Taylor series, Fourier series.

### Credit Hours : 3

### Prerequisites

- MATH105 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain the concepts of sequences, series, polar coordinates, parametric equations.
- Compute integrals and Taylor series using various techniques.
- Justify the convergence of sequences and series.
- Apply Calculus to real world problems such as area, volume, and arc-length.
- Communicate solutions of problems with peers and written assignments.

# Calculus for Business & Economics (MATH115)

This course introduces the concepts of differential and integral calculus useful to students in business, economics. Among the topics studied are: curve sketching for some functions relevant to business and economics applications, derivatives and techniques of differentiation, exponential growth, anti-derivatives and methods of integration, definite and indefinite integrals with applications. The course also covers topics on partial derivatives and matrices, in addition to many applications in Business and Economics.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Identify basic properties of several elementary functions
- Compute derivatives of several elementary functions including multivariate functions
- Evaluate different types of definite and indefinite integrals
- Perform basic matrix operations
- Apply mathematical models and tools to various business and economics problems

# Contemporary Applications of Math (MATH120)

Problem solving, fair divisions, Mathematics of Apportionment, Euler circuits, network, scheduling methods, population growth, symmetry, fractal geometry.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Use quantitative methods to analyze real-world problems involving social and management issues.
- Apply the concepts and methods of graphing theory to solve problems in scheduling, networking and routing.
- Analyze appearances of patterns and symmetry in nature.

# Calculus I for Engineering (MATH130)

Differential calculus of functions of one variable: functions of one variable, techniques of differentiation, derivatives of trigonometric, exponential, and logarithmic functions, chain rule, implicit differentiation, maximum and minimum values, increasing, decreasing and concave functions, inverse trigonometric functions, hyperbolic functions, some engineering applications. Integral calculus of functions of one variable: definite and indefinite integrals, techniques of integration (integration by substitution, integration by trigonometric substitutions, integration by parts, integration by partial fractions), applications of definite integrals in geometry, some engineering applications.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Compute derivatives of various types of functions
- Apply the derivative to model various engineering problems
- Analyze the properties of various types of functions and theirs graphs
- Classify integration techniques and integrate different types of functions
- Use the integration to compute areas between curves, volumes of solids, and volumes of revolutions.

# Calculus II for Engineering (MATH135)

Differential calculus of functions of several variables: vectors, vector valued functions, functions of several variables, partial derivatives, chain rule, gradient and directional derivatives, extrema of functions of several variables. Quadratic surfaces. Vector fields and line integrals, double integrals in Cartesian and polar coordinates, triple integrals in Cartesian, cylindrical and spherical coordinates.

### Credit Hours : 3

### Prerequisites

- MATH130 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply The Properties Of Vectors, Lines And Planes.
- Compute Partial Derivatives, Rate Of Change, And Extrema Of Functions Of Several Variables.
- Formulate The Concepts Of Vector-Valued Functions, Vector Fields And Line Integrals.
- Manipulate Multiple Integrals To Calculate Areas, Volumes, And Center Of Mass For Different Configurations.
- Use Critical Thinking For Analyzing Engineering Problems.

# Linear Algebra I (MATH140)

Systems of linear equations, matrices and determinants. Vector spaces, inner product spaces. Matrix representations of linear operators. Eigenvalues, eigenvectors, and Cayley-Hamilton Theorem.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain the main concepts of linear algebra (matrices, determinants, vector spaces, and linear transformations).
- Solve systems of linear equations and problems related to linear transformations.
- Use computational software to determine solutions of systems of linear equations, and the eigenvalues and eigenvectors of a matrix.
- Communicate concepts and results in linear algebra to their peers.

# Linear Algebra for Engineering (MATH145)

Solving systems of linear equations, matrices and determinants; Vector spaces, inner product spaces; Eigenvalues, eigenvectors, diagonalization; Least Squares fitting; Some engineering applications.

### Credit Hours : 3

### Prerequisites

- MATH130 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Demonstrate an understanding of the main concepts of Linear Algebra (including matrices, determinants, and vector spaces).
- Solve systems of linear equations using several methods.
- Find the eigenvalues, eigenvectors, and diagonalizable matrices.
- Analyze orthogonal and symmetric matrices.

# Set Theory and Logic (MATH205)

Compound and simple propositions, truth table, quantifiers, propositional calculus, methods of proof. Sets and operations on it. Cartesian products, relations, equivalence relation, order relation. Functions. Cardinality.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Demonstrate ability to integrate knowledge and idea in a coherent manner.
- Justify procedures of abstract proofs by applying Logic.
- Develop counterexamples to claim assertions and to make interpretation of statements.
- Recognize procedures of abstract proofs.

# Calculus III (MATH210)

Euclidean space: dot product, cross product, lines, planes, surfaces. Parametric curves in space. Functions of several variables: limits, continuity, partial derivatives, tangent plane, linear approximation, chain rule, gradient, directional derivative, extrema, Lagrange multipliers. Double integrals, applications (area, volume, center of mass), change to polar coordinates. Triple integrals, change to cylindrical and spherical coordinates. Vector fields, line integrals, conservative fields, Green's theorem.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain important concepts of multi-dimensional Calculus (such as: Euclidean space, partial derivatives, multiple integrals, vector fields)
- Solve problems related to differential and integral Calculus in multi-dimensional spaces.
- Apply Calculus to real world problems (e.g., optimization in several variables, area and volume computations).
- Use technology to visualize multidimensional surfaces.
- Discuss solutions of multi-variable Calculus problems with their peers.
- Work in a group in Calculus peer-tutoring sessions.

# Introduction to Analysis (MATH215)

Properties of R. Completeness of the line, supremum and infimum, Cantor's nested intervals theorem. Sequences, limits and their properties, monotone sequences, Bolzano-Weierstrass Theorem, Cauchy criterion, properly divergent sequences. Series, absolute and conditional convergence, tests of convergence. Topological properties of R, Metric spaces and general topology.

### Credit Hours : 3

### Prerequisites

- MATH205 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Examine the properties of the real numbers.
- Solve problems related to convergence of sequences and series of real numbers.
- Explain basic concepts and results of Analysis to their peers.
- Describe the topological properties of metric spaces.

# Applied Linear Algebra (MATH240)

This course focuses on the basic concepts of tensor analysis and various matrix decompositions and factorizations with an emphasis on concrete calculations and applications. Specific topics to be covered include Gram-Schmidt diagonalization, LU, QR, Singular-Value Decomposition, and Eigen-Decomposition. The course also introduces students to orthogonal spaces and projection operators. Computer algebra systems are used to solve problems in different areas related to Linear Algebra.

### Credit Hours : 3

### Prerequisites

- MATH140 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain the main concepts of applied Linear Algebra (Gram-Schmidt diagonalization, various matrix decomposition and factorization, tensor analysis, projection operators and orthogonal systems).
- Understand the computational methods and algorithms behind the topics in applied linear algebra
- Use computational software to solve problems in data science as an application of linear algebra
- Communicate concepts, results in applied Linear Algebra to their peers.

# Number Theory (MATH246)

Divisibility, Euclidean algorithm, prime numbers, the Fundamental Theorem of Arithmetic, the Sieve of Eratosthenes. Congruence, Diophantine equations, Chinese Remainder Theorem. Fermat's theorem, Wilson's theorem, Euler's theorem.

### Credit Hours : 3

### Prerequisites

- MATH205 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain various linear programming methods such as geometric method, simplex method, duality method.
- Formulate problems from various fields in the language of linear programming.
- Discuss the conditions of validity of several linear programming methods.
- Solve linear programming problems by various methods.

# Foundation of Geometry (MATH260)

Euclid's postulates and plane geometry. Von-Neumann postulates. The parallel postulate. Affine geometry and geometry on the sphere. Projective and hyperbolic geometries. Klein-Beltrami and Poincare models of the plane. Pappus and Desargues theorems. Transformations: automorphisms, motions, similarities, and congruence.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Communicate Concepts And Results In Geometry To Their Peers.
- Construct Scientifically Geometric Figures With A Ruler And A Compass.
- Establish Geometric Results From Deductive Reasoning.
- Explain Non-Euclidean Geometries, Including Hyperbolic Geometry.
- Obtain Results In Non-Euclidean Geometries From Models In Euclidean Geometry.
- State The Theory And Practice Of Traditional Euclidean Geometry.

# Differential Equations for Engineering (MATH270)

Ordinary differential equations: first order differential equations: separable; homogeneous, linear, Bernoulli, exact-integrating factors. Second order linear differential equations: homogeneous equations with constant coefficients; undetermined coefficients method; variation of parameters method; Euler's Equation; Non-homogeneous equations; higher order linear equations; Solving Homogeneous and Non-Homogeneous Systems of Differential Equations using eigenvalues and eigenvectors. Laplace transforms: basic properties; solving initial value problems using Laplace; solving integral equations; solving systems of differential equations by Laplace transform.

### Credit Hours : 3

### Corequisites

- MATH140 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply Laplace Transform To Solve Initial Value Problems
- Employ Initial Value Problems To Model Engineering Problems
- Solve System Of Differential Equations
- Solve Various Types Of First And Second Order Differential Equations

# Ordinary Differential Equations (MATH275)

First order differential equations: examples, separable equations, homogeneous and exact equations, integrating factor and Bernoulli's equation, linear equations, initial value problems. Higher order differential equations: linear equations, linear independence and Wronskian matrices, existence and uniqueness of solutions. Particular solutions: the method of undetermined coefficients, the method of variation of parameters. Laplace transforms and initial value problems. Series solution of differential equations. System of equations and their matrix form.

### Credit Hours : 3

### Prerequisites

- (MATH110 with a minimum grade D or MATH135 with a minimum grade D)
- (MATH140 with a minimum grade D or MATH145 with a minimum grade D)

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply differential equations to model real life problems.
- Classify the different types of ordinary differential equations
- Justify some statements in ordinary differential equations (for instance, about the existence and uniqueness of solutions).
- Solve first and second order differential equations using a variety of techniques

# Computational Mathematics (MATH290)

This course is computational in nature. It introduces various numerical techniques in mathematics. It focuses on numerical approximation of solution to different problems such as approximation of functions and solutions of differential equations. The course relies heavily on coding the presented techniques. The course also introduces the Laplace and Fourier transforms and their applications in differential equations.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Understand error analysis
- Solve numerically nonlinear equations and systems of equations
- Interpolate data
- Apply various numerical techniques for solving different types of differential equations under different conditions.

# Mathematics For Teachers I (MATH305)

Introduction to mathematical logic, sets, operation on sets, the set of natural numbers, the set of integers, the set of rational numbers, graphical representation of numbers, decimal representation of numbers, other bases, divisibility, solution of arithmetic problems, applications.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze sets and set operations.
- Identify early (Egyptian, Chinese, Babylonian, Roman) and modern numeration systems.
- Manipulate different base number systems.
- Operate with natural, integer, rational and real numbers.
- Recognize logical statements and quantifiers.
- Solve problems using inductive and deductive reasoning.

# Real Analysis (MATH310)

Functions, limits of functions, limits involving infinity, continuity, uniform continuity, Extreme Value Theorem, Intermediate Value Theorem, monotone and inverse functions. Differentiation, Mean Value theorem, L'Hospital's rule, Taylor's theorem. Riemann integral, the Fundamental Theorem of Calculus

### Credit Hours : 3

### Prerequisites

- MATH215 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain the notions and results of single-variable Calculus in a theoretical way.
- Solve problems in Real Analysis in a deductive way.
- Analyze statements in Analysis from the definitions and theorems.
- Illustrate concepts and results of Real Analysis to their peers.
- Reproduce from the literature information for proving a result in Analysis.

# Advanced Calculus (MATH313)

Vector-valued functions of n variables: limits, continuity, Jacobian matrix, differentiability, general chain rule. Implicit Function Theorem for many variables. Scalar-valued functions of n variables: multidimensional Taylor series, Hessian, optimization, constrained optimization. Multiple integrals: Jacobian, change of variables formula, improper integrals. Parametric surfaces: tangent plane, area, integrals over a surface. Vector Calculus: vector fields, divergence, curl, surface integrals of a vector field, Stokes' and Gauss' theorems.

### Credit Hours : 3

### Prerequisites

- MATH210 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain important concepts and results of vector Calculus (such as Jacobian matrix, differentiability, vector fields, surface integrals, curl, divergence, Stokes' theorem).
- Evaluate derivatives and integrals involving scalar or vector fields.
- Apply Calculus to real life problems.

# Complex Analysis I (MATH315)

Complex numbers: properties and representations. Complex functions: limits, continuity, and the derivative. Analytic functions: Cauchy - Riemann equations, harmonic functions, elementary analytic functions. Integration in the complex plane: complex line integrals, Cauchy integral theorem, Morera's theorem, Cauchy integral formula; Maximum principle. Liouville's theorem and the fundamental theorem of algebra.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Describe essential concepts in complex Analysis, such as: function of a complex variable, their limits, continuity, derivatives, and integrals.
- Evaluate elementary complex functions and multi-functions.
- Compute derivatives, harmonic conjugates, and contour integrals.
- Deduce theoretical results from Cauchy’s theorem (such as Morera’stheorem, Liouville’s theorem, Fundamental theorem of algebra, Maximum modulus principle).
- Communicate concepts and results of Complex Analysis to their peers.

# Numerical Analysis I (MATH320)

Error analysis: solutions of non-linear equations in one variable, bisection, fixed point, and false position methods, Newton and secant methods; Solution of a system of linear equations: Gaussian elimination method, Cholesky factorization method. Iterative methods: Interpolation: Lagrange, divided differences, forward, backward, and central methods. Numerical differentiation, two, three and five point formulas. Numerical integration, trapezoidal, Simpson's rules and composite quadrature.

### Credit Hours : 3

### Prerequisites

- MATH205 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyse the theoretical and practical aspects of numerical techniques.
- Solve linear and non-linear equations numerically.
- Use Mathematica software to solve numerically mathematical problems.
- Examine the use of numerical techniques for solving problems in applied mathematics.

# Linear Programming (MATH321)

General Linear Programming Problem. Geometric method. Simplex method. Revised Simplex method. Computer implementations. Duality. Parametric linear programming. Interior point methods. Applications including: transportation problem, inventory problems, blending problems and game theory.

### Credit Hours : 3

### Prerequisites

- MATH205 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain various linear programming methods such as geometric method, simplex method, duality method.
- Formulate problems from various fields in the language of linear programming.
- Discuss the conditions of validity of several linear programming methods.
- Solve linear programming problems by various methods.

# Mathematics for Teachers II (MATH335)

Geometrical figures in plane and space and their properties. Areas and volumes of geometrical figures; unitary and non-unitary linear transformations and their properties. Ratio, proportion, percentage and their practical applications. The geometric problem: construction and solutions methods.

### Credit Hours : 3

### Prerequisites

- MATH305 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Compute perimeters, areas and volumes of some two and three-dimensional geometrical shapes.
- Explain some fundamental ideas of algebra (variables, expressions, equations, inequalities).
- Manipulate data and different units measures.
- Operate with ratio, proportion and percentage.
- Solve systems of linear equations.

# Abstract Algebra 1 (MATH340)

Groups: examples, subgroups, cyclic subgroups; cosets and Lagrange's theorem; Cyclic groups and permutation groups. Normal subgroups, quotient groups; homomorphisms and isomorphisms; Direct products of groups. Rings: examples, sub rings, ideals, quotient rings, integral domains, Fields. Ring homomorphisms and isomorphisms.

### Credit Hours : 3

### Prerequisites

- MATH246 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Classify Algebraic Structures.
- Communicate Concepts And Results Of Abstract Algebra To Their Peers.
- Explain Basic Concepts Related To Various Algebraic Structures (Such As Groups, Rings And Fields).
- Retrieve From The Literature Information For Solving A Problem In Abstract Algebra.
- Solve An Algebraic Problem In A Deductive Way.

# Linear Algebra II (MATH341)

Linear Transformations: Isomorphisms of vector spaces, representation by matrices, and change of basis. Eigenvalues and eigenvectors: diagonalization and triangularization of linear operators. Inner product spaces: Orthogonalization and Rieze representation theorem. Self-adjoint operators: the Spectral theorem, Bilinear and quadratic forms.

### Credit Hours : 3

### Prerequisites

- MATH205 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Communicate Concepts And Results Of Linear Algebra To Their Peers.
- Demonstrate Diagonalizability Of Linear Operators And Matrices From The Spectral Theorem.
- Explain Concepts Of Linear Algebra Such As: Linear Transformations And Operators, Vector Spaces, And Inner Product Spaces.
- Find The Appropriate References For Solving Other Problems In Linear Algebra.
- Show Ability To Diagonalize, Triangularize, And Orthogonalize Linear Operators.

# Graph Theory (MATH342)

Definition of a graph. Examples, paths and cycles: Eulerian and Hamiltonian graphs. Application to shortest path and Chinese postman problems, trees, applications, including enumeration of molecules, planar graphs, graphs on other surfaces, dual graphs. Coloring maps, edges, vertices. Digraphs, Markov chains, Hall's marriage theorem and applications. Network flows.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply A Selection Of Algorithms To Solve Practical Problems Involving Discrete Quantities.
- Compute Graph Invariants Such As Chromatic Number, Chromatic Index And Chromatic Polynomial Of Some Examples Of Graphs.
- Explain Basic Graph Theory Concepts To Their Peers.
- Summarize The Basic Concepts In Graph Theory, Including Properties And Characterization Of Bipartite Graphs, Trees, Eulerian And Hamiltonian Graphs And Digraphs.
- Survey In The Literature Beyond The Textbook.

# Introduction to Cryptography and Coding Theory (MATH344)

This course introduces students to the principles and practices which are required for secure communication: cryptography and cryptanalysis, including authentication and digital signatures. Mathematical tools and algorithms are used to build and analyze secure cryptographic systems. Basic notions of coding theory will be also covered

### Credit Hours : 3

### Prerequisites

- MATH246 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze Error-Correcting Codes.
- Apply Encryption And Signing Techniques.
- Develop Work Attitude In A Team On Related Projects.
- Implement Fundamental Concepts Of Cryptography And Coding Theory.

# Optimization Methods (MATH350)

The course will cover the following optimization methods and techniques: Least Squares, Lagrange Multipliers, Newton’s method, Interior point method, Secant method, Quasi-Newton method. We will study the theory and implementation of these methods. The applications of these techniques in various Data Science problems from areas such as statistics, machine learning, engineering, and finance will be discussed. The practical component of this course can comprise computing laboratory work using suitable computer software like Python. This will reinforce the theoretical analysis of problems, methods, and implementation.

### Credit Hours : 3

### Prerequisites

- MATH110 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Solve different types of optimization problems
- Model real-life problems as optimization problems
- Apply appropriate solution methods to a given optimization problem
- Use software to solve optimization problems
- Communicate mathematical concepts, results in optimizations to their peers

# Mathematics for Machine Learning (MATH360)

This course provides a rigorous mathematical basis on machine learning algorithms. A fundamental learning theory for fundamental learnability of a machine is introduced. The main focus of the course is to mathematically investigate an optimal functional relationship between training data sets and a desired outcome for future prediction with a new data set via machine learning algorithms. Optimization techniques based on least square methods, Lagrange multiplier, and gradient descent methods are used in search for the functional relationship in using machine learning algorithms for the trade-off between training and prediction.

### Credit Hours : 3

### Prerequisites

- MATH110 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Understand the basic learning theory for machine learning algorithms
- Explain mathematical fundamentals of various machine learning algorithms
- Use software to solve problems in data science as a practice of the machine learning algorithms
- Communicate mathematical concepts, results in machine learning algorithms to their peers

# Partial Differential Equations (MATH372)

Definitions and concepts: general and particular solutions. Elimination of arbitrary constants and functions. First order equations (the method of characteristics). Second order equations: classifications (hyperbolic, elliptic, parabolic), the normal form. Boundary value problems: the heat equation, the wave equation, Laplace equation. Methods of solutions: separation of variables, the Fourier and Laplace transforms.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply The Mathematical Software Mathematica To Obtain Analytical Solutions Of Pde’S.
- Classify Different Types Of Partial Differential Equations.
- Solve First Order Linear And Nonlinear Pde’S Using Several Techniques.
- Solve Special Types Of Second Order Pde’S, The Wave, The Heat And The Laplace Equations Using Variety Of Techniques.
- Use Boundary Value Problems To Model Real-Life Problems.

# Dynamical Systems and Applications (MATH374)

One dimensional discrete dynamical systems. Steady states, stability, periodic points. Chaos. Lyapunov exponents. Symbolic dynamics. 2-dimensional systems. Mandelbort set. Fractals. Applications in ecology population growth, Predator-prey and competition models. Applications in medicine fractal structure of the lung, heart rat variability.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze The Solution Of Different Types Of Dynamical Systems In Terms Of Steady States, Stability, And Periodic Points.
- Communicate Findings Of A Model In The Language Of The Corresponding Problem.
- Deduce Theoretical Results From Lyapunov Exponents.
- Describe The Dynamic Of Discrete And Continuous Systems.
- Develop Mathematical Models Related To Ecology Population Growth, Predator-Prey And Competition Models, Medicine Fractal Structure Of The Lung And Heart Rat Variability.
- Use Technology To Obtain Relevant Solutions Of Dynamical Systems.

# Financial Mathematics (MATH391)

Introduction to the concepts of financial markets and products. Financial derivatives, options, futures and forwards. Pricing, hedging and no arbitrage concepts. The Binomial model. Introduction to stochastic calculus, Stochastic processes, Markov property, martingales. Brownian motion, stochastic integration, stochastic differential equations, Ito's Lemma. Black and Scholes formula, delta hedging. Numerical Methods for finance, Finite Difference Methods, Monte Carlo simulation. Optional topics: Value at Risk, Greeks, Implied volatility, implementation of pricing formulas in VBA for Excel, interest rate models, exotic options, path dependent options, Asian options.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Collect Material In Financial Mathematics Beyond The Contents Of The Textbook.
- Contribute—As Part Of A Team—To A Project On Modeling And Solving A Financial Derivative Problem.
- Describe The Practical Meanings Of Different Financial Products And Markets And Basic Concepts Of Stochastic Calculus.
- Justify Some Statements In Financial Mathematics By Critical And Deductive Thinking.
- Solve Different Types Of Stochastic Differential Equations.
- Use Binomial Trees Or Stochastic Differential Equations To Model Financial Asset Price Trajectories.

# Complex Analysis II (MATH413)

Sequences and series of complex numbers, Power series, Taylor and Laurent expansions, differentiation and integration of power series, application of the Cauchy theorem: Residue theorem, evaluation of improper real integrals, conformal mappings, mapping by elementary functions.

### Credit Hours : 3

### Prerequisites

- MATH315 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply Techniques Of Complex Analysis To Solve Various Problems.
- Describe The Fundamental Concepts Of Complex Analysis.
- Explain Results In Complex Analysis To Their Peers.
- Survey The Literature Beyond The Textbook.

# Numerical Analysis II (MATH422)

Approximation theory: Orthogonal and Chebyschev polynomials, rational and trigonometric polynomials, multiple integrals, initial value problems: Taylor's methods, multistep and Runge-Kutta methods, boundary value problems: shooting, finite difference and Rayleigh-Ritz methods.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Solve problems on some important concepts of Numerical Analysis (such as least squares approximation, double integrals, convergence, and stability).
- Formulate some numerical method for approximating the initial value problems, ordinary and partial boundary value problems.
- Show theorems in numerical analysis using different types of logical proofs.
- Apply Numerical Analysis to real world problems (such as heat equations and wave equations).
- Write Mathematica codes to investigate approximations, integrals, and numerical techniques for solving initial and boundary value problems.
- Work effectively in team on a numerical analysis project.

# Abstract Algebra 2 (MATH443)

Rings: introduction to rings properties and subrings; Integral Domain (ID), fields and characteristic of a ring; Ideals and factor rings; ring homomorphisms, polynomial rings and factorization of polynomials; Divisibility in ID and Unique Factorization Domain (UFD). Fields: the Fundamental Theorem of Fields; Splitting Field; Zeroes of Irreducible polynomial; Algebraic extension of Fields; Finite Fields; Introduction to Galois Theory.

### Credit Hours : 3

### Prerequisites

- MATH340 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Communicate Concepts And Results Of Abstract Algebra To Their Peers.
- Create Counterexamples To Disprove Algebraic Statements.
- Determine The Zeroes And Splitting Fields Of Polynomials, The Subfields Of (Finite) Fields, And The Galois Group Of Various Field Extensions.
- Discover The Fundamental Concepts Of Abstract Algebra: Rings, Integral Domains, Ring Homomorphisms, Ideals, Factor Rings, And Fields.
- Explore In The Literature, Beyond The Textbook, Topics In Abstract Algebra.

# Introduction to Topology (MATH462)

Topological spaces, Bases and sub-bases, subspaces, finite product spaces, continuous maps, homomorphisms, Hausdorff spaces, metric spaces, compactness and connectedness, separation axioms.

### Credit Hours : 3

### Prerequisites

- MATH215 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply Topological Methods To Solve Other Problems.
- Explain Basic Topological Concepts To Their Peers.
- Justify Proofs Of Several Standard Theorems Related To Compactness, Connectedness And Separation Axioms.
- Summarize The Fundamental Concepts Of Topology, Including: Topological Spaces, Continuity, Metric Spaces, And Hausdorff Spaces.
- Survey Literature Related To A Given Topological Problem.

# Mathematical Modeling (MATH470)

The modeling process, dimensional analysis, model fitting techniques, discrete models difference equations, logistic equation. Continuous models using derivatives for example: predator-prey, population, harvesting, models. Discussion of stability, phase plane. Applications using Mathematica.

### Credit Hours : 3

### Prerequisites

- MATH275 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze Quantitatively The Findings Of A Model.
- Build Team Work For Their Mathematical Modelling Part Of A Project.
- Develop A Mathematical Model For A Given Problem.
- Prepare A Report Linking A Given Problem With Its Model.
- Understand Modeling Process, Dimensional Analysis, Model Fitting Techniques, Discrete Models Difference Equations And Logistic Equation.
- Use Technology To Obtain Relevant Solutions Of A Model.

# Control Theory & Applications (MATH471)

Introduction and motivation. Problem formulation. Systems models: linear and nonlinear systems. Optimal control problems arising from different fields. Calculus of variation with application to system modeling. Limitation of calculus of variation leading to modern control theory. Time optimal control, attainable state, reachable sets, and Bang-Bang principle. Pontryagin minimum principle and transversality conditions. Linear quadratic control problems. Optimal linear state feedback control. Applications: 3-axis attitude control of communication satellites, road building and fisheries problems, geo-synchronous satellites, speed controls of electric motors.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Classify Mathematical Representation Of Control Systems.
- Communicate Effectively Solutions Of Optimal Control Problems To Their Peers.
- Determine The Existence And Uniqueness Conditions Of An Optimal Control Using Pontryagin Maximum Principle.
- Show The Stability, Observability And Controllability Of A Linear System.
- Use Logical Approach Of Transfer Functions To Obtain State-Space Realizations From A Linear System And Vice Versa.
- Use Numerical Techniques And Computer Simulation To Find Solutions Of Optimality Conditions.

# Advanced Topics in Mathematics of Data Science (MATH475)

Special topics in Mathematics of Data Science is a unique course. The topics are selected from recent developments and trends in Mathmeatics of Data Science. The course may introduce new or emerging aspects in the field, contemporary applications and theory in Mathematics of Data Science, or assesses the state-of-the-art through readings, discussions, and critiquing current literature.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Evaluate the feasibility and applications of the specialized topic.
- Recognize the methods, techniques, and skills specific to the topics.
- Apply the specialized methods, techniques, and skills in the topics.

# Research Project (MATH495)

Students are supervised during their formulation of research proposals. Instructors direct their students in carrying out different tasks leading to the execution of the projects. Students are required to give presentations regarding their achievements, and the written final reports are submitted for evaluation.

### Credit Hours : 3

### Corequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Find appropriate references and read mathematical literature independently.
- Prepare reports in mathematics using appropriate tools (e.g. SWP and/or LaTeX) and computational software.
- Present mathematical results orally in front of a specialized audience.
- Explain mathematical results in a deductive way.
- Work on assigned tasks related to mathematics individually and as a part of a group.
- Demonstrate knowledge of mathematics beyond the curriculum.

# Research Project I (MATH496)

Students are supervised during their formulation of research proposals. Instructors direct their students in carrying out different tasks leading to the execution of the projects. Students are required to give presentations regarding their achievements, and the written final reports are submitted for evaluation.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Find appropriate references and read mathematical literature related with data science independently.
- Prepare reports in mathematics of data science using appropriate tools (e.g. Python, Mathematica, MATLAB, SWP and/or LaTeX) and computational software.
- Present mathematical results related to the data science orally in front of a specialized audience.
- Explain mathematical results related to data science in a deductive way.
- Work on assigned tasks related to mathematics and data science individually and as a part of a group.
- 6. Demonstrate knowledge of mathematics and data science beyond the curriculum.

# Research Project II (MATH497)

Students are supervised during their formulation of research proposals. Instructors direct their students in carrying out different tasks leading to the execution of the projects. Students are required to give presentations regarding their achievements, and the written final reports are submitted for evaluation.

### Credit Hours : 3

### Prerequisites

- MATH496 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Find appropriate references and read mathematical literature related with data science independently.
- Prepare reports in mathematics of data science using appropriate tools (e.g. Python, Mathematica, MATLAB, SWP and/or LaTeX) and computational software.
- Present mathematical results related to the data science orally in front of a specialized audience.
- Explain mathematical results related to data science in a deductive way.
- Work on assigned tasks related to mathematics and data science individually and as a part of a group.
- Demonstrate knowledge of mathematics and data science beyond the curriculum.

# Internship (MATH500)

The Internship training program is coordinated by both the department, academic supervisor and the faculty training committee. The program is continuously monitored and reviewed by a field supervisor staff member at one of the institutions, establishments, or work sites in the United Arab Emirates. (This course is conducted over half a semester (8 weeks) during the third year of study. Offered condensed courses should be taken during the other half of the semester).

### Credit Hours : 6

### Prerequisites

- Pre/Co MATH495 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply Their Mathematical Knowledge In A Working Environment.
- Determine An Adequate Mathematical Model For A Problem Coming From The Industry.
- Develop Adequate Team Work Attitudes With Supervisors, Co-Workers, And Possibly Customers.
- Interpret A Problem From The Industry In A Logical, Scientific Way.
- Make Up A Well-Structured And Organized Professional Report.
- Solve Mathematical Problems Coming From The Industry.

# Internship (Mathematical Analytics) (MATH501)

The Internship training program is coordinated by both the department, academic supervisor and the faculty training committee. The program is continuously monitored and reviewed by a field supervisor staff member at one of the institutions, establishments, or work sites in the United Arab Emirates. (This course is conducted over a semester (16 weeks) during the final year of study.

### Credit Hours : 6

### Prerequisites

- MATH496 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply their Mathematical Analytics knowledge in a working environment.
- Solve mathematical problems related to data science coming from the industry.
- Use an adequate mathematical model to solve Data Science related problems.
- Interpret a problem from the industry in a logical, scientific way.
- Make up a well-structured and organized professional report.
- Develop adequate team work attitudes with supervisors, co-workers, and possibly customers

# Real Analysis (MATH510)

Sequences of functions, the uniform norm, uniform convergence. Series of functions and tests for uniform convergence. Limits superior and inferior. Lebesgue outer measure and Lebesgue measure, measurable subsets, Borel measurable sets, non-measurable sets. Measurable functions. Integration of non-negative functions, Levi’s monotone convergence theorem, Fatou’s lemma, Integrals of measurable functions. Lebesgue’s dominated convergence theorem. Riemann integral versus Lebesgue integral.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Compare Riemann Integrals With Lebesgue Integrals
- Construct Lebesgue Outer Measure And Lebesgue Measure
- Describe ?-Algebras, Measurable Sets, And Measurable Functions
- Explain Lebesgue Integrals And Convergence Theorems
- Justify Pointwise And Uniform Convergence Of Sequences And Series Of Functions

# Complex Analysis (MATH515)

Complex derivative, Cauchy-Riemann equations, conformality, power series and Abel's theorem. Complex integration, exactness and independence of path, Cauchy's theorem for disks, Cauchy's integral formula, higher derivatives, applications. Taylor's finite development, zeroes of analytic functions, classification of isolated singularities, Casorati-Weierstrass theorem. Argument principle, open mapping theorem. Maximum modulus principle, Schwarz' lemma. Chains, cycles, simple connectivity, homology, general form of Cauchy's theorem, periods and residues, the residue method. Compactwise convergence and Weierstrass' theorem, Hurwitz's theorem, Taylor's expansion, Laurent expansion. Mittag-Leffler’s theorem. Infinite products and absolute convergence, Weierstrass’s factorization theorem. Riemann conformal mapping theorem. Montel's theorem. Special functions (gamma, zeta). Introduction to Harmonic analysis.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze Entire Functions
- Apply Techniques Of Complex Analysis To Solve Boundary Value Problems.
- Describe Techniques Of Power Series Expansions
- Discuss Important Concepts And Results Of Complex Analysis

# Numerical Analysis (MATH520)

Error analysis. Solutions of linear systems: LU factorization and Gaussian elimination, QR factorization, condition numbers and numerical stability, computational cost. Least squares problems: the singular value decomposition (SVD), QR algorithm, numerical stability. Eigenvalue problems: Jordan canonical form and conditioning, Schur factorization, the power method, QR algorithm for eigenvalues. Iterative Methods: construction of Krylov subspace, the conjugate gradient and GMRES methods for linear systems, the Arnoldi and Lanczos method for eigenvalue problems.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Assess A Method For Its Accuracy, Stability, And Computational Cost.
- Demonstrate Awareness Of The Efficiency Implications In A Computer Implementation Of A Method.
- Model A Real-World Problem As A Problem In Numerical Linear Algebra.
- Select Or Design A Method For Solving A Problem In Numerical Linear Algebra.
- Use Numerical Software Appropriately, I.E., Decide When To Use Certain Methods Depending On Their Limitations.

# Numerical Methods in Differential Equations (MATH522)

Theory and implementation of numerical methods for initial and boundary value problems in ordinary differential equations. One-step, linear multi-step, Runge- Kutta, and extrapolation methods; convergence, stability, error estimates, and practical implementation, Study and analysis of shooting, finite difference and projection methods for boundary value problems for ordinary differential equations. Theory and implementation of numerical methods for boundary value problems in partial differential equations (elliptic, parabolic, and hyperbolic).

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze The Error Associated With Each.
- Create Computer Algorithms For Solving Ordinary And Partial Differential Equations.
- Implement Different Numerical Methods For Solving Initial And Boundary Value Problems.
- Implement Different Numerical Methods For Solving Various Types Of Partial Differential Equations Such As The Elliptic, Parabolic And Hyperbolic Types.
- Solve Real-Life Problems Using Different Numerical Methods.

# Algebra I (MATH540)

Group theory: definitions, subgroups, permutation groups, cyclic groups, quotient groups, homomorphism, the isomorphism and the correspondence theorems. Ring theory: definitions, rings homomorphism, ideals, quotient rings, fraction fields, polynomial rings, Euclidean domain, and unique factorization domain. Field theory: algebraic field, extensions.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Classify Different Algebraic Structures.
- Define Various Algebraic Structures.
- Determine Galois Groups Of Polynomials Of Small Degree, Of Finite Fields And Of Cyclotomic Number Fields.
- Develop Proofs Of General Statements Using Abstract Knowledge And Operations.
- Develop Proofs Of General Statements Using Abstract Knowledge.
- Justify Steps Of Abstract Proofs By Invoking Properties Of Algebraic Structures.

# Number Theory (MATH541)

Basics of number theory: divisibility, unique factorization, congruence arithmetic, Chinese remainder theorem, integers modulo n, Finite fields, Fermat's little theorem, and Wilson's theorem. Introduction to Algebraic number theory: the Pell equation, the Gaussian integers, Quadratic integers, and the Four square theorem. Quadratic reciprocity and quadratic congruence with composite modules.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply Public-Key Cryptography
- Identify And Use The Properties Of Congruences
- Identify And Use The Properties Of Divisibility
- Recognize The Theory Of Quadratic Residues And Their Relation To Quadratic Congruences
- Solve Some Diophantine Equations

# General Topology (MATH561)

Fundamentals of point set topology: topological spaces, neighborhoods of points, basis, subbases, and weight of spaces. Continuous maps and homeomorphisms, closed and open mappings, quotient mappings. Metric and normal spaces, accountability and separation axioms. Product spaces and quotient spaces. Compactness and connectedness of spaces and properties. Complete metric space and function spaces.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Examine The Main Topological Properties Of Metric Spaces .
- Justify Elementary Theorems Involving The Concepts Of Topological Spaces, Homeomorphism, Compactness And Connectedness.
- Outline The Fundamental Concepts Of Point-Set Topology.
- Solve Mathematical Questions By Using General Topology.

# Theory of Partial Differential Equations (MATH570)

The theory of initial value and boundary value problems for hyperbolic, parabolic, and elliptic partial differential equations, with emphasis on nonlinear equations. More general types of equations and systems of equations

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply Analytical Methods To Prove Existence And Uniqueness Of Solution For Different Types Of Pde’S.
- Classify Second Order Linear Pdes.
- Construct Green’S Functions And Green’S Representation Formula.
- Solve Various Types Of Pde’S Using Different Tools, Such As: The Method Of Characteristics, Separation Of Variables, Fourier And Laplace Transforms.
- Use The Software Mathematica To Solve Various Types Of Pde’S.

# Dynamical Systems & Chaos Theory (MATH573)

Discrete time dynamical systems. Continuous time dynamical systems. Invariant manifolds, homoclinic orbits, local and global bifurcations. Hamiltonian systems, completely integrable systems, KAM theory. Different mechanisms for chaotic dynamics, symbolic dynamics, Applications in physics, biology and economics.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Use Sarkovskii’S Theorem And Period Doubling Cascades In Chaos Theory.
- Apply Chaotic Dynamical Systems To Science And Engineering Problems.
- Describe The Different Mechanisms Governing Chaotic Systems.
- Determine The Stability And Bifurcations Of Non-Linear Discrete And Continuous Dynamical Systems.
- Explain The Poincaré-Bendixson Theorem And Its Various Implications.
- Explain The Concepts Of Chaos And Fractal

# Functional Analysis (MATH616)

Banach Spaces, The Banach Fixed Point Theorem; Bounded Linear Operators and functionals; Hilbert Spaces; Representation of functionals on Hilbert Spaces; Compact linear operators in Banach Spaces; Spectral Theory of Bounded Self-Adjoint Linear Operators in Hilbert Spaces.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Recognize Inner Products, Hilbert Spaces, And State Their Main Properties
- Recognize Normed And Banach Spaces, And State Their Main Properties
- Solve Problems Related To Linear Operators On Hilbert And Banach Spaces.
- Work With Metric Spaces

# Mathematics Seminar (MATH633)

In the first part of the course, introductory research talks will be delivered by faculty members. Ethics issues related to mathematical research will be also discussed. In the second part, each student will give a talk in a research topic of his/her choice.

### Credit Hours : 1

### Course Learning Outcomes

At the end of the course, students will be able to :- Demonstrate ability to integrate in depth specific scientific topics;
- Explain mathematical ideas in a rigorous and ethical way;
- Develop effective team work with peers on projects related to the assigned topics;
- Compile a literature review related to the assigned topics;

# Algebra II (MATH640)

Group theory: Sylow theorems, Jordan–Holder theorem, solvable group. Ring theory: unique factorization in polynomial rings and principal ideal domain. Field theory: rules and compass constructions, roots of unity, finite fields, Galois theory, solvability of equations by radicals.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Justify Steps Of Abstract Proofs By Invoking Properties Of Algebraic Structures.
- Produce Properties Of A Group From The Properties Of Its Subgroups.
- State The Properties Of Basic Algebraic Structures.

# Selected Topics (MATH690)

A variety of topics and current research results in Mathematics will be presented by faculty members to students.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Build Various Mathematical Tools Related To The Topics, And Apply Them To The Investigation Of Other Problems When Appropriate.
- Construct Clear And Accurate Mathematical Proofs In Exploring Further Properties Of The Studied Mathematical Objects.
- Explain The Concepts And Tools Developed In The Topics
- Solve Multi-Steps Problems Using Advanced Mathematics Tools.
- Survey The Main Results Of A Specific Mathematic Topic.

# Independent Studies (MATH695)

Graduate students will study topics related to their Ph.D. thesis independently. The selection of these topics will be with the consent of advisor.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain The Concepts Of The Studied Topics.
- Formulate Mathematical Proofs In A Clear, Rigorous And Accurate Scientific Method By Exploring The Properties Of The Studied Mathematical Objects.
- Manipulate The Tools Of The Studied Topics.

# Functional Analysis (MATH710)

Normed Spaces; Banach Spaces; Compactness and Finite Dimension; Bounded Linear Operators; Operator Spaces; Inner Product Spaces; Hilbert Spaces; Orthonormal Sets and Sequences; Representation of Functionals on Hilbert Spaces; Self-Adjoint; Unitary and Normal Operators; Zorn's Lemma; The Hahn-Banach Theorem; Adjoint Operator; Reflexive Spaces, The Baire Category Theorem; The Uniform Boundedness Theorem; Strong and Weak Convergence; Numerical Integration and Weak-* Convergence; The Open Mapping Theorem; The Closed Graph Theorem; The Banach Fixed Point Theorem; Spectral Theory of Bounded Linear Operators and Compact Linear Operators in Normed Spaces; Spectral Theory of Bounded Self-Adjoint Linear Operators in Hilbert Spaces.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Elaborate with dual spaces and their properties
- Recognize weak topologies on Banach spaces and their properties
- Elaborate with linear bounded operators on Hilbert spaces and state their main properties.
- Examine spectral properties of linear operators on Hilbert spaces.

# Advanced Measure Theory (MATH715)

Outer Measure; The Caratheodory-Hahn Theorem; Measurable Functions; Integration of Measurable Functions; Fatou’s lemma and Convergence Theorems; Abstract Measure Spaces; Product Measures; Fubini’s Theorem; Abstract L_p Spaces; The Completeness of L_p (X,μ); The Riesz Representation Theorem for the Dual of L_p (X,μ).

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Identify abstract measure spaces
- Apply integration of measurable functions.
- Explain the classical Banach spaces; L^p-spaces.
- Explain product measures and Lebesgue measure on R^n.

# Introduction to Operator Algebras (MATH716)

Banach and Hilbert spaces. Bounded operators on Hilbert spaces, Algebras of operators, The von Neumann algebras, compact and Hilbert-Schmidt operators. Abstract C*-algebras and main examples, The Continuous Functional Calculus Theorem, polar decomposition, Gelfand-Naimark Theorem.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze properties of bounded linear operators on Hilbert spaces
- Explain main properties of von Neumann algebras
- Analyze theorems of abstract C*-algebras

# Numerical Methods for Partial Differential Equations (MATH720)

Numerical quadrature, Spectral Methods: Collocation, Tau and Galerkin methods, Elliptic Problems and the Finite Element Method: conservation of heat, behavior of solutions, Two-point boundary value problems and the Laplace and Poisson equations, variational and the Galerkin finite element methods, Convergence, finite difference method, Method of Lines, Numerical stability, stiffness and dissipativity, convergence, Finite difference schemes, consistency, Stability, dissipativity, dispersion, convergence.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Approximate the solution of partial differential equations using the spectral methods.
- Obtain the numerical solution of partial differential equations using the finite element methods.
- Approximate the solution of class of partial differential equations using the finite difference methods.
- Compute the region of stability of a numerical method for approximating the solution of partial differential equations.

# Advanced Algebra (MATH740)

Modules, quotient modules, module homomorphisms, direct sums, free modules, tensor products. Vector spaces, matrices, dual spaces, determinants. Modules over principal ideal domains, rational canonical forms, Jordan canonical form. Modules over group rings, Schur lemma, Wedderburn theorem, character theory, orthogonality relations.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain basic concepts of module theory.
- Analyze quotient modules, homomorphisms, and basic operations on modules.
- Employ vector spaces and determinants.
- Describe modules over principal ideal domains and determine canonical forms of matrices.
- Analyze basic concepts of representation theory.
- Apply character theory and orthogonal relations.

# Advanced Number Theory (MATH741)

Estimates of arithmetic functions, the prime number theorem, Dirichlet series, Dirichlet theorem on primes in arithmetic progressions. Integer partitions, Euler formulas, Jacobi triple product formula. Algebraic numbers, algebraic integers, quadratic fields, units and primes in quadratic fields.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Apply estimates of arithmetic functions to analytic number theory.
- Describe the Prime Number Theorem.
- Solve problems related to integer partitions.
- Analyze Diophantine equations using Algebraic Number Theory.

# Cryptography (MATH743)

Public key cryptosystems (RSA, Rabin, ElGamal), discrete logarithm, Diffie-Hellman key exchange, primality testing, factoring algorithms, multivariate cryptography, other systems, signature schemes, secret sharing, hash functions, identification.

### Credit Hours : 3

### Prerequisites

- MATH540 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Employ basic concepts and algorithms of cryptography
- Perform encryption and decryption using public key cryptograph
- Analyze and apply digital signature schemes, secret sharing, hash functions, identification.
- Examine the discrete logarithm problem and illustrate its applications.
- Formulate the mathematical concepts underlying modern cryptography.

# Coding Theory (MATH744)

Block codes, linear codes, generator and parity check matrices, dual codes, weight and distances, weight enumerators, Hamming codes, Golay codes, Reed-Muller codes, Kerdock codes, bounds on codes, theory of cyclic codes, BCH codes, Reed-Solomon codes, quadratic residue codes, generalized Reed-Muller codes, codes over Z4.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Employ basic notions of coding theory.
- Analyze linear codes and describe their generator and parity-check matrices.
- Categorize different types of codes
- Determine codes over rings
- Formulate the mathematical concepts underlying coding theory.

# Finite Fields and Applications (MATH745)

Fields, finite fields, field extensions, trace and norm functions, bases, polynomials, primitive polynomials, irreducible polynomials, linearized polynomials, applications of finite fields, linear codes, multivariate cryptography.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Describe the structure of finite fields.
- Explain the notion of an extension of a field.
- Produce computations in specific examples of finite fields.
- Use polynomials for analyzing finite fields.

# Finite Groups (MATH746)

Characteristic subgroups, Nilpotent and Solvable Groups, Semidirect and Central products; Automorphisms as Linear Transformation. Representations of Finite Abelian Groups, Complete Reducibility, Clifford’s Theorem, G-Homomorphism and Representation of direct and central products, Character Theory: Frobenius Groups, Coherence and Brauer’s characterization of Characters.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain the main concepts of and theorems of the theory of finite groups.
- Apply structural results for finite groups.
- Employ the main concepts of representation theory.
- Demonstrate the efficient use of character theory.

# Module and Ring Theory (MATH747)

Free module, Projective module, Injective module, Flat modules, Homological dimensions, Noncommutative localization, von Neumann regular rings and generalizations, Frobenius and quasi-Frobenius rings, Morita theory.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Recognize and characterize several types of modules (e.g. free modules, projective modules, injective modules)
- Describe several types of rings (e.g. von Neumann regular rings, Frobenius and quasi-Frobenius rings)
- Explain the relationship between some types of modules and particular rings
- Establish the equivalences between two categories of modules

# Topology (MATH760)

Topological spaces, basis, subbases, continuous maps and homeomorphisms, product and quotient topology, metric and normed spaces, connectedness, local connectedness, compactness, local compactness, compactification, countability axioms, normal spaces, Uryshon metrization Theorem, Tietze Extension Theorem, manifolds, complete metric space and function spaces, Metrization Theorem and paracompactness.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze basic properties of topological spaces.
- Apply various mappings such as continuous mappings, homeomorphisms, closed and open mappings, and quotient mappings.
- Decide whether two given spaces are homeomorphic.
- Construct topological spaces to prove or disprove a given statement.

# Algebraic Topology (MATH761)

Fundamental group and covering spaces, simplicial and singular homology theory with applications, cohomology theory, duality theorem. Homotopy theory, fibration, relations between homotopy and homology, obstruction theory, and topic from spectral sequences, cohomology operations, and characteristic classes.

### Credit Hours : 3

### Prerequisites

### Course Learning Outcomes

At the end of the course, students will be able to :- Demonstrate understanding of the fundamental concepts of algebraic topology, such as homotopy and homology.
- Demonstrate familiarity with a range of examples illustrating these notions.
- Compute the fundamental group and the homology groups of many examples of topological spaces.
- Demonstrate proficiency in communicating mathematics orally and in writing.

# Knot Theory and Applications (MATH763)

Knots and links, isotopy, Reidemeister moves, numerical invariants, 3-colorings, Braids, Alexander’s Theorem and Markov moves, Jones and bracket polynomials, Tait’s conjectures, Alexander-Conway polynomial, HOMFLY and Kauffmann invariants, Tangle equations and Applications.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Explain the fundamental notions of knot theory.
- Solve low dimensional topological problems using knot theory.
- Compare between different type of knot invariants.
- Apply knot theoretical techniques to biological problems

# Differential Manifold (MATH764)

n-dimensional Euclidean Space, curves and surfaces, coordinate charts, manifolds, smooth maps, immersion and imbedding, sub-manifolds, partitions of unity, tangent vectors and cotangent vectors, tangent bundles, Riemannian manifolds, tensor and exterior algebra, differential forms, exterior differentiation, de Rham cohomology, Lie groups, quotient spaces.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- State the abstract definition of manifolds in the Euclidean space.
- Apply tools from Advanced Calculus to the study of manifolds.
- Understand the geometry and topology of curves and surfaces.
- Apply methods of abstract algebra to the analysis of manifolds.
- Understand the geometric terms defined on higher-dimensional manifolds.

# Advances Partial Differential Equations II (MATH770)

Method of characteristics, Formation of shocks for the inviscid Burger’s equation, Explicit formulas for solutions of the linear wave equation (d’Alembert, Kirchoff, Poisson) , Cauchy-Kowalevski theorem •, Review of Gronwall’s inequality, Sobolev spaces, Picard iteration, definition of an initial value problem, local well-posedness, global well-posedness, Green’s theorem, Review of Fourier analysis, Vector fields, Energy estimates, Finite speed of propagation, Klainerman-Sobolev inequality (preceded by a review of Sobolev embeddings), Local well-posedness for quasi-linear wave equations and global well-posedness in a subcritical situation, Symmetric hyperbolic systems, Small data global well-posedness for quasi-linear wave equations on R^n , n ≥ 4 Small data global well-posedness for quasi-linear Klein-Gordon equation on R^3, Null forms and small data global well-posedness for quasi-linear wave equations on R^3.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Analyze Method of characteristics.
- Formation of shocks for the inviscid Burger’s equation
- Find explicit formulas for solutions of the linear wave equation.
- Proof the related theorems Sobolev spaces.
- Anlayize the local well-posedness for quasi-linear wave equations and global well-posedness in a subcritical situation and symmetric hyperbolic systems.
- Analyize the small data global well-posedness for quasi-linear wave equations on R^n , n ≥ 4 .

# Integral Equations and Calculus of Variations (MATH771)

Integral Equations: Definition of Integral Equations, Kinds of Kernels, Volterra and Fredholm Equations, Method of Successive Approximations, Applications to O.D.E’s, Green’s Functions, Complex Form of Fourier and Laplace Transforms, Singular Integral Equations, Symmetric Kernels, Eigenvalues and Eigenfunctions, Fundamental Properties of Eigenvalues and Eigenvectors, Hilbert-Schmidt Theorem, Rayleigh-Ritz Method for Finding the First Eigenvalue. Calculus of Variations: Maxima and Minima, Euler Equation, Constraints and Lagrange Multipliers, Hamilton’s Principle, Lagrange Equations.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Approximate the solution of integral equations of different types.
- Explain the applications of calculus of variations.
- Approximate the solution of eigenvalue problems.
- Implement the different approaches in calculus of variation to solve real life problems.
- Analyze the singular integral equations.

# Theory of Ordinary Differential Equations (MATH772)

Initial Value Problem: Existence and Uniqueness of Solutions; Continuation of Solutions; Continuous and Differential Dependence of Solutions. Linear Systems: Linear Homogeneous And Nonhomogeneous Systems with Constant and Variable Coefficients; Structure of Solutions of Systems with Constant and Periodic Coefficients; Higher Order Linear Differential Equations; Sturmian Theory, Stability: Lyapunov Stability and Instability. Lyapunov Functions; Lyapunov's Second Method; Quasilinear Systems; Linearization; Stability of an Equilibrium and Stable Manifold Theorem for Nonautonomous Differential Equations.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Describe The Concept Of Stability Of Solutions Of Differential Equations Of Higher Orders And Systems.
- Explain The Concepts Of Equilibrium And Stable Manifolds And Their Role In Stability Of Solutions Of Ode’S.
- Prove The Existence And Uniqueness Of Solutions Of Certain Class Of Ordinary Differential Equations.
- Solve Systems Of Differential Equations Of Different Types.
- Use Available Software To Solve Differential Equations And Systems Of Differential Equations.

# Dynamical Systems and chaos theory (MATH773)

Discrete time dynamical systems. Continuous time dynamical systems. Invariant manifolds, homoclinic orbits, local and global bifurcations. Hamiltonian systems, completely integrable systems, KAM theory. Different mechanisms for chaotic dynamics, symbolic dynamics. Applications in physics, biology and economics.

### Credit Hours : 3

### Prerequisites

- MATH275 with a minimum grade D

### Course Learning Outcomes

At the end of the course, students will be able to :- Locate and analyse the stability of fixed points and periodic orbits of maps and flows
- Identify commonly encountered local and global bifurcations.
- Understand the basic notions of chaotic behaviour for maps and flows.
- Define integrability of Hamiltonian systems, and give a qualitative and semi-quantitative analysis of perturbed integrable dynamics.
- Identify applications of each of the main classes of dynamical systems, stating features of their long time behaviour.

# Stochastic Calculus for Finance (MATH774)

Stochastic process; Brownian motion; Martingales; Ito's integral; Ito's formula; Stochastic differential equations; Geometric Brownian motion; Arbitrage and SDEs; The diffusion equation; Representation theorems; Risk-neutral measures, Change of measure and Girsanov’s theorem; Arbitrage and martingales; The Feynman-Kac connection.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Manipulate continuous stochastic processes such as Brownian motion.
- Solve different kinds of stochastic differential equations.
- Develop pricing formulas for some financial derivatives using Ito formula and representation and Girsanov theorems.
- Construct PDEs for some financial derivatives prices using Feynman-Kac theorem.

# Numerical Methods for Finance (MATH777)

Numerical differentiation (Forward, Backward, central), Measuring the error, Numerical instability, Finite difference methods, Monte-Carlo methods, the Euler-Maruyama and Milstein's higher order methods for Stochastic Differential Equations. Applications to finance such as the simulation of asset prices, Monte Carlo Evaluation of European options, numerical solution for the Black-Scholes PDE.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Construct numerical simulations for SDEs.
- Evaluate options using the Monte Carlo method.
- Solve options pricing PDEs using the finite difference methods.
- Develop solutions for derivative price using transform techniques.
- Formulate calibration problems to estimate financial asset model parameters.

# Independent Studies (MATH795)

Graduate students will study topics related to their MSc. thesis independently. The selection of these topics will be with the consent of advisor.

### Credit Hours : 3

### Course Learning Outcomes

At the end of the course, students will be able to :- Acquire an understanding of the studied topics.
- Demonstrate familiarity with the concepts and tools of the studied topics
- Be proficient in expressing clear and accurate mathematical proofs in exploring the properties of the studied Mathematical objects.

# Algebra (MATU110)

The ALGEBRA COURSE is a blended learning course, which is designed to develop the algebra proficiencies necessary for success in future Math or Statistics courses. This course is required by all University colleges. It is covering the following topics: Linear equations and inequalities (in one variable),Operations on polynomials, Coordinate plane and Linear equations in two variables,Quadratic Equations and Rational Expressions,Setting up Equations and Problem Solving.

### Credit Hours : 0

# College Algebra (MATU120)

The COLLEGE ALGEBRA CURSE is a blended learning course, which is designed to develop students’ proficiencies in college algebra that are necessary for success in future Statistics or Calculus courses. This course is required by the Colleges of Business, IT, Engineering, Food and Agriculture, Medicine, Science, and Education (Science Tracks). It is covering the following topics: • Complex numbers • Factorial • Functions: properties, graphs, transformations, and inverse functions • Quadratic Functions: definition, zeros, vertices, and graphs • Exponential and logarithmic functions and equations • Basics of arithmetic and geometric sequences and sums

### Credit Hours : 0

# Trigonometry (MATU130)

The TRIGONOMETRY COURSE is a blended learning course, which is designed to develop the trigonometry proficiencies necessary for success in future Calculus courses. This course is required by the Colleges of IT, Engineering, Food and Agriculture, Medicine, Science, and Education (Science Tracks). It is covering the following topics: • Angles and their measures • Trigonometry of right triangles • Trigonometric functions: properties and graphs • Trigonometric identities and equations • Applications

### Credit Hours : 0

### عفوا

لايوجد محتوى عربي لهذه الصفحة

### عفوا

يوجد مشكلة في الصفحة التي تحاول الوصول إليها