logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Sunderland Karting Association (SKA) is a local agency who organise Go Karting races in the North East region. SKA keeps records of all upcoming races in the area and have been using a prototype system for managing scheduled races, specifically Pedal and Motor Races.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Scenario

Sunderland Karting Association (SKA) is a local agency who organise Go Karting races in the North East region. SKA keeps records of all upcoming races in the area and have been using a prototype system for managing scheduled races, specifically Pedal and Motor Races.

 

The system presently allows generation of a list of races which are scheduled to happen. As a result of system testing and end user evaluations, SKA have identified a number of modifications which require development.

 

The prototype system has been implemented within an agile framework, and extensions will be implemented using the same software development methodology. To this effect, all desired code extensions have been summarised in the burndown chart provided below.  A description of each task has been provided within the chart.

 

You have been tasked with implementing and documenting all listed mandatory changes, plus one desirable task. You may choose to either update your original form-based prototype from professional practice week 1, or to use the code base on Canvas which has been provided by SKA. It is your responsibility to complete and submit the revised system (and related documentation) by Friday 17th January, 09:00 hrs.

Burndown Chart

Task Name

Task No

Task Description

Status

Estimated Effort in Hours

1. Add Item

1.1

Create a second Form (Form2) to allow new Races to be added by the user.

Mandatory

3

 

1.2

Integrate Form2 into existing code base- the Race list on Form 1 should be updated when a new race is added.

3

2. Persist Data

2.1

Serialize Race List when application closes.

 

1.5

 

2.2

Deserialize Race  List when application opens.

 

1.5

 

2.3

Write Unit Tests to Demonstrate that Serialization and Deserialization work correctly.

Mandatory

3

3. Validate

3.1

Ensure system is robust against incorrect user input.

Mandatory

3

 

3.2

Throw Custom Exception (MaxCapacityExceeded) if the Race capacity is greater than 50.

3

 

4.1

Amend details of existing race on the list.

 

3

4. Edit Race Details

4.2

Update form and save changes to the list via serialization.

Desirable

3

 

5.1

Demonstrate the use of an Interface to allow extensible calculation of race costs (See rules for costing provided in Appendix.)

 

3

5. Implement ICostable

5.2

Evidence above extensibility through addition of a utility class (See suggested UML model in Appendix).

Desirable

3

6. Model

6.1

Create UML Model to represent the system in its entirety (with no suppression of relevant information).

Mandatory

4

 

Submission details

Hand drawn UML diagrams are acceptable but must be neat and clearly legible and then scanned for online submission. You may use a UML drawing tool e.g. Software Ideas Modeller for this task but if you do so then the UML notation used must be consistent with that covered in the module and you should export the diagram to an image file which can be embedded within the report document. Programming deliverables should be submitted as a single Visual C# solution (version 2019), containing your application, associated .dat files, and .sln file.

 

Important Information

 

You are required to submit your work within the bounds of the University Infringement of Assessment Regulations (see the Programme Handbook).  Plagiarism, paraphrasing and downloading large amounts of information from external sources, will not be tolerated and will be dealt with severely.  Although you should make full use of any source material, which would normally be an occasional sentence and/or paragraph (referenced) followed by your own critical analysis/evaluation.  You will receive no marks for work that is not your own. Your work may be subject to checks for originality which can include use of an electronic plagiarism detection service. You are not expected to put your commentary report through Turnitin (however the module leader reserves the right to do so if they deem it necessary). Where you are asked to submit an individual piece of work, the work must be entirely your own.  The safety of your assessments is your responsibility.  You must not permit another student access to your work. Where referencing is required, unless otherwise stated, the Harvard referencing system must be used (see the Programme Handbook).

Marking Criteria

Task 1

Some attempt but basic compilation errors evident.

Some attempt, but needs improvement or is lacking multi form functionality

Good use of multi-form controls that provide a basic simulation of add event functionality

Excellent use of multi-form controls that provides a realistic simulation of all required functionality.

Add Item

0

1 to 3

4 to 5

6 to 7

8 to 10

Task 2

Some attempt at data persistence but not using serialization.

Some attempt at serialization but minor errors or omissions present.

Successful use of serialization but lacking in some areas.

Excellent use of serialization.

Persist Data (Development)

 

 

 

 

0

1 to 3

4 to 5

6 to 7

8 to 10

Task 2

Some attempt but basic compilation errors evident.

Basic attempt at a single unit test.

Good set of unit tests but lacking in some areas.

Excellent set of unit tests which thoroughly tests the file-reading aspects of the system.

Persist Data            (Unit Tests)

0

1 to 3

4 to 5

6 to 7

8 to 10

Task 3

 

 

 

 

Validate

Some attempt at exception handling but basic errors evident

Basic use of exception handling but lacking customised exception class

Good use of exception handling and customised exception class (though lacking in some areas).

Excellent use of exception handling with appropriate customised exception class

 

1 to 3

4 to 5

6 to 7

8 to 10

 

Task 4

Some attempt at edit race functionality, but basic compilation errors evident.

Basic attempt at edit race functionality, but incomplete (for example changes do not persist).

Good attempt at edit race functionality, but lacking in some areas

Excellent implementation, which provides a realistic simulation of edit functionality.

Edit Race

 

1 to 3

4 to 5

6 to 7

8 to 10

Task 5

Some attempt at implementing interface and utility class, but basic compilation errors evident.

Basic attempt at implementing interface and utility class, but minor omissions or errors evident

Good attempt at  implementing interface and utility class, but lacking in some areas

Excellent implementation which provides a realistic implementation of an Interface and utility class.

Implement ICostable

 

1 to 3

4 to 5

6 to 7

8 to 10

Task 6

 

 

 

 

Model

Attempt made to correctly identify and structure classes, but with limited success.

Diagram virtually correct in structure.

Diagram virtually correct in structure and function (though lacking obvious methods or attributes).

Diagram correct in structure and function

 

1 to 3

4 to 5

6 to 7

8 to 10

 

Appendix One

Conditions For Race Costing and Guidance on Task 5 and 6

Pedal Race costs are calculated based on the maximum number of participants, the cost of the race per person, and the addition of a 20% staffing overhead:

totalCost = ( Capacity * Cost ) * 1.2

 

Motor Race costs are calculated equivalent to Pedal Races, but with an additional Insurance premium of £500:

totalCost = 500 + ( (Capacity * Cost) * 1.2)

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

919 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

521 Answers

Hire Me
expert
Husnain SaeedComputer science

610 Answers

Hire Me
expert
Atharva PatilComputer science

798 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30