All categories

3 years ago

Describe two different examples of potential conflicts, and explain why these conflicts can have a negative impact on

Computers and Technology

1 answer:

Julli [10]3 years ago

6 0

Answer:

A conflict is a situation in which two or more parties with opposing interests collide in their positions when trying to obtain a benefit or satisfy their needs. Thus, for example, if two people want to obtain the same thing, there will be a conflict of interest between those people, since only one of them will be able to satisfy their need.

Thus, two examples of conflict are, on the one hand, the clash of interests over a particular thing (two people want the same thing or position); and on the other, the conflict between two people with different and antagonistic personalities (an extroverted and noisy person against another introverted and reserved).

In all cases, a conflict between two people who are working on the same project could lead to a series of negativities that could affect its outcome.

You might be interested in

You manage a network that uses a single switch. All ports within your building connect through the single switch. In the lobby o

Karo-lina-s [1.5K]

Answer:

<u>VLANs</u>

Explanation:

Virtual LANs (VLANs) are a type of network connection or arrangement of network devices in the same broadcast domain. They are called Virtual LANs because they represent fractions or subgroups in the switch ports found in an Ethernet LAN.

Indeed, because of their topological arrangement, this reduces the security risk of unauthorized access to sensitive data or devices since the host can be placed on a different VLAN. Hence, in this scenario, using this network feature would allow visitors to plug into these ports to gain internet access, but they would not have access to any other devices on the private network.

5 0

3 years ago

How do I change my username/display name

exis [7]

Answer:

Explanation:

you do to me on the bottom bar and once you hit that you click the pencil and change it

6 0

3 years ago

Read 2 more answers

Which describes the first step a crawler-based search engine uses to find information?

Orlov [11]

<span>Crawler-based search engines are what most of us are familiar with - mainly because that's what Google and Bing are. These companies develop their own software that enables them to build and maintain searchable databases of web pages (the engine), and to organise those pages into the most valuable and pertinent way to the user.</span>

5 0

3 years ago

Read 2 more answers

Discuss about the main frame computer

Nimfa-mama [501]

Answer:

Mainframes (also called "big iron")[1] are powerful computers used for large information processingjobs. They are mainly used by governmentinstitutions and large companies for tasks such as census, industry and consumer statistics, enterprise resource planning, and financial transaction processing. Mainframe computers are specially used as servers on the World Wide Web (WWW). They are distinct from supercomputers.

7 0

3 years ago

A computing company is running a set of processes every day. Each process has its own start time and finish time, during which i

Helga [31]

Answer:

Above all else, let us show that this issue has the greedy choice property.

This implies that worldwide ideal arrangement can be gotten by choosing local ideal arrangements. Presently notice the following:

The global optimal solution of the issue requests us to track down the minimum number of times process_check module should be run.

It is likewise referenced that during each running interaction, process_check module should be called atleast once. Along these lines, the minimum possible number of process_check calls happens when process_check is made close to the quantity of the processes that are run.

Along these lines, we see that the global optimal solution is shaped by choosing optimal answer for the nearby advances.

Along these lines, the issue shows greedy choice property. Thus, we can utilize a greedy algorithm for this issue.

The greedy step in this calculation is to postpone the process_check as far as might be feasible. Thus, it should be run towards the finish of each interaction. So the following algorithm can be utilized:

Sort the cycles by utilizing the completion times.

Towards the finish of the 1st process in the arranged list, run the process_check module. Right now any process that is now running is removed the arranged rundown. The main interaction is additionally removed from the sorted list.

Now repeat stage 2, till all processes are finished.

In the above mentioned algorithm, the costliest advance is the step of sorting. By utilizing the optimal sorting algorithm, for example, merge sort, we can achieve it in O(n log n) asymptotic time.

Along these lines, this greedy algorithm additionally takes O(n log n) asymptotic time complexity.

5 0

3 years ago