All categories

3 years ago

Put the following numbers in order from greatest to least:

Computers and Technology

1 answer:

monitta3 years ago

3 0

Negativ numbers no matter how big, will always be less than zero. The correct Answer is A) 45,15,0,-11,-37

You might be interested in

Wendell notices that the company's top executives share a belief that managers are directly responsible for the organization's s

Debora [2.8K]

This belief reflects an omnipotent view of management.

8 0

2 years ago

1. How many bits would you need to address a 2M × 32 memory if:

Dominik [7]

Answer:

a) 23 b) 21
a) 43 b) 42
a) 0 b) 0

Explanation:

1) How many bits is needed to address a 2M * 32 memory

2M = 2^1*2^20, while item =32 bit long word

hence ; L = 2^21 ; w = 32

a) when the memory is byte addressable

w = 8; L = ( 2M * 32 ) / 8 = 2M * 4

hence number of bits = log2(2M * 4)= log2 ( 2 * 2^20 * 2^2 ) = 23 bits

b) when the memory is word addressable

W = 32 ; L = ( 2M * 32 )/ 32 = 2M

hence the number of bits = log2 ( 2M ) = Log2 (2 * 2^20 ) = 21 bits

2) How many bits are required to address a 4M × 16 main memory

4M = 4^1*4^20 while item = 16 bit long word

hence L ( length ) = 4^21 ; w = 16

a) when the memory is byte addressable

w = 8 ; L = ( 4M * 16 ) / 8 = 4M * 2

hence number of bits = log 2 ( 4M * 2 ) = log 2 ( 4^1*4^20*2^1 ) ≈ 43 bits

b) when the memory is word addressable

w = 16 ; L = ( 4M * 16 ) / 16 = 4M

hence number of bits = log 2 ( 4M ) = log2 ( 4^1*4^20 ) ≈ 42 bits

3) How many bits are required to address a 1M * 8 main memory

1M = 1^1 * 1^20 , item = 8

L = 1^21 ; w = 8

a) when the memory is byte addressable

w = 8 ; L = ( 1 M * 8 ) / 8 = 1M

hence number of bits = log 2 ( 1M ) = log2 ( 1^1 * 1^20 ) = 0 bit

b) when memory is word addressable

w = 8 ; L = ( 1 M * 8 ) / 8 = 1M

number of bits = 0

5 0

3 years ago

NEED HELP ASAP! BRAINLIEST AND 20 PTS TO CORRECT ANSWER!

son4ous [18]

The correct answer is C.

8 0

3 years ago

A computer can manipulate symbols as if it understands the symbols and is reasoning with them, but in fact it is just following

Law Incorporation [45]

Answer:

The symbols may or may not have meaning, but the machine does not need to know how the symbols are interpreted in order to manipulate the symbols in the right way.

Explanation:

The computer can change the symbols in the case when the computer understand but in actual following the cut-paste rules without having any understanding this is because the symbols might be have meaning or not but if we talk about the machine so actually they dont know how the symbols are interpreted and how it can be used so that it can be change in the accurate way

5 0

2 years ago

There are two algorithms called Alg1 and Alg2 for a problem of size n. Alg1 runs in n2 microseconds and Alg2 runs in 100n log n

nataly862011 [7]

The answer & explanation for this question is given in the attachment below.

8 0

4 years ago