An online game is played with two dice. In this context, explain what is meant by decomposition.

Computers and Technology

1 answer:

Vlad [161]3 years ago

4 0

Answer:

The answer to this question is given below in the explanation section.

Explanation:

This question is about desinging a game that is played with two dice and gets or shows their value to the player.

The dice value is random, and it can be between one and six. So, you need to generate two numbers between 1 and 6. You may also need to display the numbers

The main part of this program is that you need to know the numbers to limit or restrict what the user may do next while playing.

That's most of the first level of decomposition for solving a problem. In decomposition, you need to keep decomposing (breaking) the problem into smaller pieces, thinking outline of the program and deciding what objects, functions, variables, and logic you're going to implement in the coding.

You might be interested in

What is network management?

melamori03 [73]

Network management is a broad range of functions including activities, methods, procedures and the use of tools to administrate,operate,and reliably maintain computer network system. <span />

3 0

3 years ago

On a router configured to use RIP, the number of routers a packet must travel between before it reaches its destination is calle

11111nata11111 [884]

Answer:

metric

hop count

Explanation:

6 0

3 years ago

Explain how data structures and algorithms are useful to the use of computer in data management<br>

laiz [17]

Answer:

programmers who are competent in data structures and algorithms can easily perform the tasks related to data processing ,automated reasoning ,or calculations . data structure and algorithms is significant for developers as it shows their problems solving abilities amongst the prospective employers .

5 0

2 years ago

4) Which is a more efficient way to determine the optimal number of multiplications in a matrix-chain multiplication problem: en

Assoli18 [71]

Answer:

Running RECURSIVE-MATRIX-CHAIN is asymptotically more efficient than enumerating all the ways of parenthesizing the product and computing the number of multiplications of each.

the running time complexity of enumerating all the ways of parenthesizing the product is n*P(n) while in case of RECURSIVE-MATRIX-CHAIN, all the internal nodes are run on all the internal nodes of the tree and it will also create overhead.

Explanation: