the answer is Java.util.scanner
<span>BCD only goes from digit 0 (0000) to digit 9 (1001), because for 10 you need two digits, so all you've got to do is make a function that produces high for numbers from 10 (1010) to 15 (1111) as follows:
A3 A2 A1 A0 F
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
...........................
1 0 0 0 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
Then simplify the function:
F = A3*A2 + A3*A1
Finally just draw or connect the circuit using NAND</span>
Answer:
Option a: a sorted array
Explanation:
Since the expectation on the data structure never need to add or delete items, a sorted array is the most desirable option. An array is known for its difficulty to modify the size (either by adding item or removing item). However, this disadvantage would no longer be a concern for this task. This is also the reason, linked list, binary search tree and queue is not a better option here although they offer much greater efficiency to add and remove item from collection.
On another hand, any existing items from the sorted array can be easily retrieved using address indexing and therefore the data query process can be very fast and efficient.
Answer:
(i) The rotation speed must stay the same.
(ii) The rotation speed must increase.
(iii) The rotation speed must decrease.
Explanation:
According to Equation
10.10, the angular speed must therefore vary as the laser–lens system moves
radially along the disc. In a typical CD player, the constant speed of the surface at
the point of the laser–lens system is 1.3 m/s.
Answer:

Explanation:
Given
Power at point A = 100W
Power at point B = 90W
Required
Determine the attenuation in decibels
Attenuation is calculated using the following formula

Where
t and
t


Substitute these values in the given formula




<em>(Approximated)</em>