e/computer-science/aqa/questions","basePath":"/gcse/computer-science/aqa/searching-algorithms/questions","formulaUrl":null,"initialIndex":24,"initialQuestionWindow":[{"id":"a8f4b659-0952-4a5a-97d2-489c472c9077","revisionId":"acb7e291-e61d-4e05-9946-e274356aed20","questionNumber":null,"questionType":"LA","specification":"Figure 1 shows a Python list of city names.\n\n```python\ncities = [\"Paris\", \"Tokyo\", \"London\", \"Rome\", \"Cairo\", \"Sydney\"]\n```\n\nFigure 1","difficulty":2,"difficultyBand":"easy","totalMarks":1,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"fb70504b-7d44-4522-b8f8-61c37ee0337b","label":null,"content":"State why a binary search cannot be used on the list `cities`.","markscheme":"- States that the list is not sorted (or not in alphabetical order) B1","marks":1,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"b61dab94-0a73-4089-b3f2-8a5d4a199e20","revisionId":"9750ac32-a24a-451a-b3b3-0e42f6079e67","questionNumber":null,"questionType":"LA","specification":"An air traffic control system holds an unsorted list of active flight identifiers: `['DLH402', 'AAL099', 'SIA318', 'HAL012', 'UAE074', 'JAL006']`.","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"ee039334-5fd3-4ab4-9d3f-ae6b2369d792","label":null,"content":"Explain how a linear search algorithm would find the flight identifier 'UAE074' in this list.","markscheme":"- Identifies that the search starts with the first item, `'DLH402'`, and compares it to the target `'UAE074'` M1\n- Explains that as they do not match, the algorithm moves sequentially (one-by-one) through the next items (`'AAL099'`, `'SIA318'`, and `'HAL012'`), comparing each to the target M1\n- States that when `'UAE074'` is reached, the match is confirmed, and the search terminates, returning the position/index of the item A1","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"ece27e0a-3025-4318-b0cd-4ab43adf97bb","revisionId":"95b90715-7043-493c-addb-90fd7624e4d9","questionNumber":null,"questionType":"LA","specification":"A seismologist is analyzing a sequential list of seismic station identifiers: `['STA-X', 'STA-M', 'STA-P', 'STA-Y', 'STA-A', 'STA-C']`.","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"9d3de546-da0d-4559-81e6-397207ea9cfe","label":null,"content":"Explain how a linear search algorithm would find the station identifier 'STA-A' in this list.","markscheme":"- Identifies that the algorithm starts at the first element ('STA-X') and compares it to the target 'STA-A', finding no match B1\n- Explains that the algorithm moves sequentially through the list, comparing the target 'STA-A' to 'STA-M', 'STA-P', and 'STA-Y' in turn M1\n- States that the fifth element ('STA-A') matches the target, so the search terminates and returns the position (index 4 or the 5th position) A1","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null}],"subjectCode":"gcse_computer_science__aqa","summaries":[{"id":"00de9e72-c1e3-4aeb-a926-462f994d6701","difficultyBand":"medium","calculatorUse":null},{"id":"26a5ec3b-6c40-4285-b40c-fc7796abe956","difficultyBand":"medium","calculatorUse":null},{"id":"2ba91c98-d7e9-4d00-bf2e-2d7990a4fe75","difficultyBand":"easy","calculatorUse":null},{"id":"455f14ef-6535-4f4a-852b-6478d8bfce82","difficultyBand":"easy","calculatorUse":null},{"id":"5181b58a-1fd1-4b94-9f8d-fc6a859d9423","difficultyBand":"medium","calculatorUse":null},{"id":"51cdf4fe-1106-497d-91dd-f125eede4880","difficultyBand":"medium","calculatorUse":null},{"id":"52855cb8-6057-4a4e-84d1-6569ff80cd8e","difficultyBand":"medium","calculatorUse":null},{"id":"54793f96-1f5a-456c-9893-33b8ccfb9d91","difficultyBand":"easy",

Searching algorithms

Question 7

Searching algorithms Questions

Searching algorithms

Question 7

Searching algorithms Questions