Algorithms and Data Structures - Laboratorio (2008/2009)

  1. Home
  2. Teaching
  3. Bachelor's degree
  4. Bachelor in Computer Science (until 2008-2009 academic year)
  5. Insegnamenti

Course Not running, not visible

Course code
4S00013
Name of lecturer
Roberto Posenato
Number of ECTS credits allocated
2
Academic sector
INF/01 - INFORMATICS
Language of instruction
Italian
Location
VERONA
Period
2° Q dal Jan 26, 2009 al Mar 27, 2009.
Web page
http://profs.sci.univr.it/~posenato/home/courses/labASD
Course news Seminars related to the course

To show the organization of the course that includes this module, follow this link * Course organization

Lesson timetable

Learning outcomes

The goal of this course is to improve the ability about the object oriented programming.

Syllabus

Lesson 1: Interface, Javadoc and Exception: concept and practice.

Lesson 2: An example of implementation of ADTs List, Queue and Stack.

Lesson 3: Use of Comparable interface. Technique to compare implementations. QuickSort and MergeSort comparison.

Lesson 4: ADT HashTable implementation.

Lesson 5: A dynamic programming algorithm implementation: Longest Common Subsequence (LCS).

Lesson 6: Implementation of ADT Tree and Binary Search Tree. Use of Iterator interface. Traversal methods implementation.

Lesson 7: A greedy algorithm implementation: Kruskal's algorithm.

Reference books
Author Title Publisher Year ISBN Note
Giovanni Pighizzini, Mauro Ferrari Dai fondamenti agli oggetti. Corso di programmazione JAVA (Edizione 3) Pearson Addison-Wesley 2008 978 88 7192 448 9

Assessment methods and criteria

A written test about some advanced data structures and algorithm paradigms implemented in Java language.

Share