Your solutions can use: • the [] operator to get and set list elements (e.g., lst[i] and lst[i] = a) • the in and not in operators (e.g., a in lst) • the list concatenation operator (e.g., lst1 + lst2) • the list replication operator (e.g., lst * n or n * lst) • Python's built-in len, min and max functions, unless otherwise noted. Your solutions cannot use: • list slicing (e.g., lst[i : j] or (lst[i : j] = t) • the del statement (e.g., del lst[0]) • Python's built-in reversed and sorted functions. • any of the Python methods that provide list operations, e.g., sum, append, clear, copy, count, extend, index, insert, pop, remove, reverse and sort • list comprehensions Automated testing is required using python language Use the function design recipe to develop a function named Fibonacci_sequence. The function takes an integer n. The function returns a list containing the Fibonacci sequence, up until the nth term. The Fibonacci sequence is defined as Fn = Fn-1 + Fn-2. For example, if n = 6, then the Fibonacci sequence is 0, 1, 1, 2, 3, 5 (i.e., 6 terms). The function returns a list [0, 1, 1, 2, 3, 5]. If n = 7, then the Fibonacci sequence is 0, 1, 1, 2, 3, 5, 8 (i.e., 7 terms)
Your solutions can use:
• the [] operator to get and set list elements (e.g., lst[i] and lst[i] = a)
• the in and not in operators (e.g., a in lst)
• the list concatenation operator (e.g., lst1 + lst2)
• the list replication operator (e.g., lst * n or n * lst)
• Python's built-in len, min and max functions, unless otherwise noted.
Your solutions cannot use:
• list slicing (e.g., lst[i : j] or (lst[i : j] = t)
• the del statement (e.g., del lst[0])
• Python's built-in reversed and sorted functions.
• any of the Python methods that provide list operations, e.g., sum, append, clear, copy, count, extend, index, insert, pop, remove, reverse and sort
• list comprehensions
Automated testing is required
using python language Use the function design recipe to develop a function named Fibonacci_sequence. The function takes an integer n. The function returns a list containing the Fibonacci sequence, up until the nth term. The Fibonacci sequence is defined as Fn = Fn-1 + Fn-2. For example, if n = 6, then the Fibonacci sequence is 0, 1, 1, 2, 3, 5 (i.e., 6 terms). The function returns a list [0, 1, 1, 2, 3, 5]. If n = 7, then the Fibonacci sequence is 0, 1, 1, 2, 3, 5, 8 (i.e., 7 terms)
Step by step
Solved in 2 steps