Q.7 If given graph bellow (Arad is root and Bucharest is goal):Draw the tree by using the A* search, where you have to show all details on the tree?Straight-line distanceto BucharestO Oradea71,NeamtAradBucharestCraiova366O zerind1518775/160O lasiDobreta242AradEforieFagarasGiurgiuHirsova14016192178Sbu66Fagaras77118O Vaslui15180Iasi226Rimnicu VikceaLugojMehadiaTimisoara244142241111211NeantOradea97Pitesti234OLugoj7038098Pitesti9814610185O HirsovaRinınicu VilceaÓ Mehadia75Urziceni19313886Sibiu253BucharestTimisoara329120Dobreta O90Urziceni80CralovaVaslui199EforieO GiurgiuZerind374

A* search algorithm is used to traverse the graph and to find the path. A* search algorithm has two…

Q.7 If given graph bellow (Arad is root and Bucharest is goal): Draw the tree by using the A* search, where you have to show all details on the tree? Straight-line distance to Bucharest O Oradea 71 Neamt Arad 366 87 Bucharest 75 Zerind 151 Craiova 160 O lasi Dobreta Eforie Fagaras Giurgiu Hirsova 242 sad O 140 161 92 178 Sbu 99 Fagaras 77 118 O Vaslui 151 80 Iasi 226 Rimnicu Vicea Lugoj Mehadia Timisoara 244 142 241 111 211 Neant 234 97 Pitesti Oradea 380 70 98 Pitesti 98 146 101 85 O Hirsova Rinınicu Vilcea O Mehadia 75 Urziceni 193 Sibiu Timisoara Urziceni Vaslui Zerind 138 86 253 Bucharest 329 120 Dobreta O 90 80 Cialova 199 Eforie O Gurgiu 374

Q.7 If given graph bellow (Arad is root and Bucharest is goal): Draw the tree by using the A* search, where you have to show all details on the tree? Straight-line distance to Bucharest O Oradea 71 Neamt Arad 366 87 Bucharest 75 Zerind 151 Craiova 160 O lasi Dobreta Eforie Fagaras Giurgiu Hirsova 242 sad O 140 161 92 178 Sbu 99 Fagaras 77 118 O Vaslui 151 80 Iasi 226 Rimnicu Vicea Lugoj Mehadia Timisoara 244 142 241 111 211 Neant 234 97 Pitesti Oradea 380 70 98 Pitesti 98 146 101 85 O Hirsova Rinınicu Vilcea O Mehadia 75 Urziceni 193 Sibiu Timisoara Urziceni Vaslui Zerind 138 86 253 Bucharest 329 120 Dobreta O 90 80 Cialova 199 Eforie O Gurgiu 374

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

3 Question 4 Let G=(V,E) be undirected graph and: (u,v)∈E. (A) Build an algorithm in complexity O (V + E) that finds a spanning tree of G that includes the (u, v). (B) Build an efficient algorithm that finds all the ribs of G that are common to all the spanning trees of G.
Giving that, after applying Depth-first search (DFS), the visited nodes are as follows:A-B-E-F-G-C-H-D-I-JAssuming the order of the nodes are in alphabetic order ABC, and the starting node is A1. Draw the graph tree for this problem.2. Visit all the nodes using the Breadth-first search (BFS).3. If the goal is to reach node G from node A, show the solution after applying both BFS andDFS and show which algorithm is faster.
Draw and list the edges of a minimum spanning tree for the following graph in theorder that they are added by Kruskal’s algorithms. Show the Set S and the set A in the order thatthe edges are added. Draw the final MST.
(a) Let G be a simple undirected graph with 18 vertices and 53 edges such that the degreesof G are only 3 and 7. Suppose there are a vertices of degree 7 and b vertices ofdegree 3. Find a and b. To receive any credit for this problem you must write completesentences, explain all of your work, and not leave out any details. problem 1, continued(b) Recall that a graph G is said to be k-regular if and only if every vertex in G has degreek. Draw all 3-regular simple graphs with 12 edges (mutually non-isomorphic). Hint:there are six of them. To receive credit for this problem, you should explain, as well aspossible, why all of your graphs are mutually non-isomorphic.
A) Suppose the numbers 7 , 5 , 1 , 8 , 3 , 6 , 0 , 9 , 4 , 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers.ShowA) In order B) pre order C) post order B)From the given tree state predict1. Degree of tree2. Degree of node G3. Level of node H4. Prove that formula to find maximun number of node is not applicable here , along with reason5. Post order, pre order and in order traversing
1. Consider the weighted, directed graph containing the following vertices and edges.(Weights are in the parentheses.)Vertices: {A, B, C, D} Edges: {AB(5), BC(3), CA(4), AD(2), DA(4), CB(3)}a. Starting at vertex C, determine the shortest path tree using Dijkstrab. If you were to apply Floyd-Warshall’s algorithm to this tree, would it include the shortest path tree you found using Dijkstra? Why or why not?c. Starting at vertex C, determine the minimum spanning tree using Prim.d. Would Kruskal’s algorithm always result in the same MST as Prim’s? Why or why not?
Given a DAG and two vertices v and w, find the lowest commonancestor (LCA) of v and w. The LCA of v and w is an ancestor of v and w that has nodescendants that are also ancestors of v and w. Computing the LCA is useful in multipleinheritance in programming languages, analysis of genealogical data (find degree ofinbreeding in a pedigree graph), and other applications. Hint : Define the height of avertex v in a DAG to be the length of the longest path from a root to v. Among verticesthat are ancestors of both v and w, the one with the greatest height is an LCA of v and w.
Consider the following graph. Start from vertex x, use the Depth First Search (DFS) algorithm (described in the textbook) to compute the DFS tree(s). Show intermediate results similar to the textbook example and show the final DFS tree(s). It is assumed that in the adjacency list representation, all vertices are stored according to their alphabetical order. In other words, a vertex’s neighbors should be explored by their relative alphabetical order.
Draw the binary search tree that would result if the given elements were added to an empty binary search tree in the given order. Use paint to draw. a. Lisa, Bart, marge, maggie, flanders, smithers, miljouse b. 12,34,1,5,-5,6,19,45,2,-7,47
Using C/C++, implement a dynamic programming algorithm to solve the optimal binary search tree problem: define ten frequencies (summation is 1) for ten searchable objects (e.g., characters, strings, or numbers) and output: (1) the optimal binary search average comparison number; (2) the optimal binary search tree construction information (which object is in root, which is in the left child of root, which is the right child of root, … etc).
Given the following search tree, state the order in which the nodes will be searched for breadth first and depth first, until a solution B is reached.
First, convert this labelled directed graph into a search tree representation. Next, you need to define your heuristic function for each node. Later, find the searching space from the Main Gate (start) to the Varsity Mall (goal) for the following search methods:a) Depth-First Searchb) Breadth-First Searchc) Depth Limited Search (L = 3)d) Uniform Cost Searche) Best First (Greedy) Searchf) A* Algorithm