50 MCQ’s

1. What is Artificial Intelligence?

a) Artificial Intelligence is a field that aims to make humans more intelligent
b) Artificial Intelligence is a field that aims to improve the security
c) Artificial Intelligence is a field that aims to develop intelligent machines
d) Artificial Intelligence is a field that aims to mine the data

2. Which of the following is not the commonly used programming language for Artificial
Intelligence?
a) Perl
b) Java
c) PROLOG
d) LISP
3. The total number of proposition symbols in AI are ________
a) 3 proposition symbols
b) 1 proposition symbols
c) 2 proposition symbols
d) No proposition symbols
4. The total number of logical symbols in AI are ____________
a) There are 3 logical symbols
b) There are 5 logical symbols
c) Number of logical symbols are based on the input
d) Logical symbols are not used

5. What is state space?

a) The whole problem
b) Your Definition to a problem
c) Problem you design
d) Representing your problem with variable and parameter
6. What is the main task of a problem-solving agent?
a) Solve the given problem and reach to goal
b) To find out which sequence of action will get it to the goal state
c) All of the mentioned
d) None of the mentioned

7. A production rule consists of ____________

a) A set of Rule
b) A sequence of steps
c) Set of Rule & sequence of steps
d) Arbitrary representation to problem
8. Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
9. Which is the best way to go for Game playing problem?
a) Linear approach
b) Heuristic approach (Some knowledge is stored)
c) Random approach
d) An Optimal approach
10. A heuristic is a way of trying ___________
a) To discover something or an idea embedded in a program
b) To search and measure how far a node in a search tree seems to be from a goal
c) To compare two nodes in a search tree to see if one is better than another
d) All of the mentioned
11. A* algorithm is based on ___________
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing

12. The search strategy the uses a problem specific knowledge is known as ___________
a) Informed Search
b) Best First Search
c) Heuristic Search
d) All of the mentioned
13. Best-First search is a type of informed search, which uses ________________ to
choose the best next node for expansion.
a) Evaluation function returning lowest evaluation
b) Evaluation function returning highest evaluation
c) Evaluation function returning lowest & highest evaluation
d) None of them is applicable

14. Best-First search can be implemented using the following data structure.
a) Queue
b) Stack
c) Priority Queue
d) Circular Queue

15. Heuristic function h(n) is ________

a) Lowest path cost
b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node
d) Average path cost

16. Greedy search strategy chooses the node for expansion in ___________
a) Shallowest
b) Deepest
c) The one closest to the goal node
d) Minimum heuristic cost

17. What is the space complexity of Greedy search?

a) O(b)
b) O(bl)
c) O(m)
d) O(bm)

18. What is the evaluation function in A* approach?

a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
19. A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never
underestimates the cost to reach the goal.
a) True
b) False
20. Which search is implemented with an empty first-in-first-out queue?
a) Depth-first search
b) Breadth-first search
c) Bidirectional search
d) None of the mentioned
21. Which search strategy is also called as blind search?
a) Uninformed search
b) Informed search
c) Simple reflex search
d) All of the mentioned
22. What is the space complexity of Depth-first search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)

23. Strategies that know whether one non-goal state is “more promising” than another are
called ___________
a) Informed & Unformed Search
b) Unformed Search
c) Heuristic & Unformed Search
d) Informed & Heuristic Search

24. Which of the following is/are Uninformed Search technique/techniques?

a) Breadth First Search (BFS)
b) Depth First Search (DFS)
c) Bidirectional Search
d) All of the mentioned
25. Which data structure conveniently used to implement BFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned
26. Which data structure conveniently used to implement DFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned
27. uniform-cost search expands the node n with the __________
a) Lowest path cost
b) Heuristic cost
c) Highest path cost
d) Average path cost
28. LIFO is ______ where as FIFO is ________
a) Stack, Queue
b) Queue, Stack
c) Priority Queue, Stack
d) Stack. Priority Queue
29. For general graph, how one can get rid of repeated states?
a) By maintaining a list of visited vertices
b) By maintaining a list of traversed edges
c) By maintaining a list of non-visited vertices
d) By maintaining a list of non-traversed edges
30. DFS is ______ efficient and BFS is __________ efficient.
a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space
31. What is the other name of informed search strategy?
a) Simple search
b) Heuristic search
c) Online search
d) None of the mentioned
32. Which search uses the problem specific knowledge beyond the definition of the
problem?
a) Informed search
b) Depth-first search
c) Breadth-first search
d) Uninformed search
33. Which search is complete and optimal when h(n) is consistent?
a) Best-first search
b) Depth-first search
c) Both Best-first & Depth-first search
d) A* search
34. Which search method will expand the node that is closest to the goal?
a) Best-first search
b) Greedy best-first search
c) A* search
d) None of the mentioned
35._______________ Is an algorithm, a loop that continually moves in the direction of
increasing value – that is uphill.
a) Up-Hill Search
b) Hill-Climbing
c) Hill algorithm
d) Reverse-Down-Hill search
36. When will Hill-Climbing algorithm terminate?
a) Stopping criterion met
b) Global Min/Max is achieved
c) No neighbor has higher value
d) All of the mentioned
37. Hill climbing sometimes called ____________ because it grabs a good neighbor state
without thinking ahead about where to go next.
a) Needy local search
b) Heuristic local search
c) Greedy local search
d) Optimal local search
38. Which search is equal to minimax search but eliminates the branches that can’t
influence the final decision?
a) Depth-first search
b) Breadth-first search
c) Alpha-beta pruning
d) None of the mentioned
39. Which values are independant in minimax search algorithm?
a) Pruned leaves x and y
b) Every states are dependant
c) Root is independant
d) None of the mentioned
40. Which search is similar to minimax search?
a) Hill-climbing search
b) Depth-first search
c) Breadth-first search
d) All of the mentioned
41. There exist only two types of quantifiers, Universal Quantification and Existential
Quantification.
a) True
b) False

42. Which is used to construct the complex sentences?

a) Symbols
b) Connectives
c) Logical connectives
d) All of the mentioned
43. How many proposition symbols are there in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
44. A) Knowledge base (KB) is consists of set of statements.
B) Inference is deriving a new sentence from the KB.
Choose the correct option.
a) A is true, B is true
b) A is false, B is false
c) A is true, B is false
d) A is false, B is true
45. Which is not Familiar Connectives in First Order Logic?
a) and
b) iff
c) or
d) not

46. What are Semantic Networks?

a) A way of representing knowledge
b) Data Structure
c) Data Type
d) None of the mentioned

47. Frames in artificial intelligence is derived from semantic nets.

a) True
b) False

48. What is back propagation?

a) It is another name given to the curvy function in the perceptron
b) It is the transmission of error back through the network to adjust the inputs
c) It is the transmission of error back through the network to allow weights to be adjusted so
that the network can learn
d) None of the mentioned
49. The network that involves backward links from output to the input and hidden layers is
called _________
a) Self organizing maps
b) Perceptrons
c) Recurrent neural network
d) Multi layered perceptron
50. Which of the following is an application of NN (Neural Network)?
a) Sales forecasting
b) Data validation
c) Risk management
d) All of the mentioned
 Long Questions
1-Give a brief introduction to the Turing test in AI?

2-What is NLP? What are the various components of NLP?

3-What are some misconceptions about AI?

4-What is an Artificial neural network? Name some commonly used Artificial Neural networks.

5-What is knowledge representation in AI?

6-What are the various techniques of knowledge representation in AI?

7- What is a heuristic function, and where is it used?

8- What are Intelligent Agents, and How are They Used in AI?

What is Natural language processing? Mention its application domain in AI. What are
some of the problems which arise in natural language understanding for autonomous machines
like robots, intelligent computers
What is Natural language processing? Mention its application domain in AI. What are
some of the problems which arise in natural language understanding for autonomous machines
like robots, intelligent computers
What is Natural language processing? Mention its application domain in AI. What are
some of the problems which arise in natural language understanding for autonomous machines
like robots, intelligent computers
What is Natural language processing? Mention its application domain in AI. What are
some of the problems which arise in natural language understanding for autonomous machines
like robots, intelligent computers
What is Natural language processing? Mention its application domain in AI. What are
some of the problems which arise in natural language understanding for autonomous machines
like robots, intelligent computers

9- What is natural language processing ? what problems might arising while understanding NLP.

Write short notes on the following: ( 15 Marks )

(i) Top down and bottom up parsing (ii) Computer vision (iii) Turing Test.

10- What is lexicon?

11-What is state space representation in AI?

12-Explain followings.

1- heuristic search 2- heuristic function

13-Differentiate informed vs uninformed search techniques.

14- Complete the following propagation logic

(pq)→rq

15- Discuss all types of ambiguities in NLP.

16- discuss NLP pipelines in detail.
17- Depth First Search? Consider The Following Graph. Edges Between Nodes May Only Be
Traversed In The Direction.

18- Breadth First Search? Consider The Following Graph. Edges Between Nodes May Only Be
Traversed In The Direction
19- greedy best First Search? Consider The Following Graph. Edges Between Nodes May Only
Be Traversed In The Direction

20- Solve the following using minmax.

21- Explain some basic concepts and terms related to Genetic Algorithm
22- How would you describe what Genetic Algorithms are?
23- What is a Mutation and why is it programmed into the algorithm?
24- Compare the Single-Point and Two-Point crossover in genetic algorithm.
25 - What do you mean by genetic algorithm. What king of problems are best duited for genetic
algorithm.

26- What are the Examples of AI in real life?

27- What is hill climbing? Discuss its different regions in state space landscape.
28- Discuss some problesm in hill climbing algorithms.
29- Discuuc different types of hill climbing algorithm.
30- Differentiate between best first search and A* search.
31- Differentiate between Graph and Trees.