Computer Science Homework Solutions
#197805
Algorithm - Four prospectors with only one lantern must walk through a mineshaft.
Four prospectors with only one lantern must walk through a mineshaft. At most, two prospectors can travel together and any prospector in the shaft must be with the lantern. The prospectors, named Andrews, Blake, Johnson, and Kelly, can walk through the shaft in one minute, two minutes, four minutes, and eight minutes, respectively. When two walk together they travel at the speed of the slower prospector. How can the prospectors get through the mineshaft in only 15 minutes? After you have solved this problem, explain how you got your foot in the door.
Discussion of the solution to the prospectors/mineshaft problem.
What is this?
By OTA - Overall OTA Rating
James Achuff, MBA - 4.9/5
Purchase Cost Now
$2.19 CAD (was ~$3.99)
Included in Download
- Plain text response
- Attached file(s):
- 197805.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Write an algorithm, using pseudo code, to perform the following task: Given a string of numbers, identify all of the substrings that form numbers that are divisible by 3. For example, applying the algorithm on the string 37540 should produce the following substrings (not necessarily in this order): 0; 3; 75; 54; 375; 540 - 1.Write an algorithm, using pseudo code, to perform one of the following tasks,* Given a string of numbers, identify all of the substrings that form numbers that are divisible by 3. For example, apply ...
- Ambiguity in a proposed algorithm - Explain the distinction between an ambiguity in a proposed algorithm and an ambiguity in the representation of an algorithm.
- Automata and Computability - Describe the error in the following fallacious “proof” that P NP. Consider an algorithm for SAT: “On input , try all possible assignments to the variables. Accept if any satisfy ...
- Decryption algorithm - Using RSA, choose p = 5 and q = 7, encode the phrase “hello”. Apply the decryption algorithm to the encrypted version to recover the original plain text message.
- This problem is about the Floyd-Warshall all pairs shortest paths algorithm - see attachment
