Question

Which of these algorithms would require access to a large database of résumés?

1) an algorithm that ranks résumés based on similarity to résumés from already hired applicants.
2) an algorithm that parses the job history section of the résumé and awards a higher score to candidates that have worked more jobs.
3) an algorithm that awards a higher score to résumés whose words overlap with words in the job description.
4) an algorithm that computes a score based on the length of the résumé and the average length of the words.

Answer 1

Algorithm 1, which ranks résumés based on similarity to résumés from already hired applicants, would require access to a large database of résumés.

Step-by-step explanation:

The algorithm that would require access to a large database of résumés is algorithm 1, which ranks résumés based on similarity to résumés from already hired applicants. This algorithm needs to compare the input résumé with a large database of résumés that have already been hired to identify similarities and rank them accordingly.

Algorithm 2 parses the job history section of the résumé and awards a higher score to candidates that have worked more jobs. Algorithm 3 awards a higher score to résumés whose words overlap with words in the job description. Algorithm 4 computes a score based on the length of the résumé and the average length of the words and does not require access to a large database of résumés.