Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 5, Problem 18CRP
Four prospectors with only one lantern must walk through a mine shaft. 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 all four prospectors get through the mine shaft in only 15 minutes? After you have solved this problem, explain how you got your foot in the door.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Story:
Once upon a time a farmer went to a
market and purchased a wolf, a goat,
and a cabbage. On his way home,
the farmer came to the bank of a
river and rented a boat. But crossing
the river by boat, the farmer could
carry only himself and a single one
of his purchases: the wolf, the goat,
or the cabbage.
If left unattended together, the wolf
would eat the goat, or the goat
would eat the cabbage.
Problem:
Create a Flowchart and Algorithm of all the possible solutions on how the farmer carry himself
and his purchases to the far bank of the river, leaving each purchase intact.
Varian and Mateo are alchemists trying to outdo each other. Varian has created a magical device that converts lead into gold, and it works as follows. It has two receptacles. In the first, he places lead bars, in the second, he places one gold bar, and after muttering a magical incantation, the amazing device replicates whatever is in receptacle 2 as many times as there are lead bars in receptacle 1. Unfortunately though, there is a price to all this magic, and one of the lead bars in receptacle 1 gets consumed (see figure below). Varian doesn't mind too much though, because his device is built robustly, and he can just use it again with all the gold he already has in receptable 2, and the lead bars in receptacle 1.
Mateo has only recently completed his apprenticeship and wants to prove that he is just as good as Varian, so upon seeing Varian's demonstration, claims that he can do just as well. Mateo is actually quite brilliant and succeeds at making a device that resembles…
A standard science experiment is to drop a ball and see how high it bounces. Once the “bounciness” of the ball has been determined, the ratio gives a bounciness index.
For example, if a ball dropped from a height of 10 feet bounces 6 feet high, the index is 0.6, and the total distance traveled by the ball is 16 feet after one bounce. If the ball were to continue bouncing, the distance after two bounces would be 10 ft + 6 ft +6 ft + 3.6 ft = 25.6 ft. Note that the distance traveled for each successive bounce is the distance to the floor plus 0.6 of that distance as the ball comes back up.
Write a program that lets the user enter the initial height from which the ball is dropped, the bounciness index, and the number of times the ball is allowed to continue bouncing. Output should be the total distance traveled by the ball.
Below is an example of the program input and output:
Enter the height from which the ball is dropped: 25
Enter the bounciness index of the ball: .5
Enter the number of…
Chapter 5 Solutions
Computer Science: An Overview (12th Edition)
Ch. 5.1 - Prob. 1QECh. 5.1 - Prob. 2QECh. 5.1 - Prob. 3QECh. 5.1 - Suppose the insertion sort as presented in Figure...Ch. 5.2 - A primitive in one context might turn out to be a...Ch. 5.2 - Prob. 2QECh. 5.2 - The Euclidean algorithm finds the greatest common...Ch. 5.2 - Describe a collection of primitives that are used...Ch. 5.3 - Prob. 2QECh. 5.3 - Prob. 3QE
Ch. 5.3 - Prob. 4QECh. 5.4 - Modify the sequential search function in Figure...Ch. 5.4 - Prob. 2QECh. 5.4 - Some of the popular programming languages today...Ch. 5.4 - Suppose the insertion sort as presented in Figure...Ch. 5.4 - Prob. 5QECh. 5.4 - Prob. 6QECh. 5.4 - Prob. 7QECh. 5.5 - What names are interrogated by the binary search...Ch. 5.5 - Prob. 2QECh. 5.5 - What sequence of numbers would be printed by the...Ch. 5.5 - What is the termination condition in the recursive...Ch. 5.6 - Prob. 1QECh. 5.6 - Give an example of an algorithm in each of the...Ch. 5.6 - List the classes (n2), (log2n), (n), and (n3) in...Ch. 5.6 - Prob. 4QECh. 5.6 - Prob. 5QECh. 5.6 - Prob. 6QECh. 5.6 - Prob. 7QECh. 5.6 - Suppose that both a program and the hardware that...Ch. 5 - Prob. 1CRPCh. 5 - Prob. 2CRPCh. 5 - Prob. 3CRPCh. 5 - Select a subject with which you are familiar and...Ch. 5 - Does the following program represent an algorithm...Ch. 5 - Prob. 6CRPCh. 5 - Prob. 7CRPCh. 5 - Prob. 8CRPCh. 5 - What must be done to translate a posttest loop...Ch. 5 - Design an algorithm that when given an arrangement...Ch. 5 - Prob. 11CRPCh. 5 - Design an algorithm for determining the day of the...Ch. 5 - What is the difference between a formal...Ch. 5 - Prob. 14CRPCh. 5 - Prob. 15CRPCh. 5 - The following is a multiplication problem in...Ch. 5 - Prob. 17CRPCh. 5 - Four prospectors with only one lantern must walk...Ch. 5 - Starting with a large wine glass and a small wine...Ch. 5 - Two bees, named Romeo and Juliet, live in...Ch. 5 - What letters are interrogated by the binary search...Ch. 5 - The following algorithm is designed to print the...Ch. 5 - What sequence of numbers is printed by the...Ch. 5 - Prob. 24CRPCh. 5 - What letters are interrogated by the binary search...Ch. 5 - Prob. 26CRPCh. 5 - Identity the termination condition in each of the...Ch. 5 - Identity the body of the following loop structure...Ch. 5 - Prob. 29CRPCh. 5 - Design a recursive version of the Euclidean...Ch. 5 - Prob. 31CRPCh. 5 - Identify the important constituents of the control...Ch. 5 - Identify the termination condition in the...Ch. 5 - Call the function MysteryPrint (defined below)...Ch. 5 - Prob. 35CRPCh. 5 - Prob. 36CRPCh. 5 - Prob. 37CRPCh. 5 - The factorial of 0 is defined to be 1. The...Ch. 5 - a. Suppose you must sort a list of five names, and...Ch. 5 - The puzzle called the Towers of Hanoi consists of...Ch. 5 - Prob. 41CRPCh. 5 - Develop two algorithms, one based on a loop...Ch. 5 - Design an algorithm to find the square root of a...Ch. 5 - Prob. 44CRPCh. 5 - Prob. 45CRPCh. 5 - Design an algorithm that, given a list of five or...Ch. 5 - Prob. 47CRPCh. 5 - Prob. 48CRPCh. 5 - Prob. 49CRPCh. 5 - Prob. 50CRPCh. 5 - Prob. 51CRPCh. 5 - Does the loop in the following routine terminate?...Ch. 5 - Prob. 53CRPCh. 5 - Prob. 54CRPCh. 5 - The following program segment is designed to find...Ch. 5 - a. Identity the preconditions for the sequential...Ch. 5 - Prob. 57CRPCh. 5 - Prob. 1SICh. 5 - Prob. 2SICh. 5 - Prob. 3SICh. 5 - Prob. 4SICh. 5 - Prob. 5SICh. 5 - Is it ethical to design an algorithm for...Ch. 5 - Prob. 7SICh. 5 - Prob. 8SI
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Describe in general how youd remove any continue statement from a loop in a program and replace it with some st...
Java How To Program (Early Objects)
In an inheritance relationship, the _____ is the specialized class. a. superclass b. master class c. subclass d...
Starting Out with Programming Logic and Design (4th Edition)
The _____ statement causes _____ a loop to skip the remaining statement in the current iteration.
Starting Out with C++ from Control Structures to Objects (9th Edition)
In Exercises 49 through 54, find the value of the given function.
Introduction to Programming Using Visual Basic (10th Edition)
Modify the temperature conversion program to print a heading above the table.
C Programming Language
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Blue-Eyed Island: A group of individuals live on an island until a visitor arrives with an unusual order: all blue-eyed people must leave the island as quickly as possible. Every evening at 8:00 p.m., a flight will depart. Everyone can see everyone else's eye colour, but no one knows their own (nor is anyone allowed to tell them). Furthermore, they have no idea how many people have blue eyes, but they do know that at least one person does. How long will it take for the blue-eyed individuals to leave?arrow_forwardMoon effect. Some people believe that the Moon controls their activities. If the Moon moves from being directly on the opposite side of Earth from you to being directly overhead, by what percentage does (a) the Moon's gravitational pull on you increase and (b) your weight (as measured on a scale) decrease? Assume that the Earth-Moon (center-to-center) distance is 3.82 x 10° m, Earth's radius is 6.37 x 106 m, Moon's mass is 7.36 x 1022 kg, and Earth's mass is 5.98 x 1024 kg. (a) Number 6.89 Units percent (b) Number i 6.8713e-4 Units percentarrow_forwardA hungry mouse wants to eat all four fruits in a maze such as the one below, in as few moves as possible.. At each turn the mouse can move any number of squares in one of the directions up, down, left or right, but it is not allowed to enter (or jump over) any walls (i.e., the black squares). Thus, the mouse moves just like a rook in chess. To eat a fruit, the mouse has to stop at that square. Assume that the maze has 4 fruits, and the size of b xh squares. 1. Give a suitable representatión of the states in this searching problem. 2. How many possible actions can the mouse perform at each move? (1.e., what is the branching factor?)arrow_forward
- Limurians live on the planet Lemuria where the passage of time is measured in lims (days), limhas (weeks),limahas (months) and limaals (years), where each limha (week) has 5 lims (days), and each limaha (month) has3 limhas (weeks) and each limaal (year) has 10 limahas (months).Given the name of a Limurian and the number of lims (days) the Limurian has lived on the planet, write aPython program to compute and print the Limurian’s age in limaals (years), limahas (months), limas (weeks)and lims (days).Call the file containing your program limurian_age.py.Sample input (shown in bold blue) and output from the program is as follows:Please enter Limurian's name: LimardPlease enter the number of lims that the Limurian has lived for: 3547Limurian Limard is 23 limaal(s), 6 limaha(s), 1 limha(s), and 2 lim(s)old.arrow_forwardMr Monkey is standing in front of a row of banana trees on Skull Island which actually belong to his rival King Kong. The banana trees are unusually high on that island. He wants to steal as many bananas as possible. Here is his plan. He will climb up one of the trees and then keep jumping from one tree to the immediately next one, while collecting all the bananas from each of them. But he will not switch the direction of his jumps. No longer being the agile young monkey he once used to be, he can only jump a total distance of L, after which he will climb down and run away before Kong crushes his head. Let the trees be labelled as t1, t2, ·.· tn. Let v;, Vi = 1, 2, · ..n be the number of bananas in tree t;. Further, let l;, i = 1,2, Can you write an algorithm to help Mr. Monkey steal as many bananas as possible ? Your algorithm should be a polynomial in n, L. Please show all the steps of DP as in the sample solution - subproblem definition, recurrences, pseudocode, runtime . (Statutory…arrow_forwardOn an island, a group of people are living until a visitor arrives with an odd directive: everyone with blue eyes must leave the island as quickly as possible. Every evening, a flight will depart at 8:00. Everyone can see the colour of everyone else's eyes, but they are blind to their own (nor is anyone allowed to tell them). They also do not know the number of persons who have blue eyes, but they do know that at least one person has them. How long will it take the folks with blue eyes to leave?arrow_forward
- • A circuit consists of a 12 V battery connected across a single resistor. If the current in the circuit is 3 A, calculate the size of the resistor. If a small appliance is rated at a current of 10 amps and a voltage of 120 volts, the power rating would be?.arrow_forwardYou visit an island of Knights, Knaves, and Spies. Knights always tell the truth, Knaves always lie, while Spies can say anything (truth or lie). You meet three inhabitants, John, Bill, and Tom. One is a Knight, one is a Knave, and one is a Spy. John says: “I am a knight", Bill says: “John is telling the truth," and Tom says: “I am the spy!". Determine what type of people John, Bill, and Tom arearrow_forwardMark loves to move fast. So he made a spaceship that works in 4-dimensional space. He wants to use the spaceship to complete missions as fast as possible. In each mission, the spaceship starts at (0, 0, 0, 0) and needs to end up at (a, b, c, d). To do this, he instructs the spaceship's computer to execute a series of moves, where each move is a unit step in one of the eight cardinal directions: (+1,0,0,0). (0,1,0,0), (0, 0, 1,0), (0, 0, 0, 1). Unfortunately, he also moved fast when building the spaceship, so there is a bug in the spaceship's code. The first move will be executed once, the second move will be executed twice, the third move will be executed thrice, and so on. In general, the i-th move will be executed ¿ times. For any four integers a, b, c, d, let f(a, b, c, d) be the minimum number of moves of a mission that ends up at (a, b, c, d). Compute the sum of f(a, b, c, d) over all points (with integer coordinates) such that A < a < A-Barrow_forwardOn Smullyan's Island, a place in which all inhabitants are either liars or truth- tellers, you come across two inhabitants, one named Daryl and the other named Rosita. Daryl says to you: "Neither of us are truth-tellers". What is Rosita? O There is not enough information Rosita is a truth-teller There is no Rosita O Rosita is a liararrow_forwardThere are four people who want to cross a rickety bridge; they all begin on the same side. You have 17 minutes to get them all across to the other side. It is night, and they have one flashlight. A maximum of two people can cross the bridge at one time. Any party that crosses, either one or two people, must have the flashlight with them. The flashlight must be walked back and forth; it cannot be thrown, for example. Person 1 takes 1 minute to cross the bridge, person 2 takes 2 minutes, person 3 takes 5 minutes, and person 4 takes 10 minutes. A pair must walk together at the rate of the slower person's pace. Write the specification of an algorithm that solves the problem.arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. Sasha likes exploring diverse mathematical articles, for instance, wizardry squares. However, Sasha comprehends that enchanted squares have as of now been examined by many individuals, so he sees no feeling of concentrating on them further. All things considered, he designed his own kind of square — a superb square. A square of size n×n is called prime if the accompanying three conditions are held all the while: all numbers on the square are non-negative integers not surpassing 105; there are no indivisible numbers in the square; amounts of integers in each line and every segment are indivisible numbers. Sasha has an integer n. He requests you to view as any great square from size n×n. Sasha is certain beyond a shadow of a doubt such squares exist, so help him! Input The principal line contains a solitary integer t (1≤t≤10) — the number of experiments. Every one…arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Java random numbers; Author: Bro code;https://www.youtube.com/watch?v=VMZLPl16P5c;License: Standard YouTube License, CC-BY