Download as pdf or txt
Download as pdf or txt
You are on page 1of 17

J277 Computer Science Non-examined Assessment

Yr 10 NEA - Evidence Template

Analysis
Use the task sheet and describe (re-write the task in your own words) and analyse the problem here.

In this game, the players will have to roll two 6-sided dice each. With
this they will compete to earn points dependent of what they roll. Each
game consists of 5 rounds. In every round the player rolls the 2 dice,
meaning that each player rolls the dice at least 10 times a game. The
player with the most points wins the game.

The rules are:


❖ After every turn, add the score you get to your total score.

❖ If your result is an even number, you get 10 more points added to your total score.

❖ If your result is an odd number, you lose 5 points from your total score.

❖ If you roll a double, you get an extra roll in that round and the score you get is
added to your total score.

❖ Your score cannot go below 0 at any point in the game, even if you are at 0 and lose
points.

❖ Out of the two players, whoever has the highest score after 5 rounds, wins the game.

❖ Although, if both the players end the game with the same score, they each will have
to roll one dice. Whoever gets the highest total score wins. If needed repeat this until
somebody wins the game.

Design

Name: Shiven Kheskani Candidate Number: Page 1


J277 Computer Science Non-examined Assessment
Flowchart

Use Word’s drawing tools to create your flowchart. Place your flowchart here.

Name: Shiven Kheskani Candidate Number: Page 2


J277 Computer Science Non-examined Assessment

Pseudocode
Place your pseudocode here.

Name: Shiven Kheskani Candidate Number: Page 3


J277 Computer Science Non-examined Assessment

Name: Shiven Kheskani Candidate Number: Page 4


J277 Computer Science Non-examined Assessment

Variables
Place your variables table here in a table.

VARIABLES: EXPLANATION:
“player1” == The variable is used for the
labelling the first player.
“player2”== The variable is used for the
labelling the second player.
“score”== The variable to display the
total amount of points the
player received.
“die1”== The variable used for the
first die in the program.
“die2”== The variable used for the
second die in the program.
“ player1/2 score”== This variable is to show the
total score of an individual
player, in the game.

Name: Shiven Kheskani Candidate Number: Page 5


J277 Computer Science Non-examined Assessment

Success Criteria
Use bullet-points and place your success criteria here.

The Success Criteria:

❖Make sure the players are authenticated to make sure they


are authorised by creating accounts.

❖Each player gets to roll two 6-sided dice.

❖All the player scores are shown at the end of each round.

❖All players play 5 rounds.

❖Each player will roll 1 dice if they finish with a tied game.

❖Show the winner at the end of the 5 rounds,

❖Store the winning players score and details in a different file


and saved.

❖Show the score and name of the top 5 highest scores from a
different file on the players game screen.

Name: Shiven Kheskani Candidate Number: Page 6


J277 Computer Science Non-examined Assessment

Validation
Describe what checks you could put in to stop a clearly impossible value being accepted.

CHECKS: RESPONSE:
User enters the wrong Loop the program back to
details == the login site and give them
unlimited attempts.
User enters invalid number Display a message saying
== clearly to choose between 1-
6.
User doesn’t follow order == Make user do each round
specifically.
User sees an error on their Ask the user to report it to
screen. == the developers.
User has closed the program Next time the user wants to
in the middle of their play the game, give an
session. option to continue the last
game or start a new one.

Name: Shiven Kheskani Candidate Number: Page 7


J277 Computer Science Non-examined Assessment

Development

Place a screenshot here to show the code so far. Write up what you did, how you tested it and (if necessary)
how you fixed it.

Place another screenshot here to show the code so far. Write up what you did, how you tested it and (if
necessary) how you fixed it.

Name: Shiven Kheskani Candidate Number: Page 8


J277 Computer Science Non-examined Assessment

Place another screenshot here to show the code so far. Write up what you did, how you tested it and (if
necessary) how you fixed it.

Name: Shiven Kheskani Candidate Number: Page 9


J277 Computer Science Non-examined Assessment
Place another screenshot here to show the code so far. Write up what you did, how you tested it and (if
necessary) how you fixed it.

Name: Shiven Kheskani Candidate Number: Page 10


J277 Computer Science Non-examined Assessment

Place another screenshot here to show the code so far. Write up what you did, how you tested it and (if
necessary) how you fixed it.

Place another screenshot here to show the code so far. Write up what you did, how you tested it and (if
necessary) how you fixed it.

Name: Shiven Kheskani Candidate Number: Page 11


J277 Computer Science Non-examined Assessment

Testing
In table, place your test plan here.

TESTS: OUTCOMES:
Check to see if scores are Individual player scores
added up and saved. were shown at the end of
every game.
Check what happens if The loop takes place and
players tie the game. goes back to game mode.

Check if at the end of the At the end of the game the


game the program shows program displayed the best
the list of the top 5 that top 5 game winners.
have won the game.

Name: Shiven Kheskani Candidate Number: Page 12


J277 Computer Science Non-examined Assessment

Check if the correct users Both players rolled their dice


are given their turn at the at the correct time and had
correct time. no mix ups.
Check if when the game The winner of the game was
finishes the winner is shown at the end of the
displayed. game with the winner’s
message.

Evaluation

Test Plan
Place a copy of your test plan here with the actual results column filled in.

TESTS: PASS OR FAIL


Check to see if scores are PASS
added up and saved.
Check what happens if PASS
players tie the game.

Name: Shiven Kheskani Candidate Number: Page 13


J277 Computer Science Non-examined Assessment

Check if at the end of the PASS AND FAIL- The


game the program shows proper scores of the top 5
the list of the top 5 that is not very accurate.
have won the game.
Check if the correct users PASS
are given their turn at the
correct time.
Check if when the game PASS
finishes the winner is
displayed.

Testing Problems

For each test that failed, describe why / how it failed and how you fixed it.
Include evidence (Screenshots) that you tested it again.

Name: Shiven Kheskani Candidate Number: Page 14


J277 Computer Science Non-examined Assessment

Name: Shiven Kheskani Candidate Number: Page 15


J277 Computer Science Non-examined Assessment

Evaluation Summary

Place your summary statement here.

The task and project were quite challenging at the start, however
over time I felt like i understood more and more. The flowchart
and pseudocode were probably the trickiest tasks of them all, as
they consisted of many factors throughout this task. The code too
was quite complex as I had to use multiple resources and
examples from other codes in this. I applied knowledge from the
PowerPoints in the team's channel and some online research
which I had done in class.

Name: Shiven Kheskani Candidate Number: Page 16


J277 Computer Science Non-examined Assessment

Suggested Improvements

I think that I should develop my flowchart further and should also


work on some parts of my code. Overall, I think this project was
quite challenging at times, but I managed to stay determined and
do my best throughout this project.

Name: Shiven Kheskani Candidate Number: Page 17

You might also like