Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 11, Problem 53CRP
Program Plan Intro
Production system:
It is a collection of attributes of the problem such as components, collection of states, collection of rules, and collection of moves.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Consider the following design problem. A farmer is building a wire fence on his land. He has planted N wooden posts into the ground but has not put wire between them yet. The positions of these wooden posts are final; they cannot be moved. Wire placed between posts follows a straight line, and the farmer must place wire between the posts such that it forms an enclosure.
The farmer is smart and will not allow the wires to cross. See the figure below, where the posts are the circles, and the lines are the wire (ignore the post numbering). However, the farmer would like the fence to enclose as much land as possible. He is willing to let some of his posts go unused (that is, not be part of the wire fence), so long as it maximizes the amount of land that the fence encloses.
What algorithm would you use to solve this problem? Give a brief description of how it would work and the asymptotic run time as a function of N.
a) Explain on Simulated Annealing algorithm behaves at very high temperatures,
and how it behaves at very low temperatures.
(b) Imagine the implementation of Simulated Annealing algorithm in real life. Let's
say, you have a caretaker at your home. Your home has a garden and it has a
fountain with a network of pipes that contains 150 faucets. You informed your
caretaker that you are going for short holiday to Langkawi for 3 days and when
you return you would like the fountain to spray as high as possible. Your
caretaker knows that it is impossible to check all faucets within 3 days to obtain
an optimal setting. You can use Simulated Annealing algorithm to maximize the
height of the fountain, also can assume whether a faucet can be ON or OFF and
measuring the water height. Adding to that, you can make any other
assumptions required for this scenario, explain clearly using Simulated Annealing
algorithm.
A wave is modeled by the wave function:
y (x, t) = A sin [ 2π/0.1 m (x - 12 m/s*t)]
Construct on the computer, in the same graph, the dependence of y (x, t) from x on t = 0 and t = 5 s in case the value of amplitude A corresponds to the first letter of your name: letter V
A. A=0.1 mB. A=0.15 mC. A=0.2 mÇ. A=0.25 mD. A=0.3 mDh. A=0.35 mE. A=0.4 mË. A=0.45 mF. A=0.5 m
G. A=0.55 mGj. A=0.6 mH. A=0.65 mI. A=0.7 mJ. A=0.75 mK. A=0.8 mL. A=0.85 mLl. A=0.9 mM. A=0.95 m
N. A=1.05 mNj. A= 1.1 mO. A=1.15 mP. A=1.2 mQ. A=1.25 mR. A=1.3 mRr. A=1.35 mS. A=1.4 mSh. A=1.45 m
T. A=1.5 mTh. A=1.55 mU. A=1.6 mV. A=1.65 mX. A=1.7 mXh. A=1.75 mY. A=1.8 mZ. A=1.85 mZh. A=1.9 m
After constructing the graph, make the appropriate interpretations and comments from the result that you got graphically.
How much is the wave displaced during the time interval from t = 0 to t = 5 s? Does it match this with the graph results? Justify your answer. Is the material transported long wave displacement? If yes, how much…
Chapter 11 Solutions
Computer Science: An Overview (12th Edition)
Ch. 11.1 - Prob. 1QECh. 11.1 - Prob. 2QECh. 11.1 - Prob. 3QECh. 11.1 - Prob. 4QECh. 11.1 - Prob. 5QECh. 11.2 - Prob. 1QECh. 11.2 - Prob. 2QECh. 11.2 - Prob. 3QECh. 11.2 - Prob. 4QECh. 11.2 - Identify the ambiguities involved in translating...
Ch. 11.2 - Prob. 6QECh. 11.2 - Prob. 7QECh. 11.3 - Prob. 1QECh. 11.3 - Prob. 2QECh. 11.3 - Prob. 3QECh. 11.3 - Prob. 4QECh. 11.3 - Prob. 5QECh. 11.3 - Prob. 6QECh. 11.3 - Prob. 7QECh. 11.3 - Prob. 8QECh. 11.3 - Prob. 9QECh. 11.4 - Prob. 1QECh. 11.4 - Prob. 2QECh. 11.4 - Prob. 3QECh. 11.4 - Prob. 4QECh. 11.4 - Prob. 5QECh. 11.5 - Prob. 1QECh. 11.5 - Prob. 2QECh. 11.5 - Prob. 3QECh. 11.5 - Prob. 4QECh. 11.6 - Prob. 1QECh. 11.6 - Prob. 2QECh. 11.6 - Prob. 3QECh. 11.7 - Prob. 1QECh. 11.7 - Prob. 2QECh. 11.7 - Prob. 3QECh. 11 - Prob. 1CRPCh. 11 - Prob. 2CRPCh. 11 - Identify each of the following responses as being...Ch. 11 - Prob. 4CRPCh. 11 - Prob. 5CRPCh. 11 - Prob. 6CRPCh. 11 - Which of the following activities do you expect to...Ch. 11 - Prob. 8CRPCh. 11 - Prob. 9CRPCh. 11 - Prob. 10CRPCh. 11 - Prob. 11CRPCh. 11 - Prob. 12CRPCh. 11 - Prob. 13CRPCh. 11 - Prob. 14CRPCh. 11 - Prob. 15CRPCh. 11 - Prob. 16CRPCh. 11 - Prob. 17CRPCh. 11 - Prob. 18CRPCh. 11 - Give an example in which the closed-world...Ch. 11 - Prob. 20CRPCh. 11 - Prob. 21CRPCh. 11 - Prob. 22CRPCh. 11 - Prob. 23CRPCh. 11 - Prob. 24CRPCh. 11 - Prob. 25CRPCh. 11 - Prob. 26CRPCh. 11 - Prob. 27CRPCh. 11 - Prob. 28CRPCh. 11 - Prob. 29CRPCh. 11 - Prob. 30CRPCh. 11 - Prob. 31CRPCh. 11 - Prob. 32CRPCh. 11 - Prob. 33CRPCh. 11 - What heuristic do you use when searching for a...Ch. 11 - Prob. 35CRPCh. 11 - Prob. 36CRPCh. 11 - Prob. 37CRPCh. 11 - Prob. 38CRPCh. 11 - Suppose your job is to supervise the loading of...Ch. 11 - Prob. 40CRPCh. 11 - Prob. 41CRPCh. 11 - Prob. 42CRPCh. 11 - Prob. 43CRPCh. 11 - Prob. 44CRPCh. 11 - Prob. 45CRPCh. 11 - Prob. 46CRPCh. 11 - Prob. 47CRPCh. 11 - Prob. 48CRPCh. 11 - Draw a diagram similar to Figure 11.5 representing...Ch. 11 - Prob. 50CRPCh. 11 - Prob. 51CRPCh. 11 - Prob. 52CRPCh. 11 - Prob. 53CRPCh. 11 - Prob. 54CRPCh. 11 - Prob. 55CRPCh. 11 - Prob. 56CRPCh. 11 - Prob. 57CRPCh. 11 - Prob. 1SICh. 11 - Prob. 2SICh. 11 - Prob. 3SICh. 11 - Prob. 4SICh. 11 - Prob. 5SICh. 11 - Prob. 6SICh. 11 - Prob. 7SICh. 11 - Prob. 8SICh. 11 - Prob. 9SICh. 11 - Prob. 10SICh. 11 - Prob. 11SICh. 11 - Prob. 12SICh. 11 - A GPS in an automobile provides a friendly voice...Ch. 11 - Prob. 14SI
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
- Consider the following AND/OR graph to describe a simple automobile diagnostic system using IF-THEN rules. ... the problem is X Rule 3: the problem is the starter motor Rule 1: the problem is spark plugs Rule 2: the problem is battery or cables the engine the engine is will turn the engine does not turn over the lights do not the engine does not the lights do come getting gas over turn over come on on Rule 4: the engine is getting gas gas in fuel tank gas in carburetor Do you recommend data-driven or goal-driven search in this graph if we are diagnosing a problem with the automobile? Breadth-first or depth-first search? In what ways could heuristics assist the search? Justify your answers to these questions.arrow_forwardA wave is modeled by the wave function: y (x, t) = A sin [ 2π/0.1 m (x - 12 m/s*t)] y1 (t) = A sin (2πf1t) y2 (t) = A sin (2πf2t) Using any computer program, construct the wave dependency graph resultant y (t) from time t in the case when the frequencies of the two sound waves are many next to each other if the values are given: A = 1 m, f1 = 1000 Hz and f2 = 1050 Hz. Comment on the results from the graph and determine the value of the time when the waves are with the same phase and assemble constructively and the time when they are with phase of opposite and interfere destructively. Doing the corresponding numerical simulations show what happens with the increase of the difference between the frequencies of the two waves and vice versa.arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. The train framework can be addressed as directions on a 2D plane. The I-th train beginning at the base end is at first at (i,0) and will be at (i,T) after T minutes, and the I-th train beginning at the left end is at first at (0,i) and will be at (T,i) after T minutes. All trains show up at their objections following 101 minutes. In any case, Gildong observed that a few trains booked to leave at a particular time, at the same time, are extremely hazardous. As of now, n trains are planned to leave from the base end and m trains are booked to withdraw from the left end. In the event that two trains are both at (x,y) simultaneously for some x and y, they will collide with one another. In this way, he is requesting you to observe the base number from trains that ought to be dropped to forestall every such accident. Input Each test contains at least one experiments. The main line contains the number of…arrow_forward
- Can you please help me with this problem because I don't understand how to do this, I need some visual like drawing the pushdown automaton for this problem. Can you please do it step by step so I can follow along like can you show me the state diagram for the pushdown automaton. I only need help with question 2.10 but to answer 2.10 you need the question for 2.9 which I have added the questions below. Again I only need help with question 2.10. question I need help with:2.9 Give a context-free grammar that generates the language A = {a i b j c k | i = j or j = k where i, j, k ≥ 0}. Is your grammar ambiguous? Why or why not? 2.10 Give an informal description of a pushdown automaton that recognizes the language A in Exercise 2.9.arrow_forwardThe missionaries and cannibals problem is usually stated as follows. Three mission- aries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Find a way to get everyone to the other side, without ever leaving a group of mis- sionaries in one place outnumbered by the cannibals in that place. This problem is famous in AI because it was the subject of the first paper that approached problem formulation from an analytical viewpoint (Amarel, 1968). a. Formulate the problem precisely, making only those distinctions necessary to ensure a valid solution. Draw a diagram of the complete state space. b. Implement and solve the problem optimally using an appropriate search algorithm. Is it a good idea to check for repeated states? c. Why do you think people have a hard time solving this puzzle, given that the state space is so simple?arrow_forwardChemical reaction rates are proportional to a rate constant, k, which changes with temperature according to the Arrhenius equation k=k0e-Q/RT For a certain reaction Q = 8,000 cal/mole R = 1.987 cal/mole K k 0 = 1200 min 1 k0=1200min-1 For this question you will need to draw a graph in Matlab for the values of k for temperatures from 100 K to 500 K, in 15-degree increments.arrow_forward
- c. Analyze your DFA simulator pseudo-code to show its worst-case asymptotic complexity. Give your final answer in Big-Oh notation, and be sure to explain why it is so (e.g. by referring to lines in your pseudo-code).arrow_forwardQuestion solve this equation (S+T*U)/(V-W)^2 by using Little man computer (LMC) simulator. you can use input S=10, T=2, U=3, V=6 and W=4 and expected output will be 6,16,2,4,4. please show the full codes. note that the simulation only use mnemonic code, there is no function MUL or DIV in little man computer or else it will not working. PLEASE DO NOT ANSWER IF YOU ARE GOING TO USE MUL or DIV IN THE CODE! Thank you. Mnemonic ADD SUB STA LDA BRA BRZ BRP INP OUT HLT DAT Instruction Add Subtract Store Load Branch always Branch if zero Branch if positive Input Output End program Data locationarrow_forwardI need help with this problem involving Boolean variables and I am absolutely lost on this problem since I never seen anything like it. If (f(w,x,y,z) = (x+yz) + (wx). What is f(1,0,0,0) There is a line over (x+yz), there is a line over letter z, and there is a line over letter w.arrow_forward
- Give the initial state, goal test, actions/operators, and path cost for the following description. There are several possible formulations for the problem, with varying levels of detail. Pay special attention to different path costs for various actions, and conditions for when those actions are valid. The main thing is that your formulation should be precise and “hang together” so that it could actually be implemented. A monkey is in a room with a crate, with bananas suspended just out of reach on the ceiling. He would like to get the bananasarrow_forwardWrite Java programs for Algorithm 3.1. (Binomial Coefficient using Divide-and-Conquer) and Algorithm 3.2. (Binomial Coefficient using Dynamic Programming) and evaluate their performances using different problem instances. Explain what happens when k increases.arrow_forwardChoose an elliptic curve and three points P,Q,R and construct via acomputer program (e.g. Geogebra) the two points (P ⊕ Q) ⊕ R andP ⊕ (Q ⊕ R). Drag the dots and explore what that means for associativity.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education