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

Pseudocode for this Python code (I wrote one but it does not match): import random def rollDice(): num1 = random.randint(1, 6) num2 = random.randint(1, 6) return num1, num2 def determine_win_or_lose(num1, num2): total = num1 + num2 print(f"You rolled {num1} + {num2} = {total}") if total == 2 or total == 3 or total == 12: return 0 elif total == 7 or total == 11: return 1 else: print(f"Point is {total}") return determinePointValueResult(total) def determinePointValueResult(pointValue): total = 0 result = -1 while total != 7 and total != pointValue: num1, num2 = rollDice() total = num1 + num2 print(f"You rolled {num1} + {num2} = {total}") if total == pointValue: result = 1 elif total == 7: result = 0 return result def main(): n = int(input("Enter the number of games to play: ")) i = 0 winCounter = 0 loseCounter = 0 while i < n: num1,…
def findOccurrences(s, ch): lst = [] for i in range(0, len(s)): if a==s[i]: lst.append(i) return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n): word = input("welcome!") guesses = '' turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word): secrete_word = "-" * len(word) print(" the secrete word " + secrete_word) user_input = input("Guess a letter: ") if user_input in word: occurences = findOccurrences(word, user_input) for index in occurences: secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:] print(secrete_word) else: user_input = input("Sorry that letter was not found, please try again: ") def findOccurrences(s, ch): return [i for i, letter in enumerate(s) if letter == ch] *** enumerate not discussed in…
strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Find all strobogrammatic numbers that are of length = n. For example, Given n = 2, return ["11","69","88","96"]. def gen_strobogrammatic(n): Given n, generate all strobogrammatic numbers of length n. :type n: int :rtype: List[str] return helper(n, n) def helper(n, length): if n == 0: return [™"] if n == 1: return ["1", "0", "8"] middles = helper(n-2, length) result = [] for middle in middles: if n != length: result.append("0" + middle + "0") result.append("8" + middle + "8") result.append("1" + middle + "1") result.append("9" + middle + "6") result.append("6" + middle + "9") return result def strobogrammatic_in_range(low, high): :type low: str :type high: str :rtype: int res = count = 0 low_len = len(low) high_len = len(high) for i in range(low_len, high_len + 1): res.extend(helper2(i, i)) for perm in res: if len(perm) == low_len and int(perm) int(high): continue count += 1 return…
public static int test(int n, int k) { if (k == 0 || k == n) { return 1; } else if (k>n) { return 0; } else { return test(n-1, k-1) + test(n-1, k); } ww For each of the following calls, indicate the output that is produ test(7,5); test(6,4); test(4,5); test(8,3); test(5,5);
The following code contains a bug (python): def isPrime(n) : if n <= 2 : return False for i in range(2, n) : if n % i == 0 : return False return TrueWhich kind of testing is most likely to reveal the bug? a) No bug b) Black-box testing c) Glass-box testing
JAVA Language: Transpose Rotate. Question: Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string) import java.util.*; public class TestTranspose { public static void main(String[] args) { String plain = "this is the secret message"; // Here's the message Transpose transpose = new Transpose(); String secret = transpose.encrypt(plain); System.out.println("\n ********* Transpose Cipher Encryption *********"); System.out.println("PlainText: " + plain); // Display the results System.out.println("Encrypted: " + secret); System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt } } abstract class Cipher { public String encrypt(String s) { StringBuffer result = new…
a. for (int i = 0; true; i++) System.out.println (a[i]); b. for (int i = 0; true; i++) ; System.out.println (a[i]); c. for (int i = 0; i <= a.length; i++) System.out.println (a[i]); d. for (int i = 1; i <= a.length ; System.out.println (a[i-1]); 1) Which loop statement outputs the elements of array 'a'? 2/7 e. None of the above ... ...
Find the values of a, b, c and d needed to solve this puzzle int a = ? int b = ? int c = ? int d = ? char expect[128] = "There are 10 kinds of people in the world: those who understand binary and those who don't"; char actual[128] = {}; strcpy(actual,expect); int location1 = 5; int location2 = 17; ((int *)actual)[location1] = 0x58585858; ((int *)actual)[location2] = 0x59595959; *(((int *)actual) + a) = b; *(((int *)actual) + c) = d; if(strncmp(expect,actual,BUFSIZE) == 0){ return; } failure("Here are hints:\n- use two ints with 4 bytes to make the message right\n- beware of endian ordering angst\n");
int sum, k, i, j; int x[4] [4]={1,2,3,4}, {5,6,7,8},{9,8,7,3},{2, 1,7,1}; sum=x[0] [0]; for (k=1; k<=3;k++) sum+=x[k] [k]; Give the value in sum after the statements are executed:
In Java: Forms often allow a user to enter an integer. Write a program that takes in a string representing an integer as input, and outputs yes if every character is a digit 0-9. Ex: If the input is: 1995 the output is: yes Ex: If the input is: 42,000 or 1995! the output is: no Hint: Use a loop and the Character.isDigit() function.
def bigoh2(n: int) -> int: res = 0 for i in range(n): for j in range(i, n // 2): res += (i * j) return res