Using the functional programming language RACKET solve the following problem: The prime-factors function takes an integer n as input (n į 0) and returns a list containing the prime factors of n in ascending order. Prime factors are the prime numbers that divide a number exactly. If all the prime factors are multiplied, the original number is obtained.

Using the functional programming language RACKET solve the following problem: The prime-factors function takes an integer n as input (n į 0) and returns a list containing the prime factors of n in ascending order. Prime factors are the prime numbers that divide a number exactly. If all the prime factors are multiplied, the original number is obtained.

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

Similar questions

Computer Science Prove that the set M = {x ∈ R: x 2 = 2a3 b , a ∈ N, b ∈ N} is countably infinite. Your solution should either give a bijective function f : N → M or give pseudo-code of a program that prints all the values of such a function, in the following format (in this case you don’t have to define f explicitly, but need to also show the first five lines of output): 0: element of M 1: another element of M 2: yet another element of M
The binomial coefficient C(N,k) can be defined recursively as follows: C(N,0) = 1, C(N,N) = 1, and for 0 < k < N, C(N,k) = C(N-1,k) + C(N - 1,k - 1). Write a function and give an analysis of the running time to compute the binomial coefficients as follows: A. The function is written recursively.
The code of a sequential search function is shown on textbook page 60. In fact, if the list is already sorted, the search can halt when the target is less than a given element in the list. For example, given my_list = [2, 5, 7, 9, 14, 27], if the search target is 6, the search can halt when it reaches 7 because it is impossible for 6 to exist after 7. Define a function linearSearchSorted, which is used to search a sorted list. This function displays the position of the target item if found, or ‘Target not found’ otherwise. It also displays the elements it has visited. To test your function, search for these targets in the list [2, 5, 7, 9, 14, 27]: 2, 6, 14, 27 and 28.
Rewrite the below function, viral-growth in Racket, so that it can be passed to the below repeated function and so that the count variable of repeated (rather than a minsvariable in viral-growth) determines how many minutes of viral growth pass. Rewrite viral-growth to accept only one argument, the number of people who start the spread, and to return a lambda that accepts a list argument. (define (viral-growth ppl) (lambda (ls) [ YOUR CODE GOES HERE] (define (repeated f count) (lambda (x) (if (= count 0) x (f ((repeated f (- count 1)) x))))
Using a Push Down Automaton (PDA), determine if the following function is valid code according to the given set of productions. int Max ( int x, int y ) { int z ; if ( x >y ) z = x ; else z = y ; return ( z ) ; } Set of Productions: P01: FN → FN–HEAD FN–BODY P02: FN–HEAD → TYPE id ( PARAM–LIST ) P03: TYPE → char P04: TYPE → int P05: TYPE → real P06: PARAM–LIST → TYPE id P07: PARAM–LIST → PARAM–LIST , TYPE id P08: FN–BODY → { VAR–DECL STMT return ( EXPRESN ) ; } P09: VAR–DECL → λ P10: VAR–DECL → TYPE ID–LIST ; P11: VAR–DECL → VAR–DECL TYPE ID–LIST ; P12: ID–LIST → id P13: ID–LIST → ID–LIST , id P14: STMT → λ P15: STMT → SIMPLE–STMT P16: STMT → SELECT–STMT P17: STMT → REPEAT–STMT P18: STMT → SEQUENCE–STMT P19: SIMPLE–STMT → ASSIGN–STMT P20: SIMPLE–STMT → FN–CALL–STMT P21: ASSIGN–STMT → var = EXPRESN ; P22: EXPRESN →…
There is a string of characters G = g1,g2,g3,...sn with no non-alphabetic characters (i.e no punctuation or spaces). You are also given a function dict(b,i,j), with an input of string b and two indices (i&j). This function will return true if bi...j is a word in the dictionary, and false if not. Please provide a simple dynamic programming solution that can determine if the string F is a sequence of valid dictionary words. State the size of the table, how the table is filled, which elements are filled in first, and where the solution is found. Please find the running time of the algorithm (assume that all calls to the function are O(1)).
* Assignment: Longest increasing subsequence * * Sequences are a natural source of computational problems. One such * family of problems involves finding subsequences with specified * properties in a given sequence. This exercise asks you to write * a program that, given a sequence * * s(0), s(1), ..., s(n-1) * * of integers as input, finds a ___longest increasing subsequence___ * of the sequence s. * * For example, suppose we are given as input the sequence * * 72, 16, 51, 17, 6, 21, 92, 59, 54, 78, 41, 33, 94, * 85, 83, 56, 2, 46, 57, 44, 73, 6, 47, 47, 0. * * In this sequence, a longest increasing subsequence has length 7. * One example of such an increasing subsequence is * * 16 < 17 < 21 < 54 < 56 < 57 < 73. * * More generally, your program must be such that * given a sequence * * s(0), s(1), ..., s(n-1) * * of integers as input, the program returns a subsequence * * s(i_1), s(i_2), ..., s(i_k) * * that meets all…
Consider the following function for linear search that takes a list of elements sorted in increasing order and an element to search in the list. def search_inc(alist, elem): for i in range(len(alist)): if alist[i] == elem: return True if alist[i] > elem: return False return False Consider the following code, which is an alternative version of search_inc. def search_inc3(alist, elem): if alist[0] == elem: return True elif alist[0] > elem: return False else: return search_inc3(alist[1:], elem) : Which of the following statements is correct? You may assume that each function is tested with a list alist whose elements are sorted in increasing order. For simplicity, assume alist is a list of integers. Question 5 options: search_inc and search_inc3 return the same answers search_inc and search_inc3 do not return the same answers.…
Given a non-empty list items of positive integers in strictly ascending order, find and return thelongest arithmetic progression whose all values exist somewhere in that sequence. Return the answer as a tuple (start, stride, n) of the values that define the progression. To ensure unique results to facilitate automated testing, if there exist several progressions of the same length, this function should return the one with the lowest start. If several progressions of equal length emanate from the lowest start, return the progression with the smallest stride. INTRUCTIONS: Input a comment or a solution on how you solve the problem, write a psuodocode and flow chart about th problem
A triple (x, y, z) of positive integers is pythagorean if x2 + y2 = z2. Using the functions studied in class, define a function pyth which returns the list of all pythagorean triples whose components are at most a given limit. For example, function call pyth(10) should return [(3, 4, 5), (4, 3, 5), (6, 8, 10), (8, 6, 10)]. [Hint: One way to do this is to construct a list of all triples (use unfold to create a list of integers, and then a for-comprehension to create a list of all triples), and then select the pythagorean ones. def unfold[A, S](z: S)(f: S => Option[(A, S)]): LazyList[A] = f(z) match { case Some((h, s)) => h #:: unfold(s)(f) case None => LazyList() } code in scala
Write a FRACTION calculator program with c++ that adds, subtracts, multiplies, and divides fractions. Your program should check for the division by 0, have and use the following functions: (a) abs - returns the absolute value of a given integer. (b) min - returns the smallest of two positive integers. (c) gcd - returns the greatest common divisor of two positive integers. (d) reduce - reduces a given fraction. (e) flip - reduces a given fraction and flips the sign if the denominator is negative. (f) add - finds the reduced sum of a pair of given fractions. (g) subtract - finds the reduced difference of a pair of given fractions, by making the second fraction negative then using the add function. (h) multiply - finds the reduced product of a pair of given fractions. (i) divide - finds the reduced quotient of a pair of given fractions by inverting the second fraction then using the multiply function.
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.