COMP108 Algorithmic Foundations - Class Tests
Two class tests will be held.
- Class Test 1
Thursday 23rd March 2017
Questions
Suggested solution and FEEDBACK
marks
mark distribution
The Learning outcomes assessed in this class test:
- describe standard algorithms such as sorting algorithms, search algorithms, string matching algorithms;
- apply these algorithms or a given pseudo code algorithm in order to solve a given problem;
- carry out simple asymptotic analyses of algorithms involving sequence, selection, and iteration, and identify and compare simple properties of these algorithms;
- describe the algorithm design principles of divide-and-conquer;
- apply the studied algorithms that illustrate these design principles;
- apply the studied design principles to produce algorithmic solutions to a given problem
Marking criteria: Marks will be awarded to correct answer and intermediate steps.
- Class Test 2
Thursday 11th May 2017
Questions
Suggested solution and FEEDBACK
marks
mark distribution
The Learning outcomes assessed in this class test:
- describe standard algorithms such as sorting algorithms, search algorithms, string matching algorithms, graph traversal algorithms;
- apply these algorithms or a given pseudo code algorithm in order to solve a given problem;
- carry out simple asymptotic analyses of algorithms involving sequence, selection, and iteration, and identify and compare simple properties of these algorithms;
- describe the algorithm design principles of divide-and-conquer, greedy, dynamic programming method;
- apply the studied algorithms that illustrate these design principles;
- apply the studied design principles to produce algorithmic solutions to a given problem
Marking criteria: Marks will be awarded to correct answer and intermediate steps.
Back to COMP108 homepage