Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Devise an algorithm to scan an input array a of n elements, and output all prime numbers in the array that contain digit 7. For example, given array 27, 7, 13,17, 31, 37, where prime number are 7, 13, 17,31,37, the program should output 7, 17, 37. 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 6. You do not need to verify (e.g. by tracing) it though because you did it in Ex 6. You need to trace your main algorithm and the has7() algorithm. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Note that since the sub-program has7 is called several times, it's better that you use separate trace tables, one for each call. Hint, in has7(), you need a while loop. You may want to use a Boolean variable flag so that you can terminate the loop early as long as a 7 is detected. Flag can be initially true or false, depending on how you design the logic. For example, flag can be initially false, and one of the while conditions is that flag is false. When a 7 is detected, set flag to be true. This will terminate the loop. Finally return flag.

Devise an algorithm to scan an input array a of n elements, and output all prime numbers in the array that contain digit 7. For example, given array 27, 7, 13,17, 31, 37, where prime number are 7, 13, 17,31,37, the program should output 7, 17, 37. 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 6. You do not need to verify (e.g. by tracing) it though because you did it in Ex 6. You need to trace your main algorithm and the has7() algorithm. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Note that since the sub-program has7 is called several times, it's better that you use separate trace tables, one for each call. Hint, in has7(), you need a while loop. You may want to use a Boolean variable flag so that you can terminate the loop early as long as a 7 is detected. Flag can be initially true or false, depending on how you design the logic. For example, flag can be initially false, and one of the while conditions is that flag is false. When a 7 is detected, set flag to be true. This will terminate the loop. Finally return flag.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Devise an algorithm to scan an input array a of n elements, and output all prime numbers in the array that contain digit 7. For example, given array 27, 7, 13,17, 31, 37, where prime number are 7, 13, 17,31,37, the program should output 7, 17, 37. 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 6. You do not need to verify (e.g. by tracing) it though because you did it in Ex 6. You need to trace your main algorithm and the has7() algorithm. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Note that since the sub-program has7 is called several times, it's better that you use separate trace tables, one for each call. Hint, in has7(), you need a while loop. You may want to use a Boolean variable flag so that you can terminate the loop early as long as a 7 is detected. Flag can be initially true or false, depending on how you design the logic. For example, flag can be initially false, and one of the while conditions is that flag is false. When a 7 is detected, set flag to be true. This will terminate the loop. Finally return flag.
Transcribed Image Text:Devise an algorithm to scan an input array a of n elements, and output all prime numbers in the array that contain digit 7. For example, given array 27, 7, 13,17, 31, 37, where prime number are 7, 13, 17,31,37, the program should output 7, 17, 37. 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 6. You do not need to verify (e.g. by tracing) it though because you did it in Ex 6. You need to trace your main algorithm and the has7() algorithm. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Note that since the sub-program has7 is called several times, it's better that you use separate trace tables, one for each call. Hint, in has7(), you need a while loop. You may want to use a Boolean variable flag so that you can terminate the loop early as long as a 7 is detected. Flag can be initially true or false, depending on how you design the logic. For example, flag can be initially false, and one of the while conditions is that flag is false. When a 7 is detected, set flag to be true. This will terminate the loop. Finally return flag.
Devise an algorithm that scans a given array a of n elements, and get the sum of even values stored in the even position of the array. Assume the array index starts from 0 (so even position are index 0,2,4,6.. Trace your algorithm by assume the array is 3,1,6,4,8,12. In this case the sum is 6+8=14. You can see examples in slides to get started from there. The trace table here assume you use sum and i as variable. If you use other variables, change the trace table accordingly. Your image for this question should contain both the flowchart, trace table and pre-post conditions. a[0] 3 a[1] 1 a[2] 6 a[3] 4 a[4] 8 a[5] sum 12 i output
Transcribed Image Text:Devise an algorithm that scans a given array a of n elements, and get the sum of even values stored in the even position of the array. Assume the array index starts from 0 (so even position are index 0,2,4,6.. Trace your algorithm by assume the array is 3,1,6,4,8,12. In this case the sum is 6+8=14. You can see examples in slides to get started from there. The trace table here assume you use sum and i as variable. If you use other variables, change the trace table accordingly. Your image for this question should contain both the flowchart, trace table and pre-post conditions. a[0] 3 a[1] 1 a[2] 6 a[3] 4 a[4] 8 a[5] sum 12 i output
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

javascript, not java code

Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Arrays
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
SEE MORE TEXTBOOKS