Square foot gardening is one way that ensures a vegetable garden bed can thrive. It is used to ensure not too many plants of a specific variety are planted in a single area. Using the square foot model keeps plants properly spaced, providing a perfect real-world context to teach area, apply multiplication strategies and have students work collaboratively. Most garden beds are 8 x 4 resulting in 32 square feet to work with. It is possible however to have beds of different sizes. While 32 square feet to work with is what is used in this lesson, the methods and chart can be used for any rectangular planting area.

In this lesson, students will use a square foot gardening planting chart (provided) to calculate the number of crops they can plant within a specific area.

This unit is an EQuIP Exemplar for adult education (http://achieve.org/equip). Students will connect their prior, real-world knowledge to the concept of order in mathematics. They will go through a discovery process with content that will build a deep, conceptual understanding of the properties of operations to explain why we perform operations in a certain order when we see just the naked numbers.

In this course, the student will learn the theoretical and practical aspects of algorithms and Data Structures. The student will also learn to implement Data Structures and algorithms in C/C++, analyze those algorithms, and consider both their worst-case complexity and practical efficiency. Upon successful completion of this course, students will be able to: Identify elementary Data Structures using C/C++ programming languages; Analyze the importance and use of Abstract Data Types (ADTs); Design and implement elementary Data Structures such as arrays, trees, Stacks, Queues, and Hash Tables; Explain best, average, and worst-cases of an algorithm using Big-O notation; Describe the differences between the use of sequential and binary search algorithms. (Computer Science 201)

Harry and his students look at various arrangements of classroom desks in this video from Cyberchase.

This is a fast-paced introductory course to the C++ programming language. It is intended for those with little programming background, though prior programming experience will make it easier, and those with previous experience will still learn C++-specific constructs and concepts.
This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

This is a fast-paced introductory course to the C++ programming language. It is intended for those with little programming background, though prior programming experience will make it easier, and those with previous experience will still learn C++-specific constructs and concepts.
This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

This course is an introduction to software engineering, using the Java™ programming language. It covers concepts useful to 6.005. Students will learn the fundamentals of Java. The focus is on developing high quality, working software that solves real problems.
The course is designed for students with some programming experience, but if you have none and are motivated you will do fine. Students who have taken 6.005 should not take this course. Each class is composed of one hour of lecture and one hour of assisted lab work.
This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

This course is an introduction to software engineering, using the Java™ programming language. It covers concepts useful to 6.005. Students will learn the fundamentals of Java. The focus is on developing high quality, working software that solves real problems.
The course is designed for students with some programming experience, but if you have none and are motivated you will do fine. Students who have taken 6.005 should not take this course. Each class is composed of one hour of lecture and one hour of assisted lab work.
This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

This course focuses on introducing the language, libraries, tools and concepts of Javaᵀᴹ. The course is specifically targeted at students who intend to take 6.170 in the following term and feel they would struggle because they lack the necessary background. Topics include: Object-oriented programming, primitives, arrays, objects, inheritance, interfaces, polymorphism, hashing, data structures, collections, nested classes, floating point precision, defensive programming, and depth-first search algorithm.

This resource will help identify any learning gaps students may have in relation to repeated addition, multiplication problems, and arrays.  This is the foundation for being able to move forward with real world mathematical thinking. 

In dit vak leert de student programmeren in een procedurele programmeertaal en wel in C. Aan de orde komen onder meer: fundamentele programmeerconstructies (datatypen, toekennings-, keuze-, en herhalingsopdrachten), procedurele abstractie (methoden en parameters) en data-abstractie (arrays, structures). Verder wordt behandeld: het gebruik van dynamische datastructuren zoals lijsten en binaire bomen, het lezen en schrijven van files en het gebruik van een compiler. Ter illustratie zullen een aantal algoritmen worden behandeld zoals priemgetallen generatie, grootste gemene deler en sorteren.

How can we use area and multiplication to measure the amount of space an area has?Students will explore the concepts of multiplication and area by measuring rectangular planting beds in the garden.

This curriculum guide offers a list of Open Educational Resources (OER) that are arranged in a logical sequence for introducing polynomials with visual models, particularly using arrays and area models.