**183(283)/EECS 183. Elementary Programming Concepts.
*** (NS). *

This is an introductory course for students who do not necessarily plan to concentrate in engineering or computer science. It is designed to give them a good fundamental knowledge of programming in a high-level language. Introduction to a high-level programming language, top-down analysis, and structured programming. Basic searching and sorting techniques. No previous experience in computing or programming is assumed. Students will write and debug several computer programs. Computer Usage: five or six assignments are given, each requiring the student to write and debug a program on a mainframe computer. WL:1

**216/EECS 216. Circuit Analysis. *** Prior
or concurrent enrollment in Math. 216. (Excl). *

Resistive circuit elements; mesh and node analysis, network theorems; network graphs and independence; energy storage elements; one- and two-time-constant circuits; phasors and a.c. steady-state analysis; complex frequency and network functions; frequency response and resonance. Lecture and laboratory.

**270/EECS 270. Introduction to Logic Design. *** (Excl). *

Binary and non-binary systems, Boolean algebra digital design techniques, logic gates, logic minimization, standard combinational circuits, sequential circuits, flip-flops, synthesis of synchronous sequential circuits, PLA's, ROM's, RAM's, arithmetic circuits, computer-aided design. Laboratory includes hardware design and CAD experiments.

**300/EECS 300/Math. 300.
Mathematical Methods in System Analysis. *** Math. 216
or 316 or the equivalent. No credit granted to those who have
completed or are enrolled in Math. 448. (Excl). *

An introductory course in operational mathematics as embodied in Laplace Transforms, Fourier Series, Fourier Transforms and Complex Variables, with emphasis on their application to the solution of systems of linear differential equations. The response of linear systems to step, impulse, and sinusoidal forcing functions.

**303/EECS 303. Discrete Structures. *** Math.
115. (Excl). *

Fundamental concepts of algebra; partially ordered sets, lattices, Boolean algebras, semi-groups, rings, polynomial rings. Graphical representation of algebraic systems; graphs, directed graphs. Application of the concepts to various areas of computer science and engineering.

University of Michigan | College of LS&A | Student Academic Affairs | LS&A Bulletin Index

This page maintained by LS&A Academic Information and Publications, 1228 Angell Hall

The Regents
of the University of Michigan,

Ann Arbor, MI 48109 USA +1 734 764-1817

Trademarks of the University of Michigan may not be electronically or otherwise altered or separated from this document or used for any non-University purpose.