# Experiment 1 2021¶

Thank you for participating in this experiment! Please try to answer each question below to the best of your ability. Start with pretest problems 1 and 2 and then do the practice and then do the posttest problems 1 and 2.

## Pretest Problem 1¶

Try to solve the following fix code problem. You have five minutes to try to solve it. It is okay if you can’t solve it, you will earn credit for trying to solve it.

Click on the “Start” button to show the problem.

Fix the code below to remove all adjacent duplicate values in the passed list. For example, removeDups([5, 5, 1]) returns [5, 1] and removeDups([1, 1, 2, 2, 3, 3, 3, 5, 6, 5, 6]) returns [1, 2, 3, 5, 6, 5, 6].

Click on the “Finish Exam” button shown before the question when you are done with the above question and then answer the poll below.

In solving the preceding problem I invested:
• 1. Very, very low mental effort
• 2. Very low mental effort
• 3. Low mental effort
• 4. Rather low mental effort
• 5. Neither low nor high mental effort
• 6. Rather high mental effort
• 7. High mental effort
• 8. Very high mental effort
• 9. Very, very high mental effort

## Pretest Problem 2¶

Try to solve the following fix code problem. You have five minutes to try to solve it. It is okay if you can’t solve it, you will earn credit for trying to solve it.

Click on the “Start” button to show the problem.

Fix the function adjacentTwos below to return True if there are at least two adjacent 2’s in list nums, otherwise return False. For example, return True for adjacentTwos([1, 2, 2]) since there are two adjacent items equal to 2 (at index 1 and 2) and False for adjacentTwos([2, 1, 2]) since the 2’s are not adjacent.

Click on the “Finish Exam” button shown before the question when you are done with the above question and then answer the poll below.

In solving the preceding problem I invested:
• 1. Very, very low mental effort
• 2. Very low mental effort
• 3. Low mental effort
• 4. Rather low mental effort
• 5. Neither low nor high mental effort
• 6. Rather high mental effort
• 7. High mental effort
• 8. Very high mental effort
• 9. Very, very high mental effort

## Practice¶

Try to solve the following mixed up code problems. You can use the “Help Me” button to make the problem easier if you have made at least three attempts to solve the problem. After you solve each problem, please answer the poll as well.

Selecting from: sum13_nd_pp_exA, sum13_w6d_pp_exB

In solving the preceding problem I invested:
• 1. Very, very low mental effort
• 2. Very low mental effort
• 3. Low mental effort
• 4. Rather low mental effort
• 5. Neither low nor high mental effort
• 6. Rather high mental effort
• 7. High mental effort
• 8. Very high mental effort
• 9. Very, very high mental effort

Selecting from: list_multiples_pp_exA, list_multiples_w3d_pp_exB

In solving the preceding problem I invested:
• 1. Very, very low mental effort
• 2. Very low mental effort
• 3. Low mental effort
• 4. Rather low mental effort
• 5. Neither low nor high mental effort
• 6. Rather high mental effort
• 7. High mental effort
• 8. Very high mental effort
• 9. Very, very high mental effort

Selecting from: ibeforee_pp_exA, ibeforee_pp_wd_exB

In solving the preceding problem I invested:
• 1. Very, very low mental effort
• 2. Very low mental effort
• 3. Low mental effort
• 4. Rather low mental effort
• 5. Neither low nor high mental effort
• 6. Rather high mental effort
• 7. High mental effort
• 8. Very high mental effort
• 9. Very, very high mental effort

Selecting from: removetarget_pp_v2_exA, remove_target_pp_wd_exB

In solving the preceding problem I invested:
• 1. Very, very low mental effort
• 2. Very low mental effort
• 3. Low mental effort
• 4. Rather low mental effort
• 5. Neither low nor high mental effort
• 6. Rather high mental effort
• 7. High mental effort
• 8. Very high mental effort
• 9. Very, very high mental effort

## Posttest Problem 1¶

Try to solve the following fix code problem. You have five minutes to try to solve it. It is okay if you can’t solve it, you will earn credit for trying to solve it.

Click on the “Start” button to show the problem.

Fix the code below to remove all adjacent duplicate values in the passed list. For example, removeExtras([3, 3, 1]) returns [3, 1] and removeExtras([7, 7, 8, 8, 9, 9, 9, 10, 9, 10, 11]) returns [7, 8, 9, 10, 9, 10, 11].

Click on the “Finish Exam” button shown before the question when you are done with the above question and then answer the poll below.

In solving the preceding problem I invested:
• 1. Very, very low mental effort
• 2. Very low mental effort
• 3. Low mental effort
• 4. Rather low mental effort
• 5. Neither low nor high mental effort
• 6. Rather high mental effort
• 7. High mental effort
• 8. Very high mental effort
• 9. Very, very high mental effort

## Posttest Problem 2¶

Try to solve the following fix code problem. You have five minutes to try to solve it. It is okay if you can’t solve it, you will earn credit for trying to solve it.

Click on the “Start” button to show the problem.

Fix the function two_cats below to return True if there are at least two adjacent “cat” strings in list pets, otherwise return False. For example, return True for two_cats(['dog', 'cat', 'cat']) since there are two adjacent items equal to ‘cat’ (at index 1 and 2) and False for two_cats(['cat', 'dog', 'cat']) since the ‘cat’ strings are not adjacent.

Click on the “Finish Exam” button shown before the question when you are done with the above question and then answer the poll below.

In solving the preceding problem I invested:
• 1. Very, very low mental effort
• 2. Very low mental effort
• 3. Low mental effort
• 4. Rather low mental effort
• 5. Neither low nor high mental effort
• 6. Rather high mental effort
• 7. High mental effort
• 8. Very high mental effort
• 9. Very, very high mental effort