Algorithms and Data Structures 2024/2025 (L.EIC011) - DCC/FCUP & DEI/FEUP

Information for the 2nd Practical Test


General Information


Specific goals for each exercise and training problems

  1. [25%] Exercise 1: a method in a linked list
    You will need to add one method to the singly linked list class given in the lectures and used on practical exercises (class SinglyLinkedList<T>: see code | download code).  
  2. [25%] Exercise 2: a method in a binary tree
    You will need to add one method to the binary tree class given in the lectures and used on practical exercises (class BTree<T>: (see code | download code).  
  3. [15%] Exercise 3: DFS method in a graph
    You will need to add one method 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.  
  4. [15%] Exercise 4: BFS method in a graph
    You will need to add one method 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.  
  5. [20%] Exercise 5: 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 will 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).