PSEUDOCODE:
1. DECLARE number: INTEGER
2. DECLARE multiple: INTEGER
3. INPUT number
4. FOR counter FROM 1 TO 10 DO
5. multiple <-- number * counter
6. PRINT number, " * ", counter, " = ", multiple
7. ENDFOR
<em>1. declaring a variable "number" as an Integer</em>
<em>2. declaring a variable "multiple" as an Integer</em>
<em>3. The user inputs the value of number</em>
<em>4. FOR loop where variable "counter" increments by 1 after every iteration</em>
<em>5. sets the value for variable "multiple" as the value of number * counter</em>
<em>6. prints out for example "3 * 1 = 3" and will continue till counter reaches 10</em>
<em>7. Ends the for loop</em>
FLOWCHART below
hope it helped
<span>In certain cases, when the Swen executable is removed or renamed by an anti virus program without stopping to fix the registry, it then will become impossible to run any executable files on the machine. This happens because windows will be unable to find the file that is associated with any executables on it's hard drive.</span>
Answer:
1000/125 billion instructions per second.
Explanation:
All the stages take 125ps and latch time was outlooked.
The clock speed would be the highest stage time in all 5 stages. Here all are same clock speed it would be 125ps only.
throughput = 1/cycle time so ⇒ 1/125 instructions/ps
Since we want it in billion instructions per second so we have to multiply with 10⁻⁹ /10⁻¹² then the result is 1000/125 billion instructions per second.
You can try downloading some kind of computer cleaner like CleanMyMac X free version, also definitely restart your computer if you haven't done so already.
Answer:
The complete method is as follows:
public List buildList(List L)
{
L.insert(30);
L.insert(23);
L.insert(19);
L.insert(4);
return L;
}
Explanation:
To complete the method, we make use of the insert() function.
This inserts elements of the list into list L. However, we have to start from the last element (i.e. in descending order)
So, the explanation is as follows:
L.insert(30); --- This inserts the last element
Continue inserting in descending order
<em> L.insert(23); </em>
<em> L.insert(19);
</em>
Until the first list element is inserted
L.insert(4);
This returns the filled list L
return L;
