This introduction covers Digital Dice within Merge Sort for GCSE Computer Science. Revise Merge Sort in Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This topic appears less often, but it can still be a useful differentiator on mixed-topic papers. It is section 2 of 7 in this topic. Use this introduction to connect the idea to the wider topic before moving on to questions and flashcards.
Topic position
Section 2 of 7
Practice
15 questions
Recall
10 flashcards
Digital Dice
Games, simulations, and security all need randomness. Rolling dice? Drawing lottery numbers? Shuffling cards? Generating passwords? All need random numbers. Computers use pseudo-random number generators - they're not truly random (they follow formulas) but are good enough for most uses. A seed value starts the sequence - same seed gives same "random" numbers!