5.11 LAB: Find the largest power of 2 less than a number Any positive integer can be written as the sum of a series of terms, where each term is the number 2 raised to some power. For example: 165 27+25 +2² +2⁰ 93077 = 216 +216 +2¹3 +2¹1 +2° +2³+27 + 24 +2² +20 Notice how the exponent of each term is less than that of its predecessor. You will write a program to read an integer and decompose it into such a series. Here is an example of how your final program might be used (user enters the number in first line and program outputs the series of terms): Enter a number: 1234 2**10 + 2**7 + 2**6 + 2**4 + 2**1 You will write your program in two phases. In this phase, your program only reads an integer inum and finds the largest n such that 2"

5.11 LAB: Find the largest power of 2 less than a number Any positive integer can be written as the sum of a series of terms, where each term is the number 2 raised to some power. For example: 165 27+25 +2² +2⁰ 93077 = 216 +216 +2¹3 +2¹1 +2° +2³+27 + 24 +2² +20 Notice how the exponent of each term is less than that of its predecessor. You will write a program to read an integer and decompose it into such a series. Here is an example of how your final program might be used (user enters the number in first line and program outputs the series of terms): Enter a number: 1234 210 + 27 + 26 + 24 + 2**1 You will write your program in two phases. In this phase, your program only reads an integer inum and finds the largest n such that 2"

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

zyBooks My library > CS 1010: Algorithmic Problem Solving home > 4.14: LAB: Remove gray from RGB zyBooks catalog 2 Help/FAC 4.14 LAB: Remove gray from RGB Summary: Given integer values for red, green, and blue, subtract the gray from each value. Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255,0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray). Given values for red, green, and blue, remove the gray part. Ex: If the input is: 130 50 130 the output is: 80 0 80 Find the smallest value, and then subtract it from all three values, thus removing the gray. Note: This page converts rgb values into colors. LAB 4.14.1: LAB: Remove gray from RGB 0/10 ACTIVITY P Type here to search 1O a 56°F Cip
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?…
Lab 15.1 Greatest Common Divisor A formula for finding the greatest common divisor (GCD) of two numbers was formulated by the mathematician Euclid around 300 BCE. The GCD of two numbers is the largest number that will divide into both numbers without any remainder. For example, the GCD of 12 and 16 is 4, the GCD of 18 and 12 is 6. The basic algorithm is as follows: Assume we are computing the GCD of two integers x and y. Follow the steps below: 1. Replace the larger of x and y with the remainder after (integer) dividing the larger number by the smaller one. 2. If x or y is zero, stop. The answer is the nonzero value. 3 If neither x nor y is zero, go back to step 1. Here is an example listing the successive values of x and y: $ (135 / 20) - 15 $ (20 / 15) = 5 * (15 / 5) = 0 135 20 15 20 15 5 5 GCD = 5 Write a recursive method that finds the GCD of two numbers using Euclid's algorithm. public class Arithmetic { public static int gcd(int a, int b) // Your work here Lab 15.2 Tester for GCD…
Listing 6.7, PrimeNumberFunction.py, provides the isPrime(number) function for testing whether a number is prime. Use this function to find the number of prime numbers less than 10,000.
4.16 LAB: Interstate highway numbers Primary U.S. interstate highways are numbered 1-99. Odd numbers (like the 5 or 95) go north/south, and evens (like the 10 or 90) go east/west. Auxiliary highways are numbered 100-999, and service the primary highway indicated by the rightmost two digits. Thus, I-405 services I-5, and I-290 services I-90. Given a highway number, indicate whether it is a primary or auxiliary highway. If auxiliary, indicate what primary highway it serves. Also indicate if the (primary) highway runs north/south or east/west. Ex: If the input is: 90 the output is: I-90 is primary, going east/west. Ex: If the input is: 290 the output is: I-290 is auxiliary, serving I-90, going east/west. Ex: If the input is: 0 the output is: 0 is not a valid interstate highway number. Ex: If the input is: 200 the output is: 200 is not a valid interstate highway number. See Wikipedia for more info on highway numbering. 344614.2153518.qx3zqy7 Use Python. Don't use Java cause that's…
6.14 Lab: Reversing an Integer. In this problem, your task is to complete the reverseNumber(num) function. The input of the function is an integer number num. The function should return a number where all the digits are reversed from the original number. You can assume that the input will be a non-negative integer. Example 1: If the input is: 123 The output is: 321 Example 2: If the input is: 321 The output is: 123 Example 3: If the input is: 1000 The output is: 1 Brainstorming. Oftentimes, a problem as formulated can be made easier when you change the way the data is represented. In this case, this problem can be solved in a clever way using strings. If you first convert the number into a string, you can then reverse the string and convert the number back to an integer. def reverseNumberUsingString(num): numInStringFormat = str(num) #converts the number into a string reversedNumberInStringFormat = numInStringFormat[::-1] #reverses the string reversedNumber =…
Part 2: Binary Arithmetic One of the most common operations we perform on binary numbers (and all numbers) is addition. It can be cumbersome to convert your binary numbers to decimal just to add them and convert them back, so instead we will be learning how to add binary numbers directly. Binary addition works the same way as decimal addition, with the added restriction that each digit can only go up to 1. Let's consider the possibilities for adding the values of any 2 single digits together: 0 + 0 0 + 1 1 + 0 1 + 1 0 1 1 10 (remember that 10 in binary represents the number 2) In that last case, the result is larger than a single digit. When adding larger binary numbers, that means we have to carry the 1 over to the next column. This presents us with another new case: what happens if we have 1 + 1 + carried 1? In that case, the result is 11, which means that column's result is 1, and we carry 1 to the next column. Below is an example of adding two binary numbers that shows all…
PYTHON CODE: In order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test…
4.23 LAB: Golf scoresGolf scores record the number of strokes used to get the ball in the hole. The expected number of strokes varies from hole to hole and is called par (i.e. 3, 4, or 5). Each score's name is based on the actual strokes taken compared to par: "Eagle": number of strokes is two less than par"Birdie": number of strokes is one less than par"Par": number of strokes equals par"Bogey": number of strokes is one more than par
PYTHON: In order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test case…
Part 3: Negative Binary Numbers This standard method of binary number representation doesn't account for negative numbers. We can't just throw a negative sign in front of a binary number though - everything in a computer must be represented by 1's and 0's. One way we can get around this is by using the very first digit of each binary number to represent the sign: 0 for positive and 1 for negative. This is called 1's complement representation. 00010110 -> 0 0010110 -> positive 22 10010110 -> 1 0010110 -> negative 22 Using 1's complement representation we can represent the numbers -127 through 127 in a single byte (note that we can only go half as high as an unsigned number because half of the possible representations for that byte are being used for the negative numbers). However, there is a flaw with 1's complement: the representation of the number 0. 00000000 -> 0 0000000 -> zero 10000000 -> 1 0000000 -> negative zero? Because of this, we…
C CODE 3.22 LAB: Remove gray from RGB Summary: Given integer values for red, green, and blue, subtract the gray from each value. Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255, 0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray). Given values for red, green, and blue, remove the gray part. Ex: If the input is: 130 50 130 the output is: 80 0 80 Find the smallest value, and then subtract it from all three values, thus removing the gray.