Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Related questions
Concept explainers
Question
How to solve the problem by FOLLOWING this python code format?
def createList(n):
#Base Case/s
#TODO: Add conditions here for your base case/s
#if <condition> :
#return <value>
#Recursive Case/s
#TODO: Add conditions here for your recursive case/s
#else:
#return <operation and recursive call>
#remove the line after this once you've completed all the TODO for this function
return []
def removeMultiples(x, arr):
#Base Case/s
#TODO: Add conditions here for your base case/s
#if <condition> :
#return <value>
#Recursive Case/s
#TODO: Add conditions here for your recursive case/s
#else:
#return <operation and recursive call>
#remove the line after this once you've completed all the TODO for this function
return []
def Sieve_of_Eratosthenes(list):
#Base Case/s
if len(list) < 1 :
return list
#Recursive Case/s
else:
return [list[0]] + Sieve_of_Eratosthenes(removeMultiples(list[0], list[1:]))
if __name__ == "__main__":
n = int(input("Enter n: "))
print(n)
list = createList(n)
#Solution 1
primes = Sieve_of_Eratosthenes(list)
print(primes)
![You are to do a recursive implementation of the Sieve of Eratosthenes, an ancient algorithm
for finding all prime numbers up to a given limit, n, which we will let the user input.
We will be modifying this algorithm a bit. Instead of just marking the multiples of prime
numbers, we will directly remove them by creating our own helper
function, removeMultiples). This recursive function takes in a number, n, and a list and
returns a list that doesn't contain the multiples of n.
We will also create a recursive function, greateList), that takes in the user input n and returns an
array of integers from 2 through n (i.e. [2, 3, 4, ..., n]). You can use this list when testing
the removeMultiples() helper function above.
Our last recursive function is the SieveOfEratosthenes). This takes in a list and returns a list of
prime numbers from the input list. This function is already fully working in the given template to
make you focus more on implementing the first two. This is intended to serve as a guide on how to
create or manipulate arrays in a recursive manner.](https://content.bartleby.com/qna-images/question/5e4b46f5-fd0b-4b69-8fa1-4775c5e817f6/ace81c04-373f-48e8-91b9-dd3273bae168/1w2t4ot_processed.png)
Transcribed Image Text:You are to do a recursive implementation of the Sieve of Eratosthenes, an ancient algorithm
for finding all prime numbers up to a given limit, n, which we will let the user input.
We will be modifying this algorithm a bit. Instead of just marking the multiples of prime
numbers, we will directly remove them by creating our own helper
function, removeMultiples). This recursive function takes in a number, n, and a list and
returns a list that doesn't contain the multiples of n.
We will also create a recursive function, greateList), that takes in the user input n and returns an
array of integers from 2 through n (i.e. [2, 3, 4, ..., n]). You can use this list when testing
the removeMultiples() helper function above.
Our last recursive function is the SieveOfEratosthenes). This takes in a list and returns a list of
prime numbers from the input list. This function is already fully working in the given template to
make you focus more on implementing the first two. This is intended to serve as a guide on how to
create or manipulate arrays in a recursive manner.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps
Knowledge Booster
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
- Decrease-by-Constant-Factor Fake-Coin puzzle method in Java or C++ to find the fake coin out of n coins. Assume the false coin is lighter. Randomly place the false coin among the n coins. Submit results images and code files.arrow_forwardRecursive Power MethodWrite a method called powCal that uses recursion to raise a number to a power. The method should accept two arguments: The first argument is the exponent and the second argument is the number to be raised (example” powCal(10,2) means 210). Assume that the exponent is a nonnegative integer. Demonstrate the method in a program called Recursive (This means that you need to write a program that has at least two methods: main and powCal. The powCal method is where you implement the requirements above and the main method is where you make a method call to demonstrate how your powCal method work).arrow_forwarddef SomeMethod(a,b): a= a+b b=b+a print(a,b,end=" ") return (a+b) def main(): x=10 y=20 print(SomeMethod(x,y)) main() x and y are called: ? a and b are called: ?arrow_forward
- Count divisibles in range def count_divisibles_in_range(start, end, n): Let us take a breather by tackling a problem simple enough that its solution needs only a couple of conditional statements and some arithmetic, but not even one loop or anything even more fancy. The difficulty is coming up with the conditions that cover all possible cases of this problem exactly right, including all of the potentially tricksy edge and corner cases, without being off-by-one. Given three integers start, end and n so that start <= end, count how many integers between start and end, inclusive, are divisible by n. Sure, you could solve this problem with the list comprehension one-linerreturn len([x for x in range(start, end+1) if x % n == 0]) but of course the automated tester is designed so that anybody trying to solve this problem in such a blunt fashion will only find themselves running out of both time and space! Your code should have no loops at all, but use only integer arithmetic and…arrow_forwardPythonarrow_forwardFIX THE CODE PROVIDED BELOW Part 2 - Syntax Errors and Troubleshooting The code below has many syntax (and other) errors. Tasks:Compile the code and fix the errors one at a time. // Lab1a.java // This short class has several bugs for practice. // Authors: Carol Zander, Rob Nash, Clark Olson, you public class Lab1a { public static void main(String[] args) { compareNumbers(); calculateDist(); } publicstatic void compareNumbers() { int firstNum = 5; int secondNum; System.out.println( "Sum is: + firstNum + secondNum ); System.out.println( "Difference is: " + (firstNum - secondNum ); System.out.println( "Product is: " + firstNun * secondNum ); } public static void calculateDistance() { int velocity = 10; //miles-per-hour int time = 2, //hoursint distance = velocity * timeSystem.out.println( "Total distance is: " distanace); } } Part 3 - Print Statements and Simple Methods Use "print" and "println" statements, but use method calls to reduce the number of repeated "print"and "println"…arrow_forward
- A fractal pattern has the sequence {1, 10, 100, 1000, …}. The recursive formula is _________.arrow_forwardPlease solve this java problem and including the GUI to run it.arrow_forwardCompilation Techniques The program snippet is known as follows: a = 10; b = 1; c = 2; do { b = b + 1 while (b <= 10) { if (a%2==0) c = c + b; a = a + 1; } } while (c < = 30); Make a code generator for the above program fragment.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON 
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education