Answer:
Please find the code in the attached file.
Output:
Please find the attached file.
Explanation:
In this code a "num" variable is declared that use while loop that check num value greater than equal to 0.
Inside the loop we input the "num" value from the user-end and use if the value is positive it will define a for loop that calculates the quotient value as integer part, and use the asterisks to print the value.
If input value is negative it print a message that is "Goodbye".
Please find the code link: https://onlinegdb.com/7MN5dYPch2
Answer:
Given that:
A= 40n^2
B = 2n^3
By given scenario:
40n^2=2n^3
dividing both sides by 2
20n^2=n^3
dividing both sides by n^2 we get
20 = n
Now putting n=20 in algorithms A and B:
A=40n^2
= 40 (20)^2
= 40 * (400)
A= 16000
B= 2n^3
= 2 (20)^3
= 2(8000)
B= 16000
Now as A and B got same on n = 20, then as given:
n0 <20 for n =20
Let us take n0 = 19, it will prove A is better than B.
We can also match the respective graphs of algorithms of A and B to see which one leads and which one lags, before they cross at n= 20.
Answer:2.render 3.resolution 4.visual communication 5.rasterizing 6.nondestructive 7.stroke&fill 8.lines&path 9.pixels
Explanation:
Answer:
A hard drive
Explanation:
Since tablets and phones are compact, they are better off not having a big, giant, bulky storage device like hard drives. Modern computing made hard drives less important by developing Solid-State Drives (SSDs) and extremely dense (512 bit) storage that can provide the same if not more storage than a traditional hard drive at the fraction of the size.
