Debug the following program: 1- def factorial (n): if(n<0): 2 - 3 return 1 result!=n 0: result = result * n 6 n = n 7 return result 8 9 - for i in range(-1,5): 10 print('Factorial of',i,'is', factorial (i))
Q: Given the following program : sum = 0; for (i=0;i2;j--) sum=i+j; The value of sum after it is…
A: The value of sum is overriding its own value after each iteration, so the resultant value will be…
Q: Analyze the following expressions and predict the return output. No. Expression Return a) 8+ 12*2-4…
A: Ans : a) Expression: 8 + 12 * 2 - 4 return : 28 b) Expression: (4+17) % 2 - 1…
Q: the only method you are alowed to use is substitution method, a)t(n)=7t(n/8) + 2n is O(n)…
A: Substitution method : solves the given recurrence relation by repeatedly substituting the previous…
Q: When giving the user a set of choices to choose from, should numbers be used? E.g. 1, 2, 3? If so,…
A: Using numbers such as 1,2,3 to choose a set of choices make it more sense from user point of view.…
Q: he smallest positive integer which divides the expression (n+1)(n+2)(n+3)(n+4) is
A: The correct answer is given below:-
Q: in java Rewrite the following code using a for loop. long prod = 5; int x = 3; boolean valid =…
A: Firstly, we will rewrite above code to check using while loop what is the change. Thereafter , we…
Q: have There are N guarding posts on the Great Wall of China. However, not all the guards. We call a…
A: Include header files Define main method Declare variables Taking input for the number of posts…
Q: A positive whole number n > 2 is prime if no number between 2 and n (inclusive) evenly divides n…
A: Python program: from math import sqrt def prime(n): divisor = 2 found = False…
Q: Consider the following program: Fib[n] if(n==0) then return 0 else if(n==1) then return 1 else…
A: Given program: Fib[n] If(n==0) then return 0 else if(n==1) then return 1 else return…
Q: A factorial of N is defined as 1 if N is O or 1, and 1*2**N if N is a non-negative integer. Write a…
A: note:- only one program will be solved if they are not linked . Also mention programming language…
Q: int MyFunc(int n) int sum- 0: return 0; sum -n+ MyFunc(-n): return sum: what will be the result of :…
A: Data structure and algorithm in java output of the Function
Q: GIT> = 0|1|2|3 |4|5 |6|7|8|9|A |B|C Instead of writing 3*2, in this language you write *32 (which…
A: import java.util.Stack;public class PolishNotation { boolean flag=true; public float…
Q: 4. A taxicab number is a sum of the cubes of two numbers such that the smallest of them divides the…
A: Below are the algorithm and the C program to find the taxicab number with two integers: - Algorithm:…
Q: This code check whether a number is divisible by 5 and 11 or not. 1.. 2-.... 3-.. 4-. 1-lf ((n Mod 5…
A: As given, we need to find out the correct code that checks whether a number is divisible by 5 and 11…
Q: age, write a
A: #include<stdio.h> int main (void){ int array[] = {1,6,15,9}; int length = sizeof array /…
Q: A variable that accumulates the sum of several numbers is a(n)_____________
A: This fill in the blank question is related to programming.
Q: A factorial of N is defined as 1 if N is 0 or 1, and 1*2**N if N is a non-negative integer. Write a…
A: Since the language is not mentioned, we will use C programming by default. We will ask the user to…
Q: 4. A taxicab number is a sum of the cubes of two numbers such that the smallest of them divides the…
A: //include the required header file #include <iostream> using namespace std; //definition of…
Q: start No Yes End No Yes j<=N i=i+1 read N j=j+1 print i j<=k i=1,j=1,k=0 print \n k=k+i
A: 1) Read N 2) create variables i=1,j=1,k=0 3) check if j<=N If yes Put k=k+i…
Q: What is the value stored in y when the algorithm below is used on the input: 3, 2, 1, 0? proc noname…
A: The given code is a procedure in which an array of elements of size n. The array, consisting of 4…
Q: a. if (n == 0) {b = true; } else { b = false; } (Hint: What is the value of n == 0?) b. if (n == 0)…
A: Conditional operator : A conditional operator is a short form of if-else statement. It is also…
Q: A positive whole number n > 2 is prime if no number between 2 and n (inclusive) evenly divides n.…
A: import mathn=int(input("Enter n value: "))count=0for i in range(2,int(math.sqrt(n))): if n%i==0:…
Q: 2. The product of odd or even digit numbers Complete the given code so that the value of all odd or…
A: Please refer below for your reference: Language used is Kotlin: Completing the function myProd as…
Q: In this program you will ask the user for 4 integers that represent two fractions. First ask for…
A: 1. Declare variables to store numerator and denominator of all the three numbers. 2. Input Numerator…
Q: What is the value stored in y when the algorithm below is used on the input: 3, 2, 1, 0? proc noname…
A: The algorithm initializes an integer type array "noname" of "n" number of elements. For an input…
Q: Drag and drop to complete a program to find :the sum of the following series !n/1 . + !1/3 + !1/2 +…
A: here have to determine about correct sequence of code snippet.
Q: int Func (int n) { if (n 1) return 3; == printf("%d \n", n); int x = n * Func (n - 3); printf("%d…
A: Recursion is the process of repeating items in a self-similar way. In programming languages, if a…
Q: int mystery (int n) if (n < 1) return 0; else if (n % 2 == 0) return mystery(n-1): else return 1 +…
A: The function takes the integer n : returns 0 if n is less than or equal to 0 recursively calls the…
Q: Question #1. Product in the Range [N...M] Write a Program that reads a starting number (N) and…
A: // C# program to print the product // of all numbers in range N and M using System; class GFG{…
Q: sum = 0 i=0 j = 12 var1 = 3 var2 = 3 var3 = 0 while(i var3){ var1 =var1 - i; } else { var3 = var3+…
A: Assembly language: Assembly language is a low level programming language. It is used to directly…
Q: Implement the following Boolean expression. EQ = (AoO Bo) (A:O B1) (A2 © B2) (A3 O B3)
A: Given Boolean function is, EQ=(A0⊙B0)(A1⊙B1)(A2⊙B2)(A3⊙B3) X-NOR function gives output 1 if 2 inputs…
Q: , pi); you can use a Monte Carlo method to estimate the value of the real constant ππ. Buffon's…
A: Code: import java.util.*; class Main{ public static void precisionCompute(int x, int y, int n)…
Q: A prime number is called a Mersenne prime if it can be writtenin the form 2 p - 1 for some positive…
A: Since the programming language is not mentioned, assuming the programming language to be C language.
Q: For any integer n > 0, n! is defined as the product n * n - 1 * n - 2 ... * 2 * 1 0! is defined to…
A: NOTE: - The problem is solved in c language. EXPLANATION: - The header math.h is included to make…
Q: This sequence will never reach 1, and so the number 11 is called unhappy. Given a positive whole…
A: A happy number is defined as a number that is the sum of the squares of its digit will result in 1…
Q: What belongs in the XXX and YYY in the statement below in order to generate a random number between…
A: Random generator = new Random(); generator.nextInt(XXX) - YYY; nextInt() method in Random class will…
Q: Find the Big-Oh of the following. Explain your answer. 1- 1 for (int a : arra) ( 2 print (a); 5 for…
A: Big-oh notation is used to represent upper bound of an algorithm. It is denoted by O()
Q: Q3: Write C++ program to read a score of student and print the estimation to refer it. e.g: 100 - 90…
A: Code: #include<iostream>using namespace std;int main(){//declaring scoreint…
Q: Replace the following statements with a single statement that initializes sum to 0 at the time it is…
A: GIVEN: Replace the following statements with a single statement that initializes sum to 0 at the…
Q: trace the following code and give the output. for (int p= -1; abs (p) < 12; p *= 2) if (abs…
A: Implementable Program code: #include <iostream> using namespace std; //main method int…
Q: t funcB(int); t funcA(int n) { if (n 4) { return n funcA(n - 5); }else { return n- funcB(n - 1); t…
A: Here in this question we ha have given a code segment and we have asked to find the output of this…
Q: a) Prove the assignment segment given below to its pre-condition and post-condition using Hoare…
A: Summary: - Hence, we have discussed all the points.
Q: (Conversion from square meter to ping) Write a program that displays the following two tables side…
A: A loop is used to iterate through a block of code several times for different values. The different…
Q: Modify the program to also print the powers of 2 for 2^20 and 2^30. And label 2^10, 2^20, 2^30 as K,…
A: Code : #include <stdio.h> #include <math.h> //Main function int main() { int i=0,…
Q: end for for i1 to n do if B[i) == t then return TRUE end if end for return FALSE What is the…
A: In the worst case, the integer t (i.e search element) is the not present in both the cases. In that…
Q: int Func (int n) { if (n 1) return 3; printf("%d \n", n); int x = n * Func (n - 3); printf("%d \n",…
A: Code trace is an execution of code involving simulation by hand. The working of code can be…
Q: The factorial of a non-negative integer n, written as n!, is defined as follows: if n>1 if n = 0 (1…
A: program factorialimplicit none integer(kind = 16)::fact integer :: i,n print*,'Enter Number: '…
Q: Debug Program4:…
A: Answer: After debugging the program 4: error free code is as follows: #include <stdio.h>int…
Q: Ryuk the shinigami wants to find out the different ways to add up to N apples! For example, if you…
A: We have to find out different ways in which a number N can add up. We have to implement the code…
Q: There are N stairs, and a person standing at the bottom wants to reach the top. The person can climb…
A: Here we are given the number of stairs and we need to find the number of ways to reach the top, and…
Step by step
Solved in 3 steps with 1 images
- e11: Find the value of A for the following: A = (5 + 2* 3+ (( 3-2)* 7)+ -9) /2.In Python, grades_dict = {'Wally': [87,96,70], 'Eva': [100,87,90], 'Sam': [94,77,90], 'Katie': [100,81,82], 'Bob': [83,65,85]} Write your own describe function that produces the same 8 statistical results, for each one of the columns, that the built-in describe() function does. Note 1: Use the sample standard deviation formula (that is, the denominator is: N-1) Note 2: Your algorithm should work for any number of columns not just for 5 Note 3: You can use the np.percentile() for the 25% and 75% percentile as well as the sort() built-in functionsPython Test Program: import recursive_functionsimport mathdef main():# Test factorialprint('Testing factorial.')assert recursive_functions.factorial(0) == 1assert recursive_functions.factorial(1) == math.factorial(1)== 1assert recursive_functions.factorial(2) == math.factorial(2)== 2assert recursive_functions.factorial(5) == math.factorial(5)== 120assert recursive_functions.factorial(7) == math.factorial(7)== 5040print('All tests pass for `factorial` ()\n')# Test sum_recursivelyprint('Testing sum_recursively.')assert recursive_functions.sum_recursively(0) == 0assert recursive_functions.sum_recursively(1) ==sum(range(1+1)) == 1assert recursive_functions.sum_recursively(2) ==sum(range(2+1)) == 3assert recursive_functions.sum_recursively(10) ==sum(range(10+1)) == 55print('All tests pass for `sum_recursively` () ')# Test sumlist_recursively(l)print('Testing sumlist_recursively.')assert recursive_functions.sumlist_recursively([1,2,3])…
- In Python, grades_dict = {'Wally': [87,96,70], 'Eva': [100,87,90], 'Sam': [94,77,90], 'Katie': [100,81,82], 'Bob': [83, 65, 85]} write your own describe function that produces thesame 8 statistical results, for each one of the columns, that the built-in describe() function does.Note 1: Use the sample standard deviation formula (that is, the denominator is: N-1)Note 2: Your algorithm should work for any number of columns not just for 5Note 3: You can use the np.percentile() for the 25% and 75% percentile as well as the sort()built-in functionsBy default, which one of the following types of values will be thrown when the below function is executed?def abstractAdd(a,b,c):print(a+b+c) Choose an answer A None B bool C str D intzain IQ docs.google.com Q The general form of (Compound if) is: If (condition); {statmenet1; } else {statmenet1; } * true False Int mark [5]= { 3, 77, 40, 1233}; * true O False 7. The output of this program is(49): int main ( ){int a=4,sum; while (a<=10) {sum+=a; a+=1;}cout << "The Total = << sum ;} * true False
- 2- The factorial n! of a positive integer n is defined as n! = 1*2*3 . .. * (n-1) * n Where 0! = 1 Write a function to calculate the factorial of a number. Argument: A number n of type unsigned int. Returns: The factorial n! of type long double. Write two versions of the function, where the factorial is • calculated using a loop calculated recursively Test both functions by outputting the factorials of the numbers 0 to 20.# We have small bags of cement (10 kilograms each)# We have big bags of cement (50 kilograms each)# Return the number of each of the bags to use,# assuming we always use big bags before small bags.# Return -1 for each if it can't be done.## Oh, and there 4 errors in the main() function# Happy Debugging! import random def main():keep_going = "y" while keepgoing.upper() == "Y": small_bags = random.randint(5,20) big_bags = random.randint(1,5) goal = random.randint(60,350,10) small_used, big_used = make_cemont(small_bags, big_bags, gaol)if small_used == -1: print("Sorry, we can't reach", goal, "kilograms with", small_bags, "small bags and", big_bags, "big bags.")else: print("Goal", goal, "kilograms achieved!") print("Small bags:", small_used, "out of", small_bags) print(" Big bags:", big_used, "out of", big_bags) another_round = input("Try again (y/n)?: ")def make_cement(small_bags_supplied, big_bags_supplied,…Debug the following program: 1- def factorial (n): if(n<0): 2 - 3 return 1 4 - result!=n 0: 5 result = result * n 6 n = n - 1 7 return result 8 9 - for i in range(-1,5): 10 print('Factorial of',i,'is',factorial(i)) Run Run Tests Grade Should vou be testing for ineguality oniy?//Assignment 06 */public static void main[](String[] args) { String pass= "ICS 111"; System.out.printIn(valPassword(pass));} /* public static boolean valPassword(String password){ if(password.length() > 6) { if(checkPass(password) { return true; } else { return false; } }else System.out.print("Too small"); return false;} public static boolean checkPass (String password){ boolean hasNum=false; boolean hasCap = false; boolean hasLow = false; char c; for(int i = 0; i < password.length(); i++) { c = password.charAt(1); if(Character.isDigit(c)); { hasNum = true; } else if(Character.isUpperCase(c)) { hasCap = true; } else if(Character.isLowerCase(c)) { hasLow = true; } } return true; { return false; } }SEE MORE QUESTIONS