“Half-Manhattan distance” heuristic is equal to the Manhattan distance divided by two. explain how the use of this heuristic would or would not affect the optimality properties of (i). Greedy Best-First Search,(ii). Uniform-Cost Search, and (iii.) A* Search

Q.5 Given the figure below, using the Greedy-Best First search find if it is optimal / admissible or not? Explain why ? h=5 2. A B h=3 h=4 2 C h=3 E goal h=2 з G goal

Consider the two strings/sequences X = (B, A, N, A, N, A) (P, A, N, O, R, A, M, A) of characters. Apply the Edit Dis- tance algorithm to X and Y to compute an optimal solution. Show your work (the contents of the table), and use the table to give an JII. %3D and Y = optimal solution.

8. A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonablo time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate? O A Unreasonable algorithms may sometimes also be undecidable O B. Heuristics can be used to solve some problems for which no reasonable algorithm exsts O C. efficiency Two algorithms that solve the same problem must also have the same O B. Approximate solutions are often identical to optimal solutions

In the graph given below, consider that you keep track of already expanded nodes and their f cost. Also, if you visit an already expanded node by some other branch, you push it back to the fringe only if their new f cost is lower than the previous f cost. Now, simulate Greedy Best First Search and A* Search algorithm on the following graph considering X as the start node and P as the goal node.

Find an optimal Hoffman code for g:5, o:15, u:28, m:25, b:10, c:17. draw out steps so i can understand

5a.Given a university course prerequisite structure; a directed edge (u, w) indicates that course u must be completed before course w. Assuming cycle is not allowed (i.e., acyclic) and we have n courses, describe an optimal algorithm for assigning courses to students. 5b. Differentiate between the followings:       i.    Breadth first search and depth first search     ii.   Single source shortest path and all pairs shortest path. iii. Independent set and vertex cover