Question 2.1 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 Write 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 was received (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.

Question 2.1 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 Write 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 was received (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.

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 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.
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.
Question 2.1 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 twoto get a new value for N If N is an odd number, then multiply N by 3 and add 1to get a new value for N. Continue to generate numbers in thisway 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 Write 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 was received (entered by the user). The function must also count and return the numbers that the sequence consists of. Thereturned value must be displayed from the main() function. Question 2.2 Write a function createPassword()with no return value to randomly select 8 capital letters from the alphabet. The function receives the address of the first characters of the…
Can someone help me to answer this activity? Factorial of a number is defined as: n! = n(n-1)(n-2)(n-3)...(2)(1) For example, 4! = 4*3*2*1 The n! can be written in terms of (n-1)! as: n! = n* (n-1)! (n-1)! = (n-1)*(n-2)! and so forth. Thus, in order to compute n!, we need (n-1)!, to have (n-1)!, we need (n-2)! and so forth. As you may immediately notice, the base case for factorial is 1 because 1! = 1. Write a program that uses a recursive function called factorial that takes an integer n as its argument and returns n! to the main.
The Problem A Zeckendorf number is defined for all positive integers as the number of Fibonacci numbers which must be added to equal a given number k. So, the positive integer 28 is the sum of three Fibonacci numbers (21, 5, and 2), so the Zeckendorf number for k = 28 is three. Wikipedia is a satisfactory reference for our purposes for more details of the Zeckendorf and Fibonacci numbers. In both cases, you do not need to read the entire Wikipedia entry. Your assignment is to write two ARM assembly language functions which calculate Zeckendorf and Fibonacci numbers. Zeck function The first function, which should be named zeck, receives an integer parameter in register zero. This will be the variable k we discussed above. Your code should return the Zeckendorf number for k in register zero when complete. If the parameter k is zero, return zero. If the parameter k is negative, return minus 1. If the parameter k is too large to calculate, return minus 1. Fib function The other function,…
1.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 c++ 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.
Suppose that you are given the following logical statement:¬ P ∧ Q → ¬ R ∨ SBased on our discussion of order of operations, which is the correct way to interpretthis?(a) ¬(P ∧ ((Q → (¬R)) ∨ S))(b) (¬(P ∧ (Q → (¬R)))) ∨ S(c) ((¬P) ∧ (Q → (¬R))) ∨ S(d) (¬P) ∧ ((Q → (¬R)) ∨ S)(e) (¬(P ∧ Q)) → (¬(R ∨ S))(f) ((¬P) ∧ Q) → ((¬R) ∨ S)(g) ((¬P) ∧ (Q → (¬R))) ∨ S(h) ((¬P) ∧ (Q → (¬R))) ∨ S(i) (¬P) ∧ ((Q → (¬R)) ∨ S)(j) ¬((P ∧ Q) → (¬(R ∨ S)))
Modulo arithmeticFor two integers ‘a’ and ‘b’ and a positive integer ‘n’, let + represent the operation a + b = (a+b)mod(n), that is, the result of a + b is the remainder of the usual sum a + b after dividing by n (using a natural representation). Similarly, let * represent the operation a * b = (a*b)mod(n), that is, the result of a * b is the remainder of the product a*b after dividing by n. For example using the set S = {2, 5, 8} and n = 9, 5 + 8 = 4, since 4 is the remainder after dividing 13 (5 + 8) by 9; and 2 * 8 = 7, since 7 is the remainder after dividing 16 (2*8) by 9.a. For each set S and number n specified below, create two “operation” tables (these are called Cayley tables), one showing the results for the operation +, and one showing the results of the operation * for each pair of elements from S (see the example tables in the notes).i. S1 = {0, 1} and n = 2ii. S2 = {1, 2} and n = 3iii. S3 = {0, 2, 4, 6} and n = 8iv. S4 = {1, 3, 5, 7} and n = 8v. S5 = {1, 2, 3, 4} and n =…
I need help with this question of Data Structures and Algorithmns 1) True or False a) If g1(n) = O(f1(n)) and g2(n) = O(f2(n)), then g1 x g2 = O(f1(n) x f2(n)) (True or False) b) If f(n) = logan and g(n) = logbn , then f(n) = Θ(g(n)) (True or False)
procedure Horner(c, a_(0), a_(1), a_(2),… , a_(n): real numbers)y := a_(n)for i := 1 to ny := y ∗ c + a_(n−i)return y {y = a_(n)c^(n) + a_(n−1)c^(n−1) + ⋯ + a_(1)c + a_(0)}a) Evaluate 3x^(2) + x + 1 at x = 2 by working througheach step of the algorithm showing the values assigned at each assignment step.b) Exactly how many multiplications and additions areused by this algorithm to evaluate a polynomial ofdegree n at x = c? (Do not count additions used toincrement the loop variable.)
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.