1 hello = "Hello World" 2 noun "David" 3 numberof__friends = "2" name_of_friend = "Carly" 5 location = "la MC" time = "5:30 pm" 4. 7 8 print(hello) print("Im only as smart as", noun, "because I'm reading.") 10 print("There are only",numberof_friends, "friends available to eat with you today") print("why don't we call", name_of_friend, "today?") 12 print("If they bring their partner then we need a table for", name_of_friend*2) 13 print("We need to arrive at", location, "at what time?") 14 print("We have to be there at", time, "or else o'Brien will say i told you so") 9. 11

1 hello = "Hello World" 2 noun "David" 3 numberof__friends = "2" name_of_friend = "Carly" 5 location = "la MC" time = "5:30 pm" 4. 7 8 print(hello) print("Im only as smart as", noun, "because I'm reading.") 10 print("There are only",numberof_friends, "friends available to eat with you today") print("why don't we call", name_of_friend, "today?") 12 print("If they bring their partner then we need a table for", name_of_friend*2) 13 print("We need to arrive at", location, "at what time?") 14 print("We have to be there at", time, "or else o'Brien will say i told you so") 9. 11

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

var adventurersName = ["George", " Tim", " Sarah", " Mike", " Edward"];var adventurersKilled = 3;var survivors;var leader = "Captain Thomas King";var numberOfAdventurers = adventurersName.length; survivors = numberOfAdventurers - adventurersKilled; console.log("Welcome to The God Among Us\n");console.log("A group of adventurers began their search for the mystical god said to live among us. In charge of the squad was " + leader + " who was famous for his past exploits. Along the way, the group of comrades were attacked by the god's loyal followers. The adventurers fought with bravado and strength under the tutelage of "+ leader + " the followers were defeated but they still suffered great losses. After a headcount of the remaining squad, "+ adventurersKilled +" were found to be dead which left only " + survivors + " remaining survivors.\n"); console.log("Current Statistics :\n");console.log("Total Adventurers = " + numberOfAdventurers);console.log("Total Killed = " +…
def division_calculator(a, b): ''' Question 4 You are asked to write a small division calculator, where you are taking 'a' as dividend and 'b' as the divider. You will need to return both the quotient and the remainder. Your returned result should be the: "a is divided by b, with the quotient equals 'quotient' and remainder equals 'remainder'" Note: You must use f-string to do this question. Args: a (int), b (int) Returns: string >>> division_calculator(3, 1) "3 is divided by 1, with the quotient equals 3 and remainder equals 0." ''' # print(division_calculator(9, 3))
Bulgarian solitaire def bulgarian_solitaire(piles, k): You are given a row of piles of pebbles, all identical, and a positive integer k so that the total number of pebbles in these piles equals k*(k+1)//2, the arithmetic sum formula that equals the sum of positive integers from 1 to k. Almost as if intended as a metaphor for the bleak daily life behind the Iron Curtain, all pebbles are identical and you don't have any choice in your moves. Each move picks up one pebble from each pile (even if doing so makes that pile vanish), and creates a new pile from the resulting handful. For example, starting with[7, 4, 2, 1, 1], the first move turns this into [6, 3, 1, 5]. The next move turns that into [5, 2, 4, 4], which then turns into the five-pile configuration [4, 1, 3, 3, 4], and so on. This function should count how many moves are needed to convert the given initial piles into the goal state where each number from 1 to k appears as the size of exactly one pile, and return that count. These…
Payment = Principal [rate ((1 + rate)months)] [(rate + 1)months - 1] For the formula to compute monthly payment, see Listing 2.9, ComputeLoan.java. (Financial application: loan amortization schedule) The monthly payment for a given loan pays the principal and the interest. The monthly interest is computed by multiplying the monthly interest rate and the balance (the remaining princi- pal). The principal paid for the month is therefore the monthly payment minus the monthly interest. Write a program that lets the user enter the loan amount
Enter the name of Stock: Oracle Corporation Enter the symbol of Stock: URCL Enter the previous closing price: 34.5 Enter the current price: 34.35 Stock name: Oracle Corporation Stock symbol: ORCL Stock ID: 59 Price-change percentage: - 0.434782608695648 Challenge Question - Using GregorianCalendar and Date classes: (Use the GregorianCalendar class) Java API has the Date class and GregorianCalendar class in the java.util package, which you can use to obtain the current date with specific details like current year, current month, current day of a date and so on. Write a program to perform these tasks: 1. Display the current year, month, and day. 2. Display the current date by using the to String() method from the Date class. 3. Display the current time-which is used to display the number of milliseconds- by using getTime() method from the Date class. We will use it in the step 17. 4. - Display the current year by using get(GregorianCalendar.YEAR) method from to GregorianCale class. 5-…
Enter the name of Stock: Oracle Corporation Enter the symbol of Stock: URCL Enter the previous closing price: 34.5 Enter the current price: 34.35 Stock name: Oracle Corporation Stock symbol: ORCL Stock ID: 59 Price-change percentage: - 0.434782608695648 Challenge Question - Using GregorianCalendar and Date classes: (Use the GregorianCalendar class) Java API has the Date class and GregorianCalendar class in the java.util package, which you can use to obtain the current date with specific details like current year, current month, current day of a date and so on. Write a program to perform these tasks: 1. Display the current year, month, and day. 2. Display the current date by using the to String() method from the Date class. 3. Display the current time-which is used to display the number of milliseconds- by using getTime() method from the Date class. We will use it in the step 17. 4. - Display the current year by using get(GregorianCalendar.YEAR) method from to GregorianCale class. 5-…
What need to notepad ++ total cod3. Var adventurersName = ["George", " Tim", " Sarah", " Mike", " Edward"];var adventurersKilled = 3;var survivors;var leader = "Captain Thomas King";var numberOfAdventurers = adventurersName.length; survivors = numberOfAdventurers - adventurersKilled; console.log("Welcome to The God Among Us\n");console.log("A group of adventurers began their search for the mystical god said to live among us. In charge of the squad was " + leader + " who was famous for his past exploits. Along the way, the group of comrades were attacked by the god's loyal followers. The adventurers fought with bravado and strength under the tutelage of "+ leader + " the followers were defeated but they still suffered great losses. After a headcount of the remaining squad, "+ adventurersKilled +" were found to be dead which left only " + survivors + " remaining survivors.\n"); console.log("Current Statistics :\n");console.log("Total Adventurers = " +…
Sevens rule, zeros drooldef seven_zero(n):Seven is considered a lucky number in Western cultures, whereas zero is what nobody wants to be. We now bring these two opposites briefly together with positive integers that consist of some solid sequence of sevens, followed by some (possibly empty) solid sequence of zeros. Examples of such integers are 7, 77777, 7700000, 77777700, or 700000000000000. A surprising theorem proves that for any positive integer n, there exist infinitely many integers of such seven-zero form that are divisible by n. This function should return the smallest such seven-zero integer. This exercise is about efficiently generating all numbers of the constrained form of sevens and zeros in strictly ascending order to guarantee finding the smallest working such number. This logic might be best written as a generator to yield such numbers. The body of this generator consists of two nested loops. The outer loop iterates through the number of digits d in the current number.…
10-13. Verify User: The final listing for remember_me.py assumes either that the user has already entered their username or that the program is running for the first time. We should modify it in case the current user is not the person who last used the program. Before printing a welcome back message in greet_user(), ask the user if this is the correct username. If it’s not, call get_new_username() to get the correct username.
7. username_ends_with_digits This function decides whether a given username ends with some digits. It returns either True, if the username does end with digits, or False, if it does not. Check out the .isdigit method on strings! Sample runs should look like: >>> username_ends_with_digits("FunctionEnjoyer") False >>> username_ends_with_digits("this_username_95060") True
Credit Card Number Check. The last digit of a credit card number is the check digit, which protects against transcription errors such as an error in a single digit or switching two digits. The following method is used to verify actual credit card numbers but, for simplicity, we will describe it for numbers with 8 digits instead of 16:• Starting from the rightmost digit, form the sum of every other digit. For example, if thecredit card number is 4358 9795, then you form the sum 5 + 7 + 8 + 3 = 23.• Double each of the digits that were not included in the preceding step. Add all digits ofthe resulting numbers. For example, with the number given above, doubling the digits,starting with the next-to-last one, yields 18 18 10 8. Adding all digits in these valuesyields 1 + 8 + 1 + 8 + 1 + 0 + 8 = 27.• Add the sums of the two preceding steps. If the last digit of the result is 0, the number isvalid. In our case, 23 + 27 = 50, so the number is valid.Write a program that implements this…
Credit Card Number Check. The last digit of a credit card number is the check digit, which protects against transcription errors such as an error in a single digit or switching two digits. The following method is used to verify actual credit card numbers but, for simplicity, we will describe it for numbers with 8 digits instead of 16:• Starting from the rightmost digit, form the sum of every other digit. For example, if thecredit card number is 4358 9795, then you form the sum 5 + 7 + 8 + 3 = 23.• Double each of the digits that were not included in the preceding step. Add all digits ofthe resulting numbers. For example, with the number given above, doubling the digits,starting with the next-to-last one, yields 18 18 10 8. Adding all digits in these valuesyields 1 + 8 + 1 + 8 + 1 + 0 + 8 = 27.• Add the sums of the two preceding steps. If the last digit of the result is 0, the number isvalid. In our case, 23 + 27 = 50, so the number is valid.Write a program that implements this…