All categories

3 years ago

Each processor or core processes two threads at the same time is called _________.

Computers and Technology

1 answer:

Scrat [10]3 years ago

4 0

Answer:

Parallelism

Explanation:

Each processor or core processes two threads at the same time is called parallelism.

Parallelism in computing refers to the improvement of performance. In fact parallelism is the mechanism in which multiple computing tasks can be processed at the same time. In synthesis in parallel executions every single task is split into multiple core processes in which every sub-task is executed at the same time.

You might be interested in

(1) The Format Painter ___.

siniylev [52]

(1) The Format Painter-allows you to copy formatting from one object and apply it to another object

(2) What is the best description of the Quick Access toolbar-(b) Shows the shortcut for the current tool

Explanation:

(1) The Format Painter-allows you to copy formatting from one object and apply it to another object

(2) What is the best description of the Quick Access toolbar-(b) Shows the shortcut for the current tool

(3) What is the difference between the Slides pane and the Outline pane-(a) one is text-based while the other shows thumbnails

(4) Where can you find the ZOOM command-(c) View Tab

(5) If you wanted to add a glow effect to text, which dialog box would you use-(c) Format Text Effects

(6) You have created a Title slide, but you have made too many formatting modifications and you want it to look like the original layout. What is the best way to do this-(a) Use the Reset command on the Home tab

(7) Which of the following tabs is not shown by default-(a) Slide Show

(8) If you want to change the background of a particular slide, which tab would you choose-(d) Design tab

(9) What is the shorcut for Paste-(c) CTRL + V

(10) Which of the following statements about sections is FALSE-(c) You can delete a section without all of the slides in it being deleted

 (11) What is the shortcut key for checking spelling-(c) F7

(12) You have created a title slide but you want to change its layout to a section header slide. What is the quickest way to do this-(b) Click Home - Layout - Section Header

(13) What types of presentations will you find in the File - New area-(c) Templates from Office Online

(14) Which of the following commands can be used to open the Help screen-(a) File - Help - Microsoft Office Help

8 0

3 years ago

Write a C++ program using a do while loop for (Find the highest score). The program should work for any number of students. Run

alexdok [17]

Answer:

#include <iostream>
using namespace std;
int main()
{
int highest = 0;
int score;
do{
cout<<"Input a score: ";
cin>>score;
if(score > highest){
highest = score;
}
}while(score >= 0);
cout<<highest;
return 0;
}

Explanation:

Firstly, create a variable highest and initialize it with zero (Line 5). Next, create a do while loop (Line 7 - 14). Within the loop prompt user to input a score (Line 8-9) and if the current score is higher than the highest variable, assign the score to highest variable (Line 11 - 13).

After finishing the loop when user put in any negative value, the program shall be able to print out the highest input score (Line 16).

8 0

3 years ago

Write the code to compute and output how many times the value 99 is found in an array of integers named numbers

astraxan [27]

Thank you for being the rare question where you actually provide what language you want your answer in; I approve, and encourage this.

In Java, the following will work.
I made it a bit more versatile to work with others numbers, other than 99, if you so please (if not, just hardcode the 99 in yourself).

// Example list - fill this with numbers yourself.
ArrayList<Integer> nums = new ArrayList<>();
int n = 99;
int count = (int)nums.stream().filter(i -> i == n).count();
System.out.println(n + " occurences.");

8 0

4 years ago

If you want to start a convo go here https://padlet.com/beighbay000/x0q2v6qrm46j

Setler [38]

Answer:

Explanation:

thx for tha points

..........

6 0

3 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