Pleasee helpppppppppppppppppppppp me!

She does not need a computer all she needs are a good laptop that could handle a game engine and a graphic drawing tablet to make the terrain and characters.

Explanation:

It also depends on what kind of game you want to create

6 0

3 years ago

g Boolean Algebraic properties _____. a. are used to make boolean expressions more complicated b. are used to convert a Boolean

vesna_86 [32]

Answer:

c. can lead to a simpler expression and thus a simpler circuit.

Explanation:

Boolean logic refers to a theory of mathematics developed by the prominent British mathematician, called George Boole. In Boolean logic, all variables are either true or false and are denoted by the number "1" or "0" respectively; True = 1 or False = 0.

Also, Boolean logic allow users to combine keywords with Boolean operators (quotes, AND, OR, near/n) to give a more personalized and relevant search results.

There are five (5) main Boolean Algebraic properties and these includes;

I. Commutative property: it applies to both multiplication and addition.

For addition; A + B = B + A
For multiplication; A.B = B.A

II. Associative property: it applies to both multiplication and addition.

For addition; A + (B + C) = (A + B) + C
For multiplication; A(BC) = (AB)C

III. Distributive property: it is formed using the product of a sum.

A(B + C) = AB + AC

IV. Complement property: it involves a variable and its complement.

For addition: A + A' = 1
For multiplication; A.A' = 0

V. Identity property:

For addition; A + 0 = A
For multiplication; A.1 = A

In digital electronics, Boolean expressions are used to represent circuits which comprises of Boolean operations and as such simplifying any logic expression without changing or altering any of it's functionalities and properties based on given operations or variables.

Hence, Boolean Algebraic properties can lead to a simpler expression and thus a simpler circuit.

3 0

2 years ago

Prime numbers can be generated by an algorithm known as the Sieve of Eratosthenes. The algorithm for this procedure is presented

Sidana [21]

Answer:

const MAXNR=150;

let candidates = {};

for(let i=2; i<=MAXNR; i++) {

candidates[i] = true;

}

for(let p=2; p <= MAXNR; p++) {

if (candidates[p]) {

process.stdout.write(`${p} `);

// Now flag all multiples of p as false

i=2;

while(p*i <= MAXNR) {

candidates[p*i] = false;

i++;

}

4 0

2 years ago