All categories

3 years ago

Make the smallest

Computers and Technology

1 answer:

seraphim [82]3 years ago

3 0

Answer:

Whole Numbers:

0000 0001 (Binary) --> 1 (Decimal)

Real Numbers:

0000 0001 (Binary) --> 0.00390635 (Decimal)

Explanation:

In general, the smallest nonzero number that can be displayed in binary that is a whole number is 1. Consider that as you increase by 1 in the binary system starting from 0, you will have the following:

0000 0000 == 0

0000 0001 == 1 (Smallest nonzero)

0000 0010 == 2

0000 0011 == 3

... etc.

Notice the smallest value here is decimal 1. With this in mind, you will need to "program" you Flippy Do Pro to display this value. Alternatively, if you consider decimal numbers in binary with the Flippy Do Pro, you can have even smaller nonzero numbers. Depending on where you decide to place the decimal, you can even have smaller nonzero values.

Let's assume that you say this is a fractional representation of binary on the Flippy Do Pro. Then, you will say your decimal is infront of the display of the Flippy Do Pro, hence index 9 (which is not displayed). From here, you will simply say the following:

0000 0000 == 0.0

0000 0001 == 0.00390635 (Smallest nonzero)

0000 0010 == 0.0078125

0000 0100 == 0.015625

... etc.

Note, in binary, as you move the value of 1 to the right of the decimal, you are doing (1 / 2^n), where n is the index value to the right of the decimal.

Hence, depending on if you are to consider just whole numbers or real numbers, the smallest value displayed can be different even though the number being displayed is still 0000 0001.

Cheers.

You might be interested in

Cliff just started working with a client who has a very disorganized AdWords account. What’s an effective way for him to begin r

scoundrel [369]

AdWords is a service which helps to create online advertisements. It's needed to promote your business, by increasing popularity of your website or selling your products. The most effective way for Cliff is to create campaigns based on the structure of his client’s website. He should divide his client's account into several campaigns according to website's structure.

7 0

3 years ago

________ is digital textual information that can be stored, manipulated, and transmitted by electronic devices.

mars1129 [50]

E-text is digital textual information that can be stored, manipulated, and transmitted by electronic devices. The term "e-text" stands for electronic text and it is used for any digital document written, read, transmitted or manipulated by electronic devices, such as smart phones, PCs, tablets,...The origins of the e-text are in the beginning of the Internet.

7 0

3 years ago

Examine the efficiency the various recovery algorithms used in deadlock handling

sineoko [7]

Solution:

The process of transaction can guarantee the reliability of business applications. Locking resources is widely used in distributed transaction management (e.g; two phase commit, 2PC) to keep the system consistent. The locking mechanism, however, potentially results in various deadlocks. In service oriented architecture, the deadlock problem becomes even worse because multiple transactions try to lock shared resources in the unexpectable way due to the more randomicity of transaction requests, which has not been solved by existing research results. In this paper, we investigate how to prevent local deadlocks, caused by the resource competition among multiple sub-transactions of a gl obal transaction, and global deadlocks from the competition among different global transactions. We propose a replication based approach to avoid the local deadlocks, and a timestamp based approach to significantly mitigate the global deadlocks. A general algorithm is designed for both local and global deadlock prevention. The experimental results demonstrate the effectiveness and efficiency of our deadlock prevention approach. Further, it is also proved that our approach provides higher system performance than traditional resource allocation schemes.

This is the required answer.

4 0

3 years ago

List the three control problems associated with competingprocesses and briefly define each.

hjlf

Answer and explanation :

the three control problems associated with competing process are

MUTUAL EXCLUSION : We know that some resources are shareable and some are not shareable. which means only one process can access the resource at a time this type of resources are called critical resources this code can be access at only one process at a time. the other process if required to access should not be allowed
DEADLOCK: this hold the process without complete for example suppose there are two resources R1 and R2 and two process P1 and P2 and P1 use R1 and P2 use R2 but after some time when P1 needs R2 but R2 is not available as it is used by P2 so the all process will be on hold
STARVATION : when priorities are given to the process as high priorities and low priorities. And high priorities process always competing then low priorities process have to wait for very long time this is called starvation

3 0

3 years ago

Suppose that the bag class is efficiently implemented with a fixed array with a capacity of 4000, as in Chapter 3 of the class t

Phoenix [80]

Answer:

b.used is 2, b.data[0] is 4, b.data[1] is 6

Explanation:

bag b;

b.insert(5); // b has 5

b.insert(4); // b has 5,4

b.insert(6); // b has 5,4,6

b.erase_one(5); // now 5 is removed , b has 4,6

so no:of elements b.used is 2

b[0]=4;

b[1]=6;

6 0

3 years ago