Artificial Intelligence and Soft Computing (AISC) MCQ's




Question 91 :
Give the height h(A) of a fuzzy set A where μA(χ)={0.2,0.5.,0.6,0.1,0.9}


  1. 0.5
  2. 0.1
  3. 1
  4. 0.9
  

Question 92 :
___agent doesn’t maintain an internal state that depends on the percept history.


  1. Simpe Reflex Agent
  2. Utility Based Agent
  3. Goal Based Agent
  4. Model Based Agent
  

Question 93 :
______________ is the first operator applied on population


  1. Reproduction
  2. Recombination
  3. Mutation
  4. Crossover
  

Question 94 :
Which form is called as a conjunction of disjunction of literals?


  1. Conjunctive normal form
  2. Disjunctive normal form
  3. Normal form
  4. First normal form
  

Question 95 :
Based on thougth/learning , behaviour and performance which is not the concept involved in AI definition?


  1. Think Humanly
  2. Think Rationally
  3. Act Humanly
  4. Act Mechanically
  

Question 96 :
which of the following is slower optimization method?


  1. Simulated Annealing.
  2. Genetic Algorithm
  3. random search
  4. steepest descent
  

Question 97 :
____ is not a Critical category of AI, based on the capacity of intelligence.


  1. Atificial Moderate Intelligence
  2. Atificial Narrow Intelligence
  3. AtificialGeneral Intelligence
  4. AtificialSuper Intelligence
  

Question 98 :
α <==> β is ________ connective and is equivalent to _____ boolean GATE


  1. Bi conditional , OR
  2. Bi conditional , XOR
  3. Implication , XOR
  4. Bi conditional , X NOR
  

Question 99 :
_________________explores the parameter space of an objective function sequentially in a seemingly random fashion to find the optimal point that minimizes or maximizes the objective function.


  1. Random search
  2. Simulated Annealing.
  3. Newton's Method
  4. steepest descent
  

Question 100 :
Which basic logical operation cannot perform by single layer McCulloch Pitts model?


  1. XOR
  2. AND
  3. OR
  4. NOT
  

Question 101 :
α -> β is FALSE only when α is _____ and β is ________


  1. TRUE, TRUE
  2. FALSE, TRUE
  3. TRUE, FALSE
  4. FALSE, FALSE
  

Question 102 :
Fuzzy logic is useful for both commercial and practical purposes.


  1. True, False.
  2. True, True
  3. False, False
  4. False, True
  

Question 103 :
What is FOPL equivalent for All Romans were either loyal to Caesar or hated him


  1. ∀x roman(x)-> loyalTo(x,Caesar) V hate(x,Caesar)
  2. ∀x roman(x) ∧ loyalTo(x,Caesar) V hate(x,Caesar)
  3. ∃x roman(x) ∧ loyalTo(x,Caesar) V hate(x,Caesar)
  4. ∃x roman(x)-> loyalTo(x,Caesar) V hate(x,Caesar)
  

Question 104 :
Fuzzy controllers are built on the basis of .........


  1. Fuzzy Extension principle
  2. Membership function
  3. Fuzzy Inference Systems
  4. Fuzzy variables
  

Question 105 :
Which is not an example of NLP application?


  1. Document Summaraization
  2. Language Translation
  3. Smart Assistant
  4. Voice Recognition
  

Question 106 :
For a perfect binary tree if BFS visits the nodes in following order : A,B,C,D,E,F,G then what will be order for DFS ?


  1. A,B,C,D,,E,F,G
  2. A,B,D,C,F,G,E,
  3. A,B,D,E,C,F,G
  4. A,B,D,E,E,G,F
  

Question 107 :
A full cycle of the downhill simplex search involves the following steps


  1. Reflection, Expansion, Contraction, Shrinkage
  2. Expansion, Contraction, Shrinkage, Reflection
  3. Contraction, Shrinkage, Reflection, Expansion
  4. Shrinkage, Reflection, Expansion, Contraction
  

Question 108 :
Properties of fuzzy sets is


  1. Intersection
  2. Union
  3. Compliment
  4. Commutative
  

Question 109 :
Genetic algorithms belong to the family of methods in the


  1. artificial intelligence area
  2. optimization area
  3. complete enumeration family of methods
  4. Non-computer based (human) solutions area
  

Question 110 :
What is back propagation?


  1. It is another name given to the curvy function in the perceptron
  2. It is the transmission of error back through the network to adjust the inputs
  3. It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn
  4. to develop learning algorithm for single layer feedforward neural network
  

Question 111 :
which of the following is Derivative Based Optimization method?


  1. Newton's Method
  2. Simulated Annealing.
  3. Genetic Algorithm
  4. Downhill simplex search
  

Question 112 :
Which of the following sentences represent 'No politician is honest'?


  1. ∃x (¬(politician(x)) __> ¬(honest(x)))
  2. ∀x (politician(x) ∧ ¬(honest(x)))
  3. ∀x (politician(x) __> ¬(honest(x)))
  4. ∃x (honest(x) __> ¬(politician(x)))
  

Question 113 :
Which of the following are the drawbacks of Hill Climbing?


  1. Hill Climbing is not an informed search algorithm
  2. It is not complicated
  3. The search may get stuck at a local optimum
  4. Hill Climbing requires an exponential amount of memory
  

Question 114 :
Which approach is most suited to structured problems with little uncertainty


  1. Simulation
  2. human intuition
  3. Optimization
  4. genetic algorithms
  

Question 115 :
Local Search algorithms are good for _____


  1. Optimal Solutions
  2. Problems with memory constraints
  3. Problem with no memory constraints
  4. Problem with no time constraints
  

Question 116 :
Fuzzification Inference Unit converts ........ input into ........set


  1. Crisp, Fuzzy
  2. Fuzzy, Crisp
  3. Crisp, Crisp
  4. Fuzzy,Fuzzy
  

Question 117 :
In Decision Tree, the leaf node represents _____


  1. test on attribute
  2. class label
  3. outcome of test
  4. cluster
  

Question 118 :
The ____ can not be regarded as type of planning in AI


  1. Total Order planning
  2. Partial Order Planning
  3. Hierarchical Planning
  4. Mesh Planning
  

Question 119 :
For a perfect binary tree if BFS visits the nodes in following order : A,B,C,D,E,F,G then what will be order for Iterative deepening DFS ?


  1. A,B,C,D,,E,F,G
  2. A,B,D,C,F,G,E,
  3. A,B,D,E,C,F,G
  4. A,B,D,E,E,G,F
  

Question 120 :
. In CNF, existentially quantified variables are replaced by a ___ process.


  1. Recursion
  2. Iteraton
  3. Skolemization
  4. Normalization
  
Pages