|
|
|
|
|
|
|
|
When
: Tuesday, December 18, HH 252, 10:10-12:10 (Group
I).
Thursday, December 13, HH252, 10:10-12:10 (Group II).
What is Allowed
: Two sheets of notes (both sides, point 10 size
minimum).
No extra devices.
Format :
(i) Four problems
(ii) Problem (1): Given the following excerpt from a
program, derive its time complexity
formula.
(~ 25 points)
Problem (2) : Trace the following sorting algorithm
on the following set of data.
(~ 25 points).
Problem (3) : Trace the following Graph algorithm
on the following graph.
(~ 25 points).
Problem (4) : Another problem like (3) OR
Given the following implementation
for the ???? ADS, change it so that it
does this and that.
(~ 25 points).
How to best prepare for the Final Exam :
(i) Go over the examples given in class.
(ii) Go over the homework assignments.
(iii) Do not assume that the teacher is exceptionally
mean.
ALL OUTSTANDING HOMEWORKS AND PROJECTS ARE DUE ON THE DAY OF THE FINAL EXAM (right before the final). FOR PROJECTS, IT IS ACCEPTABLE TO HAND IN A FLOPPY WITH THE SOURCE CODES OR UPLOAD THE SOURCE CODES ONTO YOUR WEB PAGE. NO PERMISSIONS FOR THE TEACHER = NO CREDIT FOR THE PROJECTS !!!!!