|
Computer
Science Courses
CS012
Introduction to
Computing, (2,1,0)
Prereq. None
Overview of computer
history, organization, systems and terminology, number
system. Problem solving using algorithms and
flowcharts. Programming language elements, data types,
I/O, control structures, functions and subprograms.
CS023 Structured Programming, (2,2,0)
Prereq. CS012
Structured programming
concepts in programs design for problem solving through
algorithms using the Pascal programming language. Syntax
and semantics, control structures, loops, arrays, string
processing, functions, procedures, recursive procedures
and functions, records and files.
CS033
Data
Structures and Algorithms, (2,2,0)
Prereq. CS023
Design manipulation and
implementation of abstract data structures. Stacks,
queues, linked lists, multi-linked lists structures,
trees and binary search tree. Sorting and searching
algorithms and efficiency considerations. Algorithm
analysis: recurrence relation; worst case and average
case analysis using O-notation.
CS043 Computer Architecture & Organization, (2,2,0)
Prereq. None
Introduction to structure
of digital computers; Basic components: processors,
controllers, I/O, buses, memory organization including
cache and virtual memory concepts, DMA direct memory
access. Data formats, data flow, microprogram and
control functions. Study of the design of a small
computer.
Back
Mathematics and Statistics Courses
MS053
Calculus I, (2,2,0)
Prereq. None
Numbers, intervals, functions, limits,
exponential, Logarithmic and hyperbolic functions,
derivatives, geometrical and physical applications of
derivatives. Integration, techniques of evaluating
indefinite integration, definite integration,
application: areas, volumes, etc. Role theorem, mean
value theorem, Taylor’s theorem.
MS063 Calculus II, (2,2,0)
Prereq. MS053
Differentiating of vectors, scalar and vector
point functions, del operator, gradient, divergence and
curl, line integral: circulation and work, surface
integral; flux, Green’s theorem, Stoke’s theorem, volume
integral, Divergence theorem.
MS072 Algebra & Geometry, (2,2,0)
Prereq. MS053
Axes,
translation and rotation of axes, polar coordinates,
conic section: parabola, ellipse and hyperbola and their
properties.
Algebra of vectors, complex numbers, matrices
and determinants, row operations, inverse of square
matrices, linear equations, Graner’s rule, eigenvalues
and eigenvectors.
MS083 Discrete Mathematics I, (2,2,0)
Prereq. MS063
Operations on sets and
Boolean algebra, Relations, orderings, equivalence
relations and functions.
Prepositional and
predicate logic, lattices. Group and semi-groups.
MS093 Mathematical Methods, (2,2,0)
Prereq. MS063
Infinite series, Fourier series, Fourier
integral theorem. Fourier transforms, Lapalace
transform, Special functions: Bessel’s functions, error
functions, application to differential equations,
partial differential equations.
MS103 Discrete Mathematics II, (2,2,0)
Prereq. MS083
Introduction
to finite State Machine and finite state otomata.
Indeterminist Finite State Otmata Graph theory:
definition of nodes and branches of a graph, analysis of
different graphs. The use of trees in Huffman encoding
method and other encoding techniques. Grammar, Language.
MS123 Probability and Statistics, (2,2,0)
Prereq. MS063
Sample spaces, random variables, conditional
probability, expectations, some important distribution
(binomial, Poisson, normal, etc.) Random variables and
their distributions, hypothesis testing, regression.
MS133 Numerical Methods, (2,2,0)
Prereq. MS063
Solution of equations, solution of linear
equations, solution of non-linear simultaneous
equations, solving the egenvalue problem, solution of
initial value problems, introduction to the solution of
partial differential equations
MS173 Differential Equations, (2,2,0)
Prereq. MS063
Differential equations
of first order, linear differential equations, series
solution of differential equations, system of ordinary
differential equations, application to those different
types of equations.
Back
|