Last modified: 2016-10-07
This is a course page of
David Casperson
Associate Professor
Computer Science
University of Northern British Columbia

CPSC 370: Functional and Logic Programming (2006)

Homework Questions now Due

Due 2006-09-30.
  1. How many partial binary boolean functions are there?
  2. The triangular numbers are the number of dots in a triangle that is n rows deep and n columns wide. Thus t(4) is 1+2+3+4=10. Write a standard ML function to compute t(n).
  3.    .
       ..   .
       ...  ..  .
       .... ... .. .
        
    The pyramidal numbers are the number of dots in a pyramid that is n rows long and n columns wide and n columns high. Thus p(4) is 1+3+6+10=20. Write a standard ML function to compute p(n).
  4. Generalize.
  5. Guesstimate the running time behaviour of the winning and losing functions discussed in class.

    A function to aid timing can be found here. this function is invoked as TimeUtil.time f x and it returns a pair consisting of the time to compute f x and the value of the computation.

Home page Semesters Site Map
go back Fall 2006 go forward
2017-09 other links

Semester Map
CPSC 141
CPSC 200
CPSC 370
Course Outline
Handing in Homework
Pending Homework Questions
Solutions
Policies
References
David’s Schedule