|
|
|
Home
> Admissions
> MS in Game Development
Approved Non-CS Courses
The following list is mainly used by Master of
Science in Computer Science students who are interested in taking courses
outside of the computer science that count towards their degree. A maximum
of 9 units of these EE courses can be taken and counted towards the M.S.
degree. Only 1 course can be taken from outside of the EE or CS department
to count towards the degree (such as, ISE 511, 520, etc.). The MATH and PHYS
courses are cross listed with CS and will count as a CS course and not as an
'outside' course.
- EE 450 (3 UNITS): Introduction to Computer
Networks. Network architectures; layered protocols,
network service interface; local networks;
long-haul networks; internal protocols; link
protocols; addressing; routing; flow control;
higher level protocols. Prerequisite: junior
standing.
- EE 454L (3 UNITS):Introduction to Systems
Design Using Microprocessors. Operation and
timing of 8-bit microprocessors; design of
microprocessor-based systems; 16-bit microprocessors;
bit sliced microprocessors. Prerequisite:
EE102L and EE 357
- EE 465 (3 UNITS): Probabilistic Methods
in Computer Systems Modeling. Review of probability;
random variables; stochastic processes; Markov
chains; and simple queuing theory. Applications
to program and algorithm analysis; computer
systems performance and reliability modeling.
Prerequisite: MATH 407.
- EE 552 (3 UNITS): Logic Design and Switching
Theory State minimization of incompletely
specified sequential circuits; asynchronous
sequential circuits; races; state assignments;
combinatorial and sequential hazards in logic
circuits. Prerequisite: Graduate Standing.
- EE 553 (3UNITS): Computational Solution
of Optimization Problems.
- Computer algorithms for system optimization.
Search techniques, gradient methods, and parameter
optimization in control systems. Optimization
with constraints; linear and nonlinear programming.
Random search techniques. Prerequisite: EE
441
- EE 554 (3 UNITS): Real Time Computer Systems
Structure of real time computer systems; analog
signals and devices; scheduling, synchronization
of multiprocessors; reliability, availability;
serial/parallel computations; real time operating
systems and languages; design examples. Prerequisite:
EE457x and CS455x
- EE 557 (3 UNITS): Computer Systems Architecture.
Comparative studies of computer system components:
the CPU, memory, and I/O; analytical modeling
techniques to allow comparative evaluation
of architectures; parallelism and supercomputers.
Prerequisite: EE 457x and CS 455x
- EE 559 (3 UNITS): Mathematical Pattern Recognition
Distribution free classification, discriminant
functions, training algorithms; statistical
classification, parametric and nonparametric
techniques, potential function; non-supervised
learning. Prerequisite: EE 464 Corequisite:
EE441
- EE 658 (3 UNITS): Diagnosis and Design or
Reliable Digital Systems Fault models; test
generation; fault simulation; self checking
and self testing circuits; design for testability;
fault tolerant design techniques; case studies.
Prerequisite: Graduate standing.
- MATH 458 (4 UNITS): Numerical Methods Rounding
errors in digital computation; solution of
linear algebraic systems; Newton’s method
for nonlinear systems; matrix eigenvalues;
polynomial approximation; numerical integration;
numerical solution of ordinary differential
equations. Prerequisite: linear algebra and
calculus.
- MATH 501 (3 UNITS): Numerical Analysis and
Computation Linear equations and matrices,
Gauss elimination, error estimates, iteration
techniques; contractive mappings, Newton’s
method; matrix eigenvalue problems; least
squares approximation, Newton-cotes and Gaussian
quadratures; finite difference methods. Prerequisite:
Linear algebra and calculus
- MATH 502ab(2-3 UNITS) Numerical Analysis
Computational linear algebra; solution of
general nonlinear systems of equation; approximation
theory using functional analysis; numerical
solution of ordinary and partial differential
equation. Prerequisite: MATH 425a and MATH
471
- MATH 504ab(3 UNITS): Numerical Solution
of Ordinary and Partial Differential Equations.
A: Initial value problems; multistep methods,
stability, convergence and error estimation,
automatic stepsize control, higher order methods,
systems of equations, stiff problems; boundary
value problems; eigenproblems. B: Computationally
efficient schemes for solving PDE numerically;
stability and convergence of difference schemes,
method of lines; fast direct and iterative
methods for elliptic equations. Prerequisite:
MATH 501 or MATH 502a or departmental approval
- MATH 505ab(2-3 UNITS): Applied Probability
A: Populations, permutations, combinations,
random variables, distribution and density
functions conditional probability and expectation,
binomial, Poisson, and normal distribution;
laws of large numbers, central limit theorem.
B: Markov processed in discrete or continuous
time; renewal processes; martingales; Brownian
motion and diffusion theory; random walks,
inventory models, population growth, queuing
models, shot noise. Prerequisite: Departmental
approval
- MATH 533: (3 UNITS): Combinatorial Analysis
and Algebra. Advanced group theory; algebraic
automata theory; graph theory; topics in combinatorial
analysis.
- MATH 578 (3 UNITS): DNA and Protein Sequence
Analysis
- MATH 587ab(2-3 UNITS): Mathematical Models
of Neurons and Neural Networks A: Dynamics
of discrete and analog neural networks; qualitative
and numerical analysis; computer simulation;
learning algorithms and convergence; Kolmagorov
theory of feed-forward networks. B: Nernst-Planck
and Goldman-Hodgkin-Katz equations; Hodgkin-Huxley
theory; cable theory; compartment models of
dendritic structures; McCulloch-Pitts networks
perceptron theory. Prerequisite: a: MATH 465
and either MATH 501 or MATH 5022, b: MATH
587a
- PHYS 495: (2 UNITS) Senior Project An original
project will be constructed applying computer
technology (in either hardware or software)
to produce a result useful in the physics
classroom or laboratory. Prerequisite: Departmental
approval
- ISE 511: (3 UNITS): Computer aided manufacturing.
Modern industrial automation, numerical control
concepts, programmable controllers, robotics,
computer-process interfacing, automated process
and quality control, flexible manufacturing
systems, introduction to computer-integrated
manufacturing systems.
- ISE 520: (3 UNITS): Optimization: Theory
and Algorithms. Conditions for optimality.
Nonlinear programming algorithms for constrained
and unconstrained problems. Special problems
such as quadratic, separable, fractional,
geometric programming. Prerequisite: MATH
225 or EE 441, or departmental approval.
- ISE 532 (3 UNITS): Network Flows Tree, path
flow problems and solution techniques. Methods
for minimal cost flows. Applications. Prerequisite:
ISE 330 or ISE 536 or departmental approval
- ISE 536: (3 UNITS) Linear Programming and
Extensions Linear programming models for resource
allocation; simplex and revised simplex methods;
duality; sensitivity; transportation problems;
selected extensions to large scale, multiobjective,
and special structured models. Prerequisite:
MATH 225 or EE 441 or departmental approval.
- ISE 538 (3 UNITS): Elements of Stochastic
Processes Random variables stochastic processes,
birth-and-death processes, continuous and
discrete time Markov chains with finite and
infinite number of states, renewal phenomena,
queueing systems.
- ISE 575 (3-6 UNITS) Topics in Engineering
Approaches to Music Cognition Computational
research in music cognition, including computational
methods for music analysis, such as the abstracting
and extracting of pitch and time structures.
Computational research in expressive performance,
the manipulation of parameters (e.g., tempo,
loudness, articulation) to focus attention,
facilitate parsing, and create emotional affect.
Open to graduate engineering students only.
Recommended preparation: programming experience
(C++ or Java), basic signal processing and
music theory.
|
|
|