Algorithm Design and Analysis

Code:

CC2001

Acronym:

CC2001

Level:

200

Keywords
Classification	Keyword
OFICIAL	Computer Science

Instance: 2023/2024 - 2S

Active?	Yes
Web Page:	http://www.dcc.fc.up.pt/~apt/aulas/DAA/2324
Responsible unit:	Department of Computer Science
Course/CS Responsible:	Bachelor in Computer Science

Cycles of Study/Courses

Acronym	No. of Students	Study Plan	Curricular Years	Credits UCN	Credits ECTS	Contact hours	Total Time
L:B	0	Official Study Plan	3	-	6	48	162
L:CC	70	study plan from 2021/22	2	-	6	48	162
L:F	0	Official Study Plan	3	-	6	48	162
L:G	0	study plan from 2017/18	2	-	6	48	162
			3
L:IACD	57	study plan from 2021/22	2	-	6	48	162
L:M	2	Official Study Plan	2	-	6	48	162
			3
L:MA	0	Official Study Plan	3	-	6	48	162
L:Q	0	study plan from 2016/17	3	-	6	48	162

Teaching language

Portuguese

Objectives

To learn techniques for designing and analyzing algorithms.

Learning outcomes and competences

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.

Working method

Presencial

Pre-requirements (prior knowledge) and co-requirements (common knowledge)

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.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Program

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.

Computtaionally hard problems. Brief introduction to the complexity classes P, NP, NP-hard, NP-complete for decision problems. Introduction to approximation and parameterized algorithms.

Mandatory literature

Cormen Thomas H. 070; Introduction to algorithms. ISBN: 9780262033848 hbk
J. Kleinberg, E. Tardos; Algorithm Design, Addison-Wesley, 2005. ISBN: 978-0321295354

Complementary Bibliography

R. Sedgewick and K. Wayne; Algorithms, 4th Edition, Addison-Wesley, 2011. ISBN: 978-0321573513
Skiena Steven S.; The algorithm design manual. ISBN: 978-1-84800-069-8
Mark de Berg; Computational geometry. ISBN: 978-3-540-65620-3 hbk
S. Halim and F. Halim; Competitive Programming, 1st Edition, 2011
Michael R. Garey; Computers and intractability. ISBN: 0-7167-1045-5

Teaching methods and learning activities

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.

Software

Linguagens de programação/Programming Languages: C, C++ or Java
Servidor Mooshak para CC2001 (http://mooshak.dcc.fc.up.pt/~daa)

Evaluation Type

Distributed evaluation with final exam

Assessment Components

designation	Weight (%)
Exame	80,00
Trabalho laboratorial	20,00
Total:	100,00

Amount of time allocated to each course unit

designation	Time (hours)
Estudo autónomo	72,00
Frequência das aulas	48,00
Trabalho laboratorial	42,00
Total:	162,00

Eligibility for exams

Students must attend at least 75% of the pratical classes to be admitted to the exams. Students who miss more than three classes cannot attend the exams. 

Calculation formula of final grade

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 2023/2024, 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 and NP + 0.8*NT  >= 9.5.
In addition, students with NT >= 10.0 will be approved.

Academic integrity violations: the regulations from FCUP/University of Porto will be applied.

Examinations or Special Assignments

Along the semester there will be two written tests (if that fits the academic calendar 2023/2024),  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.

Special assessment (TE, DA, ...)

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.

Classification improvement

Students approved in 2022/2023, who wish to improve their grade, must take the practical tests and the final exam.

Observations

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).