1 get input n 2 set a variable num = 1 3 if num <= _(1)_, goto step 4, otherwise go to step 11 4 set a variable factor = 1 5 if factor <= num goto step 6, otherwise goto _(2)- 6 if factor*factor == num, print "num is a perfect square" 7 if factor*factor*factor == num, print “num is a perfect cube" 8 if (3)_ and (4)_, goto step 10 9 increment factor: factor = factor+1, goto step 5 10 increment num: num = num+1, goto _(5)_ 11 terminate program

1 get input n 2 set a variable num = 1 3 if num <= _(1)_, goto step 4, otherwise go to step 11 4 set a variable factor = 1 5 if factor <= num goto step 6, otherwise goto _(2)- 6 if factorfactor == num, print "num is a perfect square" 7 if factorfactor*factor == num, print “num is a perfect cube" 8 if (3)_ and (4)_, goto step 10 9 increment factor: factor = factor+1, goto step 5 10 increment num: num = num+1, goto _(5)_ 11 terminate program

Principles of Information Systems (MindTap Course List)

12th Edition

ISBN:9781285867168

Author:Ralph Stair, George Reynolds

Publisher:Ralph Stair, George Reynolds

Chapter3: Hardware: Input, Processing, Output, And Storage Devices

Section: Chapter Questions

Problem 11SAT

See similar textbooks

Similar questions

The Famous Gauss You must know about Gauss, the famous mathematician. Back in late 1700’s, he was at elementary school. Gauss was asked to find the sum of the numbers from 1 to 100. The question was assigned as “busy work” by the teacher. He amazed his teacher with how quickly he found the sum of the integers from 1 to 100 to be 5050. Gauss recognized he had fifty pairs of numbers when he added the first and last number in the series, the second and second-last number in the series, and so on. For example:(1 + 100), (2 + 99), (3 + 98), ..., (50 + 51). Each pair has a sum of 101 and there are 50 pairs. History repeats itself. Jojo’s teacher assign a “busy work” to the students. The teacher believes that there will be no shortcut to finish this task in a minute. The teacher gives N integers A1, A2, ..., AN to the students. The teacher also gives Q questions. Each question contains two integers L and R asking the sum of all Ai where L <= Ai <= R. As a good friend of Jojo, help Jojo…
Computer Science Without performing the division find the remainder when integer X=631453672 is divided by 7.
Take the floor of a floating point number to the nearest tenth. It should work for any number, positive or negative (or zero). floor(3.14) → 3.1 floor(6.28) → 6.2 floor(-0.414) → -0.5
The n in n-gon means that the .4 .regular polygon having n sides True O False O
Overflows You have learned the concept of overflow (with say n! that overflows at 13! for integer) Now consider Fibonacci numbers this way: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, etc. A Fibonacci sequence f(n) is of the form: f(1) = f(2) = 1, and f(n+2) = f(n) + f(n+1) for n >= 1. 3. Write a Java computer program that prints out Fibonacci numbers in a certain data type from f(1) until f(n) with n an integer you input from the keyboard.| For short data type (signed of two bytes), the output looks like this way: Enter 1 to 6 for char, short, int, long, float, and double 2 Enter a number to find the Fibonacci series: 50 The Fibonacci series till 50 terms: Short Fibonnaci(1)= 1 Short Fibonnaci (2)= 1 Short Fibonnaci(36)= -11856 Short Fibonnaci(37)= -24967 Short Fibonnaci(38)= 28713 Short Fibonnaci(39)= 3746 Short Fibonnaci(40)= 32459 For int data type Enter 1 to 6 for char, short, int, long, float, and double Enter a number to find the Fibonacci series: 100 The Fibonacci series till…
1. P VI V2 V3 V4 V5 V6 V7 V8 V9 Using the matrix P from the Floyd's II algorithm V2 9 VI 0 0 9 0 09 0: 9 8 8 8 6 0 0 8 8 8 0 9 0 V3 5 5 0 9 5 0 0 9 V4 0 0 5 0 0 2 7 V6 9 0 9 0 0 9 1 0 8 8 V5 0 1 9 0 6 8 0 0 V7 9 9 9 V8 9 9 9 9 9 7 9 0 9 0 0 9 0 6 7 V9 5308OOS 3 0 Find the path from v4 to v that has the minimum cost:
LEGO Con vent the following numben to base 10 30 AF216
a. f1(n) is Ω(f6(n)) b. f5(n) is Q(f3(n)) c. f1(n) is O(f3(n)) d. f5(n) is O(f1(n)) e. f6(n) is Ω(f4(n))
Computer Science Having the following 9 bit number in binary format, divide the number into three color components to be suitable for rendering following the same method used in fractal rendering. N=(011010111) solving is related to Java 2d concepts, and image processes
If two numbers a and b are even, then their sum a + b is even.
Divide the binary numbers in the attached picture. Solution must be in binary.
In the following array, A(2,3,3) is equal to: 111 112 113 Page 1 211 212 213 Page 2 121 311 312 313 Page 3 221 131 321 322 323 231 331 332 333