Free MCS-211 Solved Assignment | July 2025 | MCA_NEW, MCAOL | English & Hindi Medium | IGNOU
Question:-1(a) Design and develop an efficient algorithm to find the list of prime numbers in the range 501 to 2000. What is the complexity of this algorithm? Answer: 🔍 Sieve of Eratosthenes Algorithm for Primes (501 to 2000) 🧠 Step 1: Algorithm Design Create a boolean list is_prime[0..2000], initialize all entries as True. Mark is_prime[0] […]