Question

carina is trying to remember a word by looking for it in a dictionary. she knows it starts with w and ends with d. for the second letter, she could work her way through the alphabet, or she could start with e because that is the most frequently occurring letter in english. if she tried every letter, carina would be using a(n) _____. if she starts with e, carina would be using a(n) _____.

a.algorithm; heuristic

b.heuristic; heuristic

c.algorithm; algorithm

d.heuristic; algorithm

Answer

This answer is hidden. It contains 1 characters.