few_shots: 
Example:
Problem/activity:
Task
Materials
One 10-frame per pair of students (see example below)
[IMG]
Counters, 10 per pair of students
Decks of number cards 0-5 (with 4 of each number) or two 0-5 dice
Setup
This activity is done in pairs. The students sit side by side with 10-frame and deck of cards or dice. If they have cards, the cards are shuffled and placed face down in front of them.
Action
Player 1 flips a card or rolls the die. They place that many counters on the 10-frame. Player 2 flips a card or rolls the die. They place that many more counters on the 10-frame next to the counters already on the ten frame. The students count the total together.
A recording sheet can be added when the students have been introduced to equations and number sentences. For those students who can handle higher numbers, a deck of 0-10 cards and two 10-frames can be used.
This game can also be played alone.


Concept/skill: 
Solve addition and subtraction word problems, and add and subtract within 10, e.g., by using objects or drawings to represent the problem.

Answer: 
No. Though this task involves addition, it does not involve any word problems.

Now, does the problem or activity shown below enable students to learn the full intent of the following concept or skill?

shot_info: im_task_001477_neg_0

K
standard_description: Understand that restricting a trigonometric function to a domain on which it is always increasing or always decreasing allows its inverse to be constructed.
problem_activity: Task
Many computer applications use very complex mathematical algorithms. The faster the algorithm, the more smoothly the programs run. The running time of an algorithm depends on the total number of steps needed to complete the algorithm. For image processing, the running time of an algorithm increases as the size of the image increases.
For an $n$-by-$n$ image, algorithm 1 has running time given by $p(n) = n^3+3n+1$ and algorithm 2 has running time given by $q(n)=15n^2+5n+4$ (measured in nanoseconds, or $10^{-9}$ seconds ).
Compute the running time for both algorithms for images of size 10-by-10 pixels and 100-by-100 pixels.
Graph both running time polynomials in an appropriate window (or several windows if necessary).
Which algorithm is more efficient?


aligns: no