Ex 5) This exercise uses sub-algorithms. Trace the algorithm when input value is 4 and complete the trace tables. Also note that there are two variables named num. One is in the main algorithm and another is the sub-algorithm. Write pre- post-conditions for each of these algorithms (the main one and the sub-algorithm). num output start num prime(num) start num flag d returned value 14-2 is num i+i+1 T prime()=true flag-true d2 flag=true and dsnum/2 num mod d = 0 flag false dd+1 end ret flag Note that you will have to implement several functions that require multiple inputs (e.g. 12, 2, -3, 6, -11, -3, 1, -1). In these cases, accept as input a comma delimited string (i.e. "12, 2, -3, 6, -11, -3, 1, -1"). Then, break the comma delimited string into a series of integers for processing with your algorithm. You may want to research the 'split' method for strings in Javascript to learn how to break a string apart into many pieces. G AFTER-JAR WORKS (THIS PART WILL NOT BE GRADED!
Ex 5) This exercise uses sub-algorithms. Trace the algorithm when input value is 4 and complete the trace tables. Also note that there are two variables named num. One is in the main algorithm and another is the sub-algorithm. Write pre- post-conditions for each of these algorithms (the main one and the sub-algorithm). num output start num prime(num) start num flag d returned value 14-2 is num i+i+1 T prime()=true flag-true d2 flag=true and dsnum/2 num mod d = 0 flag false dd+1 end ret flag Note that you will have to implement several functions that require multiple inputs (e.g. 12, 2, -3, 6, -11, -3, 1, -1). In these cases, accept as input a comma delimited string (i.e. "12, 2, -3, 6, -11, -3, 1, -1"). Then, break the comma delimited string into a series of integers for processing with your algorithm. You may want to research the 'split' method for strings in Javascript to learn how to break a string apart into many pieces. G AFTER-JAR WORKS (THIS PART WILL NOT BE GRADED!
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 18PE
Related questions
Question
Please help me with this question. I am not understanding what to do
Using html, css, and js make a js code for the flowchart below
Thank you
Transcribed Image Text:Ex 5) This exercise uses sub-algorithms. Trace the algorithm when input value is 4 and
complete the trace tables. Also note that there are two variables named num. One is in the
main algorithm and another is the sub-algorithm. Write pre- post-conditions for each of
these algorithms (the main one and the sub-algorithm).
num
output
start
num
prime(num)
start
num
flag d
returned value
14-2
is num
i+i+1
T
prime()=true
flag-true
d2
flag=true and
dsnum/2
num mod d = 0
flag false
dd+1
end
ret flag
Transcribed Image Text:Note that you will have to implement several functions that require multiple inputs (e.g. 12, 2, -3, 6,
-11, -3, 1, -1). In these cases, accept as input a comma delimited string (i.e. "12, 2, -3, 6, -11, -3, 1,
-1"). Then, break the comma delimited string into a series of integers for processing with your
algorithm. You may want to research the 'split' method for strings in Javascript to learn how to break
a string apart into many pieces.
G
AFTER-JAR WORKS (THIS PART WILL NOT BE GRADED!
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning