Searching Algorithms
Muhtasari
You have lost your passport somewhere in the house. One way to find it is to start in the hall and search every room in turn until you hit it. The other way, if the house is a hotel with numbered rooms and you know the number, is to walk to the middle corridor, see whether your room is above or below, and ignore half the building. Both plans find the passport. Only one of them is any use in a hotel with a thousand rooms.
Those two plans are the linear search and the binary search, and this specification wants three things from you: the mechanics of each, the ability to follow and write pseudocode for both, and a clear-eyed comparison of where each one wins. The comparison is not simply that binary is faster. Binary search demands something in return, and knowing what it demands is the difference between a two-mark answer and a four-mark one.
Malengo
- Understand and explain how the linear search algorithm works.
- Understand and explain how the binary search algorithm works.
- Compare and contrast linear and binary search algorithms.
Ramani ya mawazo
Mada hii imechorwa ili uone jinsi mawazo yanavyounganika.
Fungua ramani ya mawazo kwenye programu
Maelezo ya Somo
Dokezo Kamili la Somo Linapatikana kwenye Programu ya Green Bridge
Pata programu ya Green Bridge CBT kwenye simu au kompyuta yako kwa maktaba kamili ya IGCSE: mitihani ya miaka iliyopita, miongozo ya usahihishaji, ramani za mawazo, kadi za marudio na masomo ya sauti.
Tathmini ya Somo
Hongera kwa kukamilisha somo la Searching Algorithms. Sasa kwa kuwa umechunguza dhana na mawazo muhimu, ni wakati wa kuweka ujuzi wako kwa mtihani. Sehemu hii inatoa mazoezi mbalimbali maswali yaliyoundwa ili kuimarisha uelewaji wako na kukusaidia kupima ufahamu wako wa nyenzo.
Utakutana na mchanganyiko wa aina mbalimbali za maswali, ikiwemo maswali ya kuchagua jibu sahihi, maswali ya majibu mafupi, na maswali ya insha. Kila swali limebuniwa kwa umakini ili kupima vipengele tofauti vya maarifa yako na ujuzi wa kufikiri kwa makini.
Tumia sehemu hii ya tathmini kama fursa ya kuimarisha uelewa wako wa mada na kubaini maeneo yoyote ambapo unaweza kuhitaji kusoma zaidi. Usikatishwe tamaa na changamoto zozote utakazokutana nazo; badala yake, zitazame kama fursa za kukua na kuboresha.
- Which condition must be met before a binary search can be used? A. The data must be stored in a file B. The data must be numeric C. The data must be sorted D. The data must contain no duplicates Answer: C
- An array holds 64 sorted items. What is the maximum number of comparisons a binary search will make? A. 6 B. 8 C. 32 D. 64 Answer: A
- A linear search is used on an array of 40 items to look for a value that is not present. How many comparisons are made? A. 1 B. 20 C. 39 D. 40 Answer: D
- In an iterative binary search, which assignment is made when the middle element is smaller than the target? A. First becomes Middle B. First becomes Middle + 1 C. Last becomes Middle D. Last becomes Middle - 1 Answer: B
- Which of the following is an advantage of a linear search over a binary search? A. It makes fewer comparisons on large data sets B. It works on data that is not in any order C. It halves the search area at each step D. It can only be used on arrays Answer: B
Fanyia kazi maswali haya kwenye programu
Fanyia kazi maswali haya kwenye programu
Vitabu Vinavyopendekezwa
Fanya Mazoezi ya Maswali ya Majaribio
Ungependa kufanya mazoezi ya maswali ya majaribio kuhusu Searching Algorithms? Pakua programu ya Green Bridge CBT ili kupata maswali ya majaribio na tathmini kamili za mazoezi kuhusu mada hii.
Pakua Programu Kwenye Google Playstore
Kila kitu unachohitaji ili kufaulu katika JAMB, WAEC & NECO.
