Since Joan wants to see what her presentation would look like in the eyes of her audience, it might be best for her to use the Slideshow view that is available at the bottom right side of her desktop view.
This option is a full-screen form of her Normal view in Microsoft PowerPoint. The Slideshow view is represented by the projector screen symbol next to the zoom in and out bar.
The simplest ways are being used to help eliminate the previously stored data, by deleting hard disc storage facilities with the same data wherever that used a sequence of all zeros.
<h3>What is a hard disc?</h3>
The "DoD Standard" is a term used during the data sanitizing industry and refers to DoD 5220.22-M, and the further discussion can be defined as follows:
The simplest ways are being used to help eliminate the previously stored data, by deleting hard disc storage facilities with the same data wherever that used a sequence of all zeros.
The sparging eliminates statistics to entirely delete the gravitational flux from electronic media.
Hard drives as well as other data storage devices, for example, computer tapes, retain magnetic data.
It could no longer be seen as storage after a disk is degaussed.
Therefore, the final answer is "Using the DoD 5220.22-M method and Degauss media with a magnet".
Learn more about hard disc at:
brainly.com/question/13329582
#SPJ1
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find 
, we need to compute 
and 
before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current
and 
to find the value of 
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.
1.For each of the following, give the name of an element from Period 4 (potassium to krypton), which matches the description.
Elements may be used once, more than once or not all.. Single line text.
(1 Point)
an element that reacts with water to produce a lilac flame
2.For each of the following, give the name of an element from Period 4 (potassium to krypton), which matches the description.
Elements may be used once, more than once or not all.. Single line text.
(1 Point)
an element used as an inert atmosphere
3.For each of the following, give the name of an element from Period 4 (potassium to krypton), which matches the description.
Elements may be used once, more than once or not all.. Single line text.
(1 Point)
an element that has a valency of 3
4.Write a balanced chemical equation for the reaction between potassium and water. (Non-anonymous question). .
(1 Point)
Upload file
File number limit: 1Single file size limit: 10MBAllowed file types: Word, Excel, PPT, PDF, Image, Video, Audio
5.For each of the following, give the name of an element from Period 4 (potassium to krypton), which matches the description.
Elements may be used once, more than once or not all.. Single line text.
(1 Point)
an element with a fixed valency of 2 that not is not in group 2
Answer:
LAN
Explanation:
i am not sure but I think it is lan
