Tip: Choose Save as PDF in the print dialog to download. Use A4 paper size.
Shade in the A or B circle for each question.
Draw a line connecting each item on the left to its match on the right.
| Left column | Right column | |
|---|---|---|
| 1crawler | AA search engine does not return pages randomly. It must rank results by relevance to the query so the user can find useful information. | |
| 2index | BA stored database of words and the pages they appear on, so results can be found quickly | |
| 3The user's query is the words typed in to describe the information they want to find | CA program that follows links from page to page to discover and collect web pages for the search engine | |
| 4Ranking sorts the matching pages so the most relevant results appear first | DA top-ranked page is not always accurate or unbiased. Ranking can be affected by bias, paid adverts and poor relevance, so users must check sources. | |
| 5Search engine shows every page on the web in random order | Eresults.sort(key=score, reverse=True) | |
| 6Top result = always the most accurate and unbiased page | Fquery = "best study tips year 11" |
Complete each line of code by filling in the missing parts.
Shade in the letter of the line that contains an error.
search engine — A digital solution that solves the problem of finding information by indexing web pages and ranking the results for a user's query.FOR EACH page IN web
crawl(page)
index(page)FOR EACH word IN page.text
ADD page TO index[word]query ← INPUT("Search: ")
matches ← index[query]SORT matches BY score DESCENDING
DISPLAY matchesIF page.relevance < 0.2 THEN
REMOVE page FROM results