#artificial intelligence
- For the given graph, the table below indicates the path costs and the heuristic values solution : src : group 1
- consider the following statements , all people who are earning are happy solution : src : group 1
- Use Resolution to answer the question, “What course would Steve like? a) Steve only likes easy courses. b) Science courses are hard. c) All the courses in the basket weaving department are easy. d) BK301 is a b... 2
- Explain bayes theorem with example Bayes' theorem gives the probability of a cause given an observed effect: P(A_imid B) = (P(A_i) P(Bmid A_i))/(Σ_j P(A_j) P(Bmid A_j)). State... 1
- Consider the following axioms All people who are graduating are happy. All happy people smile. Someone is graduating. Answer are in the pictures 2
- Artificial Intelligence Question paper Solutions (AI-DS/AI-ML/CSE(DS/AIML)) A. What is PEAS descriptor? Give PEAS descriptor for robot maid for cleaning the house. PEAS stands for Performance measure, Environment, Ac... 1
- Explain A* algorithm in detail. A* search algorithm : It’s a variation of Best First search where the evaluation of a state or a node not only depends on the heuristic valu... 2
- Draw and describe the architecture of Utility based agent. How is it different from Model based agent? The agents which are developed having their end uses as building blocks are called utility-based agents. When there are multiple possible al... 2
- Define chromosome, selection, fitness function, cross over and mutation as used in Genetic Algorithm. A genetic algorithm (GA) is a search/optimisation method based on natural evolution: a population of candidate solutions (chromosomes) is im... 1
- In a class, there are 80% of the students who like English and 30% of the students who likes English and Mathematics Given: 80% of the students like English 30% of the students like both English and Mathematics We want to find: The percentage of students wh... 2
- Draw and explain architecture of Expert System An expert system is a computer program that is designed to solve complex problems and to provide decision-making ability like a human expert... 1
- Discuss different applications of AI Here are 10 major applications of artificial intelligence: 1. Virtual Assistants - Siri, Alexa, Google Assistant etc. that understand voices... 1
- What is PEAS descriptor? Give PEAS descriptor for robot maid for cleaning the house. PEAS stands for Performance measure, Environment, Actuators, and Sensors. It is a framework used in the field of artificial intelligence (AI... 1
- Artificial Intelligence important questions sem 5 (Ai&Ds/ AiMl)? 1) Explain applications of AI 2) Draw and explain architecture of Expert System (**) 3) What is PEAS descriptor? Give PEAS descriptor for __... 1
- Artificial Intelligence Viva Questions with Answers Module 1: Introduction to Artificial Intelligence Question 1: What is Artificial Intelligence (AI)? Answer 1: AI refers to the simulation of... 1
- Write a Prolog program to calculate the factorial of a number factorial(0, 1). factorial(N, Result) :- N > 0, N1 is N - 1, factorial(N1, Result1), Result is N * Result1. You can use this Prolog program... 1
- The law says that it is a crime for America to sell weapons to hostile nations. Resolving the negated goal ¬Criminal(West) with the knowledge base gives the empty clause, so West is a criminal. 1. FOPL representation It... 1
- With the help of resolution graph, resolution in FOL, solve the following things: Adding the negation "John does not like peanuts" to the knowledge base and resolving leads to the empty clause, so "John likes peanuts" is p... 1
- Difference between forward and backward chaining Forward Chaining Backward Chaining 1. When based on available data a decision is taken then the process is called as Forward chaining. Backw... 1
- Explain Heuristic function with respect to: - What is a heuristic function? How do we calculate the Heuristic function ? A heuristic function h(n) estimates the cost of the cheapest path from node n to a goal; informed searches such as greedy best-first and A*... 1
- Explain Bidirectional Search with appropriate examples and diagrams. Bidirectional search runs two searches at the same time, one forward from the start and one backward from the goal, and stops when the two f... 1
- Explain Uniform Cost Search with appropriate examples and diagrams. Uniform cost search (UCS) always expands the frontier node with the lowest path cost g(n) from the start, so it finds the cheapest path even... 1
- Explain iterative deepening search with appropriate examples and diagrams. Iterative deepening search (IDS) runs depth-limited DFS repeatedly with limits 0, 1, 2, … until the goal is found, combining the completenes... 1
- Compare Bfs ,Dfs and Dls with diagrammatic example BFS explores level by level, DFS goes as deep as possible along one branch before backtracking, and DLS is DFS that stops at a fixed depth l... 1