This lesson focuses on the observation of properties and the classification of objects to build ideas about variables. Learners compare buttons to identify similarities and differences. In addition, learners are introduced to Venn Diagrams by reading "The Elves and the Shoemaker" and sorting their shoes in a giant diagram.

This lesson offers students the opportunity to engage in exploration of ways to sort different objects.  The Lesson begins with a pre assesment option of students prior sorting knowledge.  Students are given three shapes and asked to sort the shapes from left to right from smallest to largest. Then students are asked to trace the shapes in order for the teacher to keep as a record of student growth.  
Once the pre assessment is given students are put into groups with different levels of ability.  Students are then given materials to sort such as pattern blocks, animal counters, crayons, etc. (Additional suggestions are made on the website). Students work together to sort their objects and then discuss their rule for sorting.  
Students come together in a large group to share their rule for sorting.  Then students go back into their small groups and try to sort their objects in a different way by using the suggestions of their peers.
Finally, students can record their rule for sorting with sentences, words, or pictures depending on the grade/ability level.

Foundations subject in modern software development techniques for engineering and information technology. Covers the design and development of component-based software (using C# and .NET); data structures and algorithms for modeling, analysis, and visualization; basic problem-solving techniques; web services; and the management and maintenance of software. Includes a treatment of topics such as sorting and searching algorithms; and numerical simulation techniques. Foundation for in-depth exploration of image processing, computational geometry, finite element methods, network methods and e-business applications.

Venn diagrams can be used effectively in kindergarten.  Making them user-friendly, hands-on, and developmentally appropriate as a tool and kindergarten students can use venn diagrams with ease. Students are guided toward an understanding of the Venn diagram by physically sorting items into hula hoops. Students are able to move to an interactive 
 As they sort objects into unions and sets in this lesson plan, students make their thinking visible through similar "rough-draft" talk. By thinking aloud about their choices in this lesson, students are invited to be storytellers as they explore the connections between mathematics and language.
Students can complete a self-assessment to determine their learning and working collaboratively in a group.

This course presents the fundamentals of object-oriented software design and development, computational methods and sensing for engineering, and scientific and managerial applications. It cover topics, including design of classes, inheritance, graphical user interfaces, numerical methods, streams, threads, sensors, and data structures. Students use Java programming language to complete weekly software assignments. How is 1.00 different from other intro programming courses offered at MIT? 1.00 is a first course in programming. It assumes no prior experience, and it focuses on the use of computation to solve problems in engineering, science and management. The audience for 1.00 is non-computer science majors. 1.00 does not focus on writing compilers or parsers or computing tools where the computer is the system; it focuses on engineering problems where the computer is part of the system, or is used to model a physical or logical system. 1.00 teaches the Java programming language, and it focuses on the design and development of object-oriented software for technical problems. 1.00 is taught in an active learning style. Lecture segments alternating with laboratory exercises are used in every class to allow students to put concepts into practice immediately; this teaching style generates questions and feedback, and allows the teaching staff and students to interact when concepts are first introduced to ensure that core ideas are understood. Like many MIT classes, 1.00 has weekly assignments, which are programs based on actual engineering, science or management applications. The weekly assignments build on the class material from the previous week, and require students to put the concepts taught in the small in-class labs into a larger program that uses multiple elements of Java together.

This online game allows students to practice sorting words with long vowel sounds and short vowel sounds.  Students identify an object at the bottom of the screen, must say it to themselves and then sort it into either the long vowel cart or the short vowel cart.

Studies how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Models of randomized computation. Data structures: hash tables, and skip lists. Graph algorithms: minimum spanning trees, shortest paths, and minimum cuts. Geometric algorithms: convex hulls, linear programming in fixed or arbitrary dimension. Approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.