Back to the 2021 paper

Module 3: Classification and Prediction

202110m

The results of an exam are recorded along with some data about the students. The results can be found in the table below :

ID Cell No. Language Passed all Assignments GPA Passed Exam
1 93333-11101 Java No 3.1 Yes
2 93333-11112 Java No 2.0 No
3 93333-11102 C++ Yes 3.5 Yes
4 93333-11113 Python Yes 2.5 Yes
5 93333-11103 Java Yes 3.9 No
6 93333-11114 C++ No 2.9 No
7 93333-11104 Java No 1.9 No
8 93333-11115 Python Yes 3.2 Yes

In no more than one page of text, describe the design of a K-Nearest Neighbour classifier to predict if a student will fail or pass the exam.

Similar questions

Data MiningUsing the dataset from Q5a, use your K-NN classifier to predict whether the following student (who overslept and missed the original exam) will pass the re-exam : | ID | Cell No. | Language | Passed all Assignments | GPA | Passed Exam | | :---: | :---: | :---: | :---: | :---: | :---: | | 9 | 93333-11109 | C++ | Yes | 3.0 | ?? |20214mDatabase Management SystemGiven the Students' relation as shown below: | StudentID | StudentName | StudentE-mail | StudentAge | CPI | |---|---|---|---|---| | 2345 | Shankar | shankar@math | X | 9.4 | | 1287 | Swati | swati@ee | 19 | 9.5 | | 7853 | Shankar | shankar@cse | 19 | 9.4 | | 9876 | Swati | swati@mech | 18 | 9.3 | | 8765 | Ganesh | ganesh@civil | 19 | 8.7 | For (StudentName, StudentAge) to be the key for this instance, the value X should not be equal to: (i) 18 (ii) 19 (iii) 15 (iv) 2020192mMACHINE LEARNINGFollowing is a data set that contains two attributes, X and Y, and two class labels, ‘+’ and ‘–’. Each attribute can take three different values: 0, 1, or 2. The concept for the ‘+’ class is Y = 1 and the concept for the ‘–’ class is X = 0 ∨ X = 2. ![image](https://res.cloudinary.com/djkpavwmp/image/upload/v1764335073/q5_zh4zj9.png) (a) Build a decision tree on the data set. Does the tree capture the ‘+’ and ‘–’ concepts? (b) What are the accuracy, precision, recall and F1-measure of the decision tree? (Note that precision, recall, and F1-measure are defined with respect to the ‘+’ class.)202214mMACHINE LEARNINGFor the Sun Burn data set given below, construct a decision tree. | Name | Hair | Height | Weight | Location | Class | |--------|--------|----------|---------|----------|-------| | Sunita | Blonde | Average | Light | No | Yes | | Anita | Blonde | Tall | Average | Yes | No | | Kavita | Brown | Short | Average | Yes | No | | Sushma | Blonde | Short | Average | No | Yes | | Xavier | Red | Average | Heavy | No | Yes | | Balaji | Brown | Tall | Heavy | No | No | | Ramesh | Brown | Average | Heavy | No | No | | Sweta | Blonde | Short | Light | Yes | No |202314m