Answer: design of the network
security for the network
documentation
identifying and fixing issues
Explanation: I just took the test
Answer:
Hi!
The following Javascript statement compares if num is 2 or 5 and increment num by 1 if true.
if ( num==2 || num==5)
num = num +1;
Explanation:
The operator == is used to compare if the operands are equal.
The operator || is OR.
- If at least one of the operands is true then return true.
- If all operands are false returns false.
if( num==2 || num==5)
<em> // if num is equal 2 or if num is equal 5</em>
num = num +1; <em>// adds 1 to num.</em>
Answer:
a. 2^6, or 64 opcodes.
b. 2^5, or 32 registers.
c. 2^16, or 0 to 65536.
d. -32768 to 32768.
Explanation:
a. Following that the opcode is 6 bits, it is generally known that the maximum number of opcodes should be 2^6, or 64 opcodes.
b. Now, since the size of the register field is 5 bits, we know that 2^5 registers can be accessed, or 32 registers.
c. Unsigned immediate operand applies to the plus/minus sign of the number. Since unsigned numbers are always positive, the range is from 0 to 2^16, or 0 to 65536.
d. Considering that the signed operands can be negative, they need a 16'th bit for the sign and 15 bits for the number. This means there are 2 * (2^15) numbers, or 2^16. However, the numbers range from -32768 to 32768.
Answer:
an information key that explains how information in a chart is represented by colors or patterns
Explanation:
This is the information that is used to explain the data in the graph.
Answer:
Merge sort
Explanation:
The various types of sorting algorithms are
1. Quick sort
2. Bubble sort
3. Selection sort
4. Insertion sort
5. Merge sort
6. Heapsort
The algorithm that performs best for an already sorted list is the insertion sort
While the algorithm that performs worse for an already sorted list is the merge sort since it divides the sorted list into sub list before it operations
