In this video David quickly explains each 2D motion concept and does a quick example problem for each concept. Keep an eye on the scroll to the right to see where you are in the review. Created by David SantoPietro.

Figuring how long it takes an A380 to take off given a constant acceleration. Created by Sal Khan.

A Brief Introduction to Engineering Computation with MATLAB is specifically designed for students with no programming experience. However, students are expected to be proficient in First Year Mathematics and Sciences and access to good reference books are highly recommended. Students are assumed to have a working knowledge of the Mac OS X or Microsoft Windows operating systems. The strategic goal of the course and book is to provide learners with an appreciation for the role computation plays in solving engineering problems. MATLAB specific skills that students are expected to be proficient at are: write scripts to solve engineering problems including interpolation, numerical integration and regression analysis, plot graphs to visualize, analyze and present numerical data, and publish reports.

This resource includes PowerPoint, workbook pages, and supplemental videos associated to OpenStax College Algebra, Section 5.3 Graphs of Polynomial Functions.  All materials are ADA accessible.  Funded by THECB OER Development and Implementation Grant (2021)

Introduces students to the basic tools in using data to make informed management decisions. Covers introductory probability, decision analysis, basic statistics, regression, simulation, and linear and nonlinear optimization. Computer spreadsheet exercises and examples drawn from marketing, finance, operations management, and other management functions. Restricted to Sloan Fellows.

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.

Introduction to Statistics is a resource for learning and teaching introductory statistics. This work is in the public domain. Therefore, it can be copied and reproduced without limitation. However, we would appreciate a citation where possible. Please cite as: Online Statistics Education: A Multimedia Course of Study (http://onlinestatbook.com/). Project Leader: David M. Lane, Rice University. Instructor's manual, PowerPoint Slides, and additional questions are available.

Mathematics, as we all know, is the language of science, and fluency in algebraic skills has always been necessary for anyone aspiring to disciplines based on calculus. But in the information age, increasingly sophisticated mathematical methods are used in all fields of knowledge, from archaeology to zoology. Consequently, there is a new focus on the courses before calculus. The availability of calculators and computers allows students to tackle complex problems involving real data, but requires more attention to analysis and interpretation of results. All students, not just those headed for science and engineering, should develop a mathematical viewpoint, including critical thinking, problem-solving strategies, and estimation, in addition to computational skills. Modeling, Functions and Graphs employs a variety of applications to motivate mathematical thinking.

Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code.

Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and adjacency list representations; and B-trees.

A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.

There are key differences between the way teaching and learning takes place in high schools and universities. Our goal is much more than just getting you to reproduce what was done in the classroom. Here are some key points to keep in mind:
• The pace of this course will be faster than a high school class in precalculus. Above that, we aim for greater command of the material, especially the ability to extend what we have learned to new situations.
• This course aims to help you build the stamina required to solve challenging and lengthy multi-step problems.
• As a rule of thumb, this course should on average take 15 hours of effort per week. That means that in addition to the 5 classroom hours per week, you would spend 10 hours extra on the class. This is only an average and my experience has shown that 12–15 hours of study per week (outside class) is a more typical estimate. In other words, for many students, this course is the equivalent of a halftime job!
• Because the course material is developed in a highly cumulative manner, we recommend that your study time be spread out evenly over the week, rather than in huge isolated blocks. An analogy with athletics is useful: If you are preparing to run a marathon, you must train daily; if you want to improve your time, you must continually push your comfort zone.

Graphing energy versus position for a block accelerated by a spring and stopped by friction.