Form the SQL statement by rearranging the four blocks.
2.Parsons Problem, SQL statement, no randomization.
Form the SQL statement by rearranging the four blocks. This version of this problem will always present the blocks in the same fixed order (but incorrect, hopefully!), as prescribed by the author in the source.
Form the SQL statement by rearranging the four blocks.
4.Parsons Problem, Natural Language.
Form the sentence often used to show font samples. You can reuse blocks as needed.
5.Parsons Problem, Natural Language, with Distractors.
Form the sentence often used to show font samples. Again, but now with distractors.
6.Parsons Problem, SQL statement, reusable.
Form the SQL statement by rearranging the four blocks. Same problem as above, but we allow blocks to be reused (even though the solution does not require that).