C# homework help "prof.Huda only"
Assignment Cover Sheet
| SOUTHERN CROSS UNIVERSITY | |||||||||||
| ASSIGNMENT COVER SHEET | |||||||||||
| For use with online submission of assignments | |||||||||||
| Please complete all of the following details (the red cells) and include this file in your project file. An incomplete form will be returned to you for completion and marking will be delayed. | |||||||||||
| Your assignments must be submitted as one zip file. This file (marking sheet) must be included in the top folder of your project. | |||||||||||
| Unit Name: ISY00245 Principles of Programming | |||||||||||
| Student Name: | |||||||||||
| Student ID: | |||||||||||
| Assignment Title: | |||||||||||
| Due Date: | |||||||||||
| Date Submitted: | |||||||||||
| Declaration: | |||||||||||
| I have read and understand the Rules relating to Awards (Rule 3.17) as contained in the University Handbook. I understand the penalties that apply for plagiarism and agree to be bound by these rules. The work I am submitting electronically is entirely my own work. | |||||||||||
| Signed: | |||||||||||
| (Please type your name) | |||||||||||
| Date: | |||||||||||
| Please fill in all details | 11 | ||||||||||
Marking Sheet
| Task | Task Detail | Possible | :-) Tim Comber: Tim Comber: Enter 1 for full marks for that criterion | Mark | SubTotals | OK | Marker Comments | ||||
| Code Style | Introductory comments | 1 | 1 | ||||||||
| Method comments | 1 | 1 | |||||||||
| Code comments | 1 | 1 | |||||||||
| Variables/constants commented | 1 | 1 | |||||||||
| Comments are useful | 1 | 1 | |||||||||
| Comments correctly placed/aligned | 1 | 1 | |||||||||
| No more than one blank line at a time | 1 | 1 | |||||||||
| One blank line separates sections of code | 1 | 1 | |||||||||
| No line exceeds 80 characters | 1 | 1 | |||||||||
| Only one statement per line | 1 | 1 | |||||||||
| All names are meaningful | 1 | 1 | |||||||||
| No abbreviated names | 1 | 1 | |||||||||
| Variables and constants correctly named | 1 | 1 | |||||||||
| Variables initialised | 1 | 1 | |||||||||
| No unused variables/unreachable code/warnings | 1 | 1 | |||||||||
| Conditions make sense (eg not while(true)) | 1 | 1 | |||||||||
| No magic numbers | 1 | 1 | |||||||||
| Braces correctly aligned/located | 1 | 1 | |||||||||
| No other errors | 2 | 2 | 20 | ||||||||
| Stepwise refinement | At least one method used SCU: SCU: 5 marks: fully modularised 1 mark: only one method apart from main 0 marks: no methods | 5 | 5 | ||||||||
| Parameters used SCU: SCU: *5 marks: Every method that should use a parameter has parameter * Lose 1 mark each time there should have been a parameter used and it wasn't * Zero marks if parameters not used | 5 | 5 | |||||||||
| Returns used SCU: SCU: *5 marks: Every method that should return a value does so * Lose a mark for each function that should return a value but does not * zero if returns not used | 5 | 5 | 15 | ||||||||
| Array handling | Array of structs declared and used correctly | 10 | 10 | 10 | |||||||
| File handling | Data read from file correctly into array of structs and displayed | 4 | 4 | ||||||||
| Data saved to file corretly | 2 | 2 | |||||||||
| File closed after use | 2 | 2 | |||||||||
| Checked that file exists | 2 | 2 | 10 | ||||||||
| Works as expected | Menu: loops and displays options | 5 | 5 | ||||||||
| Code to deal with unnecessary data | 5 | 5 | |||||||||
| Find the highest number of applications | 12 | 12 | |||||||||
| Convert data into database friendly format | 18 | 18 | |||||||||
| Overall quality of program Administrator: Administrator: Marker's decision: Full marks - could not be improved No marks - Major faults |
Tim Comber: Tim Comber: Enter 1 for full marks for that criterion |
SCU: SCU: 5 marks: fully modularised 1 mark: only one method apart from main 0 marks: no methods |
SCU: SCU: *5 marks: Every method that should use a parameter has parameter * Lose 1 mark each time there should have been a parameter used and it wasn't * Zero marks if parameters not used |
SCU: SCU: *5 marks: Every method that should return a value does so * Lose a mark for each function that should return a value but does not * zero if returns not used | 5 | 5 | 45 | ||||
| 100 | Total | 100 | |||||||||
| Out of 40 | Cover sheet not completed | ||||||||||
| No Late Penalty | 0 | ||||||||||
| Final Mark | 0 |