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

- Newton's Method
- Simulated Annealing.
- Genetic Algorithm
- Downhill simplex search

Question 32 : Which of the following is the correct definition of “an aunt” in FOL? Here, Aunt(x,y) is read as x is an aunt of y and Sister(x,y) is read as x is a sister of y.

- ∀x ∀y (Aunt(x,y) ---> ∀z (Sister(z, x) v Parent(z, y)))
- ∀x ∀y (Aunt(x,y) ---> ∃z (Sister(z,x) ∧ Parent(z,y)))
- ∀x ∀y (Aunt(x,y) ---> ∃z (Sister(x,z) ∧ Parent(z,y)))
- ∀x ∀y (Aunt(x,y) ---> ∃z (Sister(x,z) ---> Parent(z,y)))

Question 33 : It converts the fuzzy quantities into crisp quantities.

- Knowledge base
- defuzzification unit
- fuzzification unit
- Decision-making Unit

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

- Simulated Annealing.
- Genetic Algorithm
- random search
- steepest descent

Question 35 : During learning, if a Perceptron misclassifies a training data positively, i.e., erroneously yields an output +1 instead of –1, the interconnection weights are ..............

- Increased
- Decreased
- Kept unaltered
- make it zero

Question 36 : ____________________ is tolerant to imprecision and uncertainty and follows a multivalued logic.

- Hard Computing
- Soft Computing
- Analytical Model based computing
- Adhoc Computing

Question 37 : What is back propagation?

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

Question 38 : Choose the correct option for soft computing technique

- Soft computing is deterministic
- Soft computing output is precise
- Soft computing is based on crisp logic
- Soft computing can deal with incomplete, uncertain and noisy data.

Question 39 : What is TRUE for linear activation functions.

- Weights and biases of neural network with linear activation function will not get updated during backpropogation.
- The network with linear activation function will not be able to learn complex patterns in data.
- They can be used only for binary classifier
- The derivative of linear activation function is zero.

Question 40 : _________________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.

- Random search
- Simulated Annealing.
- Newton's Method
- steepest descent

Question 41 : In Membership function graph x-axis represents?

- Universe of discourse
- degrees of membership in the [0, 1] interval
- degrees of discourse
- Universe of membership

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

- Simulation
- human intuition
- Optimization
- genetic algorithms

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

- True, False.
- True, True
- False, False
- False, True

Question 44 : Which environment is called as semi dynamic?

- Environment does not change with the passage of time
- Agent performance changes
- Environment will be changed
- Agent performance does not change

Question 45 : In the case of______________, both artificial neural network and fuzzy system work independently from each other.

- cooperative neural fuzzy systems
- Artificial Neural Network
- Neural Network
- neuro fuzzy system

Question 46 : Suppose you are designing a handwritten digit recognition system using MLP.Dataset contains 28*28 pixel images of handwritten digits from 0-9.Choose the correct number of neuron for input and output layer.

- Input layer:100 neurons and Output layer:9 neuron.
- Input layer:100 neurons and Output layer:100 neuron
- Input layer:10 neurons and Output layer:2 neuron
- Input layer:784 neurons and Output layer:10 neuron

Question 47 : Any soft‐computing methodology is characterized with

- precise solutions
- control actions are unambiguous and accurate
- Control action is formally defined
- algorithm which can easily adapt with the change of dynamic environment

Question 48 : Classification and Regression are the examples of ............learning

- Supervised
- Unsupervised
- dependent
- Specialized

Question 49 : Rules are expressed as a set of?

- Switch statement
- Using Loop
- if-then statements
- Using continue statement

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

- artificial intelligence area
- optimization area
- complete enumeration family of methods
- Non-computer based (human) solutions area

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

- Think Humanly
- Think Rationally
- Act Humanly
- Act Mechanically

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

- Atificial Moderate Intelligence
- Atificial Narrow Intelligence
- AtificialGeneral Intelligence
- AtificialSuper Intelligence

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

- Simpe Reflex Agent
- Utility Based Agent
- Goal Based Agent
- Model Based Agent

Question 54 : The suitable task environment for Fighter plane simulator agent is___

- Fully Observable
- Deterministic
- Dynamic
- Episodic

Question 55 : ____Agent provides crude binary distinction between Happy and Unhappy states

- Simple reflex agent
- Model based agent
- Learning agent
- Goal Based agent

Question 56 : 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 ?

- A,B,C,D,,E,F,G
- A,B,D,C,F,G,E,
- A,B,D,E,C,F,G
- A,B,D,E,E,G,F

Question 57 : ___ can not be admissible Hueristic for 8 puzzle problem.

- Number of tiles in place
- Number of misplaced tiles
- Manhattan Distance
- Manchester Distance

Question 58 : 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 ?

- A,B,C,D,,E,F,G
- A,B,D,C,F,G,E,
- A,B,D,E,C,F,G
- A,B,D,E,E,G,F

Question 59 : Number of Nodes expanded in MinMax algorithm is _____ that of Alpha Beta Pruning method.

- less than
- always same as
- same or greater than
- less or same as

Question 60 : Local beam search with k = 1 is _____ search

- Depth First
- Iterative deepening
- Hill Climbing
- Breadth First