There are n lines of strange number strings, where line 1 is 0, then line n is obtained by replacing character 0 with 01 and character 1 with 10 in line n-1. For example, the first row is 0, the second row is 01, the third row is 0110... Given the number of lines n and the number k, ask to output the kth number of the strange number string of the nth line. enter: The first input number n represents the number of rows, and the second number k is the required number. output: The kth digit of the strange digit string on the nth line. 1

There are n lines of strange number strings, where line 1 is 0, then line n is obtained by replacing character 0 with 01 and character 1 with 10 in line n-1. For example, the first row is 0, the second row is 01, the third row is 0110... Given the number of lines n and the number k, ask to output the kth number of the strange number string of the nth line. enter: The first input number n represents the number of rows, and the second number k is the required number. output: The kth digit of the strange digit string on the nth line. 1

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

Read string integer value pairs from input until "Done" is read. For each string read: • If the following integer read is less than 40, output the string followed by ": low on stock". • Otherwise, output the string followed by ": well stocked". End each output with a newline. Ex: If the input is Oven 43 Curtain 7 Pillow 1 Done, then the output is: Oven: well stocked Curtain: low on stock Pillow: low on stock 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 } * Your code goes here */ return 0;
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...
PRG13. Write a program that will accept 10 numbers, identify if the number is odd or even, then finds the sum of all odd numbers, all even numbers, and total of all the numbers entered. Prg14: Write a program that displays a multiplication table for a given number. Sample output: Enter a number: 3 Multiplication table for 3: 3 x 0 = 0 3 x 1 = 3 3. x 9 =27 Prg15: Program that accepts a number then output the sum of the squares from 1 to n. Enter a number :4 12 + 22 + 32 + 42 = 30
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.
Write a program that reads postﬁx expressions and prints their values. Each input expression should be entered on its own line, and the program should terminate when the user enters a blank line. Assume only binary operators, and that the expressions contain no variables. Note that you will need to use parentheses to indicate the order of application of the operators in the expression. Here are sample input–output pairs: 78 78 78 6 + 84 78 6 + 9 2 - / 12
In JAVA language, write a program to input an integer p from the user and then print the count of digit 0 in the integer p. The entered value of p will be always positive.
Using python, please explain 1: A positive integer greater than 1 is said to be prime if it has no divisors other than 1 and itself. A positive integer greater than 1 is composite if it is not prime. Write a program that asks the user to enter an integer greater than 1, then displays all of the prime numbers that are less than or equal to the number entered The program should work as follows: Once the user has entered a number, the program should populate a list with all of the integers from 2 up through the value entered. The program should then use a loop to step through the list. The loop should pass each element to a function that displays the element whether it is a prime number.
Your task is to take an integer number n & prints the difference between the product of its digits and the sum of its digits.
solve in java Integer numInput is read from input representing the number of integer values to be read next. Use a loop to read the remaining integer values from input. For each integer value read, output "Value read: " followed by the value. Then, output "Highest: " followed by the highest of the integer values read. End each output with a newline. Ex: If the input is: 3 220 -490 5 then the output is: Value read: 220 Value read: -490 Value read: 5 Highest: 220 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 import java.util.Scanner; public class HighestValues { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); intnumInput; intinputValue; inthighestVal=0; inti; numInput=scnr.nextInt(); /* Your code goes here */ } }
This is a python , Coding the screenshot better explains .This converts numbers to Binary
In python, write a code that allows the user to input two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The size of each sequence can vary (maybe sequence - 1 has four numbers, and sequence - 2 has seven). The output of this code should be a third sequence that is a combination of both sequences 1 and 2 and is sorted in non-decreasing order. Note: Non-decreasing order means there can be a repeated number in the third sequence (see example 1). A strictly increasing order sequence cannot have repeat numbers at all (see example 3). Remember, all input sequences must be in strictly increasing order! please do this using python, only using while loops. NO language of "break" or "len" please. Hint: we can use three separate lists to solve this code.