Computer Science: An Overview (13th Edition) (What's New in Computer Science)
13th Edition
ISBN: 9780134875460
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 11, Problem 38CRP
Program Plan Intro
Production system:
To develop a machine for solving puzzles is an area of research for many years. To classify common characteristics of problem, there is an approach that is called production system. Production system consists of three main components. The three main components of production system are as follows:
- Collection of states is a collection of all situations that may occur during the achievement of goal.
- Collection of productions: A production is a move that may lead to a situation. Some productions may be eliminated depending upon their significance for desired goal.
- Control system refers to the logic that takes us towards goal. The control system identifies the significant moves out of several moves available.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Question
Harry has a big wall clock, that got hit while he was
playing. Now, the minute hand doesn't rotate by
the angle 2t/3600 each second, but now it moves
according to different angle x. You can assume that
coordinates of the centre of the clock are (0, 0) and
the length of the minute hand is I. One endpoint of
the minute hand is always located at the clock
centre; the other endpoint is initially located at the
point (0, 1). One second later, Harry observes that
this endpoint is at distance d above the x-axis, i.e.,
the y-coordinate of this endpoint is equal to d.
Harry is curious about where the minute hand will
be (specifically, its y-coordinate) after t seconds.
Because t can be very large, Harry can't wait for
that moment. Please help him to write a python
code that prints a single line containing the output.
Input:
422
Output
4
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 large apple farm distributes their apples in boxes that they can source from any one of a number of nearby
box manufacturers. Each box manufacturer makes only one box type that holds a specific number of apples
- so a box from one manufacturer might hold 24 apples, while a box from another might hold 13. The apple
farm can only choose one box supplier each year (a decision they make each year based on price), but they
can then order an unlimited number of boxes of that type.
The farm likes to be prepared, and creates large batches of apples to pack before the decision about which
box type to use has been made. The farm also likes to limit waste, and tries to set the number of apples
in these large batches such that they can fill an integer number of boxes perfectly with no apples left over.
In creating these batches, although the farm doesn't yet know the exact capacity of the boxes they will
buy, they know a list of possible values the box capacity will take. For example, if the…
Chapter 11 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
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.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 - Draw a diagram similar to Figure 11.5 representing...Ch. 11 - Prob. 47CRPCh. 11 - Prob. 48CRPCh. 11 - Prob. 49CRPCh. 11 - Prob. 50CRPCh. 11 - Prob. 51CRPCh. 11 - Prob. 52CRPCh. 11 - Prob. 53CRPCh. 11 - Prob. 54CRPCh. 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
Similar questions
- Every patient has a primary physician. Every doctor has at least one patient. Each pharmacy sells several drugs and has a price for each. A drug could be sold at several pharmacies, and the price could vary from one pharmacy to another. Doctors prescribe drugs for patients. A doctor could prescribe one or more drugs for several patients, and a patient could obtain prescriptions from several doctors. Each prescription has a date and a quantity associated with it. You can assume that, if a doctor prescribes the same drug for the same patient more than once, only the last such prescription needs to be stored. Pharmaceutical companies have long-term contracts with pharmacies. A pharmaceutical company can contract with several pharmacies, and a pharmacy can contract with several pharmaceutical companies. For each contract, you have to store a start date, an end date, and the text of the contract. Pharmacies appoint a supervisor for each contract. There must always be a supervisor for each…arrow_forwardConsider 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.arrow_forwardA medical Centre can have many doctors. A doctor can be scheduled for many appointments but may not have any scheduled appointment at all. A patient can schedule request for one or more appointments. However, every appointment is about only one patient. As a result of every appointment, there must be a bill. One payment is applied to exactly 1 bill, and 1 bill can be paid off over time by several payments. A bill can be outstanding, having nothing yet paid on it at all. One patient can make many payments, but a single payment is made by only 1 patient. Some patients are insured by an insurance company. If they are insured, they can only carry insurance with one company. An insurance company can have many patients carry their policies. For patients that carry insurance, the insurance company will make payments, each single payment is made by exactly 1 insurance company. (Hint: final ERD must include 7 tables.) a) Identify the entities with attributes and keys (primary and foreign keys).…arrow_forward
- As a teaching administrator of the department, your responsibility is to schedule the classes for a particular classroom. Suppose there are n classes, each class i is represented by its start time and finishing time [Si, fi], and we say that two classes i and j are non-conflicting if they do not overlap in time (i.e., sizfj or szfi). You want to schedule as many classes for the classroom as possible, but the scheduled classes should be non-conflicting. Develop an algorithm so that you can select the maximum number of classes for the classroom. (We are expecting either pseudocode or language description of your algorithm)arrow_forwardA produce dealer has a warehouse that stores a variety of fruits. He wants a machine capable of sorting the fruit according to the type. There is a conveyor belt on which the fruit is loaded. It is then passed through a set of sensors which measure 3 properties of the fruit: shape, texture, and weight. The sensor system is somehow rather primitive: • Shape sensor : -1 if the fruit is round and 1 if it is more elliptical• Texture sensor : -1 if the surface is smooth, 1 if it is rough• Weight sensor : -1 if the fruit is > 500g, 1 if is < 500g The sensor output will then be input to a Neural Networks based classifying system. As an AI Engineer you are supposed to design (draw the architecture and determine the optimal weight W and bias b) a simple neural network (could be a single perceptron) that can be used to recognize the fruit so that it can be directed to the correct storage bin. As a startup case, the simple network will only be used for two type of fruit i.e. banana and…arrow_forwardA produce dealer has a warehouse that stores a variety of fruits. He wants a machine capable of sorting the fruit according to the type. There is a conveyor belt on which the fruit is loaded. It is then passed through a set of sensors which measure 3 properties of the fruit: shape, texture, and weight. The sensor system is somehow rather primitive: • Shape sensor : -1 if the fruit is round and 1 if it is more elliptical • Texture sensor : -1 if the surface is smooth, 1 if it is rough • Weight sensor : -1 if the fruit is > 500g, 1 if is < 500g The sensor output will then be input to a Neural Networks based classifying system. As an AI Engineer you are supposed to design (draw the architecture and determine the optimal weight W and bias b) a simple neural network (could be a single perceptron) that can be used to recognize the fruit so that it can be dirccted to the correct storage bin. As a startup case, the simple network will only be used for two types of fruit i.e. banana and apple.…arrow_forward
- Mr 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_forwardYou and your friends decided to hold a “Secret Santa” gift exchange, where each person buys a gift for someone else. To see how this whole thing works, let’s consider the following example. Suppose there are 7 people A, B, C, D, E, F, and G. We denote x → y to mean “x gives a gift to y.” If the gift exchange starts with person A, then they give a gift to E. Then E gives a gift to B. And it is entirely possible that B gives a gift to A; in such a case we have completed a “cycle.” In case a cycle occurs, the gift exchange resumes with another person that hasn’t given their gift yet. If the gift exchange resumes with person D, then they give a gift to G. Then G gives a gift to F. Then F gives a gift to C. Then finally C gives a gift to D, which completes another cycle. Since all of the people have given their gifts, the giftexchange is done, otherwise the gift exchange resumes again with another person. All in all, there are two cycles that occurred during the gift exchange: A → E → B → A…arrow_forwardA materials engineer wants to study the effects of two different processes for sintering copper (aprocess by which copper powder coalesces into a solid but porous copper) on two different typesof copper powders. From each type of copper powder, she randomly selects two samples andthen randomly assigns one of the two sintering processes to each sample by the flip of a coin.The response of interest measured is the porosity of the resulting copper. Explain what type ofstudy this is and why.arrow_forward
- Three prisoners have been sentenced to long terms in prison, but due to over crowed conditions, one prisoner must be released. The warden devises a scheme to determine which prisoner is to be released. He tells the prisoners that he will blindfold them and then paint a red dot or blue dot on each forehead. After he paints the dots, he will remove the blindfolds, and a prisoner should raise his hand if he sees at least one red dot on the other two prisoners. The first prisoner to identify the color of the dot on his own forehead will be release. Of course, the prisoners agree to this. (What do they have to lose?) The warden blindfolds the prisoners, as promised, and then paints a red dot on the foreheads of all three prisoners. He removes the blindfolds and, since each prisoner sees a red dot (in fact two red dots), each prisoner raises his hand. Some time passes when one of the prisoners exclaims, "I know what color my dot is! It's red!" This prisoner is then released. Your problem…arrow_forwardYou, Alice and Bob manage "Robo-Pizzeria" a company that uses drones to deliver pizza. Here are some important features of your business model: • Drones can fly directly to a location so the time it takes to travel to a location is proportional to the distance between the two locations. • Delivery locations are given as points in a 2-dimensional plane. The Robo-Pizzeria is located at the origin (0,0). The first problem you are trying to solve is planning the route for your drone to follow while delivering pizzas to n locations. The route must leave from the Robo-Pizzeria, visit all locations, and return while travelling the minimum total distance. a) Show how you can turn these 4 delivery locations into a complete weighted graph with 5 nodes (including the Robo-Pizzeria at the origin) by stating the adjacency matrix for the graph. {(1, 1), (-2,-1), (2, 1), (-3,5)} (Since the graph is undirected you only need to state the upper triangle of the matrix.) b) Now describe the procedure you…arrow_forwardIn order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test case contains…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