Complements of Programming and Algorithms

Code:

EIC0018

Acronym:

CPAL

Keywords
Classification	Keyword
OFICIAL	Programming

Instance: 2008/2009 - 2S

Active?	Yes
Web Page:	http://paginas.fe.up.pt/~nflores/dokuwiki/doku.php?id=teaching:0809:cpal
Responsible unit:	Department of Informatics Engineering
Course/CS Responsible:	Master in Informatics and Computing Engineering

Cycles of Study/Courses

Acronym	No. of Students	Study Plan	Curricular Years	Credits UCN	Credits ECTS	Contact hours	Total Time
MIEIC	133	Syllabus since 2006/2007	2	-	7	-

Teaching language

Portuguese

Objectives

This course is a complements of first one on Algorithms and Data
Structures. In the first course the student learn basic algorithms and
simple data structures that include priority queues, hash tables and
trees. In this follow up course they learn graphs, set representation,
files and basic text processing algorithms. The course ends with the
study of five strategies for designing algorithms.

The first lectures of the course are used to provide a basic
introduction to Java programming language. All encoding examples and
the programming works are done in Java.

Program

Introduction to Java programming language

Graphs,
Set representation,
Files
Basic Text processing algorithms.

Five strategies for designing algorithms:
Greedy Algorithms
Divide and Conquer
Dynamic Programming
Randomized Algorithms
Backtracking Algorithms

Mandatory literature

Eckel, Bruce; Thinking in Java. ISBN: 0-13-027363-5
Weiss, Mark Allen; Data structures & algorithm analysis in Java. ISBN: 0-201-35754-2

Teaching methods and learning activities

The first lectures are used to make an introduction to Java programming language. The topics are formally presented along with examples and Java encoded small programs. The students make programming works involving the studied data structures and do a small project on an application using graphs.

Software

Eclipse

keywords

Technological sciences > Technology > Computer technology > Software technology

Evaluation Type

Distributed evaluation with final exam

Assessment Components

Description	Type	Time (hours)	Weight (%)	End date
Attendance (estimated)	Participação presencial	60,00
Computer-based test	Exame	3,00		2009-04-22
Final exam (both editions)	Exame	4,00		2009-07-31
Group assignment	Trabalho escrito	40,00		2009-06-05
	Total:	-	0,00

Amount of time allocated to each course unit

Description	Type	Time (hours)	End date
Individual study	Estudo autónomo	60	2009-07-31
	Total:	60,00

Eligibility for exams

Minimum of 30% of the continuous evaluation total

Calculation formula of final grade

Final classification = 0,7 * Exam classification + 0,3 * continuous evaluation classificaion