The Fibonacci series begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms. The first few terms are: 0, 1, 1, 2, 3, 5, 8, 13, 21, ... Write an algorithm in pseudo code to generate and print the first N terms of the Fibonacci series where N is user-defined. Pay attention to how your algorithm prints the first two terms.

The Fibonacci series begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the two preceding terms. The first few terms are: 0, 1, 1, 2, 3, 5, 8, 13, 21, ... Write an algorithm in pseudo code to generate and print the first N terms of the Fibonacci series where N is user-defined. Pay attention to how your algorithm prints the first two terms.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

ALGO(A)x = A[0]p = -1r = nwhile (True) { do { p = p + 1 } while (A[p] < x) do { r = r - 1 } while (A[r] > x) if (p >= r ){ return r } exchange A[p] and A[r]} From the above algorithm, we have to state whether the following statements are True or False(With explanation) (A) At the end of each iteration of the while loop of Line 4, each index of A smaller than p contains an integer smaller than x. (B) At the end of each iteration of the while loop of Line 4, each index of A larger than r contains an integer larger than or equal to x. (C) When ALGO terminates, the integer at index r is x.
use JAVA to write the code. : Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbers The algorithm: given two numbers, n1 and n2: Divide n1 by n2 and let r be the remainder. If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.) Set n1 to the value of n2, set n2 to the value of r, and go back to step 1. Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad. Catch this problem as it happens and make the user enter another value until they enter an acceptable one. Give an appropriate error message if this happens.
I need to write a recursive Java program to count the number of muck-free regions in a lagoon. The Lagoon is represented by a rectangle of N x M squares. Each square contains either muck ('M') or sand ('.'). A region is defined as a connected set of one of more squares with sand in it, where a square is considered to connect to all eight of its adjacent squares. Sample input/output is shown in picture attached
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.
In python, Problem Description:Sheldon and Leonard are physicists who are fixated on the BIG BANG theory. In order to exchange secret insights they have devised a code that encodes UPPERCASE words by shifting their letters forward. Shifting a letter by S positions means to go forward S letters in the alphabet. For example, shifting B by S = 3 positions gives E. However, sometimes this makes us go past Z, the last letter of the alphabet. Whenever this happens we wrap around, treating A as the letter that follows Z. For example, shifting Z by S = 2 positions gives B. Sheldon and Leonard’s code depends on a parameter K and also varies depending on the position of each letter in the word. For the letter at position P, they use the shift value of S = 3P + K. For example, here is how ZOOM is encoded when K = 3. The first letter Z has a shift valueof S = 3 × 1 + 3 = 6; it wraps around and becomes the letter F. The second letter, O, hasS = 3 × 2 + 3 = 9 and becomes X. The last two letters…
Euclid’s algorithm (or the Euclidean algorithm) is an algorithm that computes thegreatest common divisor, denoted by gcd, of two integers. Below are the original versions ofEuclid’s algorithm that uses repeated subtraction and another one that uses the remainder.int gcd_sub(int a, int b){ if (!a) return b; while (b) if (a > b) a = a – b; else b = b – a; return a;}int gcd_rem(int a, int b){ int t; while (b) { t = b; b = a % b; a = t; } return a;}1. Trace each of the above algorithm using specific values for a and b.2. Compare both algorithms.
The Binary Search algorithm works by testing a mid-point, then eliminating half of the list. In this exercise, you are going to take our binary search algorithm and add print statements so that you can track how the search executes. Inside of the recursive binary search function, add print statements to print out the starting, ending, and midpoint values each time. Then as you test a value, print out the results, either too high, too low, or a match. Sample Output Starting value: 0 Ending value: 9 Testing midpoint value: 4 Too high! Starting value: 0 Ending value: 3 Testing midpoint value: 1 Too low! Starting value: 2 Ending value: 3 Testing midpoint value: 2 Match!
You have an array of 10,000 subject scores for a high-school exam and you want to find the scores that are ranked from 4900 to 5100 that is the 201 most middle-ranked scores. Precisely describe two alternative algorithmic ap proaches to doing this - one of which is, in terms of time complexity, more efficient than the other.
Computer Science you are given a string X of length n and another string Y of length m ≤n. Say,the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < nand 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1.The task is to count the maximum number of non-overlapping sub-sequences of X that are thesame as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB(i.e., among overlapping sub-sequences, you can select only one of them).Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
Knowing that (x + 1)2 = x2 + 2x + 1,and that multiplication is more time consuming than addition, write an efficientprogram that displays the first ten natural numbers and their squares. Knowingthat (x + 1)3 = x3 + 3x2 + 3x + 1, the same process can be followed to displaythe cubes of these numbers.Here is a sample run: 0^2 = 01^2 = 12^2 = 4...8^2 = 649^2 = 8110^2 = 100
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
For the following problem please write an algorithm in plain English .i.e give details as to how you will solve the problem.A deck of 52 playing cards (as used for playing bridge) has to be sorted. At the end of the attempt, the sorted deck of cards should be on the table with the backside up.The order within a suite is Ace - King - Queen - Jack- 10 -9 - 8 - 7- 6- 5- 4- 3- 2. The very first card in the sorted deck is the Ace of Clubs, the next ones are the King of Clubs, the Queen of Clubs, the Jack of Clubs, the 10 of Clubs ... down to the 2 of Clubs. The next card is Ace of Spades, followed by the King of Spades etc. The hearts and diamonds cards follow in the same order.The deck of cards must be well-shuffled immediately prior to the challenge.Please write the algorithm in steps like you write a recipe for a dish.If any steps need to be repeated try to use a loop.Please try to not use any programming language.(IT's one question just with a lot of instructions to be understood well)