Data Structure and Algorithms - Tournament Players

9 Pages2102 Words311 Views
|
|
|
1Data Structure and Algorithms
DATA STRUCTURE AND ALGORITHMS
By (Student names)
[Course Name]
[Lecture Name]
[University Name]
[City where the university is located]
[Date]
2Data Structure and Algorithms
Part 1: Tournament Players.........................................................................................................................3
Question a: players behavior...................................................................................................................3
Assumptions........................................................................................................................................3
Question b: chosen data structure and information storage......................................................................3
Array data structure.............................................................................................................................3
Question c: Table for storing example game information........................................................................4
Part 2 – Justification of the choice...............................................................................................................5
Part 3 – Operations......................................................................................................................................5
Reference.....................................................................................................................................................7
3Data Structure and Algorithms
Part 1: Tournament Players
Question a: players behavior
In this games tournament scenario there are various players are involved and the selected players
will play against each other until the winner is found below are the assumptions made to
determine the players behaviors.
Assumptions
i. The tournament will involve more than three players.
ii. Each game will be played against two players.
iii. The players will be paired.
iv. Losers of each pair will not play against other players.
v. The winner of each pair will play will be selected to play against the other pair winner
(Wixom,2016).
vi. Each player will only play with each other once.
vii. The final winner will be the player who had not lost any game played from the first
pairs to the subsequent winners’ pairs.
Question b: chosen data structure and information storage
In order to store the tournament information there is the data structure that will be used that will
enable safe and quick data storage and also will allow the manipulation and operation of data
stored in them, below is the selected data structure.
Array data structure
The array is the selected data structure that will be used to store the games tournament details , in
this case the array list is the type of the array that will be used and this is to ensure the record
stored are in good format which enable users operations.
The array list will be implemented in with various dimensions and to hold all the attributes of the
stored data.
In the array list selected there will be various two vertices which include the players and winners
vertices and the games vertices where the players and winners vertices will be arranged
horizontally while the games vertices will be arranged vertically (Singh, 2016).

End of preview

Want to access all the pages? Upload your documents or become a member.

Related Documents

Pages

+1 306 205-2269

Chat with our experts. we are online and ready to help.