JAVA + MATH EXAM
- or -
Post a project like this$$
- Posted:
- Proposals: 15
- Remote
- #1326120
- Expired
✪Software Developer ✪Web Developer (Java,Python, Android, jee, JSP, JSF, Java Fx,Vue, Blue J, Nuxt) ✪ Processing ✪ Elastic Search ✪ Database
Saitama
Lead Generation Expert I Expert Virtual Assistant I Web Researcher I Contact List Building Expert
Karachi
129977640801934382103378912396431244165129400413097591314615133619813682171388816
Description
Experience Level: Intermediate
General information for the business: math + java
Description of every module: Have an exam who need skills on math and java
if anyone is good at them please pm me your skype
there are few questions...
i will give you a example of a question so you can see the level required :
The Fibonacci sequence of numbers is 1, 1, 2, 3, 5, 8, 13, 21, 34, ... The first and second numbers are 1 and after that ni = ni-2 + ni-1, e.g., 34 = 13 + 21. A number in the sequence is called a Fibonacci number. Write a method with signature int closestFibonacci(int n) which returns the largest Fibonacci number that is less than or equal to its argument. For example, closestFibonacci(12) returns 8 because 8 is the largest Fibonacci number less than 12 and closestFibonacci(33) returns 21 because 21 is the largest Fibonacci number that is <= 33. closestFibonacci(34) should return 34. If the argument is less than 1 return 0. Your solution must not use recursion because unless you cache the Fibonacci numbers as you find them, the recursive solution recomputes the same Fibonacci number many times.
Description of requirements/functionality: After you tell me price we can contact on skype
i pay you only by pph!
Extra notes:
Description of every module: Have an exam who need skills on math and java
if anyone is good at them please pm me your skype
there are few questions...
i will give you a example of a question so you can see the level required :
The Fibonacci sequence of numbers is 1, 1, 2, 3, 5, 8, 13, 21, 34, ... The first and second numbers are 1 and after that ni = ni-2 + ni-1, e.g., 34 = 13 + 21. A number in the sequence is called a Fibonacci number. Write a method with signature int closestFibonacci(int n) which returns the largest Fibonacci number that is less than or equal to its argument. For example, closestFibonacci(12) returns 8 because 8 is the largest Fibonacci number less than 12 and closestFibonacci(33) returns 21 because 21 is the largest Fibonacci number that is <= 33. closestFibonacci(34) should return 34. If the argument is less than 1 return 0. Your solution must not use recursion because unless you cache the Fibonacci numbers as you find them, the recursive solution recomputes the same Fibonacci number many times.
Description of requirements/functionality: After you tell me price we can contact on skype
i pay you only by pph!
Extra notes:
Doni S.
0% (0)Projects Completed
-
Freelancers worked with
-
Projects awarded
0%
Last project
6 May 2024
United States
New Proposal
Login to your account and send a proposal now to get this project.
Log inClarification Board Ask a Question
-
https://join.skype.com/R3pEcdEUhJzy .. please connect . I can help . will discuss the price with you as well. Thanks!
-
how many questions included in test?
203089193720
We collect cookies to enable the proper functioning and security of our website, and to enhance your experience. By clicking on 'Accept All Cookies', you consent to the use of these cookies. You can change your 'Cookies Settings' at any time. For more information, please read ourCookie Policy
Cookie Settings
Accept All Cookies