AILABQuiz

The search algorithm which is similar to the minimax search, but removes the branches that don't affect the final output is known as__.

• Depth-first search

• Breadth-first search

• Alpha-beta pruning

• None of these

Among the given options, which search algorithm requires less memory?

• Depth First Search

• Breadth-First Search

• Can ‘t tell

The PEAS in the task environment is about____________.

• Peer, Environment, Actuators, Sense

• Performance, Environment, Actuators, Sensors

• Perceiving, Environment, Actuators, Sensors

• None of these

A* Algorithm based on

• Depth-first search

• Breadth-first search

• Best-first Search

• None of these

What is the assumptions of Naïve Bayesian classifier?

• None of these
   
  

• It assumes that each input variable is dependent

• It assumes that each input attributes are independent of each other

• It assumes that the data dimensions are dependent

Arrange the following steps in sequence in order to calculate the probability of an event through Naïve Bayes classifier.

  I. Find the likelihood probability with each attribute for each class.
II. Calculate the prior probability for given class labels.
III. Put these values in Bayes formula and calculate posterior probability.
IV. See which class has a higher probability, given the input belongs to the higher probability class.

• I → II → III → IV
  
  
  

• II → I → III → IV

• III → II → I → IV

• II → III → I → IV

Which of the following is an example of an ensemble learning algorithm?

• Decision Tree

   

• K-Nearest Neighbors (KNN)

• Support Vector Machine (SVM)

• Random Forest

Ensemble of classifiers can be constructed by

• manipulating training set

• manipulating input features

• manipulating class labels

• all of these