Here you will find all availble EECS courses listed by course number. The tabs above futher organize the courses by their course level. If there is a courses that you cannot find listed, or have questions about a course that are not answered by the courses description feel free to Contact Us.
Mathematical foundations including logic, sets and functions, general proof techniques, mathematical induction, sequences and summations, number theory, basic and advanced counting techniques, solution of recurrence relations, equivalence relations, partial order relations, lattices, graphs and trees, algorithmic complexity and algorithm design and analysis. Throughout there will be an emphasis on the development of general problem solving skills including algorithmic specification of solutions and the use of discrete structures in a variety of applications.
Prerequisite(s): EECS 168 or 169 (or equivalent) and MATH 122
Back to top
Analysis of linear, electrical circuits: Kirchoff’s laws; source, resistor, capacitor and inductor models; nodal and mesh analysis; network theorems; transient analysis; Laplace transform analysis; steady-state sinusoidal analysis; computer-aided analysis.
Prerequisite(s): Corequisites: Math 220 and Math 290
Back to top
Continued study of electrical circuits: Steady state power analysis, three-phase circuits, transformers, frequency response, two-port network analysis.
Prerequisite(s): EECS 211
Back to top
Vector analysis. Electrostatic and magnetostatic fields in a vacuum and material media. Electromagnetic fields and Maxwell's equations for time-varying sources. The relationship between field and circuit theory. Simple applications of Maxwell's equations.
Prerequisite(s): MATH 220, MATH 290, PHSX 211 and EECS 211
Back to top
This course continues developing problem solving techniques by focusing on the imperative and object-oriented styles using Abstract Data Types. Basic data structures such as stacks, queues, and trees will be covered. Recursion. Basic notions of algorithmic efficiency and performance analysis in the context of sorting algorithms. Basic Object-Oriented techniques. An associated laboratory will develop projects reinforcing the lecture material. Three class periods and one laboratory period per week.
Prerequisite(s): EECS 168 or EECS 169
Back to top
