Gujarat Technological University

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY


BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3172421 Date:29/12/2021
Subject Name:AI and Machine Learning in Power Electronics
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) Define version space, candidate eliminations and inductive bias. 03
(b) How the knowledge should be represented in AI techniques? 04
(c) Compare supervised, unsupervised and reinforcement machine 07
learning methods.

Q.2 (a) Define state space search. 03


(b) What are the issues in design of search programs? 04
(c) Explain steepest ascent hill climbing algorithm. 07
OR
(c) Explain convert to clause form algorithm. 07
Q.3 (a) Differentiate depth first search and breadth first search algorithm. 03
(b) What problems is Artificial Intelligence helping to solve for 04
Samsung company?
(c) How does Alibaba use artificial intelligence? 07
OR
Q.3 (a) Explain computable functions and predicates. 03
(b) What are the key challenges and learning points for the Dominos using 04
AI?
(c) Explain AO* algorithm for problem reduction. 07
Q.4 (a) Draw neural representation of AND gate. 03
(b) Write prolog program to find maximum number from list. 04
(c) Explain Decision tree algorithm with issues. 07
OR
Q.4 (a) Describe radial basis function. 03
(b) Explain process of weights change during training in multilayer 04
network.
(c) Explain K- Nearest Neighbors algorithm. 07
Q.5 (a) Define Hypothesis Space. 03
(b) Let hypothesis space as three function h1,h2 and h3. P(h1|D)=0.4, 04
P(h2|D)=0.3, P(h3|D)=0.3. For new instance x, h1(x)=+1, h1(x)=+1,
h1(x)= -1. What is most probable classification of x?
(c) Explain Naïve Bayes algorithm. 07
OR
Q.5 (a) Give an advantages of Gibbs algorithm over Bayes optimal classifier. 03
(b) Describe relationship between Maximum Likelihood and Least squared 04
Error Hypothesis.
(c) Explain Minimum Description Length Principle. 07
************

You might also like