Calculus 1

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Description:

Cartesian coordinates; polar coordinates; complex numbers; summation, multiplication, radical and geometrical representation of complex numbers; polar representation of complex numbers; function; algebra of functions; limit and related theories; infinite limit and limit at infinity; left-hand and right-hand limit; continuum; derivative; derivative rules; inverse function and its derivative; derivative of trigonometric functions and their inverse functions; Roll's theorem; mean; value theorem; geometrical and physical applications of derivative; curves and acceleration in polar coordinates; application of derivative in approximation of equations roots; definition of integral of continuous and piecewise continuous functions; fundamental theorems of differential and integral calculus; primary function; approximation estimate methods of integral; application of integral in calculation of surface area and volume and curve length and momentum and center of gravity and work, etc. (in Cartesian and polar coordinates); logarithm and exponential function and their derivatives; hyperbolic functions; integration methods such as change of variables and by parts and partial fractions decomposition; special variable replacement of sequence, numerical series and convergence theories; power series and Taylor theorem with residual, Taylor expansion.

Suggested Textbooks:

Calculus 2

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Calculus 1

Description:

Parametric equations; space coordinates; vector in space; scalar product; 3×3 matrices; linear equations system with 3 unknowns; operation on rows; inverse matrix; solving of linear equations system; linear independence; base in R2, R3; linear transformation and its matrix; 3 × 3 determinant; characteristic vector and value; vector product; equations of line and plane; second order surface; vector function and its derivative; velocity and acceleration; curvature and normal vectors on curves; multivariable functions; total and partial derivative; tangent plane and normal line; gradient; chain rule for partial derivative; exact differential of double and triple integrals and their applications in geometrical and physical problems; change of variable in integration (without proof of accuracy); spherical and cylindrical coordinates; vector field; curvilinear integral; surface integral; divergence; curl; Laplacian; potential, Green and Stokes and divergence theorems.

Suggested Textbooks:

Physics 1

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Description:

Measurement, vectors, one-dimensional motion, motion in one plane, dynamics of particle, work and energy, energy preservation, dynamics of particles systems, rotary kinematics, balance of solid bodies, temperature fluctuation, heat, 1st thermodynamics law, gas kinetic theory, and 2nd thermodynamics law.

Suggested Textbooks:

1. Fundamentals of physics, by D. Halliday & R. Resnick (1986), John Wiley & Sons, Inc.

Physics 2

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Physics 1 (Heat and Mechanics), Calculus 1

Description:

Charge & matter, electrical field, Gauss law, electrical potential, capacitors and dielectric, current & resistance, electrical kinetics and circuits, magnetic field, Ampere's law, Faraday induction law, matter magnetic properties & oscillations, alternate currents, Maxwell equations, electromagnetic waves.

Suggested Textbooks:

1. Fundamentals of physics, by D. Halliday & R. Resnick (1986), John Wiley & Sons, Inc.

Engineering Probability and Statistics 

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Calculus 2

Description:

Introduction to set  theories, samples and table representation with mean, power, variance, conversion & probabilities combination with related theorems, intermediate random variables, average & variance, distributions, binomial Poisson' distribution, geometric difference, normal distribution, multivariate random distribution, random sampling and random numbers, sampling from small society, estimation of statistical parameters, confidence interval, hypothesis test of decision-making, assumption test, variance experience regression, correlation test, non-parametric methods, direct data fitting line, momentum generator functions, large number theorem, central limit test, sum of independent random variables, conditional probability, total probability theorem.

Suggested Textbooks:

1. A. Poppulis and S. Pillai. Probability, Random Variables and Stochastic Processes. 4th Edition, McGraw Hill, 2002 (Chapters 1 through 8).

2. S. Ross. A First Course in Probability. 10th Edition, Prentice Hall, 2019.

3. G. Casella and R. L. Berger. Statistical Inference. 2nd Edition, Wadsworth Press, 2002.

Differential Equations

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Calculus 2

Description:

Nature of differential equations and solving, family of curves and normal trajectories, physical models, separable equation, first-order linear differential equation, homogeneous equation, second-order linear equation, homogeneous equation with constant coefficient, method of undetermined coefficients, parameter changing method, application of second-order equations in physics and mechanics, solving differential equation with series, Bessel and Gamma functions, Legendre' polynomial, introduction to differential equation systems, Laplace transformation and its application in solving differential equations.

Suggested Textbooks:

Computer Workshop

Credit Hours: 1.0

Lecture Contact Hours: 0     Lab Contact Hours: 1

Prerequisite: Fundamentals of Computer Programming

Description:

History, kinds and applications of computer including personal computer, working station, minicomputers, big and super-computers, structures and accessories including motherboard, output and input board, keyboard, screen, printer, scanner, platter, modem, series and parallel gates, secondary memories, introduction to media DOS, windows 95, windows NT, editors such as vi and edit, introduction to internet including mail, ftp, Telnet, web, introduction to some applied software such as Word, Latex, Excel and Corel.

Suggested Textbooks:

1. C. Newman, SAMS Teach Yourself PHP in 10 Minutes. Sams Publishing, 2005.

2. D. Hayes, Sams Teach Yourself HTML in 10 Minutes. 4th Edition, Sams publishing, 2006.

3. R. Weakley, Sams Teach Yourself CSS in 10 Minutes. Sams Publishing, 2005.

4. B. Forta, Sams Teach Yourself Regular Expressions in 10 Minutes. Sams Publishing, 2004.

5. R. Shimonski, SAMS Teach Yourself Unix in 10 Minutes. Sams Publishing, 2005.

6. J. Andrews, A+ Guide to Managing & Maintaining Your PC. 7th Edition, Course Technology, 2009.

7. Cisco Networking Academy, IT Essentials PC Hardware and Software Course Booklet. Version 4.1, 2nd Edition, Cisco Press, 2010.

Physics Lab

Credit Hours: 1.0

Lecture Contact Hours: 0     Lab Contact Hours: 1

Prerequisite: Physics 2

Description:

According to the syllabus presented in physics II.

Suggested Textbooks:

Fundamentals of Computer Programming 

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Description:

problem solving, algorithm presentation using pseudocode, introduction to an organized programming language, constants, variables, computational and logical phrases, types of instructions, types of loops, conditional operations, vectors and matrices, subprograms (functions and procedures), input and output instructions, common algorithm such as methods of search and sort

Suggested Textbooks:

1. P. Deitel and H. Deitel. C: How to Program. 8th Edition, Prentice-Hall, 2016.

2. B. W. Kernighan and D. M. Ritchie. The C Programming Language. 2nd Edition, Prentice Hall, 1988.

Electrical Circuits

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Differential Equations

Description:

Compact circuits & Kirchhoff's Laws, approximation & modeling of circuit elements including: registers, unclosed and reclosed resources (voltage & current) capacitors, selves, power, energy, operational amplifiers (OPAMP) as a circuit element, simple circuits such as: resistor circuits, analytical methods of resistor circuits, labeling two terminals of a circuit, Tonen, Norton equivalent circuit & commutative theorem in resistor circuits, resources conversion, arranging selves, capacitors, application of spice in solving resistor circuits, first order circuits including RL & RC circuits, zero input responses, response at zero state, complete, transient and permanent responses, time coefficients and circuits with several time coefficients, switching, plateau & impulse responses, 2nd order circuits, stability, oscillation negative resistance concepts, double circuits, similarity of electrical & mechanical systems.

Application of spice in solving 1st and 2nd logic circuits and OPAMP, analytical methods for linear circuits (network and node analysis(, importance of impulse response and estimation in general linear circuits (time domain analysis) & convolution theorem, permanent sinusoidal state analysis including: concepts of phasor and impedance, admittance, phasor diagram, concepts of resonance and series & parallel resonance circuits, network functions frequency responses, power at permanent sinusoidal state, average, real and reactive power, maximum power transfer theorem, effective values & RMS, scale change in a circuit, application of spice in solving permanent sinusoidal circuits, tri-phase circuit analysis-conjugated circuits including conjugated selves, circuits equivalent of T, π conjugated selves, inductance matrix, connecting conjugated selves, transformers, circuit models & their applications, application of spice in solving selves administrated circuits and transformers

Suggested Textbooks:

1. Charles A. Desoer and Emest S. Kuh, Basic Circuits Theory, McGraw-Hill, 1970.

2. L. O. Chua, C. A. Desoer and E. S. Kuh, Linear and Nonlinear Circuits, McGraw Hill, 1987.

3. James W. Nilson, Electric Circuit (4th edition), Addison Wesley, 1995.

4. Lawrence P. Huelsman, Basic Circuit Theory (3rd edition), Prentice-Hall, 1991.

5. G. Base & N. Stevens, Introductory Network Theory, McGraw-Hill

Discrete Mathematics (Discrete Structures)

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite:

Description:

-Introduction: mathematical logic, algebra of expressions, well-structured formula, a review

of theory of sets, proof methods.

-Relations and functions: binary relations, compatibility and equivalence relations, relations

representation matrix, graphs of relations, functions, coverage functions, one to one functions.

-Recursive functions, deduction, generator functions.

-Algebraic structures: semi-groups and monoids, grammars and languages, Polish marking, groups, homomorphism, isomorphism, lattices, Boolean Algebra, Carnot table, grammar and language, grammar as an example of monoids

-Combinatorial analysis, nest principles, introduction to combinatorial algorithm, regressive and        reciprocal functions and applications.

-Graph theory: directional graphs, unidirectional graphs, Eulerian and Hamiltonian paths,  optimal paths, finding algorithm for optimal paths, connected graphs, matrix of relation and related theorems, application of graphs in activity analysis.

-Trees: minimal overlapping trees, surveying of trees, application of trees, algebraic expressions and representation of their trees.

Suggested Textbooks:

1. K. H. Rosen. Discrete Mathematics and Its Applications. 8th Edition, McGraw Hill, 2018.

2. R. P. Grimaldi. Discrete and Combinatorial Mathematics: An Applied Introduction. 5th Edition, Pearson Addison Wesley, 2004.

3. A. Engel. Problem-Solving Strategies. Springer, 1998.

Advanced Programming

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Fundamentals of Computer Programming

Suggested Textbooks:

1. P. Deitel, H. Deitel. Java: How to Program. 11th Edition, Pearson Education, 2017.

2. B. Eckel. Thinking in Java. 4th Edition, Prentice Hall, 2006.

3. M. Fowler, K. Beck, J. Brant, W. Opdyke, D. Roberts. Refactoring: Improving the Design of Existing Code. Addison-Wesley, 1999.

Data Structures 

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Advanced Programming, Engineering Mathematics

Description:

Introduction to various data structures (stacks, queues, lists, hash tables, trees, heaps, and graphs); sorting and searching; design, analysis, and comparison of algorithms.

Suggested Textbooks:

1. T. Cormen, C. Leiserson, R. Riverst, and C. Stein. Introduction to Algorithms. 3rd Edition, MIT Press, 2011.

Digital Circuits (Logic Design)

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Data Structures

Description:

Number representation system and coding, representation of negative numbers, key logic, negative test and triple state logic, overall structure of logical gates and its types, logic functions and simplification of them including: Carnot's methods and scheduling and tabulation method, computerized procedures for simplification of combination functions, decoding and coding circuits design, code converters, subtractions, summation, selectors, and comparators, collectors and destructors, logical and computational units, use of decoders, selectors and other packages for drawing combinatorial circuits, PAL, PLA & ROM, and other regular structures, leach and flip-flaps structures, synchronous circuits, comparison between state circuits under Moore & Mealy, numerators, shift registers, asynchronous circuits, study of hazards and race, allotting state without race, common chips in, sequential circuits, and designing or study of one type of machines or control and data section, modern designing methods. 

Suggested Textbooks:

1. M. Morris Mano. Digital Design. 5th Edition, Prentice Hall, 2006.

2. Victor P. Nelson, H. Troy Nagle, Bill D. Carroll, David Irwin. Digital Logic Circuit Analysis and Design. Prentice Hall, 1995.

3. Franklin P. Prosser and David E. Winkel. The Art of Digital Design: An Introduction to Top-Down Design. Prentice Hall, 1987.

Theory of Computation

Credit Hours: 3.0

Lecture Contact Hours: 3     Lab Contact Hours: 0

Prerequisite: Data Structures

Description:

Finite automata, Pushdown automata, touring machine, different types of grammars and languages, Chomsky classification, relation between languages and machines and the relevant theorems.

Suggested Textbooks:

1. M‎. Sipser. Introduction to the Theory of Computation‎. ‎3rd Edition‎, ‎Cengage Learning‎, 2013‎.

2. P. Linz. An introduction to formal languages and automata. 3rd Edition, Jones and Bartlett Publishers‎, ‎‎2001‎.

3. ‎‎J. E.‎ Hopcroft‎, R‎. ‎Motwani‎, and ‎‎‎J. D‎. Ullman. Introduction to automata theory‎, ‎languages‎, ‎and computation. 2nd Edition‎, ‎Addison-Wesley‎, ‎2001‎.

4. ‎J. P.‎ Denning‎, ‎‎J. B‎. Dennis, and J. E. Qualitz‎. ‎Machines‎, ‎languages‎, ‎and computation‎. ‎Prentice-Hall‎, ‎1978‎.

5. ‎‎‎J. E‎. Hopcroft‎ and ‎J. D. Ullman‎. ‎Introduction to automata theory‎, ‎languages‎, ‎and computation. Addison-Wesley‎, ‎1979‎.

6. ‎‎P. J‎. Cameron‎. Sets‎, ‎Logics and Categories. Springer‎, ‎1998‎.