All categories

4 years ago

What Intel socket recommends the use of a liquid cooling system?

1 answer:

7 0

The socket which Intel recommends that one should use with a liquid cooling system is LGA 2011. LGA 2011, also known as socket R is a CPU socket manufactured by Intel. It was released into the market in November 2011 and it replaced LGA 1366 and LGA 1567 in the performance and high end desk tops and server platforms. Socket R has 2011 pins that touch contact points on the underside of the processor.

You might be interested in

How do graphic designers showcase their work?

Luda [366]

They showcase it digitally since their work is done on computers.

6 0

4 years ago

Read 2 more answers

Which statement reflect a culture that value collectivism

Morgarella [4.7K]

Answer: To be honest i believe its D. All of the above reflect collectivism

hope this helps :)

8 0

4 years ago

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

leonid [27]

Answer:

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.

6 0

3 years ago

Which of the statements below explains why a budget is useful

Papessa [141]

The answer is D. All the other answers describe what a budget CAN be like, not necessarily what it is for everyone, if that makes sense.

8 0

3 years ago

Implement a method called bubbleSort, that takes an ArrayList, sorts it using bubble sort algorithm, and returns a sorted list;

boyakko [2]

Answer:

Java algorithm is given below

Explanation:

import java.util.ArrayList;

import java.util.Arrays;

import java.util.Random;

public class Temp {

static void bubbleSort(ArrayList<Integer> list) {

int n = list.size();

for (int p = 0; p < n - 1; p++)

for (int q = 0; q < n - p - 1; q++)

if (list.get(q) > list.get(q + 1)) {

int temp = list.get(q);

list.set(q, list.get(q + 1));

list.set(q + 1, temp);

}

static void selectionSort(ArrayList<Integer> list) {

int n = list.size();

for (int p = 0; p < n - 1; p++) {

int minimumIndex = p;

for (int q = p + 1; q < n; q++)

if (list.get(q) < list.get(minimumIndex))

minimumIndex = q;

int temp = list.get(p);

list.set(p, list.get(minimumIndex));

list.set(minimumIndex, temp);

}

static void insertionSort(ArrayList<Integer> list) {

int size = list.size();

int p, val, q;

for (p = 1; p < size; p++) {

val = list.get(p);

q = p - 1;

while (q >= 0 && list.get(q) > val) {

list.set(q + 1, list.get(q));

q = q - 1;

}

list.set(q + 1, val);

}

static void mergeSort(ArrayList<Integer> list, int low, int high) {

if (low < high && (high - low) >= 1) {

int mid = (high + low) / 2;

mergeSort(list, low, mid);

mergeSort(list, mid + 1, high);

merger(list, low, mid, high);

}

static void merger(ArrayList<Integer> list, int low, int mid, int high) {

ArrayList<Integer> mergedArray = new ArrayList<Integer>();

int left = low;

int right = mid + 1;

while (left <= mid && right <= high) {

if (list.get(left) <= list.get(right)) {

mergedArray.add(list.get(left));

left++;

} else {

mergedArray.add(list.get(right));

right++;

}

while (left <= mid) {

mergedArray.add(list.get(left));

left++;

}

while (right <= high) {

mergedArray.add(list.get(right));

right++;

}

int i = 0;

int j = low;

while (i < mergedArray.size()) {

list.set(j, mergedArray.get(i++));

j++;

}

public static void main(String[] args) throws Exception {

ArrayList<Integer> list = new ArrayList<>();

Random rand = new Random(System.currentTimeMillis());

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

list.add(rand.nextInt(256));

}

long start = System.currentTimeMillis();

selectionSort(list);

int sel = (int) (System.currentTimeMillis() - start);

System.out.println("Selection Sort time (in ms): " + sel);

list.clear();

// ------------------------

rand = new Random(System.currentTimeMillis());

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

list.add(rand.nextInt(256));

}

start = System.currentTimeMillis();

insertionSort(list);

int ins = (int) (System.currentTimeMillis() - start);

System.out.println("Insertion Sort time (in ms): " + ins);

list.clear();

// ------------------------

rand = new Random(System.currentTimeMillis());

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

list.add(rand.nextInt(256));

}

start = System.currentTimeMillis();

bubbleSort(list);

int bub = (int) (System.currentTimeMillis() - start);

System.out.println("Bubble Sort time (in ms): " + bub);

list.clear();

// ---------------------------

rand = new Random(System.currentTimeMillis());

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

list.add(rand.nextInt(256));

}

start = System.currentTimeMillis();

mergeSort(list, 0, list.size() - 1);

int mer = (int) (System.currentTimeMillis() - start);

System.out.println("Merge Sort time (in ms): " + mer);

long m = Math.min(Math.min(sel, ins), Math.min(bub, mer));

if (m == sel)

System.out.println("Selection Sort is fastest");

else if (m == ins)

System.out.println("insertion Sort is fastest");

else if (mer == m)

System.out.println("Merge Sort is fastest");

else if (m == bub)

System.out.println("Bubble Sort is fastest");

}

6 0

3 years ago