Q5/ Consider the following search space in which the goal is to find the p from S to G, next(S,A,5), next(S,B,2),next(A,G,5), next (B,D,1), next(B,C,2), next (C,G,2), next(D,G,5), where next(X,Y,Z) means that Y is a child of X and the cost of going from X to Y is Z. ho(S)=0, ho(A)=0, ho(B)=0, ho(C)=0, ho(D)=0, ho(G)=0, h₁(S)=5, h₁(A)=3, h₁(B)=4, h₁(C)=2, h₁(D)=5, h₁(G)=0, h₂(S)=6, h₂(A)=5, h₂(B)=2, h₂(C)=5, h₂(D)=3, h₂(G)=0, Which of the above heuristic functions ho,h₁ and h2 are admissible? - Give the solution of the longest path found by the A algorithm using the admissible heuristic function.

Q5/ Consider the following search space in which the goal is to find the p from S to G, next(S,A,5), next(S,B,2),next(A,G,5), next (B,D,1), next(B,C,2), next (C,G,2), next(D,G,5), where next(X,Y,Z) means that Y is a child of X and the cost of going from X to Y is Z. ho(S)=0, ho(A)=0, ho(B)=0, ho(C)=0, ho(D)=0, ho(G)=0, h₁(S)=5, h₁(A)=3, h₁(B)=4, h₁(C)=2, h₁(D)=5, h₁(G)=0, h₂(S)=6, h₂(A)=5, h₂(B)=2, h₂(C)=5, h₂(D)=3, h₂(G)=0, Which of the above heuristic functions ho,h₁ and h2 are admissible? - Give the solution of the longest path found by the A algorithm using the admissible heuristic function.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Q2/ Consider the following search problem: next(A,B), next(A,C), next(B,D), next(B,E), next(B,F), next(C,D), next(D,E), next(F,E), next(E,G). H(A)=20, H(B)=12, H(C)=16, H(D)-(8), H(E)=6, H(F)=7, H(G)=0. Where next(X,Y) means that Y is a child of X and H(X) represent the heuristic value of X. Use hill climbing algorithm to find the path between A and G.
In the state space shown below, write the order in which states are expanded if the initial state is 4 and there are two goal states: 5 and 8. For example, for breadth first search the answer would be: 4 2 7 1 3 6 8 using depth-first search using iterative deepening. 2 1 3 5
You are given a 2 by n grid, where the cell on row i column j contains a non-negative number ai,j . You can start at either cell in the lefttmost column, and your goal is to reach either cell in the rightmost column by a sequence of moves. You can move to an adjacent cell (if it exists) in each of the 4 cardinal directions (up,down, left and right). A path achieves a score equal to the sum of values in its cells. Note that a cell which is used twice in a path only counts its value once to the score of that path.Design an algorithm which runs in O(n) time and finds a path of minimum score from the leftmost column to the rightmost column.
In computer science and mathematics, the Josephus Problem (or Josephus permutation) is a theoretical problem. Following is the problem statement: There are n people standing in a circle waiting to be executed. The counting out begins at some point (rear) in the circle and proceeds around the circle in a fixed direction. In each step, a certain number (k) of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number k which indicates that k-1 persons are skipped and kth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive. For example, if n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1…
A magic square is a square array of non-negative integers where the sums of the numbers on each row,each column, and both main diagonals are the same. An N × N occult square is a magic square with Nrows and N columns with additional constraints:• The integers in the square are between 0 and N, inclusive.• For all 1 ≤ i ≤ N, the number i appears at most i times in the square.• There are at least two distinct positive integers in the square.For example, the following is a 5 × 5 occult square, where the sums of the numbers on each row, eachcolumn, and both main diagonals are 7:0 0 0 3 42 4 0 0 10 0 3 4 05 0 0 0 20 3 4 0 0For a given prime number P, you are asked to construct a P × P occult square, or determine whether nosuch occult square exists.InputInput contains a prime number: P (2 ≤ P ≤ 1000) representing the number of rows and columns in theoccult square.OutputIf there is no P × P occult square, simply output -1 in a line. Otherwise, output P lines, each contains Pintegers…
A wrestling tournament has 256 players. Each match includes 2 players. The winner each match will play another winner in the next round. The tournament is single elimination, so no one will wrestle after they lose. The 2 players that are undefeated play in the final game, and the winner of this match wins the entire tournament. How would you determine the winner? Here is one algorithm to answer this question. Compute 256/2 = 128 to get the number of pairs (matches) in the first round, which results in 128 winners to go on to the second round. Compute 128/2 = 64, which results in 64 matches in the second round and 64 winners, to go on to the third round. For the third round compute 64/2 = 32, so the third round has 64 matches, and so on. The total number of matches is 128 + 64 + 32+ .... Finish this process to find the total number of matches.
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You are given a parallel table of size n×m. This table comprises of images 0 and 1. You can make such activity: select 3 distinct cells that have a place with one 2×2 square and change the images in these cells (change 0 to 1 and 1 to 0). Your assignment is to make all images in the table equivalent to 0. You are permitted to make all things considered 3nm activities. You don't have to limit the number of activities. It tends to be demonstrated that it is consistently conceivable. Input The principal line contains a solitary integer t (1≤t≤5000) — the number of experiments. The following lines contain portrayals of experiments. The principal line of the depiction of each experiment contains two integers n, m (2≤n,m≤100). Every one of the following n lines contains a parallel line of length m, depicting the images of the following column of the table. It is…
Given a deck of 52 playing cards, we place all cards in random order face up next to each other. Then we put a chip on each card that has at least one neighbour with the same face value (e.g., on that has another queen next to it), we put a chip. Finally, we collect all chips that were each queen placed on the cards. For example, for the sequence of cards A♡, 54, A4, 10O, 10♡, 104, 94, 30, 3♡, Q4, 34 we receive 5 chips: One chip gets placed on each of the cards 100, 10♡, 104, 30, 3♡. (a) Let p5 be the probability that we receive a chip for the 5th card (i.e., the face value of the 5th card matches the face value of one of its two neighbours). Determine p5 (rounded to 2 decimal places). (b) Determine the expected number of chips we receive in total (rounded to 2 decimal places). (c) For the purpose of this question, you can assume that the expectation of part (b) is 6 or smaller. Assume that each chip is worth v dollars. Further, assume that as a result of this game we receive at least…
@1st mp. 109.
Q2: Search a problem consists of four juice bottles A, B, C, and D (Sol, Moon, Costa, and Dad). They can be arranged in any order from left to right, except that bottle A can never be further to the right than bottle D. For example, ABCD, CBAD, and CADB is possible states of our world, whereas DCBA, CDAB, or BCDA can never occur. The world can be manipulated by the schema swap(x, y), which swaps the bottles in positions x and y. For example, swap (1, 2) turns state BCAD into CBAD. Assume that your world is in the state ADBC, but you would like it to be in state CBAD. Draw the search tree Solve the problem by greedy if the estimated value is the # of bottles in an incorrect position. Solve the problem by A* search if f'(n) = # of operations performed + (min # of moves of the bottles to be in its position. Propose 5 chromosomes as an initial population from the basics of the problem, and apply GAs if the fitness is the # of bottles in incorrect position * of infeasible solutions, use 1…
You are given a N*N maze with a rat placed at maze[0][0]. Find whether any path exist that rat can follow to reach its destination i.e. maze[N-1][N-1]. Rat can move in any direction ( left, right, up and down).Value of every cell in the maze can either be 0 or 1. Cells with value 0 are blocked means rat cannot enter into those cells and those with value 1 are open.Input FormatLine 1: Integer NNext N Lines: Each line will contain ith row elements (separated by space)Output Format :The output line contains true if any path exists for the rat to reach its destination otherwise print false.Sample Input 1 :31 0 11 0 11 1 1Sample Output 1 :trueSample Input 2 :31 0 11 0 10 1 1Sample Output 2 : false Solution: //// public class Solution { public static boolean ratInAMaze(int maze[][]){ int n = maze.length; int path[][] = new int[n][n]; return solveMaze(maze, 0, 0, path); } public static boolean solveMaze(int[][] maze, int i, int j, int[][] path) {//…
Correct answer will be upvoted else Multiple Downvoted. Computer science. player begins the game from the 1-st stage and should beat the stages in expanding request of the stage number. The player dominates the match in the wake of beating the n-th stage. There is all things considered one designated spot on each stage, and there is consistently a designated spot on the 1-st stage. Toward the start of the game, just the designated spot on the 1-st stage is initiated, and any remaining designated spots are deactivated. At the point when the player gets to the I-th stage that has a designated spot, that designated spot is initiated. For each attempt of a phase, the player can either beat the stage or bomb the stage. On the off chance that they beat the I-th stage, the player is moved to the i+1-st stage. On the off chance that they bomb the I-th stage, the player is moved to the latest designated spot they actuated, and they need to beat the stages after that designated spot once…