1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Travka [436]
3 years ago
6

__________ is a very simple form of lossless data compression in which runs of data (that is, sequences in which the same data v

alue occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run. This is most useful on data that contains many such runs.
Run-length encoding (RLE)
ROE
None of the above
Computers and Technology
1 answer:
babymother [125]3 years ago
8 0

Answer:

The correct answer to the following question will be "Run-length encoding (RLE)".

Explanation:

RLE seems to be useful for replicated information, swapping it with a qualify as well as a copy of something like a repeat element.

  • Optimized dictionary strategies construct a table of sequences, then substitute appearances of chords with simpler codes.
  • This is a straightforward type of data compression, where data runs become stored as an individual data count as well as a value rather than as the initial run.

You might be interested in
JAVA
musickatia [10]

Answer:

class Main {  

 public static void main(String args[]) {

   int a = 5;

   int delta = 5;

   for(int i=0; i<10; i++) {

       System.out.printf("%d, ", a);

       a += delta;

       delta += 2;

   }

 }

}

6 0
3 years ago
Suppose you have two arrays of ints, arr1 and arr2, each containing ints that are sorted in ascending order. Write a static meth
telo118 [61]
Since both arrays are already sorted, that means that the first int of one of the arrays will be smaller than all the ints that come after it in the same array. We also know that if the first int of arr1 is smaller than the first int of arr2, then by the same logic, the first int of arr1 is smaller than all the ints in arr2 since arr2 is also sorted.

public static int[] merge(int[] arr1, int[] arr2) {
int i = 0; //current index of arr1
int j = 0; //current index of arr2
int[] result = new int[arr1.length+arr2.length]
while(i < arr1.length && j < arr2.length) {
result[i+j] = Math.min(arr1[i], arr2[j]);
if(arr1[i] < arr2[j]) {
i++;
} else {
j++;
}
}
boolean isArr1 = i+1 < arr1.length;
for(int index = isArr1 ? i : j; index < isArr1 ? arr1.length : arr2.length; index++) {
result[i+j+index] = isArr1 ? arr1[index] : arr2[index]
}
return result;
}


So this implementation is kind of confusing, but it's the first way I thought to do it so I ran with it. There is probably an easier way, but that's the beauty of programming.

A quick explanation:

We first loop through the arrays comparing the first elements of each array, adding whichever is the smallest to the result array. Each time we do so, we increment the index value (i or j) for the array that had the smaller number. Now the next time we are comparing the NEXT element in that array to the PREVIOUS element of the other array. We do this until we reach the end of either arr1 or arr2 so that we don't get an out of bounds exception.

The second step in our method is to tack on the remaining integers to the resulting array. We need to do this because when we reach the end of one array, there will still be at least one more integer in the other array. The boolean isArr1 is telling us whether arr1 is the array with leftovers. If so, we loop through the remaining indices of arr1 and add them to the result. Otherwise, we do the same for arr2. All of this is done using ternary operations to determine which array to use, but if we wanted to we could split the code into two for loops using an if statement.


4 0
4 years ago
The possible states of a process are:
Oliga [24]

Answer:

a. new, running, waiting, ready, and terminated.

Explanation:

The process in a computer system can have different states and these are:

-New: When the process is created.

-Ready: When the process is waiting to be executed.

-Running: When the process is chosen to be executed.

-Waiting: When the process is expecting for something to happen.

-Terminated: When the process is not running anymore.

According to this, the answer is that the possible states of a process are: new, running, waiting, ready, and terminated.

3 0
4 years ago
Read 2 more answers
BlockPy: #38.2) While Input Use a while loop to repeatedly take input from the user and print whatever they type in. When the us
BARSIC [14]

Answer:

strr=input("please enter something: ")

while strr is not "":

   print(strr)

   strr=input("please enter something: ")

Explanation:

whenever the user will enter an empty string the loop will terminate

8 0
4 years ago
What is the function below Missing?
Nat2105 [25]

Answer:

I think a closing bracket.. sorry if its wrong.

Explanation:

3 0
4 years ago
Read 2 more answers
Other questions:
  • Explain free space allocation?
    9·1 answer
  • Which of the following is NOT a logical operator (logical connective)?
    5·1 answer
  • You can advance slides during a slideshow by pressing the page down key
    7·1 answer
  • C. you have already verified the routing table entries for r1, now execute the show run | section interface command to verify vl
    11·1 answer
  • 2 The software needed to send an email is:
    7·1 answer
  • 2. An evil twin attack that broadcasts a legitimate SSID for an unauthorized network is an example of what category of threat? A
    9·1 answer
  • Why is it so important to have employees who can critically think?
    7·2 answers
  • It is impossible to overemphasize the fact that, from the perspective of a computer, a network is a) simply another I/O device.
    9·1 answer
  • You are going to visit a national park, and have never been there before. You are using a map to try and make the distance trave
    11·1 answer
  • Zoe wants to use an image file that will allow her to preserve all of the original
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!