CC2103-MOD-3-ACTIVITY-2.docx - Direction: Answer the...

Direction: Answer the following items (Malik & Nair, 2012).
1. Mark the following statements as true or false.
a. A linear search of a list assumes that the list is in ascending order.
b. A binary search of a list assumes that the list is sorted.
c. A binary search is faster on ordered lists and slower on unordered lists.
2. Consider the following list:
63 45 32 98 46 57 28 100
Using the linear search as described in this module, how many comparisons are required to find
whether the following items are in the list? (By comparison, we mean item comparisons)
b. 57 - SIX COMPARISONS
c. 63 - ONE COMPARISON 3. Consider the following list:
2 10 17 45 49 55 68 85 92
Using the detailed code for binary search as described in this module, how many comparisons are
required to find whether the following items are in the list? Show the values of left, right and mid and
the number of comparisons after each iteration of the loop.
a. 15
98 110
98 110
49

Number not in the list
No. of Iteration: 3
b. 49
Array = 2 10 17 45 49 55 68 85