If the first number in a sequence is a positive integer, x Let ao= x, an is defined as follows if an is even, then an+1 = an/2 if an is odd, then an+1 =3 *an+ 1 Then there exists an integer k, such that ak =1 For example, if: 75, then k = 14 and the numbers in the sequence are: 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1. The largest number in the sequence is 340 and it is a position 4 in the sequence (assuming 75 is at position 1) Design and implement a complete C++ program that will • read a series of integers (greater than 0) from a file and for each integer display (to the screen) − the integer − the number of steps it takes to reach 1 − the largest value in the sequence and its position

If the first number in a sequence is a positive integer, x Let ao= x, an is defined as follows if an is even, then an+1 = an/2 if an is odd, then an+1 =3 *an+ 1 Then there exists an integer k, such that ak =1 For example, if: 75, then k = 14 and the numbers in the sequence are: 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1. The largest number in the sequence is 340 and it is a position 4 in the sequence (assuming 75 is at position 1) Design and implement a complete C++ program that will • read a series of integers (greater than 0) from a file and for each integer display (to the screen) − the integer − the number of steps it takes to reach 1 − the largest value in the sequence and its position

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

This is a JAVA programming assignment. Program a GeneticAlgorithm to find an integer number between 0 and 31 that maximizes the function f (x) = x2.The initial procedure is given as below.• Population size: 6• Crossover probability: 100%• Mutation probability: 5%• Terminating criteria:o When your program produces an average of candidates is equal to or greater than29, then you can accept it as a terminating condition.• Fitness function:o You can use the function itself (f (x) = x2)as your fitness function.1. For the 1st generation, you need to print the process and result of selection, crossover, andmutation operation.you need to print the corresponding integer values and bits (binary values)of selection, crossover, and mutation operation. You also need to decide andprint the crossover point and the mutation point.2. From the 2nd generation, you do not have to print all results of selection, crossover,mutation operations. You can just print the result of each generation. Please provide…
In practical life, the employees get salaries and pay taxes honestly. Sometimes, the process of drawing salariesand payment of taxes may lead to some interesting situation. Suppose, a person draws salary of Rs. 10,000 permonth. A certain percentage of tax is charged on that amount, which is deducted every month. But if the salaryof the person is more than Rs. 10,000 per month, then the tax rate is different. Similarly if a person is getting Rs.20,000 per month, he/she would be charged more under a different tax rate slab. The interesting situationdevelops if there is an anomaly in the tax rates i.e. a person who is getting higher salary takes home lesser moneyas compared to the other person with less gross salary.To further elaborate it, we suppose that there is company 'C' where 100 or less than 100persons are employed. The salaries of the employees and their tax rates are known to us.We are required to list those unlucky persons, who are getting lesser take-home salary(net salary)…
Suppose team A plays in a best-of-7-game series. In sports sometimes teams play in a series until one team has won 4 games in the series. When a team wins its fourth game the series concludes because after a team has won 4 games it is guaranteed to win more games than its opponent even if all 7 games are played. When team A wins a game we write a W and when team A loses a game we write a L. So the sequence WWLLLWL means team A won the first, second and sixth games in the series and lost the other games. Team A lost the series. The sequence LWWLWW indicates team A won the second, third, fifth and sixth games. Team A won the series in 6 games. Given that team A wins the fifth game how many sequences of wins and losses are possible if team A wins the series?
Let l be a line in the x-yplane. If l is a vertical line, its equation is x = a for some real number a. Suppose l is not a vertical line and its slope is m. Then the equation of l is y = mx + b, where b is the y-intercept. If l passes through the point (x₀, y₀), the equation of l can be written as y - y₀ = m(x - x₀). If (x₁, y₁) and (x₂, y₂) are two points in the x-y plane and x₁ ≠ x₂, the slope of line passing through these points is m = (y₂ - y₁)/(x₂ - x₁). Instructions Write a program that prompts the user for two points in the x-y plane. Input should be entered in the following order: Input x₁ Input y₁ Input x₂
A group of m people is considering sharing the cost of buying some items for their summer camp. There are a total of n possible items to purchase. Each person writes a list of the items they are interested in purchasing on a paper. For example, person one may write “boat, trampoline, hot tub,” whereas person two may write “ hot tub, kayak, paddleboard”. There is no limit to how many items a person registers on their sheet. The goal is to determine if at least k items can be purchased. The following rules apply 1. The cost of any purchased item must be split equally among all those who listed that item on their sheet. No person can refuse to contribute to an item chosen for purchase, which is listed on their sheet. 2. Since each person has a limited budget, they may only contribute to at most one item on their list. The problem of determining if at least k items can be purchased is called SummerCamp. Show that this problem is NP-complete.
1. Big-O Notation Let f and g be functions from the set of integers or the set of real numbers to the set of real numbers. We say that f ( x ) is O ( g ( x ) ), read as "f ( x ) is big-oh of g ( x )", if there are constants C and k such that | f ( x ) | ≤ C | g ( x ) | whenever x > k. (a) Show that f(x) = x2 + 2x + 1 is O(x2) Solution: When x>1; ? 2 (1 + 2 ? + 1 ? 2 ) < ? 2 (1 + 2 1 + 1 1 2 ) = 4? 2 So, ??? ? > 1, ? 2 + 2? + 1 < 4? 2 From the definition 0 ≤ f(x) ≤ cg(x) for x≥1 Hence, for N0 = 1; c=4; and g(x)=x2 for N0 = 2; c=3; and g(x)=x2 for N0 = 3; c=2; and g(x)=x2 … Therefore, ? ? + ?? + ? = ?(? ? ) O(g(x)) = {f(x)|there exist positive constant c and N0 such that 0 ≤ f(x) ≤ cg(x) for all x≥N0} 2. Show that 7x2 is O(x3). 3. Suppose there are x number of boxes to be delivered to x number of household that is 2km apart, what is the distance travelled by the transport delivery service? 4. In number 3, suppose that each boxes…
Python programming It is given a non-negative number x, the decimal portrayal of which contains n digits. You need to shading every its digit in red or dark, with the goal that the number shaped by the red digits is detachable by A, and the number framed by the dark digits is distinct by B. Somewhere around one digit should be shaded in every one of two tones. Consider, the include of digits shaded in red is r and the include of digits hued in dark is b. Among all potential colorings of the given number x, you need to yield any to such an extent that the worth of |r−b| is the base conceivable. Note that the number x and the numbers shaped by digits of each tone, may contain driving zeros. instance of painting the number x=02165 of n=5 digits for A=3 and B=13. The red digits structure the number 015, which is detachable by 3, and the dark ones — 26, which is distinguishable by 13. Note that the outright worth of the distinction between the counts of red and dark digits is 1, it is…
We have n glasses which can hold a varying amount of liquid. We will say that glass1 is size q1 quarts and glass2 is size q2 quarts, etc. We now give you a size, say x quarts. You must give me a glass of exactly x quarts. You are allowed to fill any glass to exactly its size and to pour any liquid from one glass into another. When you pour, you either have to empty the glass you are pouring from or fill the glass you are pouring into. Can you do it?More concrete example: G1 has size 10 quarts. G2 has size 4 quarts. G3 has size 1 quart. You can get a 5 quart drink by filling G1, pouring 4 quarts from it into G2 and 1 quart of it into G1. After that, G1 has exactly 5 quarts. In the same problem, we could get 8 quarts by filling G2 twice and emptying it into G1 twice. Given This: Write an algorithm to do this and determine its complexity.
I would like my program to have an output like at the bottom #include <pthread.h> #include <semaphore.h> #include <stdio.h> #include <unistd.h> #define N 4 #define THINKING 2 #define HUNGRY 1 #define Eating 0 #define left_neighbor (phnum + 4) % N #define right_neighbor (phnum + 1) % N int state[N]; int phil[N] = { 0, 1, 2, 3 }; sem_t mutex; sem_t S[N]; void test(int phnum) { if (state[phnum] == HUNGRY && state[left_neighbor] != Eating && state[right_neighbor] != Eating) { // Philospher EATING state[phnum] = Eating; sleep(2); printf("PHIL %d EATING\n", phnum + 1); sem_post(&S[phnum]); } state[phnum] = HUNGRY; printf("PHIL %d HUNGRY\n", phnum + 1); // eat if neighbor are not eating_turn test(phnum); sem_post(&mutex); sem_wait(&S[phnum]); sleep(1); } { printf("PHIL %d is THINKING\n", phnum + 1); test(left_neighbor); test(right_neighbor); sem_post(&mutex); } void* philosphr(void* num) { while (1) { int* i = num; sleep(1); sleep(0); }…
Write a program that plays the tic-tac-toe game. Two players take turns clicking an available cell in a grid with their respective tokens (either X or O). When one player has placed three tokens in a horizontal, vertical,or diagonal row on the grid, the game is over and that player has won. A draw (no winner) occurs when all the cells in the grid have been filled with tokens and neither player has achieved a win. Figure 12.17 shows the representative sample runs of the example. Assume that all the cells are initially empty, and that the first player takes the X token and the second player the O token. To mark a cell, the player points the mouse to the cell and clicks it. If the cell is empty, the token (X or O) is displayed. If the cell is already filled, the player’s action is ignored.Define a custom class named Cell that extends Label for displaying a token and for responding to the button-click event. The class contains a data field token with three possible values—' ', X, and…
A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. For example: number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5. Write a program for general values of X and N. Ask a user for the number of people and number of passes To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players. Output number and/or the name of a person being eliminated Output number and the name of the winner Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…
A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. For example: number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5. Write a program for general values of X and N. Ask a user for the number of people and number of passes To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players. Output number and/or the name of a person being eliminated Output number and the name of the winner Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…