• 4

This preview shows page 1 - 2 out of 4 pages.

ASSESSMENT TASKSDirection: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.
d.A binary search is faster on large lists, but a linear search is faster on smalllists.
2. Consider the following list:634532984657Using the linear search as described in this module, how many comparisons arerequired to find whether the following items are in the list? (By comparison, we meanitem comparisons)28100a.90b.57c.63d.120

Course Hero member to access this document

Course Hero member to access this document

End of preview. Want to read all 4 pages?

Course Hero member to access this document

Term
Summer
Professor
Aaron Lington
Tags
Divide and conquer algorithm, Binary search algorithm, linear search of a list, binary search of a list