With discussions and lab. Use of nonlinear devices such as diodes, field effect transistors (FETs), and bipolar junction transistors (BJTs) in the design of simple analog and digital circuits. Design projects make use of PSPICE. Prerequisites: grades of C or better in E&C-ENG 212 and 221.

Lab. Design and analysis of digital computer (sub)systems, including sequential controllers, asynchronous system interfacing, bus arbitration, static and dynamic memory design, and microprogrammed microprocessor design. Use of hardware description languages and programmable logic. Breadboarding and use of diagnostic equipment.

Theoretical and practical foundations for engineering the production of contemporary and future software intensive systems. Advanced engineering problem solving concepts and skills enabled by means of state of the art modeling and testing tools. Provides the basis for the analysis and co-design of complex hardware and software systems.

Lab. Design and analysis of digital computer (sub)systems, including sequential controllers, asynchronous system interfacing, bus arbitration, static and dynamic memory design, and microprogrammed microprocessor design. Use of hardware description languages and programmable logic. Breadboarding and use of diagnostic equipment.

Lab. Design and analysis of digital computer (sub)systems, including sequential controllers, asynchronous system interfacing, bus arbitration, static and dynamic memory design, and microprogrammed microprocessor design. Use of hardware description languages and programmable logic. Breadboarding and use of diagnostic equipment.

Introduction to the quantum theory of solids and conduction processes in semiconductors. Theory of p-n junction diodes, bipolar junction transistors (BJTs), and field-effect transistors (FETs). Integrated circuits (ICs). Prerequisite: E&C-ENG 323.

Electromagnetic fields in dielectric and lossy media, transmission lines, antennas and resonators treated with the concepts of duality, image theory, reciprocity, integral equations and other techniques. Boundary and initial value problems solved for several frequently encountered symmetries.

Not available at this time

Data structures course using the Java programming language. Basic mathematical, logical, and programming concepts relevant to description and manipulation of information structures such as arrays, lists, trees, graphs, and files; the underlying principles of algorithm design and analysis applied to sorting and searching problems. Prerequisite: grade of C or better in E&C-ENG 122, 201 or equivalent.

Not available at this time