All categories

3 years ago

Explain the consequences of using bits to represent data.

Computers and Technology

1 answer:

neonofarm [45]3 years ago

7 0

Answer:

Each description of a PC needs to clarify how the PC handles data: numbers, text, pictures, sound, films, directions.

Using bits to represent data implies that the computer has to use a lot of memory since every character has a group of bits representing it.

The PC is an electronic gadget. Every one of its wires can either convey electric flow or... not convey current. Thus, similar to a light switch, it sees just two states. Incidentally, this is sufficient to make the entire thought work. Indeed, any framework that can speak to in any event two states can speak to data. Take, for instance, the Morse code that is utilized in telecommunication. Morse is a sound transmission framework that can convey a short signal (spoke to by a dab) and a long beeeeeep (spoke to by a scramble). Any letter or number can be spoken to by a mix of these two images. Snap here to see a Morse interpreter.

Explanation:

Essentially with PCs. To speak to a number, we utilize the parallel number-crunching framework, not the decimal number framework that we use in regular day to day existence. In the double framework, any number can be spoken to utilizing just two images, 0 and 1. (Morse is nearly, yet not exactly (because of the delays between letters) a paired framework. A framework firmly identified with Morse is utilized by PCs to do information pressure (more about this later).

You might be interested in

Juan wrote a loop to print all the prime numbers between 1 and 100. But instead of stopping at 100, it continues on and on forev

aniked [119]

Answer:

oh im cool

Explanation:

6 0

3 years ago

The part of the computer that provides access to the Internet is the

andrew11 [14]

Answer:

MODEM

Explanation:

5 0

3 years ago

You have just performed a cpm analysis and have found that more than one path through the project network has zero slack values.

Alex787 [66]

Answer:

There are multiple critical paths

Explanation:

The critical path method (CPM), or critical path analysis (CPA), is an algorithm for scheduling a set of project activities. It is commonly used in conjunction with the program evaluation and review technique (PERT). A critical path is determined by identifying the longest stretch of dependent activities and measuring the time required to complete them from start to finish.

The essential technique for using CPM is to construct a model of the project that includes the following:

A list of all activities required to complete the project (typically categorized within a work breakdown structure),

The time (duration) that each activity will take to complete,

The dependencies between the activities and,

Logical end points such as milestones or deliverable items.

Using these values, CPM calculates the longest path of planned activities to logical end points or to the end of the project, and the earliest and latest that each activity can start and finish without making the project longer. This process determines which activities are "critical" (i.e., on the longest path) and which have "total float" (i.e., can be delayed without making the project longer).

considering the above function of the cpm analysis because you have multiple path, there is tendency that more than path through the project network will have zero slack values.

5 0

3 years ago

You give an object a more meaningful name by setting the object’s _________________ property.

viva [34]

Answer:

The correct answer to this question is "Name".

Explanation:

In the programming language, the object is a part of the object-oriented programming language (oops).In all (oops) programming language we use class and object. where class is a collection of data member and member function, and object is a real-world entity. An Object is an instance of a Class. When a class is created, no memory is assigned but when we create the object of the class then memory is allocated.

In this question except option (d), all options are wrong.

7 0

3 years ago

A binary search algorithm is written (as in the modules, for example) which searches a pre-sorted array for some user-defined va

Mazyrski [523]

Answer:

c) it will always return with an answer of 7 or fewer comparisons of data.

Explanation:

As maximum number of comparison in worst case for sorted binary search is log₂n, here n = 100, so maximum search is at least 6.6 which is approximately 7.

4 0

3 years ago