COMP 271: Design and Analysis of Algorithms

Spring 2003
Question Banks and Tutorial Handouts

 

On this page you will find links to the tutorial handouts for COMP271.

There are also some questionbanks, with solutions. The questions in the questionbanks (some of which come from the tutorials,  others of which are new) are meant for you to practice on.  They do NOT have to be handed in and will not be marked.


Tutorial Handouts

Tutorial  Date Topic Other
07/02/03 No Tutorial  
14/02/03 O( ) Notation  
21/02/03 Divide &Conquer  
28/02/03 Selection    
07/03/03 Graphs_&_BSF    
14/03/03 DSF & Shortest Path  
21/03/03   Discussion of Assignment 1
28/03/03 MSTs and Dynamic Programming  
Week of 15/04/03 More  Dynamic Programming  
Week of 22/04/03 Greedy Algorithms  
Week of 14/05/03 NP Completeness  

 


 

Question Banks

Question Bank 1  Selected Solutions
Question Bank 2 Selected Solutions
Question Bank 3 Selected Solutions     (revised 15/04/03)
Question Bank 4 Selected Solutions    
Question Bank 5 Selected Solutions    

 


Return to COMP271 Home page