0% found this document useful (0 votes)
19 views

Assignments Theory

The documents discuss machine learning, artificial intelligence, and related concepts across six assignments. Key topics covered include supervised and unsupervised learning, classification algorithms, neural networks, linear and logistic regression, propositional and first-order logic, and decision trees.
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views

Assignments Theory

The documents discuss machine learning, artificial intelligence, and related concepts across six assignments. Key topics covered include supervised and unsupervised learning, classification algorithms, neural networks, linear and logistic regression, propositional and first-order logic, and decision trees.
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

UNIVERSITY OF PETROLEUM AND ENERGY STUDIES

Assignment 1

1. Discuss the term Machine Learning.


2. Give a brief history of ML.
3. How is Artificial Intelligence related to Machine learning and Deep learning? Explain
it by giving the block diagram related to these three concepts.
4. Discuss and differentiate: Supervised Leaning, Unsupervised Learning and
Reinforcement Learning.
5. Write a detailed note on the “Classification” in Machine Learning. Take your own
day-to-day examples to explain different types of predictive models of Classification
in machine learning.
6. Give a sketch of the development of Computers, starting from first generation of
Computers to the latest one.
7. How would you compare a human with a machine like Computers in terms of speed,
accuracy and precision? Take your own example for explaining the clock speed of
computers and of a human.
UNIVERSITY OF PETROLEUM AND ENERGY STUDIES

Assignment 2

1. Discuss Tautologies by taking an example of it.


2. Is this a tautology?
 (P => Q)
 (Q => P)
Support your answer by taking your own example.
3. Prove that (P OR Q) OR (NOT(P) AND NOT(Q)) is a tautology.
4. State the condition when the “Two sentences” are said to be logically equivalent.
5. Prove that P OR Q and NOT(NOT(P) AND NOT(Q)) are logically equivalent

6. What are the Limitations of propositional logic?


7. Discuss various problems with propositional logic and how these can be covered by
first-order logic?
8. Discuss various Elements of first-order logic.
9. As an AI expert what problems do you see in a propositional logic?
UNIVERSITY OF PETROLEUM AND ENERGY STUDIES

Assignment 3

1.

2.

3. Translate the following English sentences to Propositional Logic.


Propositions: (R)aining, Liron is (S)ick, Liron is (H)ungry, Liron is (HA)appy,
Liron owns a (C)at, Liron owns a (D)og

 It is raining if and only if Liron is sick


 If Liron is sick then it is raining, and vice versa
 It is raining is equivalent to Liron is sick
 Liron is hungry but happy
4.

5.
6. Translate each of the following sentences into First Order Logic (FOL):
(a) Not all cars have carburetors

(b) Some people are either religious or pious

(c) No dogs are intelligent


(d) All babies are illogical

7. Check the validity of the following implications:


P → (Q → R) equivalent to (P → Q) → (P → R)

8. Prove that [(P → Q) ∨ (R → S)] → [(P ∨ R) → (Q ∨ S)] is a contingency.

9. Translate each of the following sentences into First Order Logic (FOL):

(a) Every number is either negative or has a square root

(b) Some numbers are not real

(c) Every connected and circuit-free graph is a tree

(d) Not every graph is connected

10. Translate each of the following sentences into First Order Logic (FOL):

(a) All that glitters is not gold

(b) Not all that glitters is gold


(c) There is a barber who shaves all men in the town who do not shave
themselves
(d) Every connected and circuit-free graph is a tree


UNIVERSITY OF PETROLEUM AND ENERGY STUDIES

Assignment 4

1. Explain decision tree terminology.


2. How does the Decision Tree algorithm Work for classification?
3. In the below mini-dataset, the label we‘re trying to predict is the type of
fruit. This is based off the size, color, and shape variables.

i.

Calculate the information gained if we select the color variable.


ii. Calculate the information gained if we select the size
variable.

iii. Calculate the information gained if we select the shape variable.


4. Consider the following data set for a binary class problem.

i. Calculate the Information Gain while splitting A on B. Which attribute


would the decision tree induction algorithm should choose?

ii. Calculate the Gini Index while splitting A on B. Which attribute would
the decision tree induction algorithm should choose?
5. How does the random forest tree work for classification?
6. Explain Bagging and Boosting in training random forest tree.
7. How Naive Bayes Algorithms works?
8. How does the SVM work?
9. How does the KNN work?
10. How to choose right value for K in KNN?
UNIVERSITY OF PETROLEUM AND ENERGY STUDIES

Assignment 5

1. Discuss linear regression by taking a suitable example of your own.


2. Discuss logistic regression by taking a suitable example of your own.
3. Differentiate between logistic regression and linear regression?
UNIVERSITY OF PETROLEUM AND ENERGY STUDIES

Assignment 6

1. Discuss Artificial Neural Network and compare it with the human brain by taking
suitable examples.
2. Compare and contrast a Standard Computer with Artificial Neural Networks.
3. How do ANNs work?
4. Discuss the design issues of an Artificial Neural Network.
5. Discuss the application areas of an Artificial Neural Network.
6. What is back propagation in Artificial Neural Network?
7. Discuss the role of a Bias in Artificial Neural Network.
8. Discuss various steps in Back propagation Algorithm of an Artificial Neural
Network.
9. Consider the following ANN:

x1 x2 x3 w14 w15 w2 w2 w3 w3 w4 w5
4 5 4 5 6 6

1 0 1 0.2 -0.3 0.4 0.1 -0.5 0.2 -0.3 -0.2


With Bias as:

θ4 θ5 θ6
-0.4 0.2 0.1

Calculate the Net Input Ij and Output Oj. Calculate also the Error at each Node.

You might also like