181/EECS 181. Introduction to Computer Systems. Credit is granted for only one course among CS 181, Engin. 103, and Engin. 104. (4). (NS).
Introduces students to computers. Focuses on software, hardware, and social impact of computers. Elementary programming concepts, software packages and applications, word processing, data communications, information management, input-output, data entry, computer hardware components and storage devices, microcomputers, and ethics in computing. Programming assignments using a personal computer. Term paper required. Cost:2 WL:1
183(283)/EECS 183. Elementary Programming Concepts. Not intended for CS or Computer Engineering concentrators. No credit granted to those who have completed or are enrolled in Engin. 103 or 104. (4). (NS).
Introduction to a high level programming language, top-down analysis, and structured programming. Basic searching and sorting techniques. No previous experience in computer or programming is assumed. Students will write and debug several computer programs. Not intended for computer science or computer engineering majors. Cost:2 WL:1
216/EECS 216. Circuit Analysis. Prior or concurrent enrollment in Math. 216. (4). (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. (4). (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. Lectures and laboratory. Cost:3 WL:1
280/EECS 280. Programming and Introductory Data Structures. Math. 115 (and CS 183 or 284 or Engineering 104, or by placement test in PASCAL). Students with credit for CS 183 can only elect CS 280 for 2 credits. (4). (NS).
Techniques of algorithm development and effective programming, top-down analysis, structured programming, testing and program correctness. Program language syntax and static and run-time semantics. Scope, procedure instantation, recursion, abstract data types, and parameter passing methods. Structured data types, pointers, linked data structures, stacks, queues, arrays, records, and trees. Cost:2 WL:1
283(383)/EECS 283. Programming and Computer Systems. CS 183 or equivalent. (4). (NS).
Advanced topics in PASCAL, including the implementation of linked lists, trees, and hashing. Searching and sorting techniques. Selected topics in programming language theory. Students will write several programs in Pascal. Cost:2 WL:1
284/EECS 284. Introduction to a Programming Language or System. CS 184 or equivalent. (1). (Excl). May be repeated for a total of 3 credits.
A seven week mini-course covering the fundamentals of a programming language such as C, PASCAL, LISP, SNOBOL, Prolog, or Modular-2, or a system such as UNIX. Programming problems will be assigned. Specific languages or systems to be offered will be announced in advance. Cost:3 WL:1
300/EECS 300/Math. 300. Mathematical Models in System Analysis. Math. 216. No credit granted to those who have completed or are enrolled in CS 300 and Math. 448. (3). (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. WL:1
303/EECS 303. Algebraic Foundations of Computer Engineering. Math. 115. (3). (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 these concepts to various areas of computer science and engineering. WL:1 Cost:2
370/EECS 370. Introduction to Computer Organization. CS 270 and CS 280; or CS 303 and CS 381. (4). (Excl).
Computer organization will be presented as a hierarchy of virtual machines representing the different abstractions from which computers can be viewed. These include the logic level, microprogramming level, and assembly language level. Lab experiments will explore the design of a micro-programmed computer. Lecture and laboratory. Cost:3 WL:1
380/EECS 380. Data Structures and Algorithms. CS 280; and CS 303 or Math. 312. (4). (NS).
Abstract data types. Recurrence relations and recursions. Advanced data structures: sparse matrices, generalized lists, strings. Tree-searching algorithms, graph algorithms, general searching and sorting. Dynamic storage management. Analysis of algorithms 0-notation. Complexity. Top-down program development: design, implementation testing modularity. Several program assignments. Cost:4 WL:1
381/EECS 381. Systems Programming. CS 380. (4). (NS).
Machine structure and organization, data representation, memory addressing methods, use of registers, bit manipulation, integer and floating point arithmetic, program linking and subroutines, macro-instructions, program debugging, assemblers and loaders. Students write several programs in IBM 370 Assembler language. Three one-hour lectures and a one-hour discussion per week. Cost:3 WL:1
400/EECS 400/Math. 419. Linear Spaces and Matrix Theory. Four terms of college mathematics beyond Math. 110. One credit granted to those who have completed Math. 417; no credit granted to those who have completed or are enrolled in Math. 513. (3). (Excl).
See Math 419.
426/EECS 426. Fundamentals of Electronic Computer-Aided Design. CS 280 and senior standing. (3). (Excl).
Course will address, in roughly equal proportion: (1)modeling, simulation, and verification at various abstraction levels; (2) vehavioral and logis synthesis; and (3)placement and routing. Emphasis will be on understanding the underlying techniques and algorithms of these various CAD areas rather than on the use of specific CAD tools.
442/EECS 442. Computer Vision. CS 303 and CS 380. (3). (Excl).
Computational methods for the recovery, representation, and application of visual information. Topics from image formation, binary images, digital geometry, similarity and dissimilarity detection, matching, curve and surface fitting, constraint propagation and relaxation labeling, stereo, shading, texture, object representation and recognition, dynamic scence analysis, and knowledge based techniques. Hardware /software techniques.
470/EECS 470. Computer Architecture. CS 370. (3). (Excl).
Basic concepts of computer architecture and organization. Computer evolution. Design methodology. Performance evaluation. Elementary queueing models. CPU architecture. Introductions sets. ALU design. Hardwired and microprogrammed control. Nanoprogramming. Memory hierarchies. Virtual memory. Cache design. Input-output architectures. Interrupts and DMA. I/O processors. Parallel processing. Pipelined processors. Multiprocessors. Cost:3 WL:1
476/EECS 476. Foundations of Computer Science. CS 280, and either CS 303 or Math. 312 or equivalent. (4). (Excl).
An introduction to computation theory: finite automata, regular languages, pushdown automata, context-free languages, Turing machines, recursive languages and functions, and computational complexity. Cost:3 WL:1
478/EECS 478. Switching and Sequential Systems. CS 270 and CS 303, and senior or graduate standing. (3). (Excl).
An introduction to the theory of switching networks and sequential systems. Switching functions and realizations, threshold logic, fault detection, connectedness and distinguishability, equivalence and minimality, state identification, system decomposition. Cost:3 WL:1
481/EECS 481. Software Engineering. CS 380. (4). (Excl).
Pragmatic aspects of the production of software systems, dealing with structuring principles, design methodologies and informal analysis. Emphasis is given to development of large, complex software systems. A term project is usually required. Cost:3 WL:1
482/EECS 482. Introduction to Operating Systems. CS 370, CS 380, and CS 381. (4). (Excl).
Operating system functions and implementations: multitasking; concurrency and synchronization; deadlock; scheduling; resource allocation; real and virtual memory management; input/output; file systems. Students write several substantial programs dealing with concurrency and synchronization in a multitask environment. Cost:2 WL:1
483/EECS 483. Compiler Construction. CS 370, CS 380, and CS 381. (4). (Excl).
Introduction to compiling techniques including parsing algorithms, semantic processing, and optimization. Students implement a compiler for a substantial programming language using a compiler generating system. Cost:2 WL:1
484/EECS 484/IOE 484. Database Management Systems. CS 380 or IOE 473. (3). (Excl).
Concepts and methods in the definition and management of large integrated data bases for organizational information systems. Functions and objectives of existing file and data management systems will be considered and methods of analyzing proposals for new data management software will be studied; database administration, database design, and data security problems. Cost:2 WL:1
487/EECS 487/IOE 478. Interactive Computer Graphics. CS 380 or IOE 373, and senior standing. (3). (Excl).
Graphics devices and fundamentals of operation. Two dimensional and three dimensional transformations. Interactive graphical techniques and applications. Three dimensional graphics, perspective transformation, hidden line elimination. Data structures and languages for graphics. Interactive graphical programming. Cost:2 WL:1
492/EECS 492. Introduction to Artificial Intelligence. CS 303 and CS 380. (4). (Excl).
Basic artificial intelligence methods using LISP. Topics covered include search, rule-based systems, logic, constraint satisfaction, and knowledge representation. Cost:2 WL:1
493/EECS 493/IOE 437. User Interface Design and Analysis. CS 481. (3). (Excl).
Current theory and design techniques concerning how user interfaces for computer systems should be designed to be easy to learn and use. Focus on cognitive factors, such as the amount of learning required, and the information-processing load imposed on the user, rather than ergonomic factors.
570/EECS 570. Parallel Computer Architecture. CS 470. (3). (Excl).
Pipelining and operation overlapping, SIMD and MIMD architectures. Numeric and non-numeric applications. VLSI, WSI architectures for parallel computing, performance evaluation. Case studies and term projects. Cost:3 WL:1
572/EECS 572. Digital Computer Arithmetic. CS 470 or CS 370, and CS 478. (3). (Excl).
Classification and structure of finite number systems and arithmetic including weighted, redundant and signed digit classes of number systems. Theory of modern high-speed computer arithmetic including fast carry logic, multiplier recoding and SRT division. Case studies of general and special purpose arithmetic processors.
574/EECS 574. Theoretical Computer Science I. CS 476. (4). (Excl).
Formal grammars, recursive functions, logic, complexity theory. Cost:2 WL:1
585/EECS 585. Advanced Topics in Database Systems. CS 484. (3). (Excl).
Topics to be selected from areas such as: Theory of relational databases, dependencies, operators, normal forms, representational systems, relational languages. Principles of object-oriented database management systems: inheritance, encapsulatin, and polymorphism; implementation issues. Knowledge based and rule based systems. Extensible database systems. Parallel database systems. Logic systems. Multi-media systems.
592/EECS 592. Advanced Artificial Intelligence. CS 492, or permission of instructor. (4). (Excl).
Advanced topics in artificial intelligence. Issues in knowledge representation, knowledge based systems, problem solving, planning and other topics will be discussed. Students will work on several projects. [Cost:1] [WL:1]
595/EECS 595/Ling. 541. Natural Language Processing. Senior standing. (3). (Excl).
A survey of structural or syntactic theories of natural language, including phrase-structure and unification-based grammars, methods of parsing, and connections with semantics and pragmatics. Course work will include the use of existing natural language computer systems. WL:1
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
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.