# Exercise 1. Implement the algorithm covered in lectures that determines if an integer n is prime. Your function should return True, if n is prime, and False otherwise. Your algorithm has to be effective for n ~ 1,000,000,000,000. def isPrime(n):
Q: A palindrome is any word, phrase, or sentence that reads the same forward and backward. Here are…
A: A palindrome reads the same, when read straight or in reverse. A palindrome may be a single word or…
Q: PLEASE HELP ME ON THE NESTED LOOPING FUNCTION ON THE LAST... WHERE IN (When done, ask user to repeat…
A: We have given a C code. We need to remove the errors from the code and make it work. There were four…
Q: How can I apply this python code in the problem? def createList(n): #Base Case/s #TODO: Add…
A: List = []print("Initial blank List: ")print(List) # Addition of Elements# in the…
Q: Euclid’s algorithm (or the Euclidean algorithm) is an algorithm that computes the greatest common…
A: Solution:
Q: Ridbit begins with an integer n. In one action, he can perform one of the accompanying tasks:…
A: Here have to determine about the Subtract or Divide programming problem statement.
Q: (Recursive Thinking) Carefully read the comment of the following function, then complete the…
A: root flash directory Creating WORD, FORT and WORT
Q: 1. Modify the recursive Fibonacci program given in the chapter so that it prints tracing…
A: count3 = 0def recFib(n): global count3 if n == 3: count3 += 1 print(f"Computing fib({n})") if n…
Q: Remove the left recursion from the productions: E →E+T|E- T|T T→T* F|T/F | F
A:
Q: implement two recursive versions of the linear search that gets an array of songs and a title and…
A: NOTE Below is the answer for the given question. Hope you understand it well. If you have any…
Q: Write a Python function that returns the nth Fibonacci number, where n is an integer passed as a…
A: Python program to generate the nth Fibonacci number. In the Fibonacci series, the next number is the…
Q: The sieve of Eratosthenes is a way of computing all the prime numbers below a certain number. (A…
A: Step 1 The code is given in the below step
Q: The following function f uses recursion: def f(n): if n 0 a <- a + i + (i-1) return a c) def…
A: Given: The following function f uses recursion:def f(n):if n <= 1return nelsereturn f(n-1) +…
Q: def sum_even(n): total = 0 for i in range(2, n+1, 2): total += i return total def min(t): m = 0 for…
A: Q: Code the given program to recursive functions
Q: Using recursion, write a Python function def countOdds(A) which which takes an array of integers A…
A: Algorithm: Start Read list elements Implement countOdds() method which takes a list 'A' as argument…
Q: Pointers, modified) by Catherine Arellano We have a new game show that pits three people against…
A:
Q: Euclid's algorithm (or the Euclidean algorithm) is an algorithm that computes the greatest common…
A:
Q: d. Write a function Encode as follows: • // Return M^e mod PQ • int Encode (int M, int e, int PQ);…
A: RSA is a public key encryption algorithm used for secure data transmission. The key generation in…
Q: Question 19. The following function f uses recursion: def f(n): if n <- 1 return n else return…
A: GIVEN: The recursive function given is the program to find the Fibonacci series. CODE: def f(n):…
Q: these two codes and then answer these questions please: 1) Empirically, show the performance curve…
A: It is defined as a general purpose, case-sensitive, free-form programming language that supports…
Q: python language. Instructions are given within the quotations. def is_word_from_letters(word,…
A: 1. Convert "letters" to a list of letters2. For every letter in the word, 1. If the letter is in…
Q: In JavaScript use recursion to find the sum of all pages in the following: function…
A: The javascript code has been written for the given function and succesfully runs, please refer step2
Q: Given the following array as an example: int A[10]= {10,3,2,1,6,5,7,8,9,1}; A. Write a recursive…
A: A) Code: #include <stdio.h>int fun(int num[],int m,int n); int main() { int num[] =…
Q: Complete the following recursive function that returns the sum of all the numbers in a list that are…
A: The required code that will replace the bold text is: ((positive? positiveEvenNums) and (even?…
Q: 4. CodeW. X b For fun X Solved x b Answer x+ Ohttps://codeworko... CodeWorkout X264: Recursion…
A: Actually, python is a easiest programming language. It is a dynamically typed programming language.…
Q: The following function f uses recursion: def f(n): if n 0 a <- a + i + (i-1) return a c) def f(n):…
A: The Fibonacci sequence is a series of numbers where a number is the addition of the last two…
Q: Using recursion, write a function: def isIn(self, d) that returns True if d is in the list (the one…
A: Solution: Given,
Q: 10) Write a recursive algorithm to find the k-th even natural number (note: the first natural even…
A: I give the code in Python along with algorithm,code screenshot and output screenshot
Q: Implement the recursive function int equal_pairs(int a[], int size). This function returns true if…
A: Answer:- i) Recursive function for the equal pairs : Approach :- Here the idea is to use a 2…
Q: 5. Convert the following recursive functions into iterative functions. def max(k, n): if k == []:…
A: Here we have given 2 functions, max() and sum_odd(). The function max() returns the largest value…
Q: T/F 6. Consider the following recursive sum method: public int sum(int x) { if (x == 0) return 0;…
A: Program: #include <iostream>using namespace std;int sum(int x){if (x == 0) return 0;else…
Q: The sieve of Eratosthenes is a way of computing all the prime numbers below a certain number. (A…
A: Here I written python code as per problem says with two function program. I hope you like it.
Q: X173: array220 Given an array of int s, compute recursively if the array contains somewhere a value…
A: Here I have created a function named array220(). In this function, I have used conditional…
Q: Create a program that uses recursion to guess a number that a user selects. (try to mimic how a…
A: Below is the required python program: - Approach: - Importing the module random to use randint…
Q: How to solve the problem by FOLLOWING this python code format? def createList(n): #Base Case/s…
A: The code is already given above. Problem: Using PYTHON, create and implement a recursive function…
Q: The Fibonacci algorithm is a famous mathematical function that allows us to create a sequence of…
A: In the below step I have pasted the code and commented it please go through it.
Q: The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the…
A: here in this question we have asked to write a program in python which find the sequence no of…
Q: The sieve of Eratosthenes is a way of computing all the prime numbers below a certain number. (A…
A: both program is given below:-
Q: Write a function that will calculate the sum of all the numbers multiple of 3 from N down to 1 using…
A: C Program: #include <stdio.h> int computeTotal(int n){ // Declare variable sum and…
Q: The following function f uses recursion: def f(n): if n 0 a <- a + i + (i-1) return a c) def f(n):…
A: The given recursive function calculates nth fibonacci number. Option a would have been correct if…
Q: Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for…
A: Coded using Python 3.
Q: Part B: What will be the output of the following recursive function? Also show the steps involved in…
A: Code: #include <iostream>using namespace std;//recursive functionunsigned Rec(unsigned…
Q: How can I apply this python code? def createList(n): #Base Case/s #TODO: Add conditions…
A: The idea to solve this problem is to iterate the val from start to end using a for loop and for…
Q: 14) What does the following recursive method determine? public boolean question16(int[ ]a, int[ ] b,…
A: Given that, What does the following recursive method determine?public boolean question16(int[ ]a,…
Q: xou :/IX Given a string, compute recursively a new string where all the 'x' chars have been removed.…
A:
Q: from a fishing excursion. The I-th angler has gotten a fish of weight man-made intelligence.…
A: Here have to determine about the Emotional Fishermen programming problem statement.
Q: the size of the state space
A: State Space: The Size of the state space determines the space for all possible states or solutions…
Q: Write an algorithm for a program that determines all composite numbers between 1 and 20
A: In order to find all the composites between 1 and 20, the following steps are performed : Using…
Q: Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for…
A: Actually, python is a easiest programming language. It is a dynamically typed programming language.
# Exercise 1. Implement the
def isPrime(n):
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
- Need help in python. Problem: 2D random walk. A two dimensional random walk simulates the behavior of a particle moving in a grid of points. At each step, the random walker moves north, south, east, or west with probability 1/4, independently of previous moves. Compose a program that takes a command-line argument n and estimates how long it will take a random walker to hit the boundary of a 2n+1-by-2n+1 square centered at the starting point. //Given codeImport stdioImport randomImport sysn = int(sys.argv[1])//write code herestdio.write('The walker took ')stdio.write(c)stdio.writeln(' steps')le.com/forms/d/e/1FAlpQLSc6PlhZGOLJ4LOHo5cCGEf9HDChfQ-tT1bES-BKgkKu44eEnw/formResponse The following iterative sequence is defined for the set of positive integers: Sn/2 3n +1 ifn is odd if n is even Un = Using the rule above and starting with 13, we generate the following sequence: 13 u13 = 40 u40 =20 u20 = 10→ u10 =5 u5 = 16 u16 = 8 ug = 4 → Us =2 u2 =1. It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. The below function takes as input an integer n and returns the number of terms generated by the sequence starting at n. function i-Seq (n) u=n; i=%3; while u =1 if statement 1 u=u/2; else statement 2 end i=i+1; end statement 1 and statement 2 should be replaced by: None of the choices statement 1 is "mod(u,2)=D%3D0" and statement 2 is "u = 3*u+1;" statement 1 is "u%2" and statement 2 is "u = 3*u+1;" O statement 1 is "mod(n,2)=30" and statement 2 is "u = 3*n+1;"Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.
- 1. Design an algorithm to find the weighted sum of four test scores (https://en.wikipedia.org/wiki/Weight_function). Assume that the weights have been accurately calculated in advance such that their sum equals one. Your algorithm must-read in the four test scores and four corresponding weights in the following order: score1 weight1 score2 weight2 score3 weight3 score4 weight4 Write your algorithm such that it can be run with any set of data values. However, you can test your algorithm on the following sample data to verify that the result is 70: 90 0.10 80 0.20 70 0.30 60 0.40 2. Write an algorithm that prompts the user for the radius, in inches, and price of a pizza, and then reads in those values. Finally, have the algorithm compute and output the pizza’s cost per square inch. 3. Sports exercise advisor algorithm. In this algorithm you will start out with a temperature value in Celsius, so you do not need to ask the user for it. First, convert the temperature to Fahrenheit.…1. a) Given a recursive algorithm as below: int F(int n) { if (n <= 1) return 1; else if (n % 2 == 0) return F(n-1) + n; else return F(n/2) - 1; } Illustrate how you will find out the value of F(10) using the above algorithm. You need to show all the steps. b) Given a function as below: int recFx(int a, int b) { If (a < b) return a +b; else return recFx(a - b, b + 1); } Determine the values of: recFx(-10, 8) recFx(148, 78) (11) Must show all the steps.Q3: Interplanetary Spaceflight Milan Tusk is the richest person in the universe. After devoting decades of his life to further our space exploration technologies, he’s finally ready to retire. Being a space enthusiast, the first thing he wants to do is visit n planets p1, p2, …, pn, in this order. He’s currently on planet p0. Milan knows that the distance between planets pi and pi + 1 (for 0 ≤ i < n) is d[i]light years. His spaceship uses 1 tonne of fossil fuels per light year. He starts with a full tank and can fill up his tank at any of the n planets (but he must not run out in between two planets). There’s a huge cost to set up the spaceship for refuelling. Due to financial constraints (he’s not THAT rich), he can fill up his tank at most ktimes. In order to save money and make his spaceship lighter, Milan is looking for the smallest possible fuel tank that enables him to complete his space travel and reach planet pn. What is the smallest tank capacity that enables him to do so?…
- * Euclid's algorithm (or the Euclidean algorithm) is an algorithm that computes the greatest common divisor, denoted by gcd, of two integers. Below are the original version of Euclid's algorithm that uses repeated subtraction and another one that uses the remainder. int gcd sub (a,b) int gcd rem(a,b) int a,b; int a,b; { { if (!a) int t; return b; while (b) while (b) { if (a > b) = b; a = a - b; b = a % b; else a t; b = b - a; } return a; return a; } } 1. Trace each of the above algorithm using these values: a=24 and b = 18. Show your work 2. Compare both algorithms. That is, which one is better and why? Show your work.K + edgenuity.com/player/ s Semester A 7 1 2 3 4 5 05 return 1 else: return n* factorial(n-1) Which line of code includes a recursive function call? 0 3 04 01 Consider the Python code for finding the factorial of an integer n using recursion. Line numbers have been added to the left of each line of code. def factorial(n): if n == 1: Mark this and return c C O M 31 0 DELL O FIXIXI A Save and Exit G < Next English Sign out V 4 19 Kinley Heat TIME REMAINING 59:14 Submit Mar 27 0 2:38CodeW For fun X C Solved https://codeworkou... 臺亂 CodeWorkout X272: Recursion Programming Exercise: Is Reverse For function isReverse, write the two missing base case conditions. Given two strings, this function returns true if the two strings are identical, but are in reverse order. Otherwise it returns false. For example, if the inputs are "tac" and "cat", then the function should return true. Examples: isReverse("tac", "cat") -> true Your Answer: 1 public boolean isReverse(String s1, String s2) { 2. if > 3. 4. else if > return true; return false; 5. 6. else { String s1first = String s2last return s1first.equals (s2last) && 51. substring(0, 1); s2, substring(s2.length() 1); 7. 8. 6. isReverse(s1.substring(1), s2.substring(0, s2.length() 1)); { 12} 1:11AM 50°F Clear 12/4/2021
- Let A = {a, b, c} and B = {u, v}. Write a. A × B b. B × Ause JAVA to write the code. : Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbers The algorithm: given two numbers, n1 and n2: Divide n1 by n2 and let r be the remainder. If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.) Set n1 to the value of n2, set n2 to the value of r, and go back to step 1. Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad. Catch this problem as it happens and make the user enter another value until they enter an acceptable one. Give an appropriate error message if this happens.(b) The Fibonacci numbers for n 0, 1,...are defined as follows. fib (0)-0 fib (1) 1: fib (n) fib (n- 1) + fib (n - 2): Consider the following piece of code that calculates the Fibonacci numbers. int fib ( int n){ if (n is 0) return 0 else if (n is 1) return 1 else return fib (n- 1)+ fib (n- 2) What is the worst-case complexity of the above code?