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

int n = 1; int k - 2; int r = n; if (k < n) { r - k
int funcB(int); int funcA(int n) { if (n 4) { return n* funcA(n - 5); } else { return n- funcB(n - 1); int main() { cout << funcA(13); return 0; What is the output of this program? Please show our work.
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 ) What if I still want the comma between each number. without any square brackets in frint and end.
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?
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?
// 9. Is It Prime? function isPrime(n) { if (n < 2 || n % 1 != 0) { return false; } for (let i if (n % i } return true; 2; i < n; ++i) { 0) return false; == }
Given int n = (7-9/(3+4)*2-6%3); The value of n is: O a. 5 O b. 7 O c. 6 Od. 4 e. None
#include | int main() { int n=5; for (int i=1;i
lower= int(input("lower range"))upper= int(input("upper range"))print("Odd numbers between 1 - 1000")def is_odd(n):if n%2!=0:return Trueelse:return Falsedef check_odds(i):for i in range(lower,upper+1):is_odd(i)print(i) I am trying to call is_odd function in check_odd to print odd numbers. please run this program to print correct output
a) FindMinIterative public int FindMin(int[] arr) { int x = arr[0]; for(int i = 1; i < arr.Length; i++) { if(arr[i]< x) x = arr[i]; } return x; } b) FindMinRecursive public int FindMin(int[] arr, int length) { if(length == 1) return arr[0]; return Math.Min(arr[length - 1], Find(arr, length - 1)); } What is the Big-O for this functions. Could you explain the recurisive more in details ?
True or False: Asymptotically analyze the expression below. n²(1 +sqrt(n)) = O(n² log n) O True O False
2. code locations Consider the following C code and the corresponding assembly code: void baz(int a, int * p) { pushq %rbp movq %rsp,%rbp subq $16,%rsp int c; C = a-*p; movl %ecx,16(%rbp) movq %rdx, 24(%rbp) movq 24(%rbp), %rax movl (%rax),%eax movl 16(%rbp),%edx subl %eax,%edx movl %edx,%eax movl %eax,-4(%rbp) cmpl $0, -4(%rbp) je L2 if (c) { int d = c*2; movl -4(%rbp),%eax addl %eax,%eax movl %eax,-8(%rbp) *p -= d; movl 24(%rbp),%rax movl (%rax),%eax subl -8(%rbp),%eax movl %eax,%edx movq 24(%rbp), %rax movl %edx, (%rax) jmp L4: (continued on next page)