COM1201 Winter 2000. Machine Problem 1
Lab of Thursday, January 20th
DUE DATE: TUESDAY JANUARY 25th
Files: (these will be made available at the time of the first lab session)
First, download all the files listed above in the Files section by simply clicking each link,
and save them onto your Windows Desktop. The programs can be run by double clicking
on the icons.
The assignment is to determine the time complexity (in O notation, e.g., O(N) )
of each of the six programs by running them with different
values of input (N) and noting the time taken for the completion
of the program. A table with the values of N and the corresponding time
taken should be constructed for each of the programs and an estimate
of the complexity of each of the program should be made from the tables. Sufficient
number of runs should be made so that the true time complexity of
the programs is discovered.
What to turn in
You should turn in a hardcopy of your tables of all the timing experiments
and the inferences for each of the 6 programs.
At the top of the first page put your name, your ID number, your email
address, the date, "COM1201 Winter 2000", and "Machine Problem 1". If you attach
additional pages, put your name on each page, at a minimum. Only
hardcopy will be accepted.
All homework should be handed in to Professor Futrelle by the
beginning of class on Tuesday, January 25th.
All late homework should be handed in to Mr Meda, 21CN. Grade is reduced 10%
x number of classes late it is handed in.
The percent credit for this lab towards your grade will be worked out in relation to
the total number of assignments and labs that are ultimately assigned for this course.