Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is As long as x is greater than 0 Output x 2 (remainder is either 0 or 1) x-x/2 Note: The above algorithm outputs the 0's and 1's in reverse order Ex: If the input is: 6 the output is: 011 6 in binary is 110, the algorithm outputs the bits in reverse

Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is As long as x is greater than 0 Output x 2 (remainder is either 0 or 1) x-x/2 Note: The above algorithm outputs the 0's and 1's in reverse order Ex: If the input is: 6 the output is: 011 6 in binary is 110, the algorithm outputs the bits in reverse

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

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 numberk, 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
Given an integer value N, write a program to print a diamond pattern of 2*N Input The first line of input is an integer N. Explanation In the given example, the number of rows in the diamond is 2*5 = 10. So, the output should be rows as shown below.
Create a program that takes in a sentence from user input, the program then removes the last word and first word in the sentence. The remaining string is converted to upper case then printed out. [Hint: In case there is only two words, an empty line is printed] Sample run 1: Sample run 2: Enter a sentence: Hello There Enter a sentence: Happy Thursday Everyone Output: Output: THURSDAY
Write a program with loops to solve each of the following (comment each block of code): Compute the sum of all odd numbers between a and b (inclusive), where a and b are inputs. Prompt the user for a and b. Display the sum. Read a sequence of integer inputs and print the smallest and largest of the inputs. Prompt for a line of input as a string and display the string, with all vowels replaced by an underscore.
You are given a strings and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Return the length of the longest substring containing the same letter you can get after performing the above operations. Example 1: Input: s = "ABAB", k = 2 Output: 4 Explanation: Replace the two 'A's with two 'B's or vice versa. Example 2: Input: s = Output: 4 "AABABBA", k = 1 Explanation: Replace the one 'A' in the middle with 'B' and form "AABBBBA". The substring "BBBB" has the longest repeating letters, which is 4. Constraints: 1 <=s.length <= 105 s consists of only uppercase English letters. • 0 <= k <= s.length
QUESTION 15 The following algorithm finds the same character in two strings: string, =x,xX, and string2=yıy2-Yn How many times would Step 4.1.1. be performed for the following inputs: string = 6632176980 string, = 8703125409 1. input n 2. input the n-character long string x1x2x3 Xn 3. input the n-character long string yıY2y3 **Yn 4. for i = 1 ton do 4.1. for j = 1 to n do 4.1.1. if x, = y, then 4.1.1.1. return "A common character has been found; it is x," 5. return "There is no common character in the given two strings"
Can you use Python programming language to to this question? Thanks
Write a program that takes in a line of text as input, and outputs that line of text in reverse. The program repeats, ending when the user enters "Done", "done", or "d" for the line of text. Ex: If the input is: Hello there Hey done then the output is: ereht olleH yeH 461710 3116371
Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. Ex: If the input is 6, the output is: 011 (6 in binary is 110; the algorithm outputs the bits in reverse).
A consumer can withdraw up to $500 per day from an ATM. If a customer withdraws more than $300, the service charge is 4%. It tells the consumer of inadequate cash and offers to withdraw the money for a fee of $25.00. The ATM won't let you withdraw money if your account is empty or has a negative balance. If the withdrawal exceeds $500, the ATM informs the customer of the maximum withdrawal amount and refuses the withdrawal. Write an algorithm that allows customers to enter withdrawal amounts. The algorithm then verifies the account balance, debits the customer's account for the amount withdrawn plus any service fees.