Automation Quiz pg 1

Algorithms are: quick "rules of thumb" that sometimes fail to produce a solution for a problem step-by-step procedures that guarantee a solution will be found for a problem quick "rules of thumb" that guarantee a solution will be found for a problem step-by-step procedures that sometimes fail to produce a solution for a problem

Briefly explain five(5) characteristics of an Algorithm.

Can the consequences of using certain computer algorithms be anticipated?

Select the correct answer for the question below: Dynamic programming is an algorithm pattern ... 1.Is not applicable to algorithms which use recursion.   2.That is applicable to almost every set of circumstances and can be widely implemented.   3.That is applicable to only a narrow range of circumstances.   4.Offers poor efficiency gains, when applicable.

Has a set of criteria been established for Algorithm Analysis?

What Are The Criteria Of Algorithm Analysis?

Has an agreed set of criteria for Algorithm Analysis been developed?

Solve Question 43, 44 showing detailly all the steps with including all explanations Answer Should be typewritten using a computer keyboard!

Briefly explain four (4) characteristics of an Algorithm.

Explain how sequence, selection, and iteration are the building blocks of algorithms.

The use of algorithms is beneficial in problem solving because, while we may not completely grasp them, they are what?

Discuss at length the “people aspect” of the practical considerations for the development of algorithms. Include the concepts of program maintenance and ease of understanding in your response.

a) Please distinguish between "soft real-time behavior" and "hard real-time behavior" in the categories "algorithmic behavior" and "time behavior".  Precise algorithm with possibly imprecise time behavior is generally considered to be easy to achieve. Why?   What must be done if you always want to have a precise timing behavior, if necessary with approximate values? Please describe this in keywords, but with as much detail as possible.

IMAM NAME: 3 Heuristicsf Assume h is an admissible heuristic. What about h2 and Vh? Are they also admissible? What will be the advantage or disadvantage of using h2 or vh in the A algorithm instead of h? Give your answers separately for h2 and Vh!

After an exhaustive list of all of the mathematical operations has been collected, the steps in that list should be organized in a methodical fashion.

An algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. Is there any way to compare two different algorithms targeting same problem? Briefly explain the efficiency measures or an algorithm.

Discuss at length the measurement of the time and space consumed by an algorithm in order to determine its efficiency.

Case Study 3 Part 1 - Euclidean Algorithm 1. Use the Euclidean Algorithm to find the greatest common divisor of ( integers 396 and 480. (Show all workings) Part 2 Problem: Measuring Efficiency One challenge we will face is how to compare the efficiencies of two or more algorithms, to determine which is more efficient. We will have to use a common measure for example time or space First, we must determine what is most important to us (time or space or some other measure). Then compare the efficiencies (e.g., how much time each algorithm takes to execute, or how much space each algorithm uses). The challenge of timing an algorithm may introduce unwanted bias or overheads, therefore, we need a method that makes comparison fair. We are usually interested in the order of growth of the running time of an algorithm, not in the exact running time. Asymptotic notation gives us a method for classifying functions according to their rate of growth. Scenario: Bigi-Xam 9.0 is a mobile app…

After an exhaustive list of all of the mathematical operations has been collected, the steps in that list should be organised in a methodical fashion.