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
7nadin3 [17]
2 years ago
12

Before donating a computer you should use a program to wipe the hard disk to remove all of its data

Computers and Technology
2 answers:
Dafna11 [192]2 years ago
8 0
Yes, you must do it, because the person who got your computer, may hack in and use your mail do to something illegal.
Elenna [48]2 years ago
7 0
Yes you should. highly recommended
You might be interested in
For which tasks is Layout view most helpful? Check all that apply.
Solnce55 [7]

The task where the Layout view most helpful is showing how a report will look when printed.

<h3>What is the Layout view?</h3>

The Layout view is known to be a view that is said to be more of visually-oriented when compared to the Design view.

Note that the Layout view is one where each control often shows real data and as such, The task where the Layout view most helpful is showing how a report will look when printed.

Learn more about  Layout view  from

brainly.com/question/1327497

#SPJ1

6 0
1 year ago
PLEASE HELP!!!!!! ASAP
NNADVOKAT [17]

Answer:

use a wizard or use a design view

Explanation:

i took the test

4 0
3 years ago
Read 2 more answers
_______ data would be useful for creating a weekly status report for your manager that should reflect changes in real time.     
elena55 [62]
D. Field data because that it a report of what happened over the week that a manager can reflect on for possible changes.
3 0
3 years ago
Read 2 more answers
The goals of _____ are to determine the work load at which systems performance begins to degrade and to identify and eliminate a
Vitek1552 [10]

Answer:

volume testing hope this helps :)

7 0
2 years ago
Suppose that a computer can run an algorithm on a problem of size 1,024 in time t. We do not know the complexity of the algorith
Setler79 [48]

Answer:

Time Complexity of Problem - O(n)

Explanation:

When n= 1024 time taken is t. on a particular computer.

When computer is 8 times faster in same time t , n can be equal to 8192. It means on increasing processing speed input grows linearly.

When computer is 8 times slow then with same time t , n will be 128 which is (1/8)th time 1024.

It means with increase in processing speed by x factor time taken will decrease by (1/x) factor. Or input size can be increased by x times. This signifies that time taken by program grows linearly with input size n. Therefore time complexity of problem will be O(n).

If we double the speed of original machine then we can solve problems of size 2n in time t.

5 0
3 years ago
Other questions:
  • If reading or writing a cache line of size 64 bytes to Flash requires 2.56 μJ and DRAM requires 0.5 nJ, and if idle power consum
    9·1 answer
  • How to use javascript libraries in javascript code?
    9·1 answer
  • Given the commands below, what do they do? for (position = 1 through aList.getLength()/2) { a = aList.getEntry(aList.getLength()
    11·1 answer
  • After an informative session, you find yourself with several pages of notes. For maximum retention and understanding, you should
    6·1 answer
  • Anybody good with Microsoft excel? I need help with this class.
    9·2 answers
  • During the forensic phase of a security investigation, it was discovered that an attacker was able to find private keys on a poo
    9·1 answer
  • What is 450 g of flour a measure of?
    11·1 answer
  • The blue bar across the top of the screen informs you of the Screen Title, or what step you are on.
    5·1 answer
  • How do you check how much space is left in current drive?
    9·1 answer
  • the tool that is used on the form to display text that the user cannot change is a. textbox b. label c. button​
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!