3. Create an array with 100 elements. At every index in the array we store the value 1 if the number representing the index is prime and 0 if the value representing the index is not prime. For example if the array is called “Primes” then Primes[1]=1, Primes[7]=1, Primes[6]=0 etc. All we need to do is to use the input argument as an index for the array and return the value stored in the array at that index. This solution is very easy to implement but it wastes lots of memory and it scales very badly. Write a function called “isPrime” that takes as argument a number (with the decimal value between 0 and 99) stored in RO and returns value 1 if the number is prime and value 0 if the number if not prime. The return value is also stored in register RO.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

Can someone help solve this for me i would be thankfull

3. Create an array with 100 elements. At every index in the array we store the value 1 if
the number representing the index is prime and 0 if the value representing the index is
not prime. For example if the array is called “Primes” then Primes[1]=1, Primes[7]=1,
Primes[6]=0 etc. All we need to do is to use the input argument as an index for the
array and return the value stored in the array at that index. This solution is very easy
to implement but it wastes lots of memory and it scales very badly.
Transcribed Image Text:3. Create an array with 100 elements. At every index in the array we store the value 1 if the number representing the index is prime and 0 if the value representing the index is not prime. For example if the array is called “Primes” then Primes[1]=1, Primes[7]=1, Primes[6]=0 etc. All we need to do is to use the input argument as an index for the array and return the value stored in the array at that index. This solution is very easy to implement but it wastes lots of memory and it scales very badly.
Write a function called “isPrime” that takes as argument a number (with the decimal value
between 0 and 99) stored in RO and returns value 1 if the number is prime and value 0 if the
number if not prime. The return value is also stored in register RO.
Transcribed Image Text:Write a function called “isPrime” that takes as argument a number (with the decimal value between 0 and 99) stored in RO and returns value 1 if the number is prime and value 0 if the number if not prime. The return value is also stored in register RO.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 1 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY