
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Exam; Class: Discrete Math/Functional Prog; Subject: Computer Science; University: Wheaton College; Term: Unknown 1989;
Typology: Exams
1 / 1
This page cannot be seen from the preview
Don't miss anything!
Test 3 review
Formal definitions of the terms in italics will be provided for you. You still should have them functionally memorized if you are to perform well on the test. Ideally, the test will have the following questions: Several proofs of propositions about functions, including
A series of related ML problems dealing with a recursive datatype, like Peano-style wholeNumber (Exercises 6.1.(1-5), powerOfTwo (Exercises 6.1.6-9), homemadeList (Exercises 6.1.10-17), or tree (Exercises 6.2.(1-10). A proof by structural induction, as in Exercises 6.4.(1-5). A proof of a loop invariant, as in Exercises 6.8.(1-5).
Of course, if the test had all of these things independently, it would be too long.