How does backpacking help you as an aerospace engineer? Find out in this edition of My Path.

(Nota: Esta es una traducción de un recurso educativo abierto creado por el Departamento de Educación del Estado de Nueva York (NYSED) como parte del proyecto "EngageNY" en 2013. Aunque el recurso real fue traducido por personas, la siguiente descripción se tradujo del inglés original usando Google Translate para ayudar a los usuarios potenciales a decidir si se adapta a sus necesidades y puede contener errores gramaticales o lingüísticos. La descripción original en inglés también se proporciona a continuación.)

En este módulo de 25 días de grado 4, los estudiantes extienden su trabajo con números enteros. Comienzan con grandes números utilizando unidades familiares (cientos y miles) y desarrollan su comprensión de millones al desarrollar el conocimiento del patrón de tiempos diez en el sistema Base Ten en la tabla de valor del lugar (4.nbt.1). Reconocen que cada secuencia de tres dígitos se lee como cientos, decenas y, seguidas de la denominación de la base correspondiente, mil unidad (mil, millones, mil millones).

Encuentre el resto de los recursos matemáticos de Engageny en https://archive.org/details/engageny-mathematics.

English Description:
In this 25-day module of Grade 4, students extend their work with whole numbers.  They begin with large numbers using familiar units (hundreds and thousands) and develop their understanding of millions by building knowledge of the pattern of times ten in the base ten system on the place value chart (4.NBT.1).  They recognize that each sequence of three digits is read as hundreds, tens, and ones followed by the naming of the corresponding base thousand unit (thousand, million, billion).

Find the rest of the EngageNY Mathematics resources at https://archive.org/details/engageny-mathematics.

This course introduces students to the theory, algorithms, and applications of optimization. The optimization methodologies include linear programming, network optimization, integer programming, and decision trees. Applications to logistics, manufacturing, transportation, marketing, project management, and finance. Includes a team project in which students select and solve a problem in practice.

Prediction is at the heart of almost every scientific discipline, and the study of generalization (that is, prediction) from data is the central topic of machine learning and statistics, and more generally, data mining. Machine learning and statistical methods are used throughout the scientific world for their use in handling the "information overload" that characterizes our current digital age. Machine learning developed from the artificial intelligence community, mainly within the last 30 years, at the same time that statistics has made major advances due to the availability of modern computing. However, parts of these two fields aim at the same goal, that is, of prediction from data. This course provides a selection of the most important topics from both of these subjects.

This class builds a bridge between the recreational world of algorithmic puzzles (puzzles that can be solved by algorithms) and the pragmatic world of computer programming, teaching students to program while solving puzzles. Python syntax and semantics required to understand the code are explained as needed for each puzzle.

How could random numbers speed up a decision algorithm? Created by Brit Cruise.

In keeping with the tradition of the last twenty-some years, the Readings in Optimization seminar will focus on an advanced topic of interest to a portion of the MIT optimization community: randomized methods for deterministic optimization. In contrast to conventional optimization algorithms whose iterates are computed and analyzed deterministically, randomized methods rely on stochastic processes and random number/vector generation as part of the algorithm and/or its analysis. In the seminar, we will study some very recent papers on this topic, many by MIT faculty, as well as some older papers from the existing literature that are only now receiving attention.

This course covers a number of advanced "selected topics" in the field of cryptography. The first part of the course tackles the foundational question of how to define security of cryptographic protocols in a way that is appropriate for modern computer networks, and how to construct protocols that satisfy these security definitions. For this purpose, the framework of "universally composable security" is studied and used. The second part of the course concentrates on the many challenges involved in building secure electronic voting systems, from both theoretical and practical points of view. In the third part, an introduction to cryptographic constructions based on bilinear pairings is given.

In this undergraduate level seminar series, topics vary from year to year. Students present and discuss the subject matter, and are provided with instruction and practice in written and oral communication. Some experience with proofs required. The topic for fall 2008: Computational algebra and algebraic geometry.

6.896 covers mathematical foundations of parallel hardware, from computer arithmetic to physical design, focusing on algorithmic underpinnings. Topics covered include: arithmetic circuits, parallel prefix, systolic arrays, retiming, clocking methodologies, boolean logic, sorting networks, interconnection networks, hypercubic networks, P-completeness, VLSI layout theory, reconfigurable wiring, fat-trees, and area-time complexity.
This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5511 (Theory of Parallel Hardware).

6.895 covers theoretical foundations of general-purpose parallel computing systems, from languages to architecture. The focus is on the algorithmic underpinnings of parallel systems. The topics for the class will vary depending on student interest, but will likely include multithreading, synchronization, race detection, load balancing, memory consistency, routing networks, message-routing algorithms, and VLSI layout theory. The class will emphasize randomized algorithms and probabilistic analysis, including high-probability arguments.
This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5509 (Theory of Parallel Systems).

Coders use a variety of blocks and sprites to create a short story about a monster under the bed (or in the closet). The purpose of this project is to apply previously learned concepts in a new context and to learn how to modify a backdrop to make it look like nighttime.

This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. This book focuses on discrete models, which include graphs, cellular automata, and agent-based models. They are often characterized by structure, rules and transitions rather than by equations. They tend to be more abstract than continuous models; in some cases there is no direct correspondence between the model and a physical system.

Data structures and algorithms are among the most important inventions of the last 50 years, and they are fundamental tools software engineers need to know. But in my opinion, most of the books on these topics are too theoretical, too big, and too bottom-up:

*Too theoretical: Mathematical analysis of algorithms is based on simplifying assumptions that limit its usefulness in practice. Many presentations of this topic gloss over the simplifications and focus on the math. In this book I present the most practical subset of this material and eliminate the rest.

*Too big: Most books on these topics are at least 500 pages, and some are more than 1000. By focusing on the topics I think are most useful for software engineers, I kept this book under 250 pages.

*Too bottom-up: Many data structures books focus on how data structures work (the implementations), with less about how to use them (the interfaces). In this book, I go “top down”, starting with the interfaces. Readers learn to use the structures in the Java Collections Framework before getting into the details of how they work.

Finally, many present this material out of context and without motivation: it’s just one damn data structure after another!

I try to alleviate the boredom by organizing the topics around an application—web search—that uses data structures extensively, and is an interesting and important topic in its own right.

This application also motivates some topics that are not usually covered in an introductory data structures class, including persistent data structures, with Redis, and streaming algorithms.

I have made difficult decisions about what to leave out, but I have made some compromises. I include a few topics that most readers will never use, but that they might be expected to know, possibly in a technical interview. For these topics, I present both the conventional wisdom as well as my reasons to be skeptical.

This book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercise that allows readers to apply what they have learned. Each exercise includes automated tests that check the solution. And for most exercises, I present my solution at the beginning of the next chapter.

This book is intended for college students in computer science and related fields, as well as professional software engineers, people training in software engineering, and people preparing for technical interviews.

I assume that the reader knows Java at an intermediate level, but I explain some Java features along the way, and provide pointers to supplementary material.

People who have read Think Java or Head First Java are prepared for this book.

This interactive lesson helps students understand how companies use algorithms to sort job applicants. It also encourages students to reflect on how digital data mining also can contribute to the hiring process. Students examine resumes and digital data to consider the ways in which our data may open or close opportunities in an increasingly digitized hiring market.

This is a classroom activity report on teaching algorithms as part of a second course in computer programming. Teaching an algorithm in an introductory level programming class is often a dry task for the instructor and the rewards for the student are abstract. To make the learning of algorithms and software more rewarding, this assignment employs a Rubik’s cube.

This video lesson will introduce students to algorithmic thinking through the use of a popular field in graph theory—social networking. Specifically, by acting as nodes in a graph (i.e. people in a social network), the students will experientially gain an understanding of graph theory terminology and distance in a graph (i.e. number of introductions required to meet a target person). Once the idea of distance in a graph has been built, the students will discover Dijkstra's Algorithm. The lesson should take approximately 90 minutes and can be comfortably partitioned across two class sessions if necessary (see the note in the accompanying Teacher Guide). There are no special supplies needed for this class and all necessary hand-outs can be downloaded from this website.