CSci 1301: Problem Solving and Algorithm Development -- Resources

[Home] [Syllabus] [Assignments] [Resources]

In-class examples

• August 31. First Scheme examples: example1.ss
• September 4. area_ring.ss
• September 9. conditionals.ss
• September 11. movie_theater.ss
• September 14.
  • interest.ss
  • symbols.ss
  • images.ss (the file has images; right-click on the file and choose "Save link as")
  • To load a teachpack, go to Language -> Add Teachpack, then select a teachpack from the list. To unload a teachpack, go to Language -> Clear all teachpacks
• type_errors.ss
• September 18:
  • structures.ss
  • traffic_light.ss
  • student.ss (extended on Sept. 25 with Ch. 7 exampes)
• September 25: ring.ss
• September 30: lists.ss
• October 5: review.ss
• October 9: list_and_number_functions.ss
• October 12: draw_shapes.ss, list_append.ss
• October 16: sorting.ss (insertion sort), circles.ss
• October 21: recursive_structures.ss, bst.ss (binary search tree), nested_lists.ss
• October 23: local.ss: local definitions and Scheme testing functions. Note that local definitions are avaiable in Intermediate Student and above.
• November 2: functional_abstraction.ss
• November 11: functional_abstraction2.ss (another version of a filter function), map.ss (a function that allows you to apply a function to every element of a list)
• November 13: applying_functions.ss
• November 16: review2.ss - review for Midterm II. Selected solutions: red_pattern_and_other_review_questions.ss
• November 20:returning_a_function.ss: writing functions that return functions, defining functions "on the fly" with lambda
• November 23: more_lambda.ss

Student work

• Lab 4 cartoons
• Project 1: games

DrScheme resources

• To download DrScheme: http://www.plt-scheme.org/ (go to Download PLT Scheme)
• Brief instructions on getting started with DrScheme in the lab; has some basic general setup info, too.
• More detailed instructions for setting up DrScheme on the textbook's web site
• Documentation for the versions of Scheme we will be using throughout the semester. Specifically:
  • The list of all functions available in Beginning Student. As we go along, more of them will be understandable to you. Feel free to use those that are helpful and ignore the rest.
  • All operations available in Intermediate Student
  • Predefined Scheme list functions (map, filter, etc.)
• Scheme testing functions

Resources for the textbooks and other helpful resources

• The complete text of the textbook
• Notes on the book (examples, etc.)
• Known typos and mistakes (note that most of them have been corrected for the current edition)

Various links

• ENIAC (1946) is generally considered to be the first general purpose, electronic, digital programmable device, i.e. the first digital computer.