Code: | CC2001 | Acronym: | CC2001 | Level: | 200 |
Keywords | |
---|---|
Classification | Keyword |
OFICIAL | Computer Science |
Active? | Yes |
Web Page: | http://www.dcc.fc.up.pt/~apt/aulas/DAA/1920 |
Responsible unit: | Department of Computer Science |
Course/CS Responsible: | Bachelor in Computer Science |
Acronym | No. of Students | Study Plan | Curricular Years | Credits UCN | Credits ECTS | Contact hours | Total Time |
---|---|---|---|---|---|---|---|
L:B | 0 | Official Study Plan | 3 | - | 6 | 56 | 162 |
L:CC | 102 | Plano de estudos a partir de 2014 | 2 | - | 6 | 56 | 162 |
L:F | 1 | Official Study Plan | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:G | 6 | study plan from 2017/18 | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:M | 5 | Official Study Plan | 2 | - | 6 | 56 | 162 |
3 | |||||||
L:Q | 0 | study plan from 2016/17 | 3 | - | 6 | 56 | 162 |
MI:ERS | 156 | Plano Oficial desde ano letivo 2014 | 2 | - | 6 | 56 | 162 |
To learn techniques for designing and analyzing algorithms.
Improving background on generic models of common problems and the algorithmic techniques for solving them. Practical experience in applying generic algorithms to specific problems. Competence in the asymptotic analysis of the running time of algorithms.
Students should know simple algorithms and data structures (for counting, searching and sorting) and a programming language (C/C++ or JAVA).
Prerequisites: "Imperative Programming" (CC1003) and "Data Structures"(CC1007), or some course unit with equivalent content.
Asymptotic analysis of algorithms: Big O notation (O, Ω e Θ), estimating execution time, analyzing iterative and recursive programs;
Sorting: sorting as basic element of other algorithms; comparative and non comparative algorithms, binary search and direct and indirect applications;
Algorithm design techniques: exhaustive search, greedy algorithms, divide and conquer, dynamic programming;
Some specialized data structures: priority queues, disjoint sets;
Balanced Binary Search Trees: Red-Black trees;
Graph algorithms: graph representation, depth-first search, breadth-first search, minimum spanning trees, minimum distances, maximum flow.
Regular lectures for exposing the program topics and discussing examples. Laboratory classes for solving exercise sheets and programming problems for implementation, with automatic feedback and evaluation by the Mooshak system.
designation | Weight (%) |
---|---|
Exame | 75,00 |
Trabalho laboratorial | 25,00 |
Total: | 100,00 |
designation | Time (hours) |
---|---|
Estudo autónomo | 71,00 |
Frequência das aulas | 56,00 |
Trabalho laboratorial | 35,00 |
Total: | 162,00 |
Students must attend at least 75% of the pratical classes to be admitted to the exams. Students who miss more than four classes cannot attend the exams.
NP: practical grade, worth 20% of the final grade: 2 practical tests (or a single one in the end of the semester if it will be impossible to have two during the semester).
NT: If it fits in with the academic calendar for 2019/2020, there will be two optional tests during the semester (TE1, TE2). To attend TE2, it is required a minimum grade of 8.0/20.0 in TE1. The second test covers all topics. A minimum grade of 8.0/20.0 is required also.
NT = max((TE1+TE2)/2, TE2, FinalExam)
The final grade is given by
NP + 0.8*NT (required at least 9.5 out of 20).
Students do not need to take the final exam if max((TE1+TE2)/2, TE2) >= 8.
In addition, students with NT >= 10.0 will be approved.
Academic integrity violations: the regulations from FCUP/University of Porto will be applied.
Along the semester there will be two written tests (if that fits the academic calendar 2019/2020), and one or two programming tests. The written tests and exams consist of generic questions plus questions about problems seen in the theoretical and laboratory classes.
There will be one or two programming tests (weighted at 20% in total). They consist in the submission, using the Mooshak system, of solutions to problems similar to those proposed in the laboratory classes and for homework.
The pratical component is compulsory for every student, regardless of special status of any kind. If the student does not take the practical test, it will score 0 in that component.
Students approved in 2018/2019, who wish to improve their grade, must take the practical test and the final exam.
Prerequisites (not mandatory): "Imperative Programming" (CC1003) and "Data Structures"(CC1007), or some course unit with equivalent content.
CC2001 is not recommended at all to students without CC1003 or similar background.
Students without CC1007 may need an extra effort to pass CC2001.
It is strongly recommended that students follow the subjects from the beginning of the semester, through study, active participations in practical and theoretical classes, and by solving the proposed problems (for evaluation by Mooshak).