For example, multiply 100110 by 1011: 100110 1011 100110 (10011011) 100110 (10011012) 000000 (10011004, but we skip this step in the algorithm) 100110 (10011018) 110100010 This algorithm requires log b additions (the number of bits in b). This is the algorithm you will implement in your program. First your program will prompt the user and read the numbers a and b to be multiplied. Remember that a and b are converted to 2's complement when you read them. Your program will multiply the numbers as shown above, by adding shifted versions of a. For each digit of b you will need to determine whether it is 0 or 1, because (as shown above) if a digit is O then nothing is added for that digit.

For example, multiply 100110 by 1011: 100110 1011 100110 (10011011) 100110 (10011012) 000000 (10011004, but we skip this step in the algorithm) 100110 (10011018) 110100010 This algorithm requires log b additions (the number of bits in b). This is the algorithm you will implement in your program. First your program will prompt the user and read the numbers a and b to be multiplied. Remember that a and b are converted to 2's complement when you read them. Your program will multiply the numbers as shown above, by adding shifted versions of a. For each digit of b you will need to determine whether it is 0 or 1, because (as shown above) if a digit is O then nothing is added for that digit.

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

Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an even number, then divide N by two to get a new value for N. If N is an odd number, then multiply N by 3 and add 1 to get a new value for N. Continue to generate numbers in this way until N becomes equal to 1. For example, starting from N = 3 the complete ’3N+1’ sequence would be:3, 10, 5, 16, 8, 4, 2, 1 Do the following: Write a code in C++ to ask the user to enter a positive integer (N) in the main() function. Write a function sequence() that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that wasreceived (entered by the user). The function must also count and return the numbers that the sequence consists of. The returned value must be displayed from the main() function. Example input and output is given in the following image.
Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows:If N is an even number, then divide N by two to get a new value for NIf N is an odd number, then multiply N by 3 and add 1 to get a new value for N.Continue to generate numbers in this way until N becomes equal to 1For example, starting from N = 3 the complete ’3N+1’ sequence would be:3, 10, 5, 16, 8, 4, 2, 1Write code to ask the user to enter a positive integer (N) in the main() function. Write a function sequence()that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that wasreceived (entered by the user). The function must also count and return the numbers that the sequenceconsists of. The returned value must be displayed from the main() function.
Write a program in Python that reads in three integers and prints "in order" if they are sorted in order either ascending or descending, or "not in order" otherwise. For example, 1 2 3 is "in order", 1 5 2 is "not in order", 5 2 1 is "in order", 1 2 2 is "in order"
Use following series to do the given task; 135 79 11 13 15 1719 21 23 25 27 29 31 ... Given the number N of odd numbers in a certain line, your task is to determine the sum of the last three numbers of that line. For example N = 5 means, the third line, the last three numbers are 13, 15 and 17. The summation of these three numbers is 45. InputThe first line tells the number of test cases. From the next line, the input is a sequence of lines, one odd number N (1 < N <1000000000) per line. OutputFor each input line write the sum of the last three odd numbers written in that line of series with N numbers.
Start with any positive number n. If n is even divide it by 2, if n is odd multiply by 3 and add 1. Repeat until n becomes 1. The sequence that is generated is called a bumpy sequence. For example, the bumpy sequence that starts at n = 10 is: 10, 5, 16, 8, 4, 2, 1and the one that starts at 11 is11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 Write a function named lengthBumpy that returns the length of the bumpy sequence generated by its integer argument. The signature of the function is int lengthBumpy(int n) Examples:lengthBumpy(10) returns 7, and lengthBumpy(11) returns 15. You may assume that the argument n is positive and that the sequence converges to 1 without arithmetic overflow.
Write a program that produces a multiplication table, showing the results of multiplying the integers 1 through 12 by themselves.
Write a program that reads a positive integer n, and prints the firstn even numbers.For example, one execution would look like this:Please enter a positive integer: 3246
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).
choose any number as n, output all n-digit binary numbers which have equal total in right and left halves. mid element can either be 1 or 0 IF n is odd. 1. Explain where does the recursion happened? 2. Solve using the programming languages and test. Input : n=4 output: 0000 0101 0110 1001 1010 1111
Compute for the time complexity (in milliseconds) of each letter of the given program segment below, then get the total time complexity. int main( ) { int a, b, c, d; for (a=0;a<10;a++) for (b=0;b<10;b++) for (c=0;c<10;c++) for (d=0;d<10;d++) { If ((a==0)&&(b==0)&&(c==0)&&(d==0)) { a=1, b=2,c=3,d=4; } cout<<a<<b<<c<<d; } }
Implement the first round of AES ( Advanced Encryption Standard ) in python. Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.
I have the following algorithm void p2(int n) s = 0 i = 1 j = 1 while ((i <= n) and (j <= n)) do s = s + 1 i = i + 1 if i > n and j < n then i = 1 j = j + 1 end(if) end(while)write(s)fin(p2) What is the frequency counter? How many times is each line executed? Please explain clearly, thank you