Scribd
Upload
185 views4 pages

Copy of AIML Simp-Tie

This document provides sample questions that may be asked in the final assessment for the AI-ML course. It includes 5 modules worth of questions ranging from theoretical to practical applications of various AI and machine learning algorithms. Some of the key topics covered include Bayes theorem, K-means clustering, naive Bayes classification, backpropagation in neural networks, decision trees, reinforcement learning and more. The modules progress from more conceptual questions to practical questions applying different algorithms.

Uploaded by

Sana Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
185 views4 pages

Copy of AIML Simp-Tie

This document provides sample questions that may be asked in the final assessment for the AI-ML course. It includes 5 modules worth of questions ranging from theoretical to practical applications of various AI and machine learning algorithms. Some of the key topics covered include Bayes theorem, K-means clustering, naive Bayes classification, backpropagation in neural networks, decision trees, reinforcement learning and more. The modules progress from more conceptual questions to practical questions applying different algorithms.

Uploaded by

Sana Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

AI-ML(18CS71)-IMP and SIMP Questions

Disclaimer: These questions are prepared by the TIE review team teachers/mentors by
referring to various question banks and Internal question papers from more than 10
colleges. The sole purpose of this is to give a thorough idea about the Questions in the
final assessment paper(sem-end exams).

Module-4 (Start at the last)

1. What is Bayes theorem and maximum posterior hypothesis? Derive an equation for
MAP hypothesis using Bayes Theorem -12M
2. Demonstrate the derivation of K- Means Algorithm, also explain Gibbs Algorithm
3. Explain the Naive Bayes classifier and briefly explain Bayesian belief networks with
example
4. Explain the Brute Force MAP learning algorithm and write a short note about EM
Algorithm
5. Prove that a MAP can be used to predict probabilities and explain how it can be used to
minimize the squared error between the actual output hypothesis and the predicted
output hypothesis (max likelihood hypothesis for predicting probabilities).
6. Describe the Minimum Description length principle in brief with equations.
7. The following table gives a data set about stolen vehicles. Using Naive Bayes classifier
classifies the new data (Red. SUV. Domestic)
Module-1 (Pretty much theory and boring)

1. Define Artificial Intelligence and list the task domains of Artificial Intelligence.
2. Explain and Implement A* and AO* Algorithm with suitable example
3. Explain(usual definitions): Production system and characteristics (with def),
Problem characteristics(with def), AI techniques (define AI), Turing test, Control
strategy, Hill Climbing and its adv-10M
4. Write a heuristic function for traveling salesman problems? Also briefly explain
the advantages and disadvantages of BFS/DFS Algorithms
5. What is a state-space search? Write an algorithm and explain the water Jug
problem as a state-space search.
6. Discuss the tic-tac-toe problem/8 Puzzle problem in detail and explain how it can
be solved using AI techniques

Module-2 (Start First)

1. Explain Concept Learning using water sport examples and also explain the hypothesis
space of Find-S.
2. Convert the following statements into First Order Predicate Logic (i)
Everybody loves Harshavardhan (ii) Every house is a physical object (iii) No house is a
human being (iv) Every house has an owner (v) Vatsii owns a house
3. Define Knowledge Representation. What are the techniques and approaches used for
Knowledge Representation? List out the issues of Knowledge representation-12M
4. List out the steps of Candidate Elimination Algorithm. Apply the algorithm to obtain the
final version space for the training example:

5. Difference between (i)Training data and Testing data (ii)Supervised, Unsupervised and
Reinforcement Learning (iii)Inductive biased hypothesis space and unbiased learner
6. Explain the following (i)Find S (ii)IB wrt Candidate Elimination algorithm

Module-3 (Start Second)

1. Derive the Back propagation Rule for artificial neural networks.


2. Explain ID3 Algorithm with an example.
3. Explain perceptron and compute AND and OR Boolean function using
perceptron
4. For the transactions shown in the table compute the following: –.
(a)Entropy of the collection of transaction records of the table with
respect to classification. (b). What is the information gain of A1 and A2
relative to the transactions of the table?

5. Write a note on Decision Trees. What are the problems faced wrt
decision trees and Neural Network
6. Calculate info gain and entropy for the following:
Module-5 (Start after 1st Module)

1. With a neat sketch briefly explain Global Approximation of Radial basis


Function
2. Explain locally weighted regression in detail
3. Discuss the Learning tasks and Q learning in the context of reinforcement
learning
4. What is Instance based learning and explain KNN algorithm?
5. Write a note on Locally Weighted Regression.

You might also like