Write an algorithm in to solve a problem of your interest and evaluate your algorithm's goodness. (Python Language)
1. Clearly state what is the problem of your interest
2. Represent your algorithm in pseudo code. Note that each step in the algorithm must be a primitive with a clear definition without ambiguity for a computer (machine or human) to execute. For example, you can assume the step to \click on a html hyperlink" a primitive in your algorithm. You can also assume "Extract the email address of person X from Web page" is a primitive for a human since human is able to retrieve the information easily.
Here is an example of a similar problem in pseudo code that searches contact information and only searches the top ten links on the search results.
(I need another algorithm like this that follows the stated instructions above.):
procedure Search(PersonName, Institute)
goto www.google.com
input PersonName + institute as keywords to the search box on Google
n = 0
while (n < 10):
n = n + 1
click the nth link on the list of search results
if (email and phone number of PersonName at Institute found):
write down the email and phone numbers
declare search as a success and stop the search
Write an algorithm in to solve a problem of your interest and evaluate your algorithm's goodness....
In terms of the programming language required, the algorithm needs to be written in pseudocode Dynamic Programming Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be 0-red. 1-yellow, 2-blue, 3-pink. , c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4...
In terms of the programming language required, the algorithm needs to be written in pseudocode Dynamic Programming Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be 0-red. 1-yellow, 2-blue, 3-pink. , c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4...
i need the solution in pseudo code please. 4 Dynamic Programmii Consider the following problem based on the transformation of a sequence (or collection) of coloured disks. Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, cl. For example, the colour mapping might be: O-red, 1-yellow, 2-blue, 3-pink,. c-black For a given sequence of coloured disks eg.,0,1,2,3,4), at each time step (or iteration) you are only...
Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be: O-red, 1-yellow, 2-blue, 3-pink. ..., c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4 ), at each time step (or iteration) you are only allowed to perform one of three basic...
Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be: O-red, 1-yellow, 2-blue, 3-pink. ..., c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4 ), at each time step (or iteration) you are only allowed to perform one of three basic...
Python Help Please! This is a problem that I have been stuck on.I am only suppose to use the basic python coding principles, including for loops, if statements, elif statements, lists, counters, functions, nested statements, .read, .write, while, local variables or global variables, etc. Thank you! I am using python 3.4.1. ***( The bottom photo is a continuation of the first one)**** Problem statement For this program, you are to design and implement text search engine, similar to the one...
Read the case study "Google, Apple, and Facebook Struggle for Your Internet Experience" on page 255. Then discuss the advantages and disadvantages for each company. BUSINESS PROBLEM-SOLVING CASE Google, Apple, and Facebook Battle for Your Internet Experience Apple has a legacy of innovation on its side. In Three Internet titans Google, Apple, and 2011, it unveiled the potentially market disrupting Facebook are in an epic struggle to dominate your Siri (Speech Interpretation and Recognition Internet experience, and caught in the...
First, read the article on "The Delphi Method for Graduate Research." ------ Article is posted below Include each of the following in your answer (if applicable – explain in a paragraph) Research problem: what do you want to solve using Delphi? Sample: who will participate and why? (answer in 5 -10 sentences) Round one questionnaire: include 5 hypothetical questions you would like to ask Discuss: what are possible outcomes of the findings from your study? Hint: this is the conclusion....