Multiple Choice
Which scenario is not an application of the matching law to ultimately reduce the amount of time a child spends playing computer games.
A) Requiring increasingly more weekly chores for every additional 30 minutes the child wants to be at the computer
B) Spending time interacting with the child in ways that compete with the attractiveness of the computer (e.g., going to a ball game, practicing soccer moves, playing a board game)
C) Reducing the number of different games on the computer so that they all become boring to the child
D) Preventing the child from playing any game other than computer games for a week, thus reducing the reinforcing capacity of the computer games
Correct Answer:
Verified
Correct Answer:
Verified
Q13: Which statement about the minimum distance model
Q14: The procedure of fading involves a gradual<br>A)
Q15: Tolman is best known for his argument
Q16: The procedure of fading involves gradual changes
Q17: A hungry and thirsty rat spends 40%
Q19: Hawks are not successful every time they
Q20: Skinner assumed that reinforcement is powerful enough
Q21: Skinner assumed that stimulus control<br>A) enables the
Q22: Identify and explain a behavior chain that
Q23: Which scenario illustrates a schedule of reinforcement?<br>A)