9Heuristics:4Node 1 = 6Node 2 = 43Node 3 = 1Node 4 = 0Node 5 = 14Node 6 = 10Node 7 = 15Node 8 = 15Node 9 = 10326174(1) Is the heuristic in problem 1 admissible? Is it consistent?(2) Suppose you had two heuristics. The first heuristic, hị, is admissible and consistent. The second, h2,is admissible but not consistent. Prove or disprove whether a new heuristic defined as: h3 = min(h¡,h2),is admissible and/or consistent.2.

A* algorithm finds the shortest path using the heuristic functions. Cost of start stage node= g(n)…

Heuristics: Node 1 = 6 2 1/ Node 2 = 4 Node 3 = 1 /2 9. Node 4 = 0 Node 5 = 14 Node 6 = 10 2 7 Node 7 = 15 5 Node 8 = 15 Node 9 = 10 4 (1) Is the heuristic in problem 1 admissible? Is it consistent? (2) Suppose you had two heuristics. The first heuristic, h,, is admissible and consistent. The second, h2, is admissible but not consistent. Prove or disprove whether a new heuristic defined as: h3 = min(h¡,h2), is admissible and/or consistent. 3.

Heuristics: Node 1 = 6 2 1/ Node 2 = 4 Node 3 = 1 /2 9. Node 4 = 0 Node 5 = 14 Node 6 = 10 2 7 Node 7 = 15 5 Node 8 = 15 Node 9 = 10 4 (1) Is the heuristic in problem 1 admissible? Is it consistent? (2) Suppose you had two heuristics. The first heuristic, h,, is admissible and consistent. The second, h2, is admissible but not consistent. Prove or disprove whether a new heuristic defined as: h3 = min(h¡,h2), is admissible and/or consistent. 3.

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

Need the right answer among choices and also an explanation of the answer.
Question 11 Please choose the perfect answer only.
2 You are given the count matrix in the table 4 for the attribute "Previous GPA". The class label is whether a student will pass (C1) or fail (CO) a class. We want to use the attribute "Previous GPA" asour splitting attribute in an inner node of a decision tree with a binary test condition. Which is the best way to partition the attribute values into two groups? Form the count matrices for the different partitions and compute the classification error. Explain your reasoning while considering the metric of classification error to evaluate the different partitions. 0 3.1 + 0 3 Consider the decision trees shown in Figure 1. The decision tree in 1b is a pruned version of the original decision tree 1a. The training and test sets are shown in table 5. For every combination of values for attributes A and B, we have the number of instances in our dataset that have a positive or negative label. B 2 2 1 0 1 0 1 0 1 0 + 5 A 3 22 7 1 2 6 Bad 1 pass (C1) fail (CO) 4 B (a) Decision Tree 1 (DT1) 1 3…
Question 1. (a) Define Correctly "P is an order". (b) State Correctly Principle 0 and Principle 1 of set formation by stages. (c) A, B the following statement is false. Using said principles (state exactly which one was used where) prove that for any sets АЕВЕА
2
3. Express the following English sentences using propositional functions, quantifiers and logical connections. (a) Someone in the class is helped by everyone in the class. (b) There is a hard working student in the class who has not been helped by any student in class. (c) For everyone in the class, someone who is smart has helped him/her. SO (d) There are two people in the class who have not helped each other. (e) There is a hard working student in the class who is helped by every smart student in class. (f) There are some companies that hire only hard working students.
Problem 7: Use Wang's algorithm to answer whether or not Mary will go to the party, given that: If Bob goes to the party, then Anna goes (B → A). If Mary goes to the party, then Bob goes (M → B). Anna will not go to the party (not A). Show all the steps clearly stating the rule applied at each step.
Generate test cases for the triangle problem by using the cause-effect graph and decision table testing
1. Let S = {1,2...n} be a set activities, where activity i € S has a start time si, a finish time f; and a profit p, asSociated with it. Design an dynamic programming algorithm for computing a set of compatible activities of maximum profit. Argue that the time complexity of you algorithm is O(n log(n)). (You must start with the correct definitions, and then write a recurrence relation.)
Use Python
1. Why lower bound is important? 2. Why worst-case is important more than average case and best case? 3. How can you find the upper bound of a problem? 4. Is it possible that the lower bound and the upper bound of a problem are the same? Why?
Draw a decision tree (Full or simplified) to represent the Claremont School catalog. The Claremont School course catalog reads as follows: “A student must complete two prerequisites, CIS 110 and CIS 206, in order to enroll in CIS 288, which is an advanced course. A student who completes either one of these prerequisites and obtains the instructor’s permission, however, will be allowed to take CIS 288.”