×
Language:

ARTIFICIAL INTELLIGENCEQUESTION BANK
Question Bank Unit I :
Q1.Give an example of a problem for which breadth-first-search would work better thandepth-first-search would work better than breadth-first-search.Q2. describe how the branch-and-bound technique could be used to find the shortest to awater jug problem.Q3. When would best-first-search be worse than simple breadth-first-search ?Q4. Suppose that first step of the operation of the best-first-search algorithm results in thefollowing situation (a+ b means that the value of h’ at a node is a and the value of g is b).(4+1) (3+1)The second and third steps then result in the following sequence of situation.(4+1) (3+1) (4+1) (3+1)(4+2) (2+2) (4+2)(a)What node will be expanded at the next step?(b)Can we guarantee that the best solution will be found?Q5. Write Backward-Chaining Rule System & Forward-Chaining Ruke System.Q6.What is default reasoning and how can you perform it with non-monotonicreasoning?Q7.What is Logic – Based Truth Maintenance Systems?Q8. Explain JTMS and ATMS with proper example.Q9.What is partition semantics Net explain it with example?Q10. What is Mean-End-Analysis ?Q11. Write A* algorithm and show how A* algorithm can be used to find minimal-costoverall path or simply any path as quickly as possible.Q12. How best-first-search algorithm supports heuristic evaluation function?Q13.When would best-first-search be worse than simple-first-search ?

Q14. Find a good heuristic function for following(a)Monkey and Banana problem(b)Travelling Salesman problemQ15. Give an example of an admissible heuristic for the 8-puzzle.Q16.Give a heuristic that a block-stacking program might use to solve problems of theform ‘stack block X on blockY’. Is the heuristic admissible? Is it monotonic?Q17.What is Agenda-Driven Search Algorithm?Q18. Show that worst-case algorithm to solve the travelling salesman problem is of exponential complexity but an algorithm that chooser a tour through the nearestneighbour of each city is of lower order. Give an example to show that the best-first-algorithm is not , in general, optimal, but still often good.Q19. Discuss some of the potential problems of using hill climbing search. Give anexamples of the problems cited.Q20. Prove that implication is transitive in the prepositional calculas, that is, that((P->Q) ^ (Q->R) )-> (P -> R)
Question Bank Unit II :
Q1. Discuss the representational structures and knowledge necessary to understand thefollowing sentences.

The brown dog ate the bone.Attach the large wheel to the axle with the hex nut.Mary watered the plants.The spirit is willing but the flesh is weak.My kingdom for a horse!Q2. What are the context-sensitive grammars have a disadvantages for design of practical parsers.Q3. What are transition network parser?Q4. What is ATN parsers?Q5. What is conceptual dependency?Q6. What is Horn Clause and show its implementation in production system?Q7. Write back track algorithm for AND/OR graphs.Q8. Write the pseudo-code definition for a bradth-first version of pattern-search. Discussthe time and space efficiency of this algorithm.Q9. Is the minmax procedure a depth-first or breadth-first search procedure?Q10. Suggest two applications appropriate for solutions using black-board architecture.Briefly characterize the organization of the black-board and knowledge sources for eachimplementation.Q11. What is conceptual Parsing?Q12. What are principal advantages of semantic grammer?Q13. What are components of natural language understanding process?Q14. What is chart parser and explain its use?Q15. What is lexical disambiguation?Q16. What is compositional semantics?Q17. Write an ATN grammer that recognizes verb phrases involving auxillary verbs. Thegrammer should handle such phrases as
“word”
“should have gone”
“have been going”
“would have been going”
“would go”Do not exact to produce an ATN than can handle all possible verb phrases. But do designone with a reasonable stucture that handles most common ones, including the one above.The grammer should create structure that reflects the structure of the input verb phrases.Q18. Consider the following sentences:Put the red block on the blue block on the table.(a)Show all the syntactically valid parsers of this sentence. Assume any standardgrammatical formalism you like.(b)How could semantic information and would knowledge be used to select theappropriate meaning of this command in a particular situation?
Search History:
Searching...
Result 00 of 00
00 results for result for
• p.

Notes