BIT Artificial Intelligence

Construct a state space graph with start state, intermediate states and goal state. Show that DFS is not complete over the state space while BFS is guaranteed to be complete on the state space. Can depth limited search overcome the incompleteness behavior of DFS?

Differentiate forward chaining with backward chaining. Convert following statements into FOPL and use resolution algorithm to check if “John is talent” can be inferred.

All students are talent.

There is a student who is smart but not talent.

All students enrolled in IT course are programmer.

John is a student.

John is enrolled in IT course

How supervised learning is different from unsupervised learning? Explain how learning by genetic algorithm is done? Support your answer with example.

What is symbolic AI? What properties an agent should have to qualify Turing Test?

How stochastic environment of agent is different from deterministic environment? Construct PEAS framework for an agent of your choice.

Construct a state space for game search with proper utilities. Show how minimax algorithm searches the solution. Determine if there are any alpha and beta cutoffs.

How knowledge is represented using conceptual dependency? Represent following knowledge using conceptual dependency.

Hari gives a gift to Ram. Ram goes to a school. Ram told a story to Hari.

Explain the development of expert system. Also discuss applications of expert system.

What is semantic analysis in NLP? How ambiguities in NLP are handled?

What is artificial neural network? Define learning rule and learning rate.

What is goal tree? How problem decomposition is done using goal trees?

What is admissible heuristic? Formulate a state space representation with appropriate heuristics and actual costs. Show that greedy best first search is not optimal on the state space.