On a piano, a key has a frequency, say f0. Each higher key (black or white) has a frequency of fo* rn, where n is the distance (number of keys) from that key, and r is 2(1/12). Given an initial key frequency, output that frequency and the next 4 higher key frequencies. Output each floating-point value with two digits after the decimal point, which can be achieved as follows: print (f'{your_value1:.2f} {your_value2:.2f} {your_value3:.2f} {your_value4:.2f} {your_value5:.2f}') Ex: If the input is: 440 (which is the A key near the middle of a piano keyboard), the output is: 440.00 466.16 493.88 523.25 554.37 Note: Use one statement to compute r = 2(1/12) using the pow function (remember to import the math module). Then use that r in subsequent statements that use the formula fn = f0 * rn with n being 1, 2, 3, and finally 4. 461710.3116374.qx3zqy7 LAB ACTIVITY 1 22 2 2.16.1: LAB: Musical note frequencies Type your code here. 111 main.py 0/10 Load default template...

On a piano, a key has a frequency, say f0. Each higher key (black or white) has a frequency of fo* rn, where n is the distance (number of keys) from that key, and r is 2(1/12). Given an initial key frequency, output that frequency and the next 4 higher key frequencies. Output each floating-point value with two digits after the decimal point, which can be achieved as follows: print (f'{your_value1:.2f} {your_value2:.2f} {your_value3:.2f} {your_value4:.2f} {your_value5:.2f}') Ex: If the input is: 440 (which is the A key near the middle of a piano keyboard), the output is: 440.00 466.16 493.88 523.25 554.37 Note: Use one statement to compute r = 2(1/12) using the pow function (remember to import the math module). Then use that r in subsequent statements that use the formula fn = f0 * rn with n being 1, 2, 3, and finally 4. 461710.3116374.qx3zqy7 LAB ACTIVITY 1 22 2 2.16.1: LAB: Musical note frequencies Type your code here. 111 main.py 0/10 Load default template...

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

In the classic problem FizzBuzz, you are told to print the numbers from 1 to n. However,when the number is divisible by 3, print "Fizz''. When it is divisible by 5, print "Buzz''. When it isdivisible by 3 and 5, print"FizzBuzz''. In this problem, you are asked to do this in a multithreaded way.Implement a multithreaded version of FizzBuzz with four threads. One thread checks for divisibilityof 3 and prints"Fizz''. Another thread is responsible for divisibility of 5 and prints"Buzz''. A third threadis responsible for divisibility of 3 and 5 and prints "FizzBuzz''. A fourth thread does the numbers.
Read integers from input until an integer read is less than or equal to the previous integer read. For each integer read, output the integer followed by " is in a strictly increasing sequence." Then, output the last integer read followed by "breaks the sequence." End each output with a newline. Ex: If the input is -1 0 1 -5 3 4, then the output is: -1 is in a strictly increasing sequence. 0 is in a strictly increasing sequence. 1 is in a strictly increasing sequence. -5 breaks the sequence. Note: Input has at least two integers. 1 #include HNm LÔ 10 mm CO GI 2 using namespace std; 3 4 int main() { 5 6 7 8 9 10 11} int current Data; int previousData; * Your code goes here */ return 0;
1.Generate a list of 10 random numbers with values between 1 and 20, and submit the first 10 numbers as an answer to this question. (Use any random number generator). For the purpose of using them in the next questions, call these numbers A, B, C, D, . . . J 2.Convert A*pi /B into degrees. 3.Find the result of a. Degrees = (A \times B \times C) + 180 mod 180; this is the remainder after dividing (A \times B \times C) + 180 by 180 b. Convert Degrees into radians, and put the answer in \pi notation. 4.Calculate the measurements of the acute angles of a right triangle whose sides measure A, B, C units.
Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - 1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ). Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 : n = 4 / 2 = 2Step 2 : n = 2 / 2 = 1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 : n = 7 - 1 = 6Step 2 : n = 6 / 3 = 2 Step 3 : n = 2 / 2 = 1 SolutionDp///.
Let P(x, y) is "x + 2y = xy," where x and y are integers. Given: (1) ForEvery x ThereExists y P(x, y). (2) ThereExists y ForEvery x P(x, y). Select one of the following choices: a. (1) and (2) are True. ○ b. (1) and (2) are False. c. (1) is False and (2) is True. ○ d. (1) is True and (2) is False.
Use cin to read floating-point numbers from input as area readings until four readings are read that are greater than 35.0. Output the four readings in the given range. End each output with a newline. Ex: If the input is 35.0 35.6 35.9 36.0 35.2, then the output is: 35.6 35.9 36.0 35.2 Note: Use fixed and setprecision (1) to set one digit after the decimal point. 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 11 12} double currentArea; int numSuccesses; * Your code goes here */ return 0; 2 3
Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - 1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ). Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 : n = 4 / 2 = 2Step 2 : n = 2 / 2 = 1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 : n = 7 - 1 = 6Step 2 : n = 6 / 3 = 2 Step 3 : n = 2 / 2 = 1 SolutionDp///.
Use cin to read integer leftoverValue from input. Then, read the remaining integers from input until 99 is read. For each remaining integer read before 99, if the integer is positive, output the positive integer followed by a newline and subtract the positive integer from leftoverValue. Ex: If the input is: 57 -25 24 20 99 then the output is: 24 20 The total after subtracting all positive values is 13 Note: leftoverValue may go negative. 1 #include 2 using namespace std; 3 4 int main() { 5 6 7 8 9 10 11 12 13} int inputData; int leftoverValue; *Your code goes here */ cout << "The total after subtracting all positive values is " << leftoverValue << endl; return 0;
Write a program that mimics a calculator. The program should take as input two integers and the operation to be performed. It should then output the numbers, the operator, and the result. For division, if the denominator is zero, output an appropriate message. Limit the supported operations to + -/ *and write an error message if the operator is not one of the supported operations. Here is some example output: 3 + 4 = 7 13 * 5 = 65 C++
Given two numbers that represent the lengths of a right triangle's legs (sides adjacent to the right angle), output the length of the third side (i.e. hypotenuse) with two digits after the decimal point. Output each floating-point value with two digits after the decimal point, which can be achieved as follows:print('Hypotenuse: {:.2f}'.format(c)) Ex: If the input is: 3.0 4.0 the output is: Hypotenuse: 5.00
I'm running a 5-star restaurant and I can only have the best items on my menu. My menu offers 6 items, each represented by a number from 1-6. If an item on my menu does not sell or does not sell that much compared to others, I must act and replace it with something that sells! Identify which dishes do not sell. If every dish sells, print the set of dishes that were ordered least. Input: A single line containing the dish number that were ordered. Treat as one number. INPUT: 156356231 Output: The list of dishes not ordered in numerical order. If every dish sells, print the set of dishes that were ordered least. Separate each number with a new line. OUTPUT: 4
Written in Python as well as screenshotted accepting user input and computed values