Algorithm AnalysisStart with 102 coins on a table, 98 showing heads and 4 showing tails. There are two ways tochange the coins:• flip over any ten coins, or• place n+ 1 additional coins, all showing tails, on the table where n is the number of headscurrently showing on the table.For example, you might begin by flipping nine heads and one tail, yielding 90 heads and 12 tails,then add 91 tails, yielding 90 heads and 103 tails.(a) Model this situation as a state machine, carefully defining the set of states, the start state, andthe possible state transitions.(b) Optionally, explain how to reach a state with exactly one tail showing.(c) Consider the following derived variables:C ::= the number of coins on the table H ::= the number of heads on the tableT::= the number of tails on the table C, ::= parity (C)H2 ::= parity(H)T2 ::= parity(T)Here the parity : Z → {0,1} function is defined as parity(n) = 0 when n is even and 1otherwise.Which of these variables is strictly decreasing. Optionally, prove your conclusion.(d) Someone claims that this algorithm/process should be able to reach a state where there isexactly one head. Prove using the Invariant Principle that they are wrong. Optionally, verifythat the predicate you use is indeed a preserved invariant.(e) Unrelated to the above problem, describe the asymptotic behavior of f(n) ::= n+lnn+(lnn)-by relating it using the Big-Theta relation to one fo the following: n,n' logn,n, 1,2", 2" In".

Answer: I have given answer in handwritten format.

Algorithm Analysis Start with 102 coins on a table, 98 showing heads and 4 showing tails. There are two ways to change the coins: • flip over any ten coins, or • place n+ 1 additional coins, all showing tails, on the table where n is the number of heads currently showing on the table. For example, you might begin by flipping nine heads and one tail, yielding 90 heads and 12 tails, then add 91 tails, yielding 90 heads and 103 tails. (a) Model this situation as a state machine, carefully defining the set of states, the start state, and the possible state transitions. (b) Optionally, explain how to reach a state with exactly one tail showing. (c) Consider the following derived variables:

Algorithm Analysis Start with 102 coins on a table, 98 showing heads and 4 showing tails. There are two ways to change the coins: • flip over any ten coins, or • place n+ 1 additional coins, all showing tails, on the table where n is the number of heads currently showing on the table. For example, you might begin by flipping nine heads and one tail, yielding 90 heads and 12 tails, then add 91 tails, yielding 90 heads and 103 tails. (a) Model this situation as a state machine, carefully defining the set of states, the start state, and the possible state transitions. (b) Optionally, explain how to reach a state with exactly one tail showing. (c) Consider the following derived variables:

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

Given a list of scores and a passing score, you are asked to find out the average score and the number of scores which are equal to or higher than the passing score. For examples, the list of scores is as follows: 46, 58, 56, 59, 89, 93, 77, 98, 100, 64 If the passing score is 60, then the answers should be 74 and 6. If the passing score is 55, then the answers should be 74 and 9. Implement the above task using MIPS in QtSpim. Initialize the array of scores in memory using any integer values between 0 and 100. The passing score should be obtained from user’s input and the answer must be printed out. See the following screen snapshot for reference.
Write an algorithm that accepts a 2-digit number ranging from 20 to 99 and display all pair of 2-digit combinations that will sum up to your input.For example, let's assume that the user entered a 25, the algorithm should be able to display the following:15+10, 14+11, 13+12the positioning of these numbers doesn't make a difference so, if 15+10 is displayed, you don't have to display 10+15.HINT: There is a pattern on how the left digit is decremented and the right digit is incremented by 1.
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…
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.
In a scheduling program, we want to check whether two appointments overlap. For simplicity, appointments start at a full hour, and we use military time (with hours 0–24). The following pseudocode describes an algorithm that determines whether the appointment with start time start1 and end time end1 overlaps with the appointment with start time start2 and end time end2.If start1 > start2s = start1Elses = start2If end1 < end2e = endl Elsee = end2 If s < eThe appointments overlap.Else The appointments don’t overlap.Trace this algorithm with an appointment from 10–12 and one from 11–13, then with an appointment from 10–11 and one from 12–13.
Write this using java Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. m = 0 m > 0 m < 0 m = 1 m > 1 swap the rolls of x and y m < 1 m = infinity ( needs special test case) Include appropriate tests for ‘special case’ conditions. Insteadof “WritePixel” write to the screen the coordinates of the pixel that would be drawn.
Step 3: Complete the public boolean checkWin(int[][] board) method. In order to check if a puzzle is solved or not, we need to check if the current puzzle satisfy the row rule, column rule, and grid rule. So that is to check if every row of the puzzle contains the number 1 to 9 exactly once, every column contains the number 1 to 9 exactly once, and every 3X3 subgrid contains the number 1 to 9 exactly once. The nested loops for checking rows are given to you for your reference. Read the comments to understand it. Then complete the code to check the columns and the subgrids This is step three. On this practice problem we were given an incomplete java file that is being used to solve a suduko board. Ill try to copy and paste the code I have so far down below but I dont know how well that will work. import java.util.Arrays;import java.util.Random; public class Sudoku { public static final int[][] BOARD = {{4, 3, 5, 8, 7, 6, 1, 2, 9},{8, 7, 6, 2, 1, 9, 3, 4, 5},{2, 1, 9, 4, 3, 5, 7, 8,…
Artificial Intelligence - Local Search Starting from a randomly generated state of the 15-puzzle game (https://en.wikipedia.org/wiki/15_puzzle), steepest-ascent hill-climbing (the vanilla version of hill-climbing search) gets stuck 76% of the time, i.e., solving only 24% of problem instances. But it works very quickly, i.e., it takes just 6 steps on average when it succeeds and 5 steps when it gets stuck. In contrast, if sideways moves are allowed, this raises the percentage of problem instances solved by hill-climbing from 24% to 81%, with the success at a cost: the algorithm averages roughly 7 steps for each successful instance and 32 steps for each failure. Now suppose that we are implementing random-restart hill climbing (i.e., if a search fails, it keeps to try, and try, until it gets a success) by the following two versions: one uses vanilla steepest-ascent hill climbing, and the other one uses hill climbing with sideways moves. Can you please tell which version of…
Write this using java Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. m = 0 m > 0 m < 0 m = 1 m > 1 swap the rolls of x and y m < 1 m = infinity ( needs special test case) Include appropriate tests for ‘special case’ conditions. Insteadof “WritePixel” write to the screen the coordinates of the pixel that would be drawn. Please provide photos that it works and so I can understand the code better
A Fibonacci sequence is a sequence of numbers where each successivenumber is the sum of the previous two. The classic Fibonacci sequencebegins: 1, 1, 2, 3, 5, 8, 13, .... Write a program that computes the nthFibonacci number where n is a value input by the user. For example, ifn = 6, then the result is 8.
Write an algorithm that computes the Body Mass Index (BMI) given the heights and weights of students. The algorithm should first read the total number of students and then read the height and weight of each student to calculate and print the BMI category A student is considered Underweight if the BMI is less than or equal to 18.5; Normal Weight if between 18.5 and 24.9; Overweight if between 25 and 29.9; and Obese if greater than or equal to 30.