Question 1For the problem represented by the graph below, A start state. G: Goal state. Let us define the following HeuristicsH1: NA- 4, h(B)-1, hG)- 06.H2 HA)- 5, h(B)- 2, h(G)- 0which heuristics is admissibleO Hi and H2O Hi onlyO H3 onlyO None

Let's see the solution in the next steps

Question 1 For the problem represented by the graph below, A start state. G Goal state. Let us define the following Heuristics H1: NA-4, NB)-1, NG-0 H2 NA- 5, hB)-2. NG)-0 which heuristics is admissible O Hi and H2 O Hi only O Henly O None

Question 1 For the problem represented by the graph below, A start state. G Goal state. Let us define the following Heuristics H1: NA-4, NB)-1, NG-0 H2 NA- 5, hB)-2. NG)-0 which heuristics is admissible O Hi and H2 O Hi only O Henly O None

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

Part C: Function, for and plotting We did a project in the lecture on calculating the free fall speeds and plotting them on a graph. This part is similar to the project. An engineer has derived a relationship between the force applied to a material and the extension in length that the force would cause. The relationship between force f and extension e is given by: You are asked to plot a graph showing the relationship between force and extension. You are asked to complete the following tasks: Task 1 Write a Python function which returns the value of e for a given input f. Do not use literals (e.g. 5.5, 10) in the expressions for e in the function. Instead you should define constants and use them. Note that the relationship between e and f depends on whether f is bigger than 10 or not, this means you need a certain Python construction in your function. If you can't think of that, have a look at Part A of Lab03.
Chemical 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.
Computer Science Investing in stocks is a way to create assets that are supposed to provide financial security over time. In solving this problem, we assume that an investor buys several shares of stock at a certain price. These shares are going to be sold later on for a different price. Obviously, if the selling price is higher than the acquisition price, the investor makes a profit, registering capital gain. If the shares are sold at a lower price, the investor has a loss, which marks a negative capital gain. This whole process is done over a period of time, and you are required to create a scenario for buying and selling shares. The assumption is that the investor sells shares in the order in which they were purchased. The goal is to calculate the capital gain over time. Suppose that you buy n shares of stock or mutual fund for d dollars each. Later, you sell some of these shares. If the sale price exceeds the purchase price, you have made a profit—a capital gain. On the other…
Q.2: a. How you can develop learning component? Design a learning component using best first search algorithm to detect the most relevant twit? Assume that tokens and combination of tokens correspond to relevance. b. Decide your criterion for most relevant tweet. c. Represent your search space and transitions in the form of tree (preferably binary tree). d. As a rational agent discuss legal actions possible in the above case. e. Can you use genetic algorithm to solve this problem? How? (Max 900 words)
Function cai (Io) should return companies whose shares are held by every investor i E I, It is defined recursively: • Base case:. cai(null) = null • Constructor case: cai ({i1, i2...in }) = {c| cE C and. ( i1, c) E IC ) n cai ({i1, i2...in})
in discrete data structure Using predicate logic, prove that each argument in Exercise 42 is valid. Use the predicate symbols shown. Customized) There is some car that is faster than anything. Anything that is faster than anything else consumes more gasoline than anything else does. Therefore, there is a car that consumes more gasoline than anything. C(x): x is a car F(x,y): x is faster than y G(x,y): x consumes more gasoline than anything
For problem 2, you should provide two answers for each of the search strategies: the states expanded and the solution. Problem 2 Alice the agent wants to go skiing right after AI class is over. She starts in the lecture hall (the "Start" state below) and wants to make it to Alta (the "Goal" state) as soon as possible. There are several possible paths she can take denoted in the graph below ( refer to image ): The available actions at each state are denoted by arrows with a path cost label above each arrow. For each of the following graph search strategies, figure out the order in which states are expanded as well as the path returned by graph search. When choosing an arbitrary order of state expansions (to break ties), use alphabetical ordering. Remember that in graph search, states are expanded only once. Depth-first search Breadth-first search Uniform cost search A* search
QUESTION 4 A decision tree is read from left to right, with the conditions along the various branches and the actions at the far left. True False QUESTION 5 A is logically impossible in a data flow diagram (DFD) because a process must act on input, shown by an incoming data flow, and produce output, represented by an outgoing data flow. a. black hole b. gray matter C. server farm d. spontaneous combustion QUESTION 6 A(n) shows the object classes and relationships involved in a use case. a. modeling diagram b. class diagram c. association diagram d. use case diagram
Given the following UML diagram: Student - studentID: String + getStudentID(): String + toString(): String Person - lastName: String - firstName: String - dateOfBirth: Date - address: Address + getName(): String + getDOB(): Date + getAddress(): Address + toString(): String Professor - employeeID: String +getEmployelD(): String +toString(): String Write an implementation for the class Professor. DO NOT include or implement any constructor for this class. There are no abstract methods/classes in this example. toString method will return any simple String that contains firstName and employeelD only; no less, no more!! Assume firstName was defined as protected in class Person. You are not allowed to add implementation for any class or methods other than what is listed in the question statement.
IMAM NAME: 3 Heuristicsf Assume h is an admissible heuristic. What about h2 and Vh? Are they also admissible? What will be the advantage or disadvantage of using h2 or vh in the A algorithm instead of h? Give your answers separately for h2 and Vh!
Question #6 Use the following graph to find the path using (A is the start symbol and J is the Goal) a) A* search b) Best First Search c) Breadth Search d) Is the heuristic function admissible? 8 3 6. 6. 10 2 3 7 8 J)0 Co
Consider the following points. Below are some graph-like structures, along with examples of how they've been used in AI models.a. The term "K-means"b. Closest neighbours (K)c. Decision tressConsider the following points. Below are some graph-like structures, along with examples of how they've been used in AI models.a. The term "K-means"b. Closest neighbours (K)c. Decision tress