In [3]: def isPerfect (x):***Returns whether or not the given number x is perfect.A number is said to be perfect if it is equal to the sum of all itsfactors (for obvious reasons the list of factors being considered doesnot include the number itself).Example: 6 = 3 + 2 + 1, hence 6 is perfect.Example: 28 is another example since 1 + 2 + 4 + 7 + 14 is 28.Note, the number 1 is not a perfect number.your code hereSum - 0for i in range(1, x)if(x1= 0):Sun - Sum + 1if (Sum X)Iprint(" td is a Perfect Number" 1x)print(" td is not a Perfect Number 1x)else:print (isPerfect (6))File "cipython-input-3-b9df3e539e48", line 15for i in range(1, x):IndentationError: unexpected indentIn [411 perfect numbers [6, 28, 496, 8128, 335503361for i in perfect_numbers:assert true (isPerfect (i), str(i) + is perfect')not_perfect_numbers [2, 3, 4, 5, 7, 8, 9, 10,495, 8127, 8129,335503351for i in not perfect_numbers:assert true (not (isPerfect (i)), str(i) is not perfect')#test existence of doestringassert true (len (isPerfect._doc_) > 1, "there is no docstring for isPerfect")print("Success!")

Indentation error occurs when there are extra spaces. for loop should start right below the sum…

In (3) def isPerfect (x) ***Returns whether or not the given number x is perfect. A number is said to be perfect if it is equal to the sum of all its factors (for obvious reasons the list of factors being considered does not include the number itself). Example: 63+2+1, hence 6 is perfect. Example: 20 is another example since 1+2 +4 + 7 + 14 in 28. Note, the number 1 is not a perfect number. *** your code here Sum - 0 for i in range(1, x) LE(0)1 Sun Bum + 1 if (Bum=-X) else! print(" td is a Perfect Number 1x) print(td is not a Perfect Number" 1x) print (isPerfect (6)) File "cipython-input-3-b9df3e539048", line 15 for i in range(1, x) IndentationError: unexpected indent In 1411 perfect numbers 16, 28, 496, 8126, 335503361 for i in perfect numbers: assert true (isPerfect (i), str(i)+ is perfect') not perfect numbers (2, 3, 4, 5, 7, 8, 9, 10, 495, 8127, 8129, 335503351 for i in not perfect numbers assert true (not (isPerfect (i)), str(i) is not perfect') test existence of doestring assert true(len (isPerfect._doc_) 1, "there is no docstring for isPerfect") print("Success!")

In (3) def isPerfect (x) Returns whether or not the given number x is perfect. A number is said to be perfect if it is equal to the sum of all its factors (for obvious reasons the list of factors being considered does not include the number itself). Example: 63+2+1, hence 6 is perfect. Example: 20 is another example since 1+2 +4 + 7 + 14 in 28. Note, the number 1 is not a perfect number. your code here Sum - 0 for i in range(1, x) LE(0)1 Sun Bum + 1 if (Bum=-X) else! print(" td is a Perfect Number 1x) print(td is not a Perfect Number" 1x) print (isPerfect (6)) File "cipython-input-3-b9df3e539048", line 15 for i in range(1, x) IndentationError: unexpected indent In 1411 perfect numbers 16, 28, 496, 8126, 335503361 for i in perfect numbers: assert true (isPerfect (i), str(i)+ is perfect') not perfect numbers (2, 3, 4, 5, 7, 8, 9, 10, 495, 8127, 8129, 335503351 for i in not perfect numbers assert true (not (isPerfect (i)), str(i) is not perfect') test existence of doestring assert true(len (isPerfect._doc_) 1, "there is no docstring for isPerfect") print("Success!")

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

mergeAndRemove(int[], int[]) This is a public static function that takes a int[] and int[] for the parameters and returns an int[]. Given two arrays of integers. Your job is to combine them into a single array and remove any duplicates, finally return the merged array.
java: Run length coding is a method to represent a string in a more compact manner. Each character that occurs more than 2 times in a row is represented by the character and a number following it. Two examples are: "abba" → "abba""abcccbbbba" → "abc3b4a"Write a function that calculates how many characters the encoded string is shorter than the original.
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?…
1. Divisors: In a class Divisors.java, read in a maximum integer n and use nested loops to print a list of divisors for each of 1 through n as shown in the following transcript. Sample transcript (input underlined): Largest integer? 100 1: 1 2: 1 2 3: 1 3 4: 1 2 4 95: 1 5 19 95 96: 1 2 3 4 6 8 12 16 24 32 48 96 97: 1 97 98: 1 2 7 14 49 98 99: 1 3 9 11 33 99 100: 1 2 4 5 10 20 25 50 100
Code in python: A certain company has encoded the accounts of its customers and requires that you provide an algorithm that, given an account code, informs if it is valid according to the following description: The account codes are made up of 4 digits counted from right to left, plus the verification digit. The verifying digit is obtained by adding the digits of the account number of the even positions and multiplying the digits of the odd positions, from the new result the residue of the division is extracted for 10, which represents the verifying digit. Develop the code in python as a check digit class that returns 1 if it is correct or 0 if not Heading: Extract digits, verifier calculation, Account verification, Integral algorithm
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 ?
Write in C++ Alice is trying to monitor how much time she spends studying per week. She going through her logs, and wants to figure out which week she studied the least, her total time spent studying, and her average time spent studying per week. To help Alice work towards this goal, write three functions: min(), total(), and average(). All three functions take two parameters: an array of doubles and the number of elements in the array. Then, they make the following computations: min() - returns the minimum value in the array sum() - returns the sum of all the values in the array average() - returns the average of all the values in the array You may assume that the array will be non-empty. Function specifications: Function 1: Finding the minimum hours studied Name: min() Parameters (Your function should accept these parameters IN THIS ORDER): arr double: The input array containing Alice's study hours per week arr_size int: The number of elements stored in the array Return Value:…
Find the body for: def contains_no_lowercase_vowels(phrase: str) -> bool: """Return True iff (if and only if) phrase does not contain any lowercase vowels. >>> contains_no_lowercase_vowels('syzygy') True >>> contains_no_lowercase_vowels('e') False >>> contains_no_lowercase_vowels('abc') False """
1- Let A = [2: 0.5: 4],and B=B(2:4). What are the value of a ,and B?
Let A = {a, b, c} and B = {u, v}. Write a. A × B b. B × A
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…
C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".