Information for the 2nd Practical Test
General Information
- Date: 18/12/2025 (thursday)
- Time: There will be two shifts for the test (08:30 and 11:00)
[see student allocation to shift and room] (protected access)
- Place: FEUP Computer Labs (B Building)
- Duration: 2h
- Method: the test will be individual and will consist of practical problems for which you can submit C++ code to Mooshak and receive feedback that might include public test cases, like in the practical classes
- Language: all problems will be available in english and in portuguese
- Environment: the computers will have Linux, with GCC available at command line, and usual IDEs, with at least VSCode able to compile/execute (but you should know how to compile in a shell); you will have access to documentation (local copy of cppreference) and to a local copy of the course website (including lecture slides and practical classes, with all auxiliary files)
- Scoring: this test is worth 2.5 points out of 20 (12.5% of your class grade) [see explanation and calculation formula of final grade]
You will have 4 exercises in Mooshak, each worth 25%.
In all exercises there will be partial scoring (e.g. passes some tests, fails on others) to accommodate for aspects such as border cases or different algorithmic complexities.
When submitting, you will know the score you got on all tests. Your grade on a problem will be the grade of your best submission on that problem (the one with the highest score)
Specific goals for each exercise and training problems
- [25%] Exercise 1: a method in a binary tree
You will need to add one or more small methods to the binary tree class given in the lectures and used on practical exercises (class BTree<T>: (see code | download code).
- [25%] Exercise 2: DFS method in a graph
You will need to add one or more methods to the graph class given in the lectures and used on practical exercises (class Graph: see code | download code). The suggested method to solve will be using DFS, but the students can solve using any other graph traversal technique, if it solves the problem.
- [25%] Exercise 3: BFS method in a graph
You will need to add one or more methods to the graph class given in the lectures and used on practical exercises (class Graph: see code | download code). The suggested method to solve will be using BFS, but the students can solve using any other graph traversal technique, if it solves the problem.
- [25%] Exercise 4: a problem with STL containers
A problem whose solution might need data structures that were discussed in classes (such as lists, stacks, queues, sets and maps) but you can use any available STL implementation. The solution might need a certain complexity to pass all tests and the main topics of the exercise will be around practical classes #06 (lists, stacks and queues) and #08 (balanced binary search trees).