Comupter assignment | Computer Science homework help

 Assignment 1A tests your knowledge of Recursion (Chapter 18. Design a program/project/driver class (the program/project/driver class file should be called YourNameAssignment1A;  replace YourName with your actual name), with the following exact1 methods in this order:  Method Description Method1 A recursive method that computes the Nth element in this series:  Method1(x, N)=1+x 1+x2+x3+…+xN where N is an integral number between 0 and 1000 and x is a floating-point number. The method  should return N+1 if x is 1. For example, Method1(1,0) is 1, Method1(1,1) is 2, Method1(1,2) is 3,  Method1(2,1) is 3 Method1(2,2) is 7. The method should receive the floating-point number x and integral number N as parameters and  return the Nth value in the series for that x and N.  Method2 A recursive method that finds the number of occurrences of a specific letter in a word (any case). The  method should receive the character for the Letter and the string with the Word as parameter and  return the number of occurrences of the Letter in Word. For example, Method2(‘a’, “cat”) is 1,  Method2(‘a’, “Azalea”) is 3, Method2(‘a’, “CALAMATA”) is 4, Method2(‘a’, “biotechnologies”) is 0.  main The main method should call the 2 methods as follows: ▪ Ask the user for a floating-point number X and print the first 21 values from the Method1 series  (call Method1 for X and all the Numbers between 0 and 20) and output them in a table format,  with first column showing the value for the Number and the second column showing the  corresponding value computed from Method1(X, Number) call. For example, if the user enters 2 for the floating-point number X, the output should be: N METHOD1(2, N) 0 1 1 3 2 7 … (and so on until 20) ▪ Ask the user for Word, and use Method2 to compute the number of occurrences of each Letter in the alphabet (from ‘a’ to ‘z’) in the Word (counting both lower and upper case of the Letter)  and output it in a table format with first column showing the letter and the second column  showing the corresponding number of occurrences computed from the Method2(Letter, Word) call). For example, if the user enters “cat” for the Word, the output should be: Letter METHOD2(Letter, ”cat”) A 1 B 0 C 1 … (and so on until Z) 

Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more