Answer:
All flags are On ( c, z , N )
Explanation:
Given data:
4-bit operation
Assuming 2's complement representation
<u>Determine status flags that are on after performing </u> 1010+0110
1 1
1 0 1 0
0 1 1 0
1 0 0 0 0
we will carry bit = 1 over
hence C = 1
given that: carry in = carry out there will be zero ( 0 ) overflow
hence V = 0
also Z = 1
But the most significant bit is N = 1
The Option D , Table Tools Insert
Answer:
Start
Input n, 2
Calculate if (n%2==0) then is divisible else not divisible
Output number is divisible or not
Stop
Explanation:
Not sure if your asking what certain application or the definition. But the definition: A security practice that blocks or restricts unauthorized applications from executing in ways that put data at risk.
Required: program to return the largest of three numbers.
pseudocode
input parameters, int A,B,C;
int T; // temporary storage
if (A>B) T=A;
else T=B;
if (T>C) print(T);
else print(C);
