Sharing a workbook helps to complete on time. Multiple people accessing the workbook help to build

My friend Leo wants to have an emergency plan for his final exams on University of Southern Algorithmville. He has N subjects to

Brut [27]

Answer:

Greedy algorithm

Explanation:

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following property: At every step, we can make a choice that looks best at the moment, and we get the optimal solution of the complete problem.

If a Greedy Algorithm can solve a problem, then it generally becomes the best method to solve that problem as the Greedy algorithms are in general more efficient than other techniques like Dynamic Programming. But Greedy algorithms cannot always be applied. For example, the Fractional Knapsack problem (See this) can be solved using Greedy, but 0-1 Knapsack cannot be solved using Greedy.

The following are some standard algorithms that are Greedy algorithms.

1) Kruskal’s Minimum Spanning Tree (MST):

In Kruskal’s algorithm, we create an MST by picking edges one by one. The Greedy Choice is to pick the smallest weight edge that doesn’t cause a cycle in the MST constructed so far.

2) Prim’s Minimum Spanning Tree:

In Prim’s algorithm also, we create an MST by picking edges one by one. We maintain two sets: a set of the vertices already included in MST and the set of the vertices not yet included. The Greedy Choice is to pick the smallest weight edge that connects the two sets.

3) Dijkstra’s Shortest Path:

Dijkstra’s algorithm is very similar to Prim’s algorithm. The shortest-path tree is built up, edge by edge. We maintain two sets: a set of the vertices already included in the tree and the set of the vertices not yet included. The Greedy Choice is to pick the edge that connects the two sets and is on the smallest weight path from source to the set that contains not yet included vertices.

4) Huffman Coding:

Huffman Coding is a loss-less compression technique. It assigns variable-length bit codes to different characters. The Greedy Choice is to assign the least bit length code to the most frequent character.

The greedy algorithms are sometimes also used to get an approximation for Hard optimization problems. For example, the Traveling Salesman Problem is an NP-Hard problem. A Greedy choice for this problem is to pick the nearest unvisited city from the current city at every step. These solutions don’t always produce the best optimal solution but can be used to get an approximately optimal solution.

8 0

2 years ago

Write a program to calculate the great circle distance between two points on the surface of a sphere. If p1(x1, y1) and p2(x2,y2

Tamiku [17]

Answer:

import java.lang.*;

public class distance { public static double distance(double latitude1,

double latitude2, double longitude1,

double longitude2)

{

// Convert Latitude and Longitude to Radians

longitude1 = Math.toRadians(longitude1);

longitude2 = Math.toRadians(longitude2);

latitude1 = Math.toRadians(latitude1);

latitude2 = Math.toRadians(latitude2);

double d_longitude = longitude2 - longitude1;

double d_latitude = latitude2 - latitude1;

double a = Math.pow(Math.sin(d_latitude / 2), 2)

+ Math.cos(latitude1) * Math.cos(latitude2)

* Math.pow(Math.sin(d_longitude / 2),2);

double val = 2 * Math.asin(Math.sqrt(a));

// Radius of earth in kilometers is 6371

double earth_radius = 6371;

// Calculate and return the distance

return(val * earth_radius);

}

// Main Method

public static void main(String[] args)

{

double latitude1 = 67.32055555555556;

double latitude2 = 83.31861111111111;

double longitude1 = -1.7217899;

double longitude2 = -1.6567799;

System.out.println(distance(latitude1, latitude2,

longitude1, longitude2) + " K.M");

}

Explanation:

This program is implemented in Java programming language

The formula for the shortest distance between two points on the earth is:

Distance = 3963.0 * arccos[(sin(lat1) * sin(lat2)) + cos(lat1) * cos(lat2) * cos(long2 – long1)]

The latitude and longitude of the two points must be known

The latitude and longitude are converted into radians using built in methods in java.

Take value for the radius of the earth in Kilometers 6371;

Note that a seperate method has been created to calculate the distance

In the driver method (main), values for latitude and logitudes for both places have been hard-corded, then the method distance is called and passed those values

Note also that the distance has been calculated in Kilometers

8 0

3 years ago

Your friend decides to create a spreadsheet containing vocabulary terms and their definitions to help prepare for the unit test

Nataly_w [17]

Answer:

The answer is SORT

Explanation:

Just did the test :)

6 0

2 years ago

Why is a monitor an output device?

denis23 [38]

Because it's getting info from the computer and presenting it to you. Similar in principle to a printer.

6 0

3 years ago

you're installing network wiring for a new ethernet network at your company's main office building. the project specifications c

Ivahew [28]

Based on the information about the network, Cat 5e cabling posseses more twists per inch than Cat 3 cabling, and this will thereby reduce cross-talk and support higher data rates.

<h3>What is a network?</h3>

A network simply means a group of two or more computers that are interconnected for the purpose of exchanging data as well as sharing resources.

In this case, while Cat 3 and Cat 5e cabling appear the same physically, they are electrically different. It should be noted that Cat 5e cabling is twisted tighter than Cat 3 cabling and this will then reduce cross talk and enables Cat 5e wiring to support faster data transmission.

Learn more about network on:

brainly.com/question/26956118

#SPJ1

You are installing networking wiring for a new Ethernet network at your company's main office building. The project specifications call for Cat 5e UTP network cabling and RJ45 wall jacks. Near the end of the project, you run out of wire before the last few runs are complete. You have a spool of Cat 3 network cable in storage. Upon investigation, it appears very similar to Cat 5e wiring.

Should you use Cat 3 cabling as a substitute for Cat 5e cabling to finish the project?

5 0

1 year ago