def love(n): if(n 2): return False if(n == 2): return True s = int(n** (1/2)) for i in range (2, s+1): if n%1 == 0: return True def you (n): return false if(n <= 1): return 1 return n*you(n-1) a = int(input()) b = int(input()) if (not not love (b)): print (you (b)) What does this program do? Prints the factorial of b, if b is prime. Prints the nth power of b, if b is odd. Prints the nth power of b, if b is prime. O Prints the factorial of b, if b is odd. O None of the above

def love(n): if(n 2): return False if(n == 2): return True s = int(n** (1/2)) for i in range (2, s+1): if n%1 == 0: return True def you (n): return false if(n <= 1): return 1 return n*you(n-1) a = int(input()) b = int(input()) if (not not love (b)): print (you (b)) What does this program do? Prints the factorial of b, if b is prime. Prints the nth power of b, if b is odd. Prints the nth power of b, if b is prime. O Prints the factorial of b, if b is odd. O None of the above

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Using python, please explain 1: A positive integer greater than 1 is said to be prime if it has no divisors other than 1 and itself. A positive integer greater than 1 is composite if it is not prime. Write a program that asks the user to enter an integer greater than 1, then displays all of the prime numbers that are less than or equal to the number entered The program should work as follows: Once the user has entered a number, the program should populate a list with all of the integers from 2 up through the value entered. The program should then use a loop to step through the list. The loop should pass each element to a function that displays the element whether it is a prime number.
What will the final values of count1 and count2 be in terms of n? assume that n is a power of 2 of the form 2^r.
Correct code to output the following: 0 2 4 6 8 10 12 14 16 18 CODE: int[] numbers = new int[10]; for(int i=0; i < numbers.length; ++i) numbers[i] = i * 2; for(int i=0; i < numbers.length; i++) System.out.print(numbers[++i] + " "); System.out.println();
Find the errors in this code: double gpa[] = {2.2, 3.8, 4.0, 3.6, 1.7, 2.8}; int countSuper = 0; // number of students whose GPA >= 3.5 for (int count = 0; count < 6; count++){ if(gpa[count] >= 3.5){ System.out.print(”\n You are super!”); } countSuper++; } System.out.print(”\n Number of super students is: ”+ countSuper);
def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0: return hailstone(int(n/2)) else: return hailstone(int(3*n + 1))y=int(input("N: "))if y <= 0: print("N must be positive!")else: print("Hailstone sequences for 1 to " + str(y) + ":") m=0; i=1 for x in range(1, y+1): n = i h = [] h = hailstone(n) print(h) s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) If i don't one the output have the square braket? How can I fix this code? Can you pleasw help me?
II. Determine the big-O measure for each of the functions in the lower table. Choose from the various big-O measures in the upper table. A. O(1) G. O(Y) M. O(Y¹6) S. O(N log N) Y. O(W!) EE. O(X³Y) B. O(X) H. O(log Y) N. O(Z) T. O(N²) Z. O(67W) C. O(log X) I. O(Y log Y) O. 0(Z²) U. O(N²log N) AA. O(V) D. O(X log X) J. O(Y²) P. O(Z³) V. O(W³) BB. O(VV) E. O(X²) K. O(Y³) Q. O(log N) W. O(W⁹) CC. O(25¹) F. O(X³) L. O(Y¹5) R. O(N) X. O(9W) DD. O(XY)
def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0: return hailstone(int(n/2)) else: return hailstone(int(3*n + 1))y=int(input("N: "))if y <= 0: print("N must be positive!")else: print("Hailstone sequences for 1 to " + str(y) + ": ") m=0; i=1 for x in range(1, y+1): n = i h = [] h = hailstone(n) print(*h) print(",") s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) How can I fix this code if I want a comma between each number, not each line?