Answer:
B.
Explanation:
If you are trying to save an existing document you would use the save command and you will be prompted if you want to rename it to what ever you wish
Hope this helps :)
Answer:
#include<iostream>
int main()
{
int count=0;
int so_phan_tu;
std::cout << "nhap so phan tu : \n";
std::cin >> so_phan_tu;
int* A = new int[so_phan_tu];
std::cout << "nhap cac phan tu : \n";
for (int i = 0; i < so_phan_tu; i++)
{
std::cin >> A[i];
if (A[i] % 5 == 0)
{
count++;
}
}
std::cout << so_phan_tu - count;
system("pause");
return 0;
}
//cái này viết bằng C++ em nhé
Explanation:
Answer:
I think it is the last one. Or first. Try first though.
Explanation:
Have a Great Day.
Answer: a replay attack, a replay attack is used so that the attacker can go sniff out the hash, and get whatever they are trying to get, then once it goes to the attacker it will go back to the original connection after replaying the hash
Answer:
a) AL will contains 0011 1100
Explanation:
In assembly language, shifting bits in registers is a common and important practice. One of the shifting operations is the SHR AL, x where the x specifies that the bits be shifted to the right by x places.
SHR AL, 2 therefore means that the bits contained in the AL should be shifted to the right by two (2) places.
For example, if the AL contains binary 1000 1111, the SHR AL, 2 operation will cause the following to happen
Original bit => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
Shift once to the right => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | (0) |
Shift once to the right => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | (0) | (0) |
Notice;
(i) that there are two shifts - one at a time.
(ii) that the bits in bold face are the bits in the AL after the shift. Those that in regular face are those in the carry flag.
(iii) that the new bits added to the AL after a shift are the ones in bracket. They are always set to 0.
