Code:
public static int[] reverse(int [] arr){
Int [] newArr = new int[arr.length];
for (int k = 0; k<arr.length;k++){
/*Missing statement */
}
return newArr;
Answer:
Replace the comment with:
newArr[k] = arr[arr.length-k];
Explanation:
Required
Complete the code
In the given code:
The first line of the given code defines the method
public static int[] reverse(int [] arr){
The next line declares array newArr withe same length as array arr
Int [] newArr = new int[arr.length];
The next line iterates through the elements of array arr
for (int k = 0; k<arr.length;k++){
The /* Missing statement */ is then replaced with:
newArr[k] = arr[arr.length-k];
The above statement gets the elements of array arr in reversed order.
This is so because, as the iteration iterates through array arr in ascending order, arr.length-k gets the element in reversed order
Write a program with total change amount as an integer input, and output the change using the fewest coins, one coin type per line. The coin types are Dollars, Quarters, Dimes, Nickels, and Pennies. Use singular and plural coin names as appropriate, like 1 Penny vs. 2 Pennies.
If input is 0 or less, output is 'No Change'
For Example: Input: 45
Output:
1 Quarter
2 Dimes
input_val = int(input())
if input_val <= 0:
print('No change')
else:
num_dollars == input_val // 100
input_val %= 100
num_quarters == input_val // 25
input_val %= 25
num_dimes == input_val // 10
input_val %= 10
num_nickels == input_val // 5
input_val %= 5
num_pennies == input_val
if num_dollars > 1:
print('%d dollars' % num_dollars)
elif num_dollars ==1:
print('%d dollar' % num_dollars)
if num_quarters > 1:
print('%d quarters' % num_quarters)
elif num_quarters ==1:
print('%d quarter' % num_quarters)
if num_dimes >1:
print('%d dimes' % num_dimes)
elif num_dimes ==1:
print('%d dime' % num_dimes)
if num_nickels >1:
print('%d nickels' % num_nickels)
elif num_nickels ==1:
print('%d nickel' % num_nickels)
if num_pennies >1:
print('%d pennies' % num_pennies)
elif num_pennies ==1:
print('%d penny' % num_pennies)
Answer:
b ,/knlk
Explanation:
-(-13) P binary using signed. 2's complement representation
Perform the arithmetic operations (+42) + (-13) and (-42)
negative .
Consider the balloon
Answer:
00011101
00011101
Explanation:
Given the following arithmetic operations
a) (+42) + (-13)
b) (-42) - (-13)
From (a):
We need to convert +42 into binary, so we get = 00101010
Now for +13, when it is converted into binary, we get = 00001101
But, here, the 13 is negative. So, here is what we will do, we will have to take the two compliment of the binary. After doing that, we get = 111110011
∴
+ 42 → 00101010
- 13 → 1 1 1 10011
+29 000 11101
Thus, the arithmetic operation after we use 2's complement is 00011101
b)
Here both 42 and 13 are negative. Using two complement representation
-42 is first converted to binary as 00101010, Then → 11010101 + 1 = 11010110
-13 is converted to binary as 00001101 → 11110010 = 11110011
In between, a negative sign exists, so we take another 2's complement.
i.e.
11110011 → 00001100 + 1 = 00001101
- 42 → 1 1 01 0110
+13 → 00001 101
-29 1 1 1 00011
since there is no carry, we take two's complements for the result as:
1 1 1 00011 →00011100 + 1 = 00011101
Question # 2 Multiple Choice The _____ method returns an integer between the two provided numbers. It can take the value of either of the provided numbers. seed randint random range
Answer:
randint
Explanation:
Answer:
randint
Explanation:
ed 2021