Please place all of the following functions (defun …) into a SINGLE .lsp file As such,...

Question

Question

Please place all of the following functions (defun …) into a SINGLE .lsp file As such,...

Please place all of the following functions (defun …) into a SINGLE .lsp file

As such, be sure to use the EXACT SAME function names and parameter numbers and orders I provide 

Write a function ONEFIB that takes a single parameter n and returns the nth Fibonacci number.

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Function:-

(defun ONEFIB (n)
(setf a 0) // initial value of a=0
(setf b 1) // initial value ob b=1
(do ((i 3(+ i 1))) ((> i n))
(setf c (+ a b)) // add a and b, assign to c
(setf a b) // set value of b to a
(setf b c)) // set value of c to b
(format t " ~d" c) )

Output:- 5

Add a comment

Answer 2

Similar Homework Help Questions

Please place all of the following functions (defun …) into a SINGLE .lsp file As such,...

Please place all of the following functions (defun …) into a SINGLE .lsp file As such, be sure to use the EXACT SAME function names and parameter numbers and orders I provide Write a function ONEFIB that takes a single parameter n and returns the nth Fibonacci number. Write a function ALLFIB that takes a single parameter n and returns a list of the first n Fibonacci numbers. Do not worry about efficiency here. HINT: You can use ONEFIB...
In mathematics, the Fibonacci numbers are the series of number that exhibit the following pattern: 0,1,1,2,3,5,8,13,21,34,55,89,144,.......

In mathematics, the Fibonacci numbers are the series of number that exhibit the following pattern: 0,1,1,2,3,5,8,13,21,34,55,89,144,.... In mathematical notation the sequence Fn of Fibonacci number is defined by the following recurrence relation: Fn=Fn-1+Fn-2 With the initial values of F0=0 and F1=1. Thus, the next number in the series is the sum of the previous two numbers. Write a program that asks the user for a positive integer N and generate the Nth Fibonacci number. Your main function should handle user...
Use Ocaml language writing a bunch of simple functions in a file called warmups.ml. Write these...

Use Ocaml language writing a bunch of simple functions in a file called warmups.ml. Write these functions in a pure functional style only: no assignment statements, no explicit loops, and no arrays! Write a function to compute fibonacci numbers (in the sequence 0, 1, 1, 2, 3, 5, ... where each number is the sum of the previous two numbers on the list). Use pattern matching but no if/then/else statements. Use a tail recursive solution to make sure the function...

FUNCTIONS In this assignment, you will revisit reading data from a file, and use that data...

FUNCTIONS In this assignment, you will revisit reading data from a file, and use that data as arguments (parameters) for a number of functions you will write. You will need to: Write and test a function square_each(nums) Where nums is a (Python) list of numbers. It modifies the list nums by squaring each entry and replacing its original value. You must modify the parameter, a return will not be allowed! Write and test a function sum_list(nums) Where nums is a...
Write C++ Code in single source file (.cpp file) containing following user defined functions: 1. IsEven-...

Write C++ Code in single source file (.cpp file) containing following user defined functions: 1. IsEven- takes an integer input (one argument of type int) and return true or false. 2. IsPositive- takes a float input (one argument of type double) and return a Boolean value. The function returns the true if its argument is positive and false if its argument is zero or negative. 3. IsPrime- takes an integer input and return true or false. 4. NumOfDigits- takes an...
C++ 2. (a) Write a function, printdixisors, that takes a single integer parameter and prints all...

C++ 2. (a) Write a function, printdixisors, that takes a single integer parameter and prints all the numbers less that the parameter that are divisors of the parameter (i.e. divides it without a remainder) including 1. So printdivisors(6) will print 1,2,3. Note you may use a wrapper function or default parameters. (b) Write a function, sumdixisors, that takes a single integer parameter and returns the sum of all the divisors of the parameter (including 1). So sumdivisors(6) will return 6...

Write a Python file containing the following functions. Also turn in the output from testing the...

Write a Python file containing the following functions. Also turn in the output from testing the functions. All arguments to the functions may be hard-coded. Function 1 takes a list of strings as a parameter and returns a list of strings consisting of all the strings in the original list that have identical consecutive letters. For example: fun1 ([llama, good, cat, abba, abab, 112, dog]) returns [llama, good, abba, 112] Function 2 takes an integer (n), representing the number of...
Please Use C++ for coding . . Note: The order that these functions are listed, do...

Please Use C++ for coding . . Note: The order that these functions are listed, do not reflect the order that they should be called. Your program must be fully functional. Submit all.cpp, input and output files for grading. Write a complete program that uses the functions listed below. Except for the printodd function, main should print the results after each function call to a file. Be sure to declare all necessary variables to properly call each function. Pay attention...
This is Python coding question, and topic is recursive. Can anyone help me figuring this out?...

This is Python coding question, and topic is recursive. Can anyone help me figuring this out? (Only recursive function is allowed.) Thanks. Write a function called Fibonacci(n) that takes as a parameter an integer n and returns the nth Fibonacci number. The first two Fibonacci numbers are 1 and every subsequent one is the sum of the previous two: 1, 1, 2, 3, 5, 8, 13, .... Write a recursive function to count the number of uppercase letters in a...

Write a C program, containing the following functions. Function int recursive_fibonacci(int n) computes and returns the...

Write a C program, containing the following functions. Function int recursive_fibonacci(int n) computes and returns the nth F(n) using recursive algorithm (i.e., recursive function call). Fibonacci numbers are defined by F(1)=F(2)=1, F(i) = F(i-1)+F(i-2), i=2,… . Function int iterative_fibonacci(int n) computes and returns the nth Fibonacci number F(n) using iterative algorithm (i.e., loop). The main function measures the memory usage and run time of iterative_fibonacci(40) and recursive_fibonacci(40), and does the comparison. To capture the execution time by millisecond, it needs...

Please place all of the following functions (defun …) into a SINGLE .lsp file As such,...

Homework Answers

Add Answer to:
Please place all of the following functions (defun …) into a SINGLE .lsp file As such,...

Post as a guest

Earn Coins