Can I get help in racket please.Please do not solve in any otherprograms/language.When writing the following recursive functions, use only car/first, cdr/rest and consfunctions. Do not use any built-in functions, except expt.4. Write a recursive function, sumofSqr, that that will return the sum of the squares of thefirst N natural numbers.(sumofSqr 3)(sumofSqr 10) ===> 385(sumofSqr 0)===> 14(12 + 22 + 32 )===> 05. Write a recursive function, mult5,at will return how many numbers in the list aremultiples of 5.(mult5 '(60 22 13 25) ===> 2(mult5 '(5) ===> 1(mult5 '()===> 06. Write a recursive function, getlast, that will return the last element in a list. If the list isempty, return the string "empty list".7. Write a recursive function, countdown, that takes any non-negative integer start as itsargument returns a list of all the positive integers less than or equal to start, indescending order:(countdown 5) ===> (5 4 32 1)(countdown 1) ===> (1)(countdown 0) ===> ()

For part a) I didn't have used any inbuilt function as it can be done logically. I have implemented…

4. Write a recursive function, sumofSqr, that that will return the sum of the squares of the first N natural numbers. (sumofSqr 3) (sumofSqr 10) ===> 385 (sumofSqr 0) ===> 14 ; (12 + 22 + 32 ) ===> 0 5. Write a recursive function, mult5, that will return how many numbers in the list are multiples of 5. (mult5 '(60 22 13 25) ===> 2 (mult5 (5) ===> 1 (mult5 '() ===> 0 6. Write a recursive function, getlast, that will return the last element in a list. If the list is empty, return the string "empty list".

4. Write a recursive function, sumofSqr, that that will return the sum of the squares of the first N natural numbers. (sumofSqr 3) (sumofSqr 10) ===> 385 (sumofSqr 0) ===> 14 ; (12 + 22 + 32 ) ===> 0 5. Write a recursive function, mult5, that will return how many numbers in the list are multiples of 5. (mult5 '(60 22 13 25) ===> 2 (mult5 (5) ===> 1 (mult5 '() ===> 0 6. Write a recursive function, getlast, that will return the last element in a list. If the list is empty, return the string "empty list".

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Write a program that performs the following functionalities: 1. Fibonacci: a recursive function that…

A: Note: Due to company policies I am compelled to solve only one question and that is the first…

Q: What type of recursion is used in the following function? int f(int n){ if (n==1) return 1; else…

Q: Using C Write a recursive function find_sum that calculates the sum of successive integers…

A: Here I have created a function named find_sum() which is called recursively to find the sum of…

Q: What type of recursion is used in the following function? int f(int n){ if (n==1) return 1; else…

A: Here the recursion is happened at the tail end of the conditional clause.

Q: For function sumtok, write the missing recursive call. This function returns the sum of the values…

A: Introduction: In Java, a method that calls itself is referred to as a recursive method. This is…

Q: Reversing an Array 1. Describe the definition of recursive function. oBase case(s) oRecursive…

A: Given,Reversing an Array1. Describe the definition of recursive function.oBase case(s)oRecursive…

Q: Write a recursive function flatten that takes a list as an argument and returns the flat version of…

A: Here is the detailed explanation of the solution

Q: For function decToBinary, write the missing parts of the recursion case. This function should return…

A: The missing recursive call is the call to the same function, decToBinary, with the argument being…

Q: Examples: addOdd(1) -> 1 addOdd(2) -> 1 addOdd(3) -> 4 addOdd(7) -> 16 public int addOdd(int n)…

A: The addodd() function calculates the sum of all positive odd numbers less than or equal to n. It…

Q: Part I Implement the Fibonnaci Sequence One of this week’s quiz questions referred to the…

A: Define fibonacci(). This function calculates the nth element of the Fibonacci sequence using…

Q: Write a recursive function: isRearranged (sl: str, s2: str)--> bool The function determines if the…

A: Introduction:- Below is the Python Program to check the second string is the result of rearranging…

Q: Write a recursive function code that finds the elements of the given sequence: a = 3a.+ n², and a 1.…

A: Write a recursive function code that finds the elements of the given sequence: a,= 3a1+n², and a…

Q: Complete the implementation for the recursive function repeat_digits, which takes a positive integer…

A: Code: # repeat_digits recursive function def repeat_digits(num): # base case if(num <…

Q: Please explain what the recursive function will do. This function takes a string argument (str), and…

A: The provided recursive function Mystery takes a string str and two integer arguments, i and x. It…

Q: Write a recursive function that takes a number n and a list num_list as inputs, then determines…

A: Given: Write a recursive function that takes a number n and a list num_list as inputs, then…

Q: What is the return value of the function call Comp(4, 5), given the recursive function Comp defined…

A: INTRODUCTION: A recursive function is a routine that calls itself repeatedly, either directly or…

Q: An arithmetic sequence starts 2, 5, . . . Write a recursive definition for this sequence…

A: Arithmetic sequence: Arithmetic sequence is also known as Arithmetic progression. It is a sequence…

Q: Comp(3, 4), given the recursive function Comp defined below: int Comp(int a,

A: Dear Student, The answer to your question is given below -

Q: Make a code using Recursion The countSubstring function will take two strings as parameters and…

A: The source code of the program #Main.java class Main { public static void main(String[] args)…

Q: Write a recursive function to see if the first letter matches the last letter, return the middle…

A: def firstCharacter(str): return str[:1] # Returns the last character of a string strdef…

Q: Computing Powers, p(x,n)=xn 1. Describe the definition of recursive function. oBase case(s)…

A: In this question we have to understand and write the code for the computing powers p(x,n)=xn1.…

Q: Which is the base case of the following recursion function: def mult3(n): if n == 1:…

A: Answer : option a

Q: The 4th problem mimics the situation where eagles flying in the sky can be spotted and counted.…

A: According to the information given:- We have to follow the instruction in order to get desired…

Q: There are two important parts to every simple recursive function: the base case, and the recursive…

A: A recursive function which refers to the function in the code that refers to itself for execution.…

Concept explainers

Declaring and Defining the function

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates a function and uses main() to call the function. Once the function gets executed, the control is transferred to the main program.

Question

Can I get help in racket please.
Please do not solve in any other
programs/language.
When writing the following recursive functions, use only car/first, cdr/rest and cons
functions. Do not use any built-in functions, except expt.
4. Write a recursive function, sumofSqr, that that will return the sum of the squares of the
first N natural numbers.
(sumofSqr 3)
(sumofSqr 10) ===> 385
(sumofSqr 0)
===> 14
(12 + 22 + 32 )
===> 0
5. Write a recursive function, mult5,
at will return how many numbers in the list are
multiples of 5.
(mult5 '(60 22 13 25) ===> 2
(mult5 '(5) ===> 1
(mult5 '()
===> 0
6. Write a recursive function, getlast, that will return the last element in a list. If the list is
empty, return the string "empty list".
7. Write a recursive function, countdown, that takes any non-negative integer start as its
argument returns a list of all the positive integers less than or equal to start, in
descending order:
(countdown 5) ===> (5 4 32 1)
(countdown 1) ===> (1)
(countdown 0) ===> ()

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

SML programming Write a recursive function np(n) which takes a non negative n and generates a list of numbers from n+1 down to 0. You may assume that input of n is always valid. Must use identical function name and parameter(s). np(4)⟶[5,4,3,2,1,0]
in C programing Write a recursive function that returns 1 if an array of size n is in sorted order and 0 otherwise. Note: If array a stores 3, 6, 7, 7, 12, then isSorted(a, 5) should return 1 . If array b stores 3, 4, 9, 8, then isSorted(b,4) should return 0.int isSorted(int *array, int n){
Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"
Consider the recursive function provided above. After the initial call to the function ham has been made with argument 26 then how many subsequent recursive calls will be made before a value a final result can be returned? This question is internally recognized as variant 235. Q11) 1 2 3 4 5 6 7 8 none of the above
Midterm Practice Problems 1. Use recursion to write a function count_ones that returns how many Is there are in a number n when represented in decimal (base 10). For example, 1231 has two 1s. You can assume that n is nonnegative and at most 9 digits long. Do not use global (or static) variables. In main perform at least three tests of count_ones and use assert to check that the returned value is correct. Your function should have the following prototype: // count_ones (n) returns the number of is in the decimal representation of n // requires: 0 <= n < 10^9 int count_ones (int n);
Write a recursive function that, given a sequence of comparable values, returns the count of elements where the current element is less than the following ( next ) element in the given sequence. See the examples given below. def count_ordered ( seq ) : """ Input : A sequence of comparable elements Output : The number of elements that are less than the following element in the sequence Example : >>> count_ordered ( [ 1 , 2 , 3 , 4 , 5 , 6 ] ) 5 >>> count_ordered ( ( 1 , 12, 7.3 , -2,4 ) ) 2 >>> count_ordered ( 'Python' ) 2 >>> count_ordered ( [ 6 ] ) 0 >>> count_ordered ( [ ] ) 0 """ In the first example above , count_ordered ( [ 1,2,3,4,5,6 ] )the returned answer is 5 because for all the first 5 numbers the current number is less than the next number. In the second example above, count_ordered ( ( 1,12,7.3 , -2,4 ) )the…
Write code to complete raise_to_power(). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(), would be more common.Sample output with inputs: 4 24^2 = 16 def raise_to_power(base_val, exponent_val): if exponent_val == 0: result_val = 1 else: result_val = base_val * ''' Your solution goes here ''' return result_val user_base = int(input())user_exponent = int(input()) print('{}^{} = {}'.format(user_base, user_exponent, raise_to_power(user_base, user_exponent)))
Matlab Question
1. Given, nCr= n! (n-r)!r!" Write a function to compute nCr without recursion.
•rewrite calculateSum function as a recursive function. m(i) = m(i-1) + i/(i+1), where i >=1
In program C Write a recursive function find_sum(n)that calculates the sum of successive integers starting at 1and ending at n(i. e., find_sum( n) = 1 + 2 . . .+( n -1) + n.
Practice recursion on lists Practice multiple base conditions Combine recursion call with and,or not operators Search for an element in a list using recursion Instructions In this lab, we will write a recursive function for searching a list of integers/strings. Write a recursive function to determine if a list contains an element. Name the function recursive_search(aList, value), where aList is a list and value if primitive type is the object we want to search for. Return a boolean, specifically True if and only if value is an element of aList else return False from the function Examples: recursive_search([1,2,3], 2) == True recursive_search([1,2,3], 4) == False recursive_search([ ], 4) == False recursive_search([ [ 1 ], 2 ], 1) == False # -----> (because the list contains [ 1 ] and 2, not 1) Hint: Think about what the base case is? When is it obvious that the element is not in the list? If we are not at the base case, how can you use the information about the first element of the…