Description
14 attachmentsSlide 1 of 14attachment_1attachment_1attachment_2attachment_2attachment_3attachment_3attachment_4attachment_4attachment_5attachment_5attachment_6attachment_6attachment_7attachment_7attachment_8attachment_8attachment_9attachment_9attachment_10attachment_10attachment_11attachment_11attachment_12attachment_12attachment_13attachment_13attachment_14attachment_14
Unformatted Attachment Preview
Part I: General Information
All assignments are individual assignments unless it is notified otherwise.
All assignments must be submitted via Blackboard. No late submissions or e-mail submissions or hard
copies will be accepted.
Unlimited submission attempts will be allowed on Blackboard. Only the last attempt will be graded.
Work will be rejected with no credit if
■ The work is late.
The work is not submitted properly (Blurry, wrong files, crashed files, files that can’t open, etc.).
The work is a copy or partial copy of others’ work (such as work from another person or the
Internet).
Students must turn in their original work. Any cheating violation will be reported to the college.
Students can help others by sharing ideas and should not allow others to copy their work.
Documents to be submitted:
●
●
■
O Scheme source file(s) with inline comments with file extension .rkt
O Test case document with file extension .PDF
Students are required to submit a design, all the error-free source files with Javadoc style inline
comments and supporting files. Lack of any of the required items or programs with errors will result in
a low credit or no credit.Part III: Description
Goals:
●
Review and develop a deep and comprehensive understanding of functional programming
Review and develop a deep and comprehensive understanding of the divide-and-conquer technique and
programming technique such as recursion
Review and develop a deep and comprehensive understanding of data structures such as binary search trees
Instructions:
Please read the following requirements carefully. A program that doesn’t meet the following requirements may be
returned with 0 points awarded.
Use Scheme as a pure functional programming language.
The following basic functions are allowed to be used for this assignment.
O Primitive Numeric Functions: +, -, *, /, QUOTIENT, and MODULO.
o Defining Functions: LAMBDA, and DEFINE.
Numeric Predicate Functions: =, , >, =,
Purchase answer to see full
attachment
Tags:
binary search tree
preorder traversal
functions in a program
User generated content is uploaded by users for the purposes of learning and should be used following Studypool’s honor code & terms of service.
