1. Who is the “father” of artificial intelligence?

a) Fisher Ada

b) John McCarthy

c) Allen Newell

d) Alan Turning


2. What is Artificial intelligence?

a) Putting your intelligence into Computer

b) Programming with your own intelligence

c) Making a Machine intelligent

d) playing a Game  

3. What are the main goals of AI?

 a)To Create Expert Systems

 b)To Implement Human Intelligence in Machines

 c) Both A and B

 d) None of the Above

4. 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

5. 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

6. What is the form of Knowledge representation?

A. IF-THEN

 B. IF-THEN-ELSE

C. IF-ELSE

D. All of the above

 7. AI is automation of activities that we associated with _________

 A) Human vocal

 B) Human thinking

 C) Human listening

 D) all of the above

8. ________ is fundamental to problem solving process

A) Search

B) Mean end analysis

C) Heuristic sort

D) all of the above

9. In 8 puzzle problem, problem state consist of how many number of Configuration of 8 tiles and Blank space

A) 9!

B) 8!

C) 9! /2

D) 8! /2

10. In 8 puzzle problem, problem state consist of how many number of Configuration of 8 tiles and Blank space which are distinct and reachable

A) 9!

B) 8!

C) 9! /2

D) 8! /2

11.Problem definition which contains some special information

About states to exploration and expansion is called_______

A) Informed search

B) Uninformed search

C) Blind search

” style=”font-size: medium; text-align: left;”>” style=”font-size: medium; text-align: left;”>

D) B and C both

12.  Which of the following is not an example of uninformed search

A) BFS- Breadth First Search

B) DFS- Depth First Search

C) DLS- Depth Limited Search

D) BFS- Best First Search

13.. BFS and DFS are respectively ________

A) Time efficient and Space efficient

B) Space efficient and Time efficient

C) Both are Time efficient

D) Both are Space efficient

14. Which of the following method cannot be used to resolve infinite state space problem?

A) Best First Search

B) Iterative deepening search

C) Depth Limited Search

D) Depth First Search

15. BFS and DFS are respectively works based on which data structure?

A) Stack and queue

B) Queue and stack

C) Priority Queue and stack

D) Stack and priority queue

16. What is Space Complexity of Depth First search algorithm?

A) B

B) b^2

C) b^b

D) b^m

17. When is breadth-first search is optimal?

A) When there is less number of nodes

B) when all step costs are equal

C) When all step costs are unequal

D) All of the above

 18 .How many proposition symbols are there in artificial intelligence?

a) 1

b) 2

c) 3

d) 4

19. Which is used to construct the complex sentences?

a) Symbols

b) Connectives

c) Logical connectives

d) All of the mentioned

20. How many logical connectives are there in artificial intelligence?

a) 2

b) 3

c) 4

d) 5

21. Which is created by using single propositional symbol?

(A) Complex sentences

(B) Atomic sentences

(C) Composition sentences

(D) None of the mentioned

22. In FOPL, a wff is a sentence which contains _____

A) Free Variable

B) Bound Variable

C) Constants

D) A and B both

22. Real World facts can be represented by ____ which consist of atomic symbols joined with connectives.

A) Well-formed formulas (wff)

B) Well formatted formulas (wff)

C) Well defined formulas (wdf)

D) Well described formulas (wdf)

Ans :- A) Well-formed formulas (wff)

 23. Which of the following is an example of CNF.

A) (A ∧~B) V (B ∧~D ∧~ C)

B) (A V ~B) V (B ∧~D ∧~ C)

C) (A ∧~B) ∧ (B ∧~D ∧~ C)

D) (A V~B) ∧ (B V ~D V ~C)

24. Which of the following proposition is not commutative?

A) P V Q

B) P ∧Q

C) P <-> Q

D) P->Q

 

 25. Input segments of AI programming contain(s)

       a)      sound

       b)      smell

       c)      touch

       d)      All of the above

       26.  Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context?

         a)      continuous speech recognition

         b)      connected word recognition

c)       c)     isolated word recognition

         d)      speaker-dependent recognition

       27.  One definition of AI focuses on problem-solving methods that process:

        a)      smell

        b)      symbols

        c)      touch

        d)      None of the above answers.

        28.  The finding of a path start state to a goal state is known as

        a)      Search

        b)      Classification

        c)      Simulation

        d)      None of these

        29.  Which approach to speech recognition avoids the problem caused by the variation in speech     patterns among different speakers?

         a)      Continuous speech recognition      

        b)      Isolated word recognition

        c)      Connected word recognition

        d)      Speaker-dependent recognition

        30.  In a rule based system, procedural domain knowledge is in the form of

        a)      Production rules

        b)      Rule interpreters

        c)      Control rules

        d)      Meta rules

 31.       Which function is used to calculate the feasibility of whole game tree?   a)  Evaluation function      b) Transposition   c) Alpha-beta pruning      d) All of the mentioned  32.       Which is identical to the closed list in Graph search?   a) Hill climbing search algorithm   b)  Depth-first search   c) Transposition table   d)  None of the mentioned   33.  What is called as transposition table?     a) Hash table of next seen positions     b) Hash table of previously seen positions     c) Next value in the search     d) None of the mentioned     
34.   How the effectiveness of the alpha-beta pruning gets increased?    a)  Depends on the nodes    b) Depends on the order in which they are executed    c) All of the mentioned    d)  None of the mentioned 

 35.       Where does the values of alpha-beta search get updated?

 a) Along the path of search

 b) Initial state itself

c) At the end

 d) None of the mentioned           36. Which value is assigned to alpha and beta in the alpha-beta pruning?     a) Alpha = max     b)  Beta = min     c) Beta = max     d) Both Alpha = max & Beta = min        37.  Which search is similar to minimax search?     a)  Hill-climbing search     b)  Depth-first search     c)  Breadth-first search     d)  All of the mentioned      38.    To which depth does the alpha-beta pruning can be applied?     a) 10 states     b) 8 States     c) 6 States     d) Any depth        39.  Which values are independent in minimax search algorithm?       a)  Pruned leaves x and y       b)  Every states are dependant       c) Root is independent       d) None of the mentioned       40.   Which approach is to pretend that a pure divide and conquer algorithm will work?       a) Goal independence      b)  Subgoal independence          c)  Both Goal & Subgoal independence       d) None of the mentioned      41.   Backtracking is based on,       a) Last in first out          b) First in first out          c) Recursion          d) Both Last in first out & Recursion

      42.   What is the space complexity of Greedy search?       a)  O(b)       b)  O(bl)       c)  O(m)       d) O(bm)       43.   In A* approach evaluation function is       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      44.    In greedy approach evaluation function is       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       45.   Greedy search strategy chooses the node for expansion       a)  Shallowest       b)  Deepest       c)  The one closest to the goal node       d) Minimum heuristic cost      46.   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

      47.   Best-First search can be implemented using the following data structure.       a) Queue       b)  Stack       c)  Priority Queue       d)  Circular Queue      48.   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

      49.    Uninformed search strategies are better than informed search strategies.       a. True       b. False

“>“>

      50.   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

      51.   A* algorithm is based on       a. Breadth-First-Search       b. Depth-First -Search       c. Best-First-Search       d. Hill climbing

      52.   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

      53.   Which is used to improve the performance of heuristic search?       a. Quality of nodes       b. Quality of heuristic function       c. Simple form of nodes       d. None of the mentioned

      54.   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

      55.   Which search uses only the linear space for searching?       a. Best-first search       b. Recursive best-first search       c. Depth-first search       d. None of the mentioned

      56.   Which function will select the lowest expansion node at first for evaluation?       a. Greedy best-first search       b. Best-first search       c. Depth-first search       d. None of the mentioned

      57.   How many types of informed search method are in artificial intelligence?       a. 1       b. 2       c. 3       4. 4

      58.   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

      59.    LIFO is ______ where as FIFO is ________       a. Stack, Queue       b. Queue, Stack       c. Priority Queue, Stack       d. Stack. Priority Queue       60.   Optimality of BFS is       a) When there is less number of nodes          b)When all step costs are equal       c) When all step costs are unequal          d) None of the mentioned

          

      61.      Which of the following statements is the best description of reproduction?

           a)      Randomly change a small part of some strings.

           b)      Randomly generate small initial values for the weights.

           c)      Randomly pick new strings to make the next generation.

           d)      Randomly combine the genetic information from 2 strings.

            

      62.      In Fuzzy set the membership function generally in ranges

            a)      0-100

            b)      100-1000

            c)      1-100

            d)      0-1

            

      63.      Special programs that assist programmers are called

            a)      heuristic processors

            b)      symbolic programmers

            c)      intelligent programming tools

            d) program recognizers

    

64.      The characteristics of the computer system capable of thinking reasoning and learning is         known is

            a)      machine intelligence

            b)      human intelligence

            c)      artificial intelligence

            d)      virtual intelligence

      65. Which of the following is correct FOPL for given English sentence.

    “Hari likes all kind of food.”

      a) ∀x: food(x) à likes (Hari,x)

      b) ∀x: food(x) à likes(x,Hari)

      c) ∃x: food(x) à likes (Hari,x)

      d) ∃x: food(x) à likes (x,Hari) 

      65. Which of the following is correct FOPL for given English sentence.

     “No one likes everyone.”

      i) ~∀x:∃y: likes(x,y)      ii) ∀x:∃y: ~ likes(x,y)    iii) ~ (∃x): ∀y: likes(x,y)

      a) i &ii                                 b) ii & iii   

      c ) i & iii                               d) i , ii & iii

      66. Which of the following is correct FOPL for given English sentence.

     “Vinod eats everything Sachin eats.”

    a) ∀x : eats(Vinod,x) à eats(Sachin,x)

    b) ∀x : eats(Sachin,x) à eats(Vinod,x)

    c) ∃x : eats(Vinod,x) à eats(Sachin,x)

    d) ∃x : eats(Sachin,x) à eats(Vinod,x)

      67. Which of the following is correct FOPL for given English sentence.

     ”Nobody loves John.”

      a) ∀x: loves(x,John)

      b) ∀x: ~loves(x,John)

      c) ∃x: loves(x,John)

      d) ∃x: ~loves(x,John)

      68.  We have two water jugs, one measures 4 Gallons (4G) while the other measure 9 Gallons         (9G). But there is no measuring label mentioned on either of these two jugs i.e. we cannot know     the exact amount filled in the jug. Now, assuming there is an infinite amount of water supply,         can we measure all 1G, 2G, 3G…….. upto 9G using these unmarked jugs

      a) 1G to 9G

      b) 3G to 9G

      c) Empty

      d) None of the above

      69.  There are two jugs each of 4 and 3 liters respectively , without any measuring marks. how         many minimum steps are required to have 2 liters of water into the 4 litre jug (the jugs can be     filled any number of times with water, and they can be emptied any number of times).

     Here we need 2 litre water in 4 litre jug (not in any of the two jugs).

a)       4

b)      5

c)       3

d)      6

“>“>

      70.  To which depth does the alpha-beta pruning can be applied?

         a)10 states

   b) 8 States

   c) 6 States

 d) Any depth

      71. The form of heuristic estimation function for A* is

      a)       g(n) – h(n)    

      b)      g(n) + h(n)

      c) g(n) * h(n)

      d) g(n) / h(n)

      72.Choose the correct option for the minmax algorithm.

     

a)       6

b)      -5

c)       4

d)      7

      73. Choose the correct options for the Alpha-Beta pruning

    

a)       7

b)      5

c)       2

d)      3 

      74.   Find the path from S to G using greedy search. The heuristic values h of each node below         the name of the node.

        

            a)       S-B-C-G

b)      S-E-D-G

c)       S-D-E-G

d)      none

      75. Can you answer following questions? Who will win the game, O or X? Which was the sixth     mark  and at which position? Assume that both the players are intelligent enough. Can you             answer following questions?

        

a)       O will win the game, The six mark was X in square nine.

b)      X will win the game, The six mark was O in square nine

c)       O will win the game, The six mark was O in square nine

d)      None of these

76.Choose  the correct option which is one of the rule for the water jug problem as given below: Pour all the water from the 4-gallon jug into the 3-gallon jug.

a)       (X, Y| X+Y <= 3 ^ X > 0) -> (0, X+Y)

b)      (X, Y| X+Y >= 3 ^ X < 0) -> (0, X+Y)

c)       (X, Y| X+Y <= 3 ^ Y > 0) -> (0, X+Y)

d)      None

      77. “Translate the following statement into FOL. “For every a, if a is a philosopher, then a is a         scholar”

      (A)    ∀ a philosopher(a) scholar(a)

      (B) ∃ a philosopher(a) scholar(a)

      (C) All of the mentioned

      (D) None of the mentioned

      78.What is the frame?

      a) A way of representing knowledge


    b) Data Structure
    c) Data Type
    d) None of the mentioned        79. Which of the following elements constitutes the frame structure? 

      a) Facts or Data

      b) Procedures and default values

      c) Frame names

      d) Frame reference in hierarchy

“>“>    

             

      80. Which of the following is an extension of the semantic network?


    a) Expert Systems


    b) Rule Based Expert Systems


    c) Decision Tree Based networks


    d) Partitioned Networks

      81. What are the limitations of the semantic networks?


    a) Intractability


    b) Lack in expressing some of the properties


    c) Incomplete


    d) Has memory constraints

      82. Semantic Network represents _____________

 

      a) Syntactic relation between concepts

      b) Semantic relations between concepts

      c) All of the mentioned

      d) None of the mentioned

      83. Which is not a property of representation of knowledge?

          a) Representational Verification


    b) Representational Adequacy
               c) Inferential Adequacy
    d) Inferential Efficiency        84.What are the main components of the expert systems? 

           a) Inference Engine


    b) Knowledge Base
    c) Inference Engine & Knowledge Base
    d) None of the mentioned        85. What is the main challenge/s of NLP?
    a) Handling Ambiguity of Sentences    
    b) Handling Tokenization
    c) Handling POS-Tagging
    d) All of the mentioned       86. Which of the following includes major tasks of NLP?
    a) Automatic Summarization
    b) Discourse Analysis
    c) Machine Translation
    d) All of the mentioned       87. Many words have more than one meaning; we have to select the meaning which makes     the most sense in context. This can be resolved by ____________
    a) Fuzzy Logic

            b) Word Sense Disambiguation

            c) Shallow Semantic Analysis

             d) All of the mentioned 

       88. What is Natural Language Processing good for?

      a)Summarize blocks of text

      b)Automatically generate keyword tags

      c)Identify the type of entity extracted

      d) All of the above

       89. What is Machine Translation?
    a) Converts one human language to another
    b) Converts human language to machine language
    c) Converts any human language to English
    d) Converts Machine language to human language        90.What is Morphological Segmentation? 

           a) Does Discourse Analysis


    b) Separate words into individual morphemes and identify the class of the morphemes

           c) Is an extension of propositional logic
    

           d) None of the mentioned