EBK COMPUTER SCIENCE: AN OVERVIEW
12th Edition
ISBN: 8220102744196
Author: BRYLOW
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 11, Problem 33CRP
Program Plan Intro
Heuristic search:
Heuristic search method is a method of search in which goal is achieved by searching the heuristic value. The heuristic value may be based on a heuristic function. The node with highest heuristic value is chosen first as compared to other nodes which have a lower heuristic value.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Consider navigating the maze shown below (same maze used in the homework).
(N
M
4
2
K
2
2
2
E
B
G
2
2
F
H
2
The maze is represented as a graph with edge costs as shown on the edges. The edge cost is 1 for all edges where the cost is not shown. Let B be the initial state and G is the goal state. The heuristic cost of every node to reach G is :
h(n)
Th
A
5.1
B
4.1
C
3.9
D
14
E
2.2
IF
3.8
G
0
IH
3.7
IJ
7
IK
16
L
14
IM
0.5
IN
1.5
IP
1.8
S
4.5
Show the steps of an A* search starting from B to goal G:
.
Show the frontier and explored set in every iteration (i.e., complete the above table)
List the vertices in the order they are expanded.
an iterative algorithm for separating n VLSI chips into those that are good and those that are bad by testing two chips at a time and learning either that they are the same or that they are different. To help, at least half of the chips are promised to be good. Now design (much easier) a randomized algorithm for this problem. Here are some hints.Randomly select one of the chips.
What is the probability that the chip is good? How can you learn whether or not the selected chip is good? If it is good, how can you easily partition the chips into good and bad chips? If the chip is not good, what should your algorithm do? When should the algorithm stop? What is the expected running time of this algorithm?
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem:
An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose.
The community must file the class action suit under these conditions:
- The three applicants must reach the destination city;
- Only two people can travel per trip in the Van (small town - city, city - small town);
- There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made;
- The Van cannot be…
Chapter 11 Solutions
EBK COMPUTER SCIENCE: AN OVERVIEW
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
- 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.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_forwardIn attached image, there are 5 states, a, b, c, d, e. Two actions are available for each state: East, West except for the exit states a and e, where the only action available is “Exit”. The transition is deterministic. The rewards of the exit states are given as shown in Image. A) For γ= 1, what is the true utility ? (Please fill the form completely) Example response format: 10 10 10 10 10 (Please note the space!) B) For γ = 0.1, what is the true utility? Example response format: 10 0.1 10 10 0.1 (Please pay attention to the space!) C) For which γ are West and East equally good at state d? (please take to the fourth decimal place)Example response format: γ = 0.1234 (take to the fourth decimal place, please pay attention to the space!)arrow_forward
- Write and implement the best first search algorithm where we have given the Start state and Goal state and we want to reach the goal state. 4 7 3 1 8 2 5 6 Initial state 1 2 3 8 4 7 6 5 Goal statearrow_forwardfor x= 0,1,2,4,5,6arrow_forwardCorrect answer will be upvoted else downvoted. There are n focuses on an endless plane. The I-th point has facilitates (xi,yi) to such an extent that xi>0 and yi>0. The directions are not really integer. In one maneuver you play out the accompanying activities: pick two focuses an and b (a≠b); move point a from (xa,ya) to either (xa+1,ya) or (xa,ya+1); move point b from (xb,yb) to either (xb+1,yb) or (xb,yb+1); eliminate focuses an and b. Notwithstanding, the move must be performed if there exists a line that goes through the new organizes of, another directions of b and (0,0). If not, the move can't be performed and the focuses stay at their unique directions (xa,ya) and (xb,yb), individually. Input The main line contains a solitary integer n (1≤n≤2⋅105) — the number of focuses. The I-th of the following n lines contains four integers ai,bi,ci,di (1≤ai,bi,ci,di≤109). The directions of the I-th point are xi=aibi and yi=cidi. Output :In the primary…arrow_forward
- One aspect of a simulated annealing cooling schedule is the temperature. i. Explain the effect of having the starting temperature too high or too low. ii. Describe how you can decide on a suitable starting temperature. iii. Discuss how you can decide on a final temperature. iv. State the two possible states of the Current from the algorithms in Figure Q5(a). v. Determine the probability of accepting the following moves based on the values given in the table assuming the problem is trying to maximise the objective function. (Justify your answer) Current Neighbourhood Current Temperature Evaluation Evaluation 100 95 20 350 325 10 23 54 276 19 5 3arrow_forwardAnswer this questions True or False : Q1:lf the learning rate is too small, then gradient descent may take a very long time to converge. Q2: If 00 and 01 are initialized at a local minimum, then one iteration will not change their values Q3: If 00 and 01 are initialized so that 00=01, then by symmetry (because we do simultaneous updates to the two parameters), after one iteration of gradient descent, we will still have 00=01arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. You should stop precisely one of these boards, at any subsequent you wish. Then, at that point, the boards adjoining it get stopped one second after the fact, the boards nearby those get stopped 2 seconds after the fact, etc. At the end of the day, in the event that you stop board x, board y (for all substantial y) would be stopped precisely |x−y| seconds after the fact. For instance, assume there are 4 boards, and the 3-rd board is stopped when the digit 9 is on it. The board 1 stops 2 seconds after the fact, so it has the digit 1; the board 2 stops 1 second after the fact, so it has the digit 0; the board 4 stops 1 second after the fact, so it has the digit 0. The subsequent 4-digit number is 1090. Note that this model isn't ideal for n=4. When all boards have been stopped, you compose the digits showed on them from left to right, to frame a n digit number (it can comprise of driving…arrow_forward
- USE EITHER PYTHON OR MAPLE FOR THESE (or matlab if you know it)DO NOT SOLVE THESE BY HAND. If you solve these by hand I will thumbs down your answer.arrow_forwardCorrect answer will be upvoted else downvoted. Computer science. You are permitted to alter the marks through the accompanying activity: Pick two particular integers I and j among 1 and n. Trade the marks of focuses I and j, lastly Draw the section between focuses I and j. A grouping of tasks is legitimate if in the wake of applying every one of the activities in the succession all together, the k-th point winds up having the name k for all k among 1 and n comprehensive, and the drawn sections don't meet each other inside. Officially, assuming two of the portions cross, they should do as such at a typical endpoint of the two sections. Specifically, all drawn portions should be unmistakable. Track down any legitimate arrangement of activities, or say that none exist. Input The main line contains an integer n (3≤n≤2000) — the number of focuses. The I-th of the accompanying n lines contains three integers xi, yi, man-made intelligence (−106≤xi,yi≤106,…arrow_forwardSuppose a train was supposed to start at station A, pause at stationsB, C, D, ... , Y, and finish at station Z. However, it did not arrive at Z. Suppose in yourfactory the piece of equipment or process labeled A makes part B work, which in turnmakes C, D, ... , and Z work. However, Z is not working. You want to find out why.What algorithm do you use? Think of other applications of this technique.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 Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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