NB. Page numbers do not necessarily correspond
exactly to lecture numbers: [01] [02] [03] [04] [05] [06] [07] [08] [09] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [22] [23]; the notes are for sale in the bookshop.
|
Lectures:
O( ) |
O( ) |
[help-room] timetable s1 2005 -- consultation. |
If (only if) you want a programming challenge -- try to invent on O(n)-time, O(1)-space, in-situ merge algorithm -- v. hard! |
[help-room] timetable s1 2005 -- consultation. |
Easter, Friday 25 March - Friday 1 April 2005 |
Do prepare prac2 and also tute2! |
---|
There are solutions to tutorial-1 on the 2nd year notice board -- for as long as space is sufficient. |
Prac 2/3 test data:
Do also test your program on data other than from gen2.c,
including but not limited to
It is not possible to set a hard and fast time-limit such as 11.7 seconds, say, because speed will vary with processor, cache, memory, disc, load, etc.. What is more important is the trend when M and/or N are doubled etc.. |
O( ) |
NB. Anzac Day, Monday 25 Aprilcheck your time-table carefully! |
|
|
Revision:
There are past exam papers, notes, & tutorial questions
under |
0.0 0 1 1 0 0 1 1... ---------------------- 1/5 = 101 ) 1.0 0 0 0 0 0 0 0... 1 0 1 ----- 1 1 0 0 1 0 1 ----- 1 1 etc.Check: 1/510 |
Recursion ~ self reference.
Recursion does not need named self-reference;
it can be effected with the
fixed-point operator Y
(Y does not refer to itself & neither do G, g, |
Revision:
There are past exam papers, including notes, and tutorial questions
under |
And [help-room] timetable s1 2005 -- consultation. |