COMPLETE QUESTION
I. public class Test {
public static void main(String[] args){
System.out.println("Welcome to Java!");
}
}
II. public class Test { public static void main(String[] args) {System.out.println("Welcome to Java!");}}
Answer:
Both codes will compile and run and display Welcome to Java, but the code in II has a better style than I
Explanation:
When written codes, paying attention to proper coding styles and efficient memory management enables us to create programs that are highly efficient, coding styles refer to proper indentions and avoiding too lenghty lines of code (as is in code I), adding approprite comments etc.
Answer:
Center Processing Unit ....
Answer:
-3874₁₀ = 1111 1111 1111 1111 1111 1111 1101 1110₂
Explanation:
2's complement is a way for us to represent negative numbers in binary.
To get 2's complement:
1. Invert all the bits
2. Add 1 to the inverted bits
Summary: 2's complement = -N = ~N + 1
1. Inverting the number
3874₁₀ = 1111 0010 0010₂
~3874₁₀ = 0000 1101 1101₂
2. Add 1 to your inverted bits
~3874₁₀ + 1 = 0000 1101 1101₂ + 1
= 0000 1101 1110₂
You can pad the most signigicant bits with 1's if you're planning on using more bits.
so,
12 bits 16 bits
0000 1101 1110₂ = 1111 0000 1101 1110₂
They asked for double word-length (a fancy term for 32-bits), so pad the left-most side with 1s' until you get a total of 32 bits.
32 bits
= 1111 1111 1111 1111 1111 1111 1101 1110
Answer:
A. Lookup
Explanation:
You would use the Lookup field to store a value from another table.
