$39.99
howing your progress on the linked lists and trees tutorials.
You do NOT need to submit any particular main function. Your code will be assessed by inspecting the list.h, list.c, bst.h, and bst.c files only.
Assignment Submission
Assignments will be submitted via MyLO (an Assignment 1 dropbox will be created). You should use the following procedure to prepare your submission:
• Choose “Clean Solution” from the “Build” menu in Visual Studio. This step is very important as it ensures that the version that the marker runs will be the same as the version that you believe the marker is running.
• Quit Visual Studio and zip your entire project folder
• Upload a copy of the zip file to the MyLO dropbox
History tells us that mistakes frequently happen when following this process, so you should then:
• Unzip the folder to a new location
• Open the project and confirm that it still compiles and runs as expected o If not, repeat the process from the start
Student: ____________________________________
Criteria HD (High Distinction) DN (Distinction) CR (Credit) PP (Pass) NN (Fail)
You have: You have: You have: You have: You have:
1. Complete Linked List Tutorial
Weighting 60% Completed all tutorial tasks including reverse and merge functions Partially completed tutorial, including reverse or merge functions Partially completed tutorial Made a genuine attempt, but made little progress on tutorial
2. Complete Trees
tutorial
Weighting 40% Completed all tutorial tasks including height function Partially completed tutorial Made a genuine attempt, but made little progress on tutorial
Mark: ________________________