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?

Reference no: EM131447432

Questions Cloud

Define the term victim : Define the term victim. Review Son of Sam laws or notoriety-for-profit laws and explain their purpose. How do you feel about the increasing use of victim impact statements and the controversy over their constitutionality?
Cambodia economic development : You MUST include some general concluding comments about the level of economic development of your country - Cambodia Economic Development
What was the real gdp per capita : Singapore's real GDP per capita in 1996 was $2500. The country's average annual growth rate in the country is 4%. What was the real GDP per capita in year 1960?
What are victims assistance programs : What are victims' assistance programs? What is the relationship between victims' assistance programs and victims' rights? What recommendations would you make regarding the improvement of victims' assistance programs? Research federal and state vic..
Which search algorithm will find the name gene more quickly : 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?
Explanation of how a fretco acoustic guitar is manufactured : Visual Communication: Choosing the Best Visual [LO-3] You're preparing the annual report for FretCo Guitar Corporation. For each of the following types of information, select an appropriate chart or visual to illustrate the text. Explain your choi..
Identity aligned or misaligned in the country : Are power and identity aligned or misaligned in the country? Describe the country's context to justify your answer. Explain how this alignment/misalignment impacts the country's development. [200-300 words]
What is the definition of plea bargaining : What is the definition of plea bargaining? What is an example of intermediate sanctions? What is the relationship of plea bargaining as it relates to sentencing? What role does a victim have, if any, on the plea bargaining process? What goals does..
How do macro systems affect entrepreneurs : How do "macro systems" affect entrepreneurs, and the opportunities available to them? Explain how two or more systems (e.g., political, social-cultural, legal-regulatory, education, healthcare, etc.) influence functional systems implemented by entr..

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Branching are key to most software algorithms

Decisions and branching are key to most software algorithms. For this problem we will be working with prime numbers. Note that 0 IS NOT to be considered prime, but 1 is a prime.

  Develop a solution for the problem and mention algorithms

Spaces between tokens are allowed but not required. The program will convert the (user input) infix expression to postfix (RPN) form and display the converted expression on the screen.

  Simplify rsa cryptosystem using prime number

Assume we tried to simplify RSA cryptosystem using just prime p instead of composite modulus N = pq. As in RSA, we would have encryption exponent.

  Draw a defining diagram

Draw a defining diagram (IPO). Draw a structure chart. Write a program using pseudocode and modularization

  Create a project using the arraylist class

Create a project using the ArrayList class and the Main class in Search Algorithms. The ArrayList class contains implementations of the first three search methods explained in this week's lecture: sequential, sorted, and binary search.

  Display the dfs starting from a specified vertex

Design and implement a driver to show the following (check for 2 graphs; 1 is provided, including the starting vertex):Display the dfs starting from a specified vertex;Display the discovery/finishing time for each node in the graph;Show the Parenthes..

  Find maximum possible amount of money by optimal strategy

Removes it from row permanently, and receives value of coin. Find out the maximum possible amount of money we can definitely win if we move first.

  Choose a combination of meaningful data structures

Describe a mechanism to access the telephone customer records by telephone #. Assume that we have a huge data in hand, say a million records or so.

  Describe how to implement a simple parser

Describe the algorithm, write pseudo code or optionally implement the solution. Describe how to implement a simple parser that does well-formedness checking on XML, such as the following: x, y and z.

  Use of primitives helps remove ambiguities in algorithm

Explain the distinction between an ambiguity in a proposed algorithm and an ambiguity in the representation of an algorithm. Describe how the use of primitives helps remove ambiguities in an algorithm's representation.

  Draw a diagram of how the stacks might look

Two stacks of positive integers are needed, both containing integers with values less than or equal to 1000. One stack contains even integers; the other contains odd integers.

  Implement the queue data structure

implement the queue data structure - circular linked list to implement the queue data structure as described in java.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd