ITPEC Textbook
Reading settings
Theme

Guest settings stay on this device. Sign in to sync reader settings.

Contents
Chapter 7 · Data Structure and AlgorithmPractice
← Return to textbook

CONCEPT PRACTICE

Time orders of three search methods

1 related verified questions. Take them one at a time.

Filter questions
Question sources

1 of 1 questions match.

Textbook Exercises
0/1 answered

Question 1 of 1

0/1 answered

Volume 1 · Chapter 7 · Textbook Exercises · Q9

Original textbook exercise · Select the image to enlarge
Read the question as text

Which of the following is the correct combination of a search method and the order of its execution time? Here, the number of data items to be searched is n, and probability of collision of hash values (i.e., values becoming the same) is so small that it can be ignored. Binary search Linear search Hash search

The original image above preserves the complete textbook wording and layout.

Choose your answer
Choose an option to check your answer.
1 / 1Back to lesson →

Source: FE Vol 1.pdf, PDF page 458, textbook p. 448 · Information-technology Promotion Agency, Japan · First Edition: April, 2015. ID: tb-v1-c7-q9. Publisher answer and commentary · private review.

Original question · Q9
Q9 Which of the following is the correct combination of a search method and the order of its execution time? Here, the number of data items to be searched is n, and probability of collision of hash values (i.e., values becoming the same) is so small that it can be ignored. Binary search Linear search Hash search a) log2n n 1 b) n log2n n log2n c) n log2n n2 1 d) n2 1 n

Scroll horizontally to read the image at full size.

Figure

Open original ↗