Università Roma Tre

PROVIDE KNOWLEDGE ON BASIC DATA STRUCTURES (STACKS, QUEUES, LISTS, TREES, GRAPHS) AND FUNDAMENTAL ALGORITHMS FOR THEIR MANAGEMENT. ACQUIRE THE FORMAL TOOLS FOR A RIGOROUS EVALUATION OF THE COMPUTATIONAL COMPLEXITY OF ALGORITHMS AND PROBLEMS. A FURTHER OBJECTIVE OF THE COURSE IS THE ACQUISITION OF FAMILIARITY WITH THE MAIN ALGORITHMIC APPROACHES (DIVIDE AND CONQUER, GREEDY, INCREMENTAL) AND THE RECURSIVE AND ITERATIVE PROGRAMMING PARADIGMS. DURING THE COURSE STUDENTS ARE INTRODUCED TO THE C LANGUAGE.