 Related Questions Find missing numbers in an unsorted sequence of 100 million positive integers with a memory of 64mb ram. Latest Answer : in java.util.Arrays there is some overloaded sort methods. ... Read Answers (1) | Asked by : nivo Unary numeric promotion is applied in the following contexts:1.operand of the unary arithmetic operators + and -2.operand of the unary integer bitwise complement operator ~ 3.during array creation; for Binary numeric promotion is applied in the following contexts:1.operands of the arithmetic operators *, /, %, +, and - 2.operands of the relational operators = 3.operands of the numerical equality operators nonassosiative. The shift distance is calculated by AND-ing the value of the right-hand operand with a mask value of 0x1f (31) if the left-hand has the promoted type int, or using a mask value of 0x3f (63) if the left-hand Latest Answer : we can add 2 numbers using xor operator but it will not handle carry therefore, we first use and operator on those 2 numbers n den take a xor of dem ...shift d res of and by 1 bit and den wil xor again the res of shift with d prev xor res....until ... Read Answers (1) | Asked by : TANUGULA PRADEEP KUMAR How to add two numbers without using arithmetic operators? Latest Answer : int firstnumber = 1int secondno =2for(int count =0;count
Sponsored Links
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
