All categories

3 years ago

This is a free point thing!! I am giving 100 points!! Anyone wanna talk!!!!

Computers and Technology

2 answers:

julia-pushkina [17]3 years ago

8 0

Answer:

Explanation:

viktelen [127]3 years ago

8 0

Answer:

thx for the points

Explanation:

You might be interested in

Which of the following modes of replication requires a very low latency network connection and ensures data remains in synch wit

Snowcat [4.5K]

Answer:

b. Synchronous replication

Explanation:

Replication of data in storage partitions or in a number redundant array of independent disk drives helps to promote redundancy, as implied, and faulty tolerance to reduce loss of data.

There are two categories of replication and they are synchronous and asynchronous replication.

Synchronous replication requires low latency network site to mirror data, while asynchronous replication mirrors data in large metropolitan area in high latency networks.

4 0

3 years ago

Technician A says that wheel speed sensors are a highly probable cause of illuminated EBC warning lamps. Technician B says that

Blababa [14]

Technician A because

3 0

3 years ago

Write a program that prompts the user for two numbers then outputs the result of dividing the first number by the second number

Rainbow [258]

The program is

num = int(input("Enter Numerator "))

den = int(input("Enter Denominator "))

print("quotient is ",str(num//den)," remainder is ", str(num%den))

<h3>How to create a division sign in HTML?</h3>

To create a division sign ( ÷ ) in HTML you can use any of the following codes.

÷

&div;

÷

<h3>How to divide in computer programming?</h3>

Perl code

use strict;

my $first = 15;

my $second = 5;

my $answer = $first / $second;

print "You get $answer if you divide $first by $second";

When the script above is run, it displays "You get 3 if you divide 15 by 5" on the screen.

To learn more about programming, refer

https://brainly.ph/question/4743

#SPJ4

5 0

1 year ago

Greedy Algorithm Design

Alik [6]

Answer:

The algorithm is as follows:

1. Start

2. Get the number of items (n)

3. Get the current price of the n items (a1, a2..... an)

4. Get the possible hiked price of the n items (b1, b2..... bn)

5. Calculate the difference between the current and hiked prices for each item i.e. $d_i = b_i - a_i$

6. Sort the differences in descending order (i.e. from the greatest to the least)

7. Buy items in this order of difference

8. Stop

Explanation:

The algorithm is self-explanatory; however, what it does is that:

It takes a list of the current price of items (say list a)

E.g: $a = [100, 150, 160]$

Then take a list of the hiked price of the items (say list b)

E.g: $b = [110, 180, 165]$

Next, it calculates the difference (d) between corresponding prices $d_i = b_i - a_i$

$d = [(110 - 100),(180-150),(165-160)]$

$d = [10,30,5]$

Sort the difference from greatest to lowest (as the difference is sorted, lists a and b are also sorted)

$d = [30,10,5]$

$a = [150, 100, 160]$

$b = [180, 110, 165]$

If there is no hike up to item k, the couple would have saved (i = 1 to d[k-1])

Assume k = 3

The couple would have saved for 2 item

$Savings = d[1] + d[2]$

$Savings = 30 +10$

$Savings = 40$

The saved amount will then be added to the kth item in list a i.e. a[k](in this case k = 3) in order to buy b[k]

Using the assumed value of k

$a[k] = a[3]$

$a[3] = 160$

$b[3] = 165$

Add the saved amount (40) to a[3]

$New\ Amount = 40 + 160$

$New\ Amount = 200$

This new amount can then be used to buy b[3] i.e. 165, then they save the change for subsequent items

8 0

3 years ago

Directions

DanielleElmas [232]

Answer:

is he project for me

Explanation:

3 0

2 years ago