4 Classes (41 Units)

6.004 (12), 6.006 (12), 18.310 (5), 21F.101 (12)

Pre-Register


6.004 Computation Structures

Class Info

Introduces architecture of digital systems, emphasizing structural principles common to a wide range of technologies. Multilevel implementation strategies; definition of new primitives (e.g., gates, instructions, procedures, and processes) and their mechanization using lower-level elements. Analysis of potential concurrency; precedence constraints and performance measures; pipelined and multidimensional systems. Instruction set design issues; architectural support for contemporary software structures.

This class has no prerequisites.

6.004 will be offered this semester (Fall 2017). It is instructed by D. Sanchez, C. J. Terman and S. H. Wachman.

Lecture occurs 1:00 PM to 2:00 PM on Tuesdays and Thursdays in 10-250.

This class counts for a total of 12 credits.

You can find more information at the http://www.google.com/search?&q=MIT+%2B+6.004&btnG=Google+Search&inurl=https site.

MIT 6.004 Computation Structures Related Textbooks

6.006 Introduction to Algorithms

Class Info

Introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. Emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

This class has 6.042, and 6.0001 as prerequisites. This class has 6.009 as a corequisite.

6.006 will be offered this semester (Fall 2017). It is instructed by S. Micali, M. Medard and J. Ku.

Lecture occurs 11:00 AM to 12:00 PM on Tuesdays and Thursdays in 26-100.

This class counts for a total of 12 credits.

You can find more information on MIT OpenCourseWare at the Introduction to Algorithms site or on the 6.006 Stellar site.

MIT 6.006 Introduction to Algorithms Related Textbooks
MIT 6.006 Introduction to Algorithms On The Web

18.310 Principles of Discrete Applied Mathematics

Class Info

Study of illustrative topics in discrete applied mathematics, including sorting algorithms, probability theory, information theory, coding theory, secret codes, generating functions, and linear programming.

This class has no prerequisites.

18.310 will not be offered this semester. It will be instructed by M. X. Goemans.

Lecture occurs 10:00 AM to 11:00 AM on Mondays, Wednesdays and Fridays in 4-149.

This class counts for a total of 5 credits.

In the Fall 2014 Subject Evaluations, 18.310 was rated 4.8 out of 7.0. You can find more information at the MIT + 18.310 - Google Search site.

MIT 18.310 Principles of Discrete Applied Mathematics Related Textbooks
MIT 18.310 Principles of Discrete Applied Mathematics On The Web
MIT + 18.310 - Google Search
Tags
mathematics applied principles discrete daniel kleitman

21F.101 Chinese I (Regular)

Class Info

Introduction to modern standard Chinese (Mandarin) with emphasis on developing conversational skills by using fundamental grammatical patterns and vocabulary in functional and culturally suitable contexts. Basic reading and writing are also taught. For graduate credit, see 21F.151. Placement interview with instructors required of students who have had prior exposure to Chinese before or on Reg Day. Limited to 16 per section. No listeners.

This class has no prerequisites.

21F.101 will not be offered this semester. It will be instructed by .

This class counts for a total of 12 credits. This class counts as a HASS H.

In the IAP 2015 Subject Evaluations, 21F.101 was rated 6.6 out of 7.0. You can find more information at the DSpace@MIT: 21F.101 / 21F.151 Chinese I (Regular), Spring 2005 site.

MIT 21F.101 Chinese I (Regular) Related Textbooks
MIT 21F.101 Chinese I (Regular) On The Web
DSpace@MIT: 21F.101 / 21F.151 Chinese I (Regular), Spring 2005
Tags
lesson flashcube grammatical vocabulary jordan gilliland

© Copyright 2015