Skip to content

Artificial Intelligence

CSE · Final · Spring 25

Batch 61

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Daffodil International University Faculty of Science & Information Technology Department of Computer Science and Engineering Final Examination, Spring 2025 Course Code: CSE411, Course Title: Artificial Intelligence Level: 4 Term: 1 Batch: 61 Time: 02:00 Hours Marks: 40 Answer All Questions [The figures in the right margin indicate the full marks and corresponding course outcomes. All portions of each question must be answered sequentially.] 1. a) Analyze formal grammar and Chomsky hierarchy for NLP. | 5 b) Explain a multilayer neural network-based NER (Named Entity Recognition) project on image (eg. License plate recognition). | 5 | CO4 2. a) Discuss general logic characteristics with the help of entailment. | 3 b) Identify KB entails sentence 'a' if and only if 'a' is true in all words where KB is true. Let consider, KB = (p ^ q), (~p ^ ~r) and a = ~p ^ (q v ~r) and apply on the truth table. | 2 | CO2 c) Predict truth table on this statement considering propositional symbols "I make you Appetizer, Dinner, and Dessert". | 5 3. a) Demonstrate uncertainty reasons which creates ambiguity in Autonomous Agent. | 5 | CO3 b) The full joint distribution on the following table describes the probabilities of the combinations of vehicle types and vehicle owners. Applying these probabilities analyze the following questions. | 5 i) Determine the probability that a vehicle owner is under 30 years old. ii) Determine P(vehicle type = Miniyan | age of owner is under 30) iii) Determine P(vehicle type = SUV v age of owner is over 50) Age of owner | Car | Minivan | SUV under 30 | 0.15 | 0.05 | 0.1 between 30 and 50 | 0.1 | 0.15 | 0.15 over 50 | 0.15 | 0.15 | 0.05 4. Perform the following questions and answer each question respectively. | CO2 a) Identify the solution using a minimax search on the following tree. | 5 | [Figure: A minimax tree with root A, children B, C (11), D, E, and various leaf nodes with values] b) Identify a solution on the following tree which reduces node traversing. | 5 | [Figure: An alpha-beta pruning or game tree with multiple internal and leaf nodes containing numbers]