iamvinitk
diff --git a/‎prgm1/prgm1.py
+1-1 b/‎prgm1/prgm1.py
+1-1
diff --git a/‎prgm10/prgm10.py
-1 b/‎prgm10/prgm10.py
-1
diff --git a/‎prgm2/prgm2.py
+1-1 b/‎prgm2/prgm2.py
+1-1
diff --git a/‎prgm3/prgm3.py
+1-1 b/‎prgm3/prgm3.py
+1-1
diff --git a/‎prgm4/.ipynb_checkpoints/Backpropagation-checkpoint.ipynb
-142 b/‎prgm4/.ipynb_checkpoints/Backpropagation-checkpoint.ipynb
-142
diff --git a/‎prgm4/Backpropagation.ipynb
-143 b/‎prgm4/Backpropagation.ipynb
-143
@@ -1,5 +1,5 @@
 """
-Implement and demonstrate the FIND-S algorithm for finding the most specific
+1. Implement and demonstrate the FIND-S algorithm for finding the most specific
 hypothesis based on a given set of training data samples. Read the training data from a
 .CSV file.
 """
 
@@ -36,5 +36,4 @@
 plt.plot(X_train.squeeze(), y_train, 'o')
 
 plt.plot(X_test.squeeze(), y_test, 'o')
-plt.savefig('image.png', format='png', dpi=250)
 plt.show()
@@ -1,5 +1,5 @@
 """
-For a given set of training data examples stored in a .CSV file, implement and
+2. For a given set of training data examples stored in a .CSV file, implement and
 demonstrate the Candidate-Elimination algorithm to output a description of the set
 of all hypotheses consistent with the training examples.
 """
 
@@ -1,5 +1,5 @@
 """
-Write a program to demonstrate the working of the decision tree based ID3
+3. Write a program to demonstrate the working of the decision tree based ID3
 algorithm. Use an appropriate data set for building the decision tree and apply this
 knowledge to classify a new sample.
 """