Implement the following functions in the same application in C#: 1. Given a number (integer) N (greater than 1). Implement a Fibonacci sequence of length N. (Function name ComputeFibonacciSequence ) ComputeFibonacciSequence receives N. 2. Given a list L with n numbers (integers), implement a function that returns whether that list is even prone or not (i.e.: the number of even numbers in the list must be higher than that of the odd numbers.) (Function name ComputeEvenProne) - Return 1 if the list is even prone, return 0 if it is not. ComputeEvenProne receives L.

Implement the following functions in the same application in C#: 1. Given a number (integer) N (greater than 1). Implement a Fibonacci sequence of length N. (Function name ComputeFibonacciSequence ) ComputeFibonacciSequence receives N. 2. Given a list L with n numbers (integers), implement a function that returns whether that list is even prone or not (i.e.: the number of even numbers in the list must be higher than that of the odd numbers.) (Function name ComputeEvenProne) - Return 1 if the list is even prone, return 0 if it is not. ComputeEvenProne receives L.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Implement a program that contains the following two functions: 1. A function that accepts a list of numbers as an argument, the function should recursively calculate the sum of all the numbers in the list and returns that value2. A function that uses recursion to raise a number to a power. The function should accept two arguments: the number to be raised, and the exponent. Assume the exponent is a positive integer
Write a Haskell function descending that receives a list and returns whether its values are in descending order. For example, given [], [42, 9, 9, 7] and "ymca" the function returns True; given [11, 5, 3, 4], "utopia" and "yummy" it returns False. ghci> descending "utopia" False
Edsgar Dijkstra is known for his work on programming languages. Hecame up with a neat problem that he called the Dutch National Flagproblem: given a list of strings, each of which is either 'red', 'green', or 'blue'(each is repeated several times in the list), rearrange the list so that thestrings are in the order of the Dutch national flag—all the 'red' stringsfirst, then all the 'green' strings, then all the 'blue' strings.Write a function called dutch_flag that takes a list and solves this problem.
WRITE IN HASKELL, and post screenshots of result or no thumbs up, Write a recursive function to count the number of items in a list for example, count[“apple”, “banana”, “strawberry”] will return the value 3
Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys", while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda". Restrictions: printf and strlen are the ONLY C library functions that you can use in the implementation. void rotate(char *w, int j)
Implement in C Programming 10.11.1: LAB: All permutations of names Given a main program that reads the number of one word names followed by the list of names, complete the recursive function PrintAllPermutations() to list all ways people can line up for a photo (all permutations of an array of strings). Function PrintAllPermutations() takes 4 parameters: an array of a permutation of names, the number of names in the array of the permutation of names, an array of available names, and the number of names in the array of available names. Function PrintAllPermutations() then creates and outputs all possible orderings of those names separated by a comma, one ordering per line. When the input is: 3 Julia Lucas Mia then the output is (must match the below ordering): Julia, Lucas, Mia Julia, Mia, Lucas Lucas, Julia, Mia Lucas, Mia, Julia Mia, Julia, Lucas Mia, Lucas, Julia (please add commas in code please) #include <stdlib.h>#include <stdio.h>#include <string.h> const int…
Write a Haskell recursive function pascal() that returns the nth line of the Pascal triangle. For example: if user types [11] as input (input type should be an integer list) then the program should return the next sequence of numbers, in this case it would be [1 2 1]. Use function ZIP for returning a list.
What would be a way in implementing the Josephus problem in C++ using a vector or a list? That takes in three parameters, one the number of knights for the knight parameter. The second parameter, "skip", is the number of knights to skip and to execute the next night. Then the third parameter "start", is the index of the knight to execute first.
Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function (defun gcd (n m)"Returns the gcd of two numbers" (let ((dividend n) (divisor m) (remainder 1)) (while (/= remainder 0) (setq remainder (mod dividend divisor)) (setq dividend divisor) (setq divisor remainder)) dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.
Write a Lisp function called reverse that recursively reverses a string. In order to put the recursive call at the end of the function, do it this way: concatenate the last character in the string with the result of making a recursive call and sending everything *but* the last letter. Test your function with this code and paste both the code and the output into the window (reverse "")(reverse "a")(reverse "ab")(reverse "abc")(reverse "abcd")
The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.
Please answer it in Python Write a decale function that takes as an argument a list l and a number d and returns the list obtained from l by adding an offset of d to each element of l. Example: decale([4, 17, 12], 3) is [7, 20, 15]. Write a function intercale_zeros that takes as an argument a list l and returns the list obtained from l by inserting a zero after each element of l. Example: intercale_zeros([4, 17, 12]) is [4, 0, 17, 0, 12, 0].