Hello <span>Endermss2118 </span>
Answer: If you do not want the border style to carry forward each time the enter key is pressed, you need to Clear formatting
Hope This Helps
-Chris
The correct steps that indicate a correct order of acquisition as they relate to integrity and non-repudiation are:
- A hash of the disk is made
- A bit-by-bit copy is made
- A second hash is made
- A copy is made of the reference image
<h3>Is non-repudiation an aspect of integrity?</h3>
In general, nonrepudiation is known to be a term that puts together or combines authentication and integrity.
Note that Nonrepudiation is said to be a key or one of the pillars that pertains to information assurance.
The integrity in cyber security is known to be the act of keeping safe against any form of an improper information modification or destruction.
Hence, The correct steps that indicate a correct order of acquisition as they relate to integrity and non-repudiation are:
- A hash of the disk is made
- A bit-by-bit copy is made
- A second hash is made
- A copy is made of the reference image
Learn more about acquisition from
brainly.com/question/11412887
#SPJ1
Answer:
// here is code in c++.
#include <bits/stdc++.h>
using namespace std;
// function that return greatest common divisor
int g_c_d(int num1, int num2)
{
if (num1 == 0)
return num2;
return g_c_d(num2 % num1, num1);
}
// main function
int main()
{
// variables
int num1,num2;
cout<<"enter two numbers:";
// read two numbers from user
cin>>num1>>num2;
// call the function and print the gcd of both
cout<<"greatest common divisor of "<<num1<<" and "<<num2<<" is "<<g_c_d(num1.num2)<<endl;
}
Explanation:
Read two numbers from user and assign them to variables "num1" and "num2".Call the function g_c_d() with parameter "num1" and "num2".According to Euclidean algorithm, if we subtract smaller number from the larger one the gcd will not change.Keep subtracting the smaller one then we find the gcd of both the numbers.So the function g_c_d() will return the gcd of both the numbers.
Output:
enter two numbers:5 9
greatest common divisor of 5 and 9 is 1
enter two numbers:-25 15
greatest common divisor of -25 and 15 is 5
