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 5. For example, if nis 100, the program should output 5,53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. 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

Please help me with this question. I am having a hard time understanding what to do. Please complete the question in the image below. Include post and preconditions

Thank you 

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 5. For example, if nis 100, the program should output 5,53 and 59.
Your solution should have a main algorithm and two sub-algorithms, let's call them
prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15.
You should provide pre- and post-conditions for all your 3 (sub)algorithms.
Transcribed Image Text: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 5. For example, if nis 100, the program should output 5,53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms.
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 5. For example, if nis 100, the program should output 5,53 and 59.
Your solution should have a main algorithm and two sub-algorithms, let's call them
prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15.
You should provide pre- and post-conditions for all your 3 (sub)algorithms.
Transcribed Image Text: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 5. For example, if nis 100, the program should output 5,53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num)and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms.
Expert Solution
steps

Step by step

Solved in 6 steps with 36 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.
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