IT-504-A Artificial Intelligence - Nov 2023 Question Paper

Under each question, How to answer lists the points an answer should cover, outlined by CampusPrep from the syllabus. Check the details against your textbook.

1. 14 Marks
   Discuss the following search Technique with the help of an example. Also discuss the benefits and shortcoming of each.

   1. i)Breadth First Search
   2. ii)Depth First Search
   How to answer

   • Define BFS level-wise and DFS depth-wise traversal
   • Illustrate each with example search tree/graph traversal order
   • Benefits: BFS completeness/optimality, DFS memory efficiency
   • Shortcomings: BFS space complexity, DFS incompleteness/non-optimality
2. 7 Marks
   aHow to define a problem as State Space Search? Discuss it with the help of an example.
   How to answer

   • Define state, initial/goal states, operators, state space
   • Steps to formulate problem as state space search
   • Illustrate with example e.g., 8-puzzle, water jug, route finding
   • Diagram of state space graph if applicable
3. 7 Marks
   bExplain briefly the difference between procedural and declaration knowledge.
   How to answer

   • Define procedural knowledge as how-to knowledge
   • Define declarative knowledge as what/factual knowledge
   • Compare representation, use, modifiability with examples
   • Summarize differences in table form
4. 7 Marks
   aDiscuss the heuristic function. Explain how the heuristic function helps during search procedure. Explain with a suitable example.
   How to answer

   • Define heuristic function h(n) as estimated cost to goal
   • Explain role in guiding/informed search and pruning
   • Give suitable example e.g., straight-line distance, misplaced tiles
   • Show how it improves efficiency
5. 7 Marks
   bWhat is A* search? Explain various stages of A* search with an example.
   How to answer

   • Define A* with f(n)=g(n)+h(n)
   • Explain OPEN/CLOSED lists and node expansion stages
   • Work through example graph showing f-value calculation
   • Discuss optimality and admissibility condition
6. 14 Marks
   Represent the following statement in predicate logic:

   1. i)Marcus tried to assassinate Caesar.
   2. ii)All Pompeian's were Roman.
   3. iii)All Romans were either loyal to Caesar or hated him.
   4. iv)Everyone is loyal to someone.
   How to answer

   • Introduce predicates: Roman, loyal, hate, tried-assassinate
   • Translate universal/existential quantifiers for each sentence
   • Write well-formed predicate logic formulas
   • Maintain consistent variable and constant naming
7. 14 Marks
   Explain conceptual dependency with an example and build up the conceptual dependency structures for the following sentences:

   1. i)John pushed the cart.
   2. ii)John took the book from Mary.
   3. iii)While going home, I saw a frog
   How to answer

   • Define conceptual dependency and primitive acts
   • Explain syntax with example CD diagram
   • Construct CD structures for push, take, see sentences
   • Show actor, action, object, direction dependencies
8. 7 Marks
   aWhat is explanation based learning? Explain in detail with an example.
   How to answer

   • Define explanation based learning and its goal
   • Explain steps: explain example, generalize, operationalize
   • Illustrate with detailed example
   • Mention prerequisites of domain theory
9. 7 Marks
   bState Bayes Theorem explain with example.
   How to answer

   • State Bayes theorem formula P(H|E)
   • Define prior, likelihood, posterior terms
   • Explain with numerical/example application
   • Mention use in uncertain reasoning
10. 7 Marks
    aDefine expert systems. Explain the architecture of expert systems in details with a neat Diagram with an example.
    How to answer

    • Define expert system and its purpose
    • Describe components: knowledge base, inference engine, UI
    • Draw neat labelled architecture diagram
    • Illustrate working with example domain
11. 7 Marks
    bWhat is a plausible-move generator? What is its role?
    How to answer

    • Define plausible-move generator
    • Explain need to reduce branching in game search
    • Describe its role in generating promising moves only
    • Give example in chess/checkers context
12. 14 Marks
    Write a short note on (Attempt any three):

    1. a)Various Technique used in Learning
    2. b)NLP
    3. c)Knowledge Representation
    4. d)Frames
    How to answer

    • Select any three topics from given list
    • Write definition, key points and example for each
    • Mention applications/significance
    • Keep concise structured short notes