Data Structures

Code:

CC1007

Acronym:

CC1007

Level:

100

Keywords
Classification	Keyword
OFICIAL	Computer Science

Instance: 2014/2015 - 2S

Active?	Yes
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:CC	73	Plano de estudos a partir de 2014	1	-	6	56	162
MI:ERS	185	Plano Oficial desde ano letivo 2014	1	-	6	56	162

Teaching language

Portuguese

Objectives

Reinforce programming skills. Basic data structures, algorithms and programming techniques. Introduction to complexity.

Learning outcomes and competences

The student should be able to write the code for fundamental data structures and implement efficient algorithms that manipulate them. Implement solutions with techniques such as recursion, backtracking and divide to conquer.

Working method

Presencial

Program

Basic introduction to Java. Programming techniques: recursion, backtracking and divide to conquer. Basic sequential data structures: array, list, stack, queue, deque. Basic algorithms: sequential and binary search; sorting through selection, insertion, bubble-sort, quick-sort and merge-sort. Introduction to complexity. Non-sequential data structures: binary search trees and maps.

Mandatory literature

Goodrich Michael T.; Data structures and algorithms in Java. ISBN: 0-471-73884-0
Sedgewick Robert; Introduction to programming in Java. ISBN: 978-0-321-49805-2

Teaching methods and learning activities

Theory classes. Practical classes with programming exercises.

Evaluation Type

Distributed evaluation with final exam

Assessment Components

designation	Weight (%)
Exame	70,00
Teste	30,00
Total:	100,00

Amount of time allocated to each course unit

designation	Time (hours)
Frequência das aulas
Total:	0,00

Calculation formula of final grade

Final grade (0-20) = (6*Tests + 14*Exam) / 100

(with "Tests" and "Exam" evaluated 0-100)