Ex 6) Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have a digit 7. For example, if n is 100, the program should output 7, 17, 37, 47, 67, 71, 73, 79, and 97. Your solution should have a main algorithm and two sub-algorithms, let's call them prime (num) and has 7 (num). You may reuse the prime sub-algorithm of Ex 5. You do not need to verify (e.g. by tracing) it though because you did it in Ex 5. You need to trace your has 7 algorithm. You should provide pre- and post-conditions for all your 3 (sub)algorithms.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
icon
Concept explainers
Question
100%

I want answer to ex6, and give me a flowchart that should look like the one given in ex5. Please give me visual flowchart and not a written one. Thank you.

Ex 5) This exercise uses sub-algorithms. Trace it for when input value is 6 and complete the trace tables. Also
note that there are two variables name num, one in the main algorithm and another in the sub-algorithm.
Write pre-post-conditions for each of these algorithms (the main one and the sub-algorithm).
num
į output
start
num
i←2
i←i + 1
i≤ num
prime(i) = true
T
end
F
prime(num)
start
flag ← true
d<2
flag = true and
d≤ num/2
T
num mod d = 0
flag ←false
d<d+1
F
F
num flag
d returned value
ret flag
Ex 6) Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n
and have a digit 7. For example, if n is 100, the program should output 7, 17, 37, 47, 67, 71, 73, 79, and 97.
Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and
has 7 (num). You may reuse the prime sub-algorithm of Ex 5. You do not need to verify (e.g. by tracing) it
though because you did it in Ex 5. You need to trace your has7 algorithm. You should provide pre- and
post-conditions for all your 3 (sub)algorithms.
Transcribed Image Text:Ex 5) This exercise uses sub-algorithms. Trace it for when input value is 6 and complete the trace tables. Also note that there are two variables name num, one in the main algorithm and another in the sub-algorithm. Write pre-post-conditions for each of these algorithms (the main one and the sub-algorithm). num į output start num i←2 i←i + 1 i≤ num prime(i) = true T end F prime(num) start flag ← true d<2 flag = true and d≤ num/2 T num mod d = 0 flag ←false d<d+1 F F num flag d returned value ret flag Ex 6) Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have a digit 7. For example, if n is 100, the program should output 7, 17, 37, 47, 67, 71, 73, 79, and 97. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has 7 (num). You may reuse the prime sub-algorithm of Ex 5. You do not need to verify (e.g. by tracing) it though because you did it in Ex 5. You need to trace your has7 algorithm. You should provide pre- and post-conditions for all your 3 (sub)algorithms.
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Control Structure
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education