Question 2 Given the following search graph, write the sequence of node numbers in the search agenda across the search life-time and using A* search. €4 1 2 3 4 5 6 197 C3 €5 €6 569 Assume the following heuristic value per node: Node ID Node Heuristic value 542 569 133 10 161 197 346 44897 Assume distance between cities are as mentioned on the links Apply A* algorithm showing intermediate values for the Agenda, g(n), h(n) Source city is :C5 Destination city:C4 €2 240

In what order will the nodes be visited using a Breadth First Search? In what order will the nodes be visited using a Depth First Search?

A split at the $3200 income point creates a top and bottom partition. Compute the overall(weighted) Gini index given an income split of 32000. income is 0, 10,000, 20,000, 30,000, 40,000, 50,000, 60,000, 70,000, 80,000, and age is 0,10,20,30,40,50 (Please give correct answer with explanction)

Help on all parts since it is all one problem

2. The following keys are inserted into an initially empty B-Tree of order 3. Construct the B-Tree 56, 12, 32, 6, 37, 85, 79, 99.

What is the procedure for a depth first search? Find and end node - what do they imply? - what do they mean

• Depth First Search o Generate Adjacency Linklist o Traverse Graph using DFS Algorithm o Start Node: Your choice A B E G TI F I

3. List the order in which the vertices are visited with a breadth-first search starting with vertex 1. If there are multiple vertices adjacent to a given vertex, visit the adjacent vertex with the lowest value first. 1 8 2 4 6 3 7 9 10

Q1: The implementation of the Breadth-First Search algorithm uses a queue. -true -false

Give the order of nodes in each of the searches below, starting at the indicated node. When a method may select from among many next candidate nodes, prefer the node which has a larger value. i Breadth First Search starting at node 2 ii Depth First Search starting at node 2 iii Breadth First Search starting at node 4 iv Depth First Search starting at node 4