Background: When searching for an item in a list, each item that we examine (compare) is considered to be interrogated. If we search for John, the following names are interrogated: Harry, Larry, John (in that order). If two names tie for the middle position, choose the first of the two names for the middle. If we search this same list for John using the Sequential search we would interrogate all the names from Alice through John. We would start with Alice, move to Bob, move to Carol and so forth until we reached John. Directions: Use the original list of names (Alice - Oliver) to answers questions 1-8. Using a sequential search, what names are interrogated to find Carol? Using a sequential search, what names are interrogated to determine that Sam is not in the list? Using a binary search, what names are interrogated to find Carol? Using a binary search, what names are interrogated to determine that Sam is not in the list? Will a binary search or sequential search find Alice more quickly? Will a binary search or sequential search find a name in the middle of the list more quickly? Will binary search or sequential search find the absence of a name more quickly? In general, will the binary search or sequential search find an item more quickly? Show what the following list would look after it is sorted using Selection sort. 10. Show what the following list would look after sorted using Insertion sort.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Background: When searching for an item in a list, each item that we examine (compare) is considered to be interrogated.

If we search for John, the following names are interrogated: Harry, Larry, John (in that order). If two names tie for the middle position, choose the first of the two names for the middle.

If we search this same list for John using the Sequential search we would interrogate all the names from Alice through John. We would start with Alice, move to Bob, move to Carol and so forth until we reached John.

Directions: Use the original list of names (Alice - Oliver) to answers questions 1-8.

Using a sequential search, what names are interrogated to find Carol?
Using a sequential search, what names are interrogated to determine that Sam is not in the list?
Using a binary search, what names are interrogated to find Carol?
Using a binary search, what names are interrogated to determine that Sam is not in the list?
Will a binary search or sequential search find Alice more quickly?
Will a binary search or sequential search find a name in the middle of the list more quickly?
Will binary search or sequential search find the absence of a name more quickly?
In general, will the binary search or sequential search find an item more quickly?
Show what the following list would look after it is sorted using Selection sort.

10. Show what the following list would look after sorted using Insertion sort.

Original list
Alice
Bob
Carol
David
Elaine
Fred
George
Harry
Irene
John
Kelly
Larry
Mary
Nancy
Oliver
First sublist Second sublist
Irene
John
Kelly
Larry
Mary
Nancy
Oliver
Irene
John
Kelly

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions