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
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer:
B) wireless local area network (WLAN)
Explanation:
WLAN which fully meaning is WIRELESS LOCAL AREA NETWORK is a network provider that enables two or more mobile phone user , desktop or computer user to connect and have access to the internet by simply connecting to the local area wireless network and this type of wireless network are more cheaper to install.
Example of where WIRELESS LOCAL AREA NETWORK can be found are : School building, Office building, School campus, home, among others.
