0% found this document useful (0 votes)
17 views5 pages

Ai QB

The document outlines fundamental concepts of Artificial Intelligence, including definitions of key terms, search strategies, algorithms, and knowledge representation techniques. It also discusses the advantages and limitations of AI, various subfields, and provides examples of algorithms like MINMAX, A*, and Hill Climbing. Additionally, it includes practical exercises related to state space search and predicate logic.

Uploaded by

ommsutar15
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views5 pages

Ai QB

The document outlines fundamental concepts of Artificial Intelligence, including definitions of key terms, search strategies, algorithms, and knowledge representation techniques. It also discusses the advantages and limitations of AI, various subfields, and provides examples of algorithms like MINMAX, A*, and Hill Climbing. Additionally, it includes practical exercises related to state space search and predicate logic.

Uploaded by

ommsutar15
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Fundamentals 0f Artificial Intelligence

1. Define the following terms:


(Narrow AI, Rule based AI, Knowledge, heuristic function, slot and relation,
Machine Learning, NLP, frame, propositions, Supervised Learning, unsupervised
learning, search strategy).
2. What is used to build complex sentences in knowledge representation?
3. Name the search method which takes less memory?
4. Identify the other name of informed search strategy?
5. Name the search strategy which is also called as blind search.
6. Identify the data structure used to implement DFS and BFS using AI?
7. Write the features of good control strategies?
8. Write time complexity of: MINMAX algorithm, DFS, BFS, Generate and
Test, Hill Climbing, Best First Search, Problem reduction, constraint satisfaction,
Means Ends Analysis.?
9. List all the limitations of semantic networks.
10. Give the advantages of using Artificial intelligence?
11. Short note on components of script.
12. Write the approaches to knowledge representation.
13. The facts or data elements constitutes which structure?
14. List various subfields of AI.
15. State the significance of alpha-cut off in alpha-beta pruning.
16. Explain the importance of heuristic function in the informed search with an
example.
17. Explain key components of state space search.
18. Write the types of knowledge representation technique.
19. Give the difference between: Informed search and uninformed search,
Knowledge and Data, Supervised and unsupervised learning, A* and AO*.
20. Explain how the following algorithms work: Generate and Test, Hill Climbing,
Best First Search, Problem Reduction, Constraint Satisfaction, and Means-Ends
Analysis? Use diagrams if applicable.
21. What are the advantages and disadvantages of the Breadth-First Search
algorithm?
22. List and explain the various approaches to knowledge representation in AI?
23. What are the different types of Artificial Intelligence? Can you list and explain
each type in detail?
24. What are the key advantages and disadvantages of using Artificial Intelligence?
25. How would you explain the benefits and drawbacks of using an expert system?
26. Discuss the Generate and Test algorithm along with its advantages and
disadvantages?
27. Briefly describe the MIN-MAX search technique and how it is used to solve
games?
28. What are some common disadvantages of the Hill Climbing algorithm, and
how can they be overcome?
29. Can you walk me through the history of Artificial Intelligence?
30. What is predicate logic in AI? Could you explain it with a suitable example?
31. Can you write a short note on Conceptual Dependency and its role in AI?
32. What are the limitations of using semantic networks in knowledge
representation?
33. Discuss the A* and AO* algorithms in detail, preferably with examples?
34. What are some of the common applications of Artificial Intelligence today?
35. How does the Means-End Analysis strategy work? Can you give an example?
36. What are the essential requirements of a good control strategy in problem-
solving?
37. What happens when the agent program is called?
38. List out the properties of MIN-MAX algorithm.
37.Translate this sentence into predicate logic.
i. Marcus was a man
ii. Caesar was a ruler
iii. All men are mortal
iv. Bread is food.
v. Apples are fruits.
vi. John likes all kinds of food.
vii. Marcus was a Pompeian.
38. Consider following axioms in clause form.
i. Man (marcus)
ii. Pompeian (marcus)
iii. pompeian (x1) v Roman (x1)
iv) ruler (caesar)
v) isa (Pompeian, Roman)
39. Represent the following using semantic net:
i. Every girl likes ice - cream.
ii. I want a blue car.
iii. Doctor(Marcus), Black Smith (Marcus).
iv. Riya gave the pink flowered vase to her teacher.
40. Translate the following English statements into FOPL.
i. Any natural number is either odd or even.
ii. If a natural number is odd, then its square is odd.
iii. A natural number is divisible by 1.
iv. All students are smart.
v. There exists a student.
vi. Every student loves some student.
41. Represent the following sentence into the appropriate semantic network
diagram.
i. Riya took the book from Rita.
ii. Asha loaned the book to Ria.
iii. Ramesh fixed the chair with fevicol.
42. Write state space search representation of Water jug problem. There are two
jugs with capacity 4 gallon and 3gallon are given with unlimited water supply
respectively. The target is to achieve 2 gallon of water in second jug.
43. Write State Space representation of “Water Jug Problem”. There are 2

jugs of 4 L and 3 L respectively we want 2 L water in 4L jug.


44. Write state space search representation of Water jug problem. Consider two
jugs A and B, the capacity of A as 10 and the capacity of B as 6, the target
value is 4.
45. Write state space search representation of Water jug problem. Consider two
jugs A and B, the capacity of A is 9 and the capacity of B is 7, the target value
is 5.
46. Consider a graph given and find an optimal solution using AO* algorithm
where starting vertex is A and goal is F.

47. Consider a graph given and find an optimal solution using A* algorithm. where
start vertex is A and goal vertex is G

48. Consider a graph given and find an optimal solution using A* algorithm where
start vertex is A and goal vertex is F.

NOTE: 1. Practice all the examples given in the class.


2. Refer all the questions given in the class after every chapter.

You might also like