CS 100 is an intro class intended for students who plan to concentrate in Computer Science, Computer Engineering, or Electrical Engineering. It is not a class for students who are looking for a good general introduction to computing.
Computer Science does offer two classes intended for non-concentrators: CS 181, Introduction to Computing and CS 183, Elementary Programming Concepts. These classes are much more appropriate for entering LS&A students who plan on concentrating in areas other than Computer Science.
Fundamental computer skills needed to increase productivity both personally and at the workplace. Use of software packages including word-processors, spreadsheets, world wide web browsers, simple graphics and databases, and more. Not programming. Usually taken by non CE/CS/EE concentrators whose goal is computer literacy. (Note: CE is Computer Engineering, CS is Computer Science, EE is Electrical Engineering).
Note: does not count for the computing requirement in CE or EE - free elective only.
Fundamental concepts and skills of programming in a high level language (currently C++). Basic algorithms and data structures. Assumes no prior programming experience. Usually taken by non CE/CS/EE concentrators in LS&A whose goal is to learn fundamental programming skills.
Note: does not count for the computing requirement in CE or EE - free elective only.
Fundamental concepts of programming in a high level language (currently C) plus engineering applications of computing, including MatLab. Assumes no prior programming experience. Replaces the former Engineering 103, 104, 106, 107 courses. Usually taken by non CE/CS/EE concentrators in Engineering whose goal is to learn fundamental skills in programming and computing for engineering.
Note: This course is counted as non-LS&A credit. (There is a limit of 12 credits in the 120 required for an LS&A degree.)
A foundation course in Computer Science & Engineering. First course for those who intend to major in CE, CS, or EE. Fundamentals of computer hardware (about 50% of the course), software and theory. Programming is currently done in machine language, assembly language, and C. Assumes no prior programming experience. Usually taken by students who intend to major in CE/CS/EE, or non-concentrators who intend to pursue a substantial amount of course work in CE/CS/EE. Those who want to study computer hardware and software in depth. If you take CS 183 or Engineering 101 and then decide later that you want to be a CE, CS, or EE major, you can take a bridge course (see below) to pick up the hardware half of CS 100 for one credit; you do not have to take all of CS 100. A CAEN fee may be required for non- Engineering students.
Special note about CS 280 & 270 and those who need 2 programming courses
If you already know C or C++ (the equivalent of 183 or 101 above), but you have not taken CS 100, and you want to take 280 and/or 270, you may take the CS 100 "bridge" course and then take 280 or 270. For Fall 1998 the bridge course is listed as CS 284, section 001. Note that the section number of the bridge course may change from term to term. Check the department web page for current semester course information (http://www.eecs.umich.edu).
If you are not a CE or CS major but are in a concentration where you need to take two "programming" courses, we currently recommend that you take 183 or 101 and the bridge course, then take 280.
QUESTIONS?
If you are interested in becoming a CE or EE major, contact the EECS Counseling Office at 763-2305, 3415 EECS Building.
If you are interested in becoming a CS major, contact the LS&A Counseling Office at 764-0332, 1255 Angell Hall.
If you are an undecided Engineering student, contact the College of Engineering Freshman Counseling Office at 647-7106, 1009 Lurie Engineering Center.
Questions about the concentration program in Computer Science should be addressed to:
Undergraduate Counseling Office
EECS Department
3415 EECS
University of Michigan
Ann Arbor, MI 48109-2122
telephone: (313) 763-2305
electronic mail: csdegree@eecs.umich.edu
web: http://www.cs.umich.edu.
Take me to the Fall Time Schedule
183/EECS 183. Elementary Programming Concepts. This course is not intended for computer science, electrical engineering, or computer engineering concentrators. Credit is granted for only one course among CS 183, Engin. 103, and Engin. 104. (4). (MSA). (BS).
Fundamental concepts and skills of programming in a high level language. Flow of control: sequential, selection, iteration, subprograms. Basic data structures: strings, arrays, records, lists and tables. Fundamental algorithms using selection and iteration (decision making, finding maxima and minima, searching, sorting, simulation, etc.). Good program design, structure, and style are emphasized. Testing and debugging. Intended for non CE/CS/EE concentrators whose goal is to achieve basic proficiency in programming.
Check Times, Location, and Availability
470/EECS 470. Computer Architecture. CS 370. (4). (Excl). (BS).
Basic concepts of computer architecture and organization. Computer evolution. Design methodology. Performance evaluation. Elementary queueing models. CPU architecture. Instruction sets. ALU design. Hardware and microprogrammed control. Nanoprogramming. Memory hierarchies. Virtual memory. Cache design. Input-output architectures. Interrupts and DMA. I/O processors. Parallel processing. Pipelined processors. Multiprocessors.
Check Times, Location, and Availability
477/EECS 477. Introduction to Algorithms. CS 380. (4). (Excl). (BS).
Fundamental techniques for designing efficient algorithms and basic mathematical methods for analyzing their performance. Paradigms for algorithm design: divide-and-conquer, greedy methods, graph search techniques, dynamic programming. Design of efficient data structures and analysis of the running time and space requirements of algorithms in the worst and average cases.
Check Times, Location, and Availability
478/EECS 478. Logic Circuit Synthesis and Optimization. CS 270 and CS 303, and senior or graduate standing. (4). (Excl). (BS).
Advanced design of logic circuits. Technology constraints. Theoretical foundations. Computer-aided design algorithms. Two-level and multilevel optimization of combinational circuits. Optimization of finite-state machines. High-level synthesis techniques: modeling, scheduling, and binding. Verification and testing.
Check Times, Location, and Availability
481/EECS 481. Software Engineering. CS 380. (4). (Excl). (BS).
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.
Check Times, Location, and Availability
484/EECS 484/IOE 484. Database Management Systems. CS 380 or IOE 373. (4). (Excl). (BS).
Concepts and methods for the design, creation, query and management of large enterprise databases. Functions and characteristics of the leading database management systems. Query languages such as SQL, forms, embedded SQL, and application development tools. Database design, normalization, access methods, query optimization, transaction management and concurrency control, recovery, and integrity.
Check Times, Location, and Availability
505/EECS 505/Math. 562/Aero. 577/IOE 511. Continuous Optimization Methods. Math. 217, 417, or 419. (3). (Excl). (BS).
See Mathematics 562.
Check Times, Location, and Availability