INSTRUKSIES: 1. Hierdie vraestel bestaan uit 7 vrae….

INSTRUKSIES: 1. Hierdie vraestel bestaan uit 7 vrae. Beantwoord AL die vrae. 2. Lees die vrae sorgvuldig deur and nommer jou antwoorde korrek soos op die vraestel aangedui. 3. Diagramme is nie noodwendig volgens skaal. 4. ‘n Nie-programmeerbare, nie-grafiese sakrekenaar mag gebruik word. 5. Rond antwoorde af tot twee desimale waar nodig, tensy anders vermeld word. 6. Antwoorde moet op papier in jou eie handskrif gedoen word. 7. Wys alle berekeninge duidelik anders mag jy dalk punte verloor. 8. Skryf duidelik en leesbaar. 9. Die antwoorde wat verskaf word moet jou eie, oorspronklike werk wees en mag nie van enige ander bron gekopieër word nie. 10. Skandeer jou antwoorde vir hierdie toets in een pdf leêr. Benoem jou leer as volg: WISK IEB GR11A VoorletterVan T02 SBA004b Eksamen

SECTION B QUESTION 4 The points A (-4;0), B (3;7) and C…

SECTION B QUESTION 4 The points A (-4;0), B (3;7) and C (4;-1) form a triangle on the Cartesian plane as shown in the figure below Right-click to open the figure in a new tab   4.1  Prove that triangle ABC is an isosceles triangle (5) 4.2 Find the co-ordinates of D (D lies on AB) (4) 4.3 Determine if  DC

QUESTION 5 A pilot is landing a plane. He must make sure…

QUESTION 5 A pilot is landing a plane. He must make sure that the plane is constantly kept equidistant (equal distances) from the two outer landing lights   and   . The line between the two landing lights is perpendicular to the runway. The co-ordinates of the landing lights are    and   . Find the equation of his flight path in the form     (Hint: find the gradient of the flight path) Right-click to open the figure in a new tab   [7]

Let us say the cost of a False Positive is 10 units and the…

Let us say the cost of a False Positive is 10 units and the cost of a False negative is 2 units. In this context answer the following. (a) (6) How would you adjust the decision tree algorithm so that its performance on unseen cases minimizes the total expected cost instead of maximizing the accuracy?   (b) (6) Recall the Support Vector Machine formulation discussed in class, specifically the case in which we minimize the cost of misclassifications using a constant parameter C. Suggest a solution for learning an SVM classifier in which the cost of the two types of errors are different. Do not write any formulas, describe your ideas in language.  

(10) Consider the context of selecting the best attribute fo…

(10) Consider the context of selecting the best attribute for decision tree construction. Explain briefly the difference between “information gain” and “gain ratio” metrics for selecting the best attributes.  Is any one of these two better than the other – explain why? Do not write any formulas. Explain in language only.

Consider the following training data for a perceptron: X.  Y…

Consider the following training data for a perceptron: X.  Y.  Z.  Class 0.  3.  5.     1 1.  4.  8.     0 7.  1.  2.     1 -1. 5. 5.     0 2.  6.  7.     0   Use (2 3 1 4) as the initial weight vector. Execute the perceptron training algorithm as discussed in class and report the following: 1. (4) The updated weight vector after the second data point, (1,4,8), is processed.   2. (4) The updated weight vector after the third data point, (7, 1, 2), is processed.   3. (6) The updated weight vector after the fifth data point, (2, 6, 7), is processed.