Consider the following graph. The numbers written on edges represents the distance between the nodes and the numbers written on nodes represents the heuristic value. Find the most cost- effective path to reach from Noda A to node J using A* Algorithm
Find the minimum cost path for the 8-puzzle problem, where the start and goal state are given as follows:
Start State
| 1 | 2 | 3 |
| 4 | 8 | - |
| 7 | 6 | 5 |
Goal State
| 1 | 4 | 7 |
| - | 8 | 6 |
| 2 | 3 | 5 |
See Answer →
Using integration, find length of the curve from
Find the points of local maxima and local minima of f(x) See Answer →
Compare Artificial Intelligence, Machine Learning, and Deep Learning.
See Answer →Define Supervised, Unsupervised and Reinforcement learning with a suitable examples of each
See Answer →Classify AI on the basis of the functionalities of AI. Also discuss some important applications of AI.
See Answer →Determine the values of x for which is increasing and for which it is decreasing.
What is a Doubly Linked List? How does it differ from Circularly Doubly Linked List?
See Answer →What is Heap Sort? What is Merge Sort? Write the factors on the basis of which Heap Sort or Merge Sort is selected.
See Answer →Explain the process of converting a Tree into a Binary Tree with an example.
See Answer →What are B-trees? Explain with example.
See Answer →Solve the inequality and graph its solution.
Solve the equation Given that one of the roots exceeds the other by 2.
Use De Moivre’s theorem to find
Evaluate :
Analyse the reasons for the emergence of the Telugu Desam Party in Andhra Pradesh.
See Answer →Examine the role and utility of the Inter-State Council.
See Answer →Examine the relationship between caste and land ownership in rural India
See Answer →If ,find