Note the following clarification regarding question 8.c:

Your solution should consider, for example, a product described as a TV costing 5000 and a product described as a TV costing 7000 as two different products, even if their descriptions (the string "TV" in this case) are the same. Each TV would then occupy a separate line in the final output.

So, for example, if the input is as follows:

TV 5000
TV 6000
TV 5000

the output would be as follows:

TV 5000 2 10000
TV 6000 1 6000

Two corrections have been made to the examination paper:

1.) Question 1 was incomplete in the originally published examination paper.

2.) The lead text for question 2 erroneously mentioned three programming languages when it should have referred to two.

These mistakes have been corrected in the current question paper. Please download the latest version from the "Examination" folder, below.

An examination folder containing the examination questions in PDF format will be released on this course page at 06:00 on 18 June 2019.

The submission deadline for your answers is 20 June at 10:00, via an online submission on this course page that will also become available upon release of the examination questions. No late submissions will be accepted.

Please read all submission instructions and follow all of them carefully. In particular, be sure to submit a PDF document of your answers (any other format, for example a Microsoft Word document, is unacceptable). Please include a signed copy of the standard assignment and examination cover page for MIT courses as the first page of your submission.

I have posted a complete list of year marks, with a detailed breakdown of the assessments for each assignment task. Any queries should be sent to me via email (wvheerden@cs.up.ac.za) by Wednesday 12 June at 12:00.

Note that the published year mark will form a 50% contribution to the final result for this module (with the examination contributing the remaining 50%). Further details on the calculation of the final result are contained in the study guide for this module.

Note that R by default sends graph output to a PDF file. The assignment specification states that output should be displayed in a window.

There are several ways to achieve this in R, depending on the operating system the script is running under:

1.) Calling the windows() function: This approach is used with Windows installations of R. More information is available at https://www.rdocumentation.org/packages/grDevices/versions/3.6.0/topics/windows

2.) Calling the x11() function: This approach works the same way as the windows() function in Windows, but also works under Unix-like operating systems such as Linux. More information is available at https://www.rdocumentation.org/packages/grDevices/versions/3.6.0/topics/x11

3.) Calling the quartz() function: This approach works for the macOS system. More information is available at https://www.rdocumentation.org/packages/grDevices/versions/3.6.0/topics/quartz

For the purposes of this assignment, please use the x11() function, which is the most platform-independent of the three solutions.

Also note that any plot window created by R closes as soon as the script terminates. It is therefore necessary to pause the script execution by waiting for user input from the keyboard.

Please note that a minor correction has been made to the assignment specification. This correction affects only the submission instructions included under Section 3.

Previously the instructions specified that a zip archive should be uploaded, which contradicted the instructions under section 5 (General Submission Notes).

Note that the correct procedure is as originally described in section 5. In other words, you should submit your script file only. This means that the files to submit for each task are as follows:

Task 1: task1.R
Task 2: task2.py
Task 3: task3.R

Only these files should be uploaded to the correct upload slot for the appropriate task. Do not upload an archive (such as a zip file).

Note that you should also not upload your data file (I will provide the data file during marking, and your scripts should assume that the data file provided in the wine.zip archive is available in the same directory as your script file).

I have uploaded the MIT802 examination paper for 2018 to the "Sample Examination" folder, below. This paper is intended as a sample of the general format and style of question paper that you can expect for this year's paper. Note that no model answers are available for this paper.

I have uploaded the slides for lecture 2 to the "Slides" folder, below. I have also uploaded the example scripts and data files used during the two lectures to the "Examples" folder.

I have uploaded the assignment specification. Please read the instructions carefully, and follow them exactly. Note that the submission deadline is 24 May 2019 at 23:00. No late submissions will be accepted. Please direct any queries to me via email (wvheerden@cs.up.ac.za).

I have posted the study guide for the module in the "Study Guide" folder, below.

Please note the following updates regarding the assignment component of this module:

1.) Due to time constraints, I have decided to consolidate the assignment contribution into a single assignment.

2.) The assignment specification will be posted later today. Please begin the assignment as soon as possible.

2.) I have consulted with a number of students who are registered for the module, and have determined that in-person demonstrations will present a problem in some cases. I have therefore decided that the assignment submission will be electronic only, and will be assessed offline (as was the case last year). Due to this change, it is imperative that students follow all submission instructions to the letter. This includes even minor details such as the naming of files. I will include information on the steps I will follow to execute your submissions, and it is your responsibility to ensure that your submission works correctly when these steps are performed. Any deviation from the specification will result in a mark of zero for the task in question.