### Which search algorithm will find the name gene more quickly

Assignment Help Data Structure & Algorithms
##### Reference no: EM131447432

1.Which of the following statements is FALSE?

A.In loop control, initialization and modification steps must lead to the appropriate termination condition.
B.The insertion sort algorithm becomes more efficient as the size of the list increases.
C.The binary search algorithm becomes more efficient as the size of the list increases.
D.Whereas a loop involves repeating a set of instructions in a manner in which the set is completed and then repeated, recursion involves repeating the set of instructions as a subtask of itself.

2.Given the sorted list: Alice, Byron, Carol, Duane, Elaine, Floyd, Gene, Henry, Iris

Which search algorithm will find the name Gene more quickly?

Which search algorithm will find the name Alice more quickly?

Which search algorithm will detect the absence of the name Bruce more quickly?

Which search algorithm will detect the absence of the name Sue more quickly?

A.sequential
B.binary

3.At most, how many entries in a list of 100 names will be interrogated when using the binary search algorithm?

4.Given the sorted list: Alice, Byron, Carol, Duane, Elaine, Floyd, Gene, Henry, Iris

Which search algorithm will find the name Gene more quickly?

Which search algorithm will find the name Alice more quickly?

Which search algorithm will detect the absence of the name Bruce more quickly?

Which search algorithm will detect the absence of the name Sue more quickly?

A. sequential
B. binary

5.Match the definitions on the left with the terms on the right.

repeating a set of instructions as a subtask of itself (one is performed within the other)

a type of loop that tests for termination after the body is executed; often referred to as a "posttest loop"

a type of loop that tests for termination before the body is executed; often referred to as a "pretest loop"

repeating a set of instructions in which the set is completed and then repeated (one after the other)

an algorithm that is useful for searching large sorted lists by using a divide-by-two approach

an algorithm that is useful for searching small lists but is not efficient for large lists

A. while loop
B. sequential search
C. repeat loop
D. iteration
E. recursion
F. binary search

6.At most, how many entries in a list of 500 names will be interrogated when using the binary search algorithm?

#### Assignment - working with doubly linked lists

CS 20A: C++ Data Structures Assignment: Working with Doubly Linked Lists. In this assignment, you will implement the following four methods on an incomplete implementation of

#### What kind of sort you would use for a given situation

Discuss when you would use a sort and what kind of sort you would use for a given situation. Reply to others with support for or arguments against their proposal of sort usage

#### Show the result of running shellsort on the input

Show the result of running Shellsort on the input 9,8,7,6,5,4,3,2,1 using increments 1,3,7. You do not need to include a cover sheet, but you do need to put your name, date,

#### Select a task that a program could perform over an array

Select a task that a program could perform over an array of items that would be used by a small business. You can build on your effort from a previous week or tackle a new cha

#### Determine the height of the tree

COSC 2007 -Data Structures - determine the height of the tree, and find each value. You do not need to output the tree using the inorder traversal, but it might be a useful

#### Explain rijndael algorithm in some detail to your classmates

The Rijndael algorithm was chosen for the Advanced Encryption Standard (AES). Pick one (or more) steps of the algorithm and explain it in some detail to your classmates.

#### Show the result of using the linear-time algorithm

Show the result of using the linear-time algorithm to builde a binary heap using the same input. Show the result of performing three deleteMin operations in the heap of the pr

#### Writing a brief description of the algorithm

Given a BST and two numbers - a and b (where a ≤ b) - propose an algorithm that prints all the elements k of the BST that satisfy: k ≥ a and k ≤ b. Writing a brief descripti