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
Answer:
Boundary folding method is basically used in the java algorithm and in the hash table. In the hash function, the left and the right value are basically folded in the fixed boundary between the given center values by using the boundary folding methods.
There are basically two types of folding method in the hashing that are:
- Folding shift
- Folding boundary
In the folding boundary method the outside value are get reversed and the alternate values are get flipped at the boundary folding method.
Wiki is the correct answer
Home is the answer. Hope this helps. :)
