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:
//here is code in java.
import java.util.*;
class Solution
{
// main method of class
public static void main (String[] args) throws java.lang.Exception
{
try{
// declare an initialize first string variables
String st1="hello";
// declare an initialize first string variables
String st2="world";
// create another string variable
String st3;
// exchange the value of both string variables
st3=st1;
st1=st2;
st2=st3;
System.out.println("value of first String after exchange: "+st1);
System.out.println("value of second String after exchange: "+st2);
}catch(Exception ex){
return;}
}
}
Explanation:
declare and initialize two string variables.Create another string variable "st3". first assign value of "st1" to "st3" after then value of "st2" to "st1" and then assign value of "st3" to "st2". This will exchange the values of both the string.
Output:
value of first String after exchange: world
value of second String after exchange: hello
Answer:
2that is the question??? then many I could help
The answer will be A they would wanna know about her work history
Answer:
29
Explanation:
for n=28:
--------------
Algorithm 1 performs f(n) = n2 + n/2 = 28*28 + 28/2 = 798
Algorithm 2 performs f(n) = 12*28 + 500 = 836
for n=29
--------------
Algorithm 1 performs f(n) = n2 + n/2 = 29*29 + 29/2 = 855.5
Algorithm 2 performs f(n) = 12*29 + 500 = 848
so, for n=29, algorithm 2 will be faster than algorithm 1
