1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
aniked [119]
3 years ago
13

Computers process information consistently for all transactions. This creates a risk that:______

Computers and Technology
1 answer:
Anna007 [38]3 years ago
6 0

Answer:

b. erroneous processing can result in the accumulation of a great number of misstatements in a short period of time.

Explanation:

Because of the consistent nature of processing in computers, this is capable of creating certain kinds of risk. From the option, one of the probable risk that can result from consistent information processing for multiple transactions at the same time is erroneous processing. This can therefore lead to a pile of misstatements in only a short period of time.

You might be interested in
A degree-constrained minimum spanning tree is a minimum spanning tree (MST) where the maximum vertex degree is limited to a cert
Bingel [31]

Answer:

A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. Hence, a spanning tree does not have cycles and it cannot be disconnected..

By this definition, we can draw a conclusion that every connected and undirected Graph G has at least one spanning tree. A disconnected graph does not have any spanning tree, as it cannot be spanned to all its vertices.

Spanning Trees

We found three spanning trees off one complete graph. A complete undirected graph can have maximum nn-2 number of spanning trees, where n is the number of nodes. In the above addressed example, n is 3, hence 33−2 = 3 spanning trees are possible.

General Properties of Spanning Tree

We now understand that one graph can have more than one spanning tree. Following are a few properties of the spanning tree connected to graph G −

A connected graph G can have more than one spanning tree.

All possible spanning trees of graph G, have the same number of edges and vertices.

The spanning tree does not have any cycle (loops).

Removing one edge from the spanning tree will make the graph disconnected, i.e. the spanning tree is minimally connected.

Adding one edge to the spanning tree will create a circuit or loop, i.e. the spanning tree is maximally acyclic.

Explanation:

8 0
3 years ago
A server technician has been tasked with purchasing cables and connectors for a new server room. The server room consists of one
Rama09 [41]

Answer:

The answer is "Option b"

Explanation:

A straightforward cable is a form of twisted pair cable, which is used in the  LAN cable, it provides the connections to RJ-45 cable, that pinout to each end for the same connection. In this cable, that is a sequel, the same kind of computer was interlinked for used by the same routers ports, that's why the technician purchase this cable, and certain options were incorrect that can be described as follows:

  • In option a, It is used in the television, that's why it is wrong.
  • Option c and Option d both were wrong because It is used in telephones, that provides low-speed apps, and it terminates the network.
5 0
3 years ago
Consider a system consisting of m resources of the same type, being shared by n processes. Resources can be requested and releas
Mama L [17]

Answer:

Explanation:

The system will be deadlock free if the below two conditions holds :

Proof below:

Suppose N = Summation of all Need(i), A = Addition of all Allocation(i), M = Addition of all Max(i). Use contradiction to prove.

Suppose this system isn't deadlock free. If a deadlock state exists, then A = m due to the fact that there's only one kind of resource and resources can be requested and released only one at a time.

Condition B, N + A equals M < m + n. Equals N + m < m + n. And we get N < n. It means that at least one process i that Need(i) = 0.

Condition A, Pi can let out at least 1 resource. So there will be n-1 processes sharing m resources now, Condition a and b still hold. In respect to the argument, No process will wait forever or permanently, so there's no deadlock.

5 0
3 years ago
A computer that retrieves web pages is called a _____. a. search engine b. client server c. surf site d. web server
Rama09 [41]

Answer: (D) Web server

I hope this helps!

8 0
2 years ago
NEED HELP AS SOON AS POSSIBLE
BaLLatris [955]
Vertical: goes straight up and down parallel to the y-axis
4 0
3 years ago
Other questions:
  • Which type of object is used to organize and store data in Microsoft access 2013
    5·2 answers
  • The Subset Sum problem is a generalization of the Knapsack problem. Group of answer choices True False g
    8·1 answer
  • ____ indicates the number of pixels that a computer uses to display the letters, numbers, graphics, and background on a screen.
    12·2 answers
  • Sandie is writing a report for her environmental science class. She has asked her older sister who is away at college to proof h
    13·2 answers
  • The FaceSnap app has permission to use many devices on your smartphone, including the camera. A data privacy concern that arises
    6·1 answer
  • _____ refers to displaying information for the user's view.
    14·2 answers
  • You are late in the preparation of the computer graphics for your final report and presentation. You run into a friend who is gr
    13·1 answer
  • There are some network modeling tools that can ________ the existing network.
    12·2 answers
  • Take the average of some numbers. Show all the numbers that are below average. You can assume that there will not be more than 2
    10·1 answer
  • Which of the following is true?
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!