Write in the programming language Racket the function L Function L: Sum of numbers of a linear list of numbers – sum(l) The function L should be designed from scratches.You may use only the basic build-in or standard function(s) such as: car, cdr, null, null?, first, rest, if, define, and, or. PLEASE provide : Algorithm Discussion At least three test examples – program executions including: - Input data - Output data /// Image of the screen.

Write in the programming language Racket the function L Function L: Sum of numbers of a linear list of numbers – sum(l) The function L should be designed from scratches.You may use only the basic build-in or standard function(s) such as: car, cdr, null, null?, first, rest, if, define, and, or. PLEASE provide : Algorithm Discussion At least three test examples – program executions including: - Input data - Output data /// Image of the screen.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Consider the function, f(n), defined by the following code int f(int n) { int r = 0; if ( n % 2 == 0 ) return 1; // when n is even while ( n > 1 ) { n = n – 3; r++; } return r; } From the definitions of big-Theta and little-oh: Prove or disprove that f(n) is Θ ( n ) 2. Prove or disprove that f(n) is o ( n^2 ) ( note: function f(n) as defined by the code, that is, the return value, and is not asking about the runtime of the code.)
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.
Write the code in python to define a function has_repeat(mystr), which takes a string parameter and returns a boolean result. - If mystr has a character that is repeated (count is more than 1 for that character), return True - Otherwise, return False Hint: You can solve this problem by iterating over the characters in mystr and comparing each character's count with 1. For example: Test Result print(has_repeat("Happy")) True print(has_repeat("sad")) False print(has_repeat("salmons")) True print(has_repeat("Trouts")) False
(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
Describe in detail what the type means, including how its components are related from the definition of following function “foo” in SML. Write an example code of your own function foo which has the same type definition. Then, test your function foo by feeding sample input and write expected output (result). Briefly explain your code and experiment to get any credit. foo: ('a -> bool) -> 'a list -> 'a list
Please answer it in Python Write a double_consonant function , It takes a word as a parameter and has two return values ： A Boolean value equals True If the word contains a double consonant （ The same consonant twice in a row ）, under these circumstances , The second value returned is the double consonant ; If there are no double consonants , Function should return False and None. relevant information ： To simplify the exercise , We don't use words that contain multiple double consonants （ for example ,“successor”） Test your functionality on . Example ： double_consonne('arrivee') vaut True, 'r'.double_consonne('bonbon') vaut False, Nonedouble_consonne('reussite') vaut True, 's'
1.The following is the C code that you need to implement for this lab: uint8_ t f(uint8_tn) return(n<2)?(n):(f(n-1)+f(n-2)); The main function can be assumed as follows: int main() uint8_ t x; x=f(???); return 0; Obviously, " ? ? ? " is representing a value used to test the algorithm! Is "f"recursive? a.No answer text provided. b.Yes c.no d.depends on whether it is in for main 2.First, make the code in the previous question an actual C program so that it can be compiled and it runs. Play with it so that you feel comfortable with the logic of the code. Then implement the code in TTPASM. Note that you need to preserve the actual C code structure, this means you cannot it into a non-recursive subroutine. Furthermoreall conventions discussed in class regarding subroutines must be followed. The idea is that I should be able to substitute f with my own code, and main should work. Or, I can substitute main with my own, and f should work. Attach the source code of your assembly…
In this challenge, the task is to debug the existing code to successfully execute all provided test files. Python supports a useful concept of default argument values. For each keyword argument of a function, we can assign a default value which is going to be used as the value of said argument if the function is called without it. For example, consider the following increment function: defincrement_by(n,increment=1):returnn+increment The functions works like this: >>>increment_by(5,2)7>>>increment_by(4)5>>> Debug the given function print_from_stream using the default value of one of its arguments. The function has the following signature: defprint_from_stream(n,stream) This function should print the first values returned by get_next() method of stream object provided as an argument. Each of these values should be printed in a separate line. Whenever the function is called without the stream argument, it should use an instance of EvenStream class defined in…
I need help in this mcq practice If the function fOne() is called as shown below: int x = fOne (2); What is the lowest value the variable nRet will obtain throughout the execution of function fOne() until right before returning the result? Line# Code 1 int fOne(int nNum) 2 { 3 int i = 0, nRet = 0; 4 for(i = nNum; i > -nNum; i -= 2) 5 { 6 nRet -= nNum; 7 } 8 return -nRet; 9 } Group of answer choices A)-2 B)-4 C)2 D)4 Next
How can the following function be simplified so that it has a time complexity of O(n) or faster?For your information, the specifications of the functions are as follows: Using numbers ranging from 0 to 15 (inclusive), create all possible lists which sum up to K and have a length of N. Duplicated numbers are allowed as long as it fulfills the conditions above (this means [0,0,1], [0,1,0] and [1,0,0] are all correct outputs if K=1 and N=3). When instantiated with the list function, the list size of the function should be the number of all lists. For example, given K=23 and N=2, the expected list size is 8. The function must be able to accept N=10 and be finished before 9 seconds. Do not use itertools or external libraries.
Write a python program which contains a user-defined function called 'input_data'. This function should have a try/except block in it that will attempt to input a list of three players' last name and their associated number. For example, 'Jones', 44 would be one such pair of data. These name/number pairs should be added to the list, with the name first, and the number following. The list should be returned by the function. If there is an error inputting the names, the except block should set the player names to 'none', 0 for all three cases. Then, in a separate python program, take this function and place it into a loadable module called module1. Write a program that imports module1 and calls the function, then prints the string returned by the module.
python this is connected to the last problem - the second part of the question is added. my attempt on this problem shows that the part b) (approaches N*NH) is not really wokring.. a) (answered) with a function “harmonic(n)” that computes the n-th harmonic number, write a function “harmonic_all(n)” that returns the number of values generated until all values are obtained as a function of the range of possible values n, then write a function “harmonic_sim(n)” that repeats “harmonic_all(n)” a total of n_sim = 100 times. (Attaching the code from the answer for a) d) Show that as n increases (e.g., with a doubling experiment), from n = 2 to n_max = 1,000, the value of “coupon_sim(n)” approaches “n * Hn”.