ExamGecko
Question list
Search
Search

List of questions

Search

Related questions











Question 301 - DOP-C01 discussion

Report
Export

You are building a game high score table in DynamoDB. You will store each user's highest score for each game, with many games, all of which have relatively similar usage levels and numbers of players. You need to be able to look up the highest score for any game. What is the best DynamoDB key structure?

A.
HighestScore as the hash / only key.
Answers
A.
HighestScore as the hash / only key.
B.
GameID as the hash key, HighestScore as the range key.
Answers
B.
GameID as the hash key, HighestScore as the range key.
C.
GameID as the hash / only key.
Answers
C.
GameID as the hash / only key.
D.
GameID as the range / only key.
Answers
D.
GameID as the range / only key.
Suggested answer: B

Explanation:

Since access and storage for games is uniform, and you need to have ordering within each game for the scores (to access the highest value), your hash (partition) key should be the GameID, and there should be a range key for HighestScore.

asked 16/09/2024
Suraj Patil
34 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first