Question: Use Racket (preferred) or python Write a structurally recursive function (take n lst) that takes two arguments: a non-negative integer n and a list lst.

Use Racket (preferred) or python

Write a structurally recursive function (take n lst) that takes two arguments: a non-negative integer n and a list lst. take returns a list containing the first n items in lst. For example:

 > (take 2 '(a b c d e)) '(a b)

You may assume that lst has at least n items. Write a second function, take-two, that gracefully handles cases in which n is greater than the length of lst.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Use Racket (preferred) or python Write a structurally recursive function (reject pred? lst) that takes two arguments, a one-argument predicate pred? and a list lst of values of the type accepted by...

Use Racket (preferred) or python Write a structurally recursive function (positions-of s los) that takes two arguments, a symbol s and a list of symbols los. positions-of returns a list containing...

Use Racket (preferred) or python Write a structurally recursive function (interleave lst1 lst2) that takes as arguments two lists, lst1 and lst2. interleave returns a list of pairs, where each pair...

Help for racket Write a structurally recursive function (drop n los) that takes two arguments: a non-negative integer n and a list of symbols los. ::= 0 | + 1 drop returns a list containing all of...

Use Racket (preferred) or python Write a structurally recursive function (every? lob) that takes a list of booleans lob as its argument. A list of booleans has teh same structures as a list of...

solve using racket Do Not Use... ... any of Racket's primitive higher-order functions in any of your solutions, including map , apply , and filter . ... any function that converts a list argument to...

1 Program descriptions You will write six programs for this project. Except where explicitly noted, your programs may assume that their inputs are properly formatted. However, your programs should be...

ANSWER IN RACKET LANGUAGE Write a structurally recursive function in Racket (drop n los) that takes two arguments: a non-negative integer n and a list of symbols los. drop will return a list that...

Here are definitions of sequences and trees with integer elements: type iseq = Nil | Cons of int * (unit -> iseq) type itree = Leaf of int | Branch of itree * itree (a) In an ascending sequence such...

Programming Assignment #1: Varg1 Table of Contents Abstract........................................................................................................2 1....

Let A and B be nonsingular n x n matrices. Show that cond(AB) cond(A)cond(B)

Refer to the scenario described in Prob. 3.4-10 (Chap. 3), but ignore the instructions given there. Focus instead on using spreadsheet modeling to address Larry Edisons problem by doing the...

An amount of $1,250 would be recorded in the Paulsen Hardware _ account. a.) purchase discounts b.) purchases c.) sales allowance d.) sales discount

You would like to be holding a protective put position on the stock of XYZ Company to lock in a guaranteed minimum value of $50 at year-end. XYZ currently sells for $50. Over the next year, the stock...

Nationwide Financial, a 5,000-employee life insurance company based in Columbus, Ohio, found that its management development program contained four types of managers. One type, unknown leaders, have...

You have been asked to evaluate whether your organizations current pay structure makes sense in view of what competing organizations are paying. How would you determine what organizations to compare...

The chapter-opening story described how employers are shifting more employee health care costs to employees. What are the likely consequences of this change? Where does the social responsibility of...