Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
218 views2 pages

Assignment 2 AI 2025

This document outlines an assignment for B Tech Semester VI students in Computer Engineering and Information Technology, focusing on Artificial Intelligence. It includes a series of questions covering topics such as neural networks, expert systems, genetic algorithms, Markov Decision Processes, fuzzy logic, reinforcement learning, and value iteration algorithms. Students are instructed to complete the assignment, have it signed by a lecturer, and submit it as a PDF by April 26, 2025.
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
0% found this document useful (0 votes)
218 views2 pages

Assignment 2 AI 2025

This document outlines an assignment for B Tech Semester VI students in Computer Engineering and Information Technology, focusing on Artificial Intelligence. It includes a series of questions covering topics such as neural networks, expert systems, genetic algorithms, Markov Decision Processes, fuzzy logic, reinforcement learning, and value iteration algorithms. Students are instructed to complete the assignment, have it signed by a lecturer, and submit it as a PDF by April 26, 2025.
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/ 2

Ganpat University

Faculty of Engineering
B Tech Semester VI Computer Engineering/ Information Technology /Computer
Engineering with Artificial Intelligence
2CEIT606: Artificial Intelligence
Assignment -2
Instruction - The right-most text indicates the Course Outcomes (CO) Numbers, followed by Bloom’s taxonomy level
of the question, R: Remembering, U: Understanding, A: Applying, N: Analyzing, E: Evaluating, C: Creating.

Q-1 Explain a Multi-Layered Neural Network with all possible parameters. What is an 3-U
activation function and loss function in a neural network and why is it necessary? Write
down at least three Activation Functions and loss Functions according to classification
and regression problems.
Q-2 Draw and explain the architecture of rule-based expert system architecture. 2-U
Q-3 Answer the questions by taking one example: 3-A
1. Draw a Flow chart of the Genetic Algorithm
2. Explain the Roulette wheel selection method.
3. Explain Uniform crossover.
4. Explain the swap mutation technique.
5. Explain the fitness function
6. Explain the stopping criteria
7. Write down the parameters of the Genetic algorithm.
Q-4 Given the below knowledge base, show all steps of resolution to determine the answer 2-A
to this query “What course would Meera like?”.
1. Meera only likes easy courses.
2. Engineering courses are hard.
3. All the courses in the CE department are easy.
4. AI is a course in CE.
Q-5 What is a Markov Decision Process (MDP)? Explain the components of MDP and how 1-U
they interact to make decisions in a stochastic environment.
Q-6 List out the fuzzy set operation. Create your example to apply the fuzzy set operations. 3-E
Q. 7 You have a new burglar alarm installed at home. It is fairly reliable at detecting burglary, 4-E
but also sometimes responds to minor earthquakes. You have two neighbors, John and
Merry, who promised to call you at work when they hear the alarm. John always calls
when he hears the alarm, but sometimes confuses the telephone ringing with the alarm
and calls too. Merry likes loud music and sometimes misses the alarm. Given the
evidence of who has or has not called, we would like to estimate the probability of a
burglary. Find P(M) and P(B|M).

Q. 8 What is Fuzzy logic? Explain Membership functions of Fuzzy logic with applications. 3-A
Prove Fuzzy De Morgan’s Law.
Q. 9 Define Reinforcement Learning by using an appropriate diagram and explain it in detail 3-R
with the help of a given example “Teaching a dog a new trick by the trainer”.
Q. 10 Using the racing car problem depicted in the figure below, Answer the following 4-A
questions:
1. Demonstrate how the Value Iteration algorithm can be applied and calculate the
value of V2 for all states with assuming no discount factor.
2. Demonstrate how the Value Iteration algorithm can be applied and calculate the
value of V2 for all states with discount factor 0.5.
3. Demonstrate how the policy Iteration algorithm can be applied and find out
optimal policy.

Transition Model T(s,a,s’)


Source → Cool Warm Overheated
Destination ↓ slow fast slow fast slow Fast
Cool 1.0 0.5 0.5 - - -
Warm - 0.5 0.5 - - -
Overheated - - - 1.0 - -

Reward Value R(s,a,s')


Source → Cool Warm Overheated
Fas
Destination ↓ slow fast slow fast slow
t
Cool +1 +2 +1 - - -
Warm - +2 +1 - - -
Overheated - - - -10 - -

Notes –
1) Students are required to write the answers of all above questions.
2) Once you have completed writing the assignment in FILE PAGES, get it signed by the
lecturer faculty before the deadline. Then, convert your assignment to a PDF file. This PDF
must be uploaded through the Google Form link provided in the QR code to submit your
work. In addition, keep your written assignment, signed by the faculty lecturer, in your
Practical File for your records.
3) Last date of online submission – 26th April 2025, 03:30 pm.

Prof. Hiten M Sadani Prof. Bhavisha R Suthar Prof. Manan D Thakkar


Computer Engineering Department Information Technology Department Computer Engineering Department

You might also like