MCS-177: Introduction to Computer Science I, Spring 2004

• Syllabus and schedule
• Homework
  • Homework 1
  • Homework 2
  • Homework 3
  • Homework 4
  • Homework 5
  • Homework 6
  • Homework 7
  • Homework 8
• Projects
  • Project 0: Getting Started
  • Project 1: Quilting
  • Special Project: Card Sorting
  • Project 2: Sum of Divisors
  • Project 3: Fractal Curves
  • Project 4: Nim with Strategies
  • Project 5: Movie Queries
  • Project 6: Implementing Graphics
• Tests
  • Test #1: Practice Questions and Solutions and Info Sheet
  • Test #2: Practice Questions and Info Sheet
  • Final: Practice Questions with solutions to selected questions and Info Sheet
• Scheme codes from class (possibly modified)
  • Procedures that generate recursive processes
  • Procedures that generate iterative processes
  • A special sum-of-digits procedure we did in class (and more)
  • Josephus Problem
  • Modulo Exponentiation
  • Procedure parameters
  • Procedure results I and II
  • Ways to partition
  • Various Number Verifiers
  • NumberPair <–> Number
  • List Processing I and II
  • List Splitting
  • Bottom-up Merge Sort
  • Merge & Delete duplicates
  • Binary Trees
  • preorder visit
  • sequence
• Helpful links
  • Supporting Materials for our textbook, including Scheme implementations for many platforms
  • Documentation for the Scheme programming language
  • The graphics tool for DrScheme and quilting.scm
  • Graph paper
  • Experimental and analytic predictions (PostScript or PDF form)
• Interesting links
  • Alan Turing's paper: On Computable Numbers, with an application to the Entscheidungsproblem
  • Chinook: the world Man-Machine Checkers Champion
  • On-Line Encyclopedia of Integer Sequences
• Instructor: San Skulrattanakulchai
• Lab Instructor: Karl Knight
• Tutor hours in the lab: Sunday, Monday, Tuesday, Wednesday, and Thursday; 7pm-8pm

---

Back to San Skulrattanakulchai home page