Browse:
Keywords: Sorting
(Complete Item Description)
- Abstract: The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures. NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms.
(Complete Item Description)
- Abstract: Children will discover the different varieties of apples after listening to a selected story by describing likenesses and differences of apples, sorting apples, graphing apples, eating apples, and creating apple star trees. This unit can be extended to allow children to cook with apples.
- Subject:
Mathematics and Statistics, Social Sciences
- Grade Level:
Primary
- Collection:
LEARN NC Lesson Plans
(Complete Item Description)
- Abstract: This lesson plan creates a classroom database collecting information on books that students have read over a period of time determined by the teacher and/or students. By sorting and filtering, students evaluate the data and can later create other products from their findings.
(Complete Item Description)
- Abstract: Classifications and Sorting. From CS 61B: Data Structures - Fall 2007. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.
(Complete Item Description)
- Abstract: In Counting on Art, students will explore the paintings of Horace Pippin and Wayne Thiebaud and the mobiles of Alexander Calder to discover and practice math and visual art concepts.In Pippin's Story, young children (grades K–3) focus on a painting by African American artist Horace Pippin. They will learn how to "read" the clues in a painting and write a story about the work. Students will also solve counting and time problems and create their own "secret number" painting.Calder's Balancing Acts focuses on math in the mobiles of Alexander Calder. Elementary- level students (grades 2–5) will learn about the artist and write equations based on Calder's art. Upper-level students (grades 6–8) will discover patterns and the Fibonacci sequence. Both levels will make their own math mobiles.Cake Math, based on a painting by California artist Wayne Thiebaud, features math challenges of many varieties. Elementary-level students (grades 2–5) will practice fractions, addition, subtraction, word problems, sorting, and classifying. Intermediate level students (grades 6–8) will find volume and surface area in Thiebaud's cakes.
(Complete Item Description)
- Abstract: This course covers topics such as fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language. Spring 2006.
(Complete Item Description)
- Abstract: Object-oriented sorting of arrays, based on Merritt's sorting thesis.
- Subject:
Science and Technology
- Grade Level:
Post-secondary
- Collection:
Connexions
(Complete Item Description)
- Abstract: The children will be involved in several different activities (graphing, sorting and classifying, patterning) rotating to each station during the lesson.
(Complete Item Description)
- Abstract: 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.
- Subject:
Science and Technology
- Grade Level:
Post-secondary
- Collection:
MIT OpenCourseWare
(Complete Item Description)
- Abstract: Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.
- Subject:
Science and Technology
- Grade Level:
Post-secondary
- Collection:
MIT OpenCourseWare
(Complete Item Description)
- Abstract: Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.
- Subject:
Science and Technology
- Grade Level:
Post-secondary
- Collection:
MIT OpenCourseWare
(Complete Item Description)
- Abstract: This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.
- Subject:
Science and Technology
- Grade Level:
Post-secondary
- Collection:
MIT OpenCourseWare
(Complete Item Description)
- Abstract: This course presents fundamental software development and computational methods for engineering and scientific applications. Object-oriented software design and development is the focus of the course. Weekly programming problems cover programming concepts, graphical user interfaces, numerical methods, data structures, sorting and searching, computer graphics and selected advanced topics. Emphasis is on developing techniques for solving problems in engineering, science, management, and planning. The Java programming language is used.
- Subject:
Science and Technology
- Grade Level:
Post-secondary
- Collection:
MIT OpenCourseWare
(Complete Item Description)
- Abstract: This course examines fundamental software development and computational methods for engineering, scientific and managerial applications. Emphasis is placed on object-oriented software design and development. Students engage in active learning using laptop computers (available on loan). Assignments cover programming concepts, graphical user interfaces, numerical methods, data structures, sorting and searching, computer graphics and selected advanced topics. The Java® programming language is used.
- Subject:
Science and Technology
- Grade Level:
Post-secondary
- Collection:
MIT OpenCourseWare
(Complete Item Description)
- Abstract: The students will have hands-on experiences with sorting pictures into groups according to the Social Sciences objective: The learner will apply basic economic concepts to home and school. This lesson will focus on distinguishing between wants and needs.
(Complete Item Description)
- Abstract: Sorting things into categories is the first step in understanding nature. To sort items, you need to carefully observe them. This often leads to new insights into nature.
(Complete Item Description)
- Abstract: 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.
- Subject:
Science and Technology
- Grade Level:
Post-secondary
- Collection:
MIT OpenCourseWare
(Complete Item Description)
- Abstract: Sorting - continued. From CS 61B: Data Structures - Fall 2007. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.
(Complete Item Description)
- Abstract: This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.
- Subject:
Mathematics and Statistics
- Grade Level:
Post-secondary
- Collection:
MIT OpenCourseWare
Take a Survey
Take a quick survey to tell us about your unique needs for teaching and learning.
Click here to start »
