You are using an outdated version of Internet Explorer (the currently supported version by Microsoft - Internet Explorer 11 - became available in November 2013). All previous versions became unsupported by Microsoft in January 12th 2016. Please update your version or use another browser to be able to use every functionality of SIUPT, thank you.

contacts and office hours

how to find us

Copyright and acknowledgements

Data Structures 2017/2018

faculty body

Objectives

The course aims to introduce the fundamental concepts of abstract data structures. At the end of the semester the student will be able to:
1 Know the operation and understand the usefulness of the more relevant abstract data structure, including lists, stacks, queues, trees and graphs
2 Know how to choose and use appropriate data structures to solve problems.
3 know how to implement the data structures in particular using dynamic memory management.
The student will also be able to plan, manage and develop a group work, as well as present it, either written or orally.

Recommended Prerequisites

Teaching Metodology

The lecture course is developed in theoretical/practical classes and laboratories.
In the theoretical practical classes the fundamental concepts about the ADT are presented, frequently using the discussion with the students and the teaching by the discovery through examples. The labs intend to develop the specific skills, through the resolution of practical exercises in the computer, with individual accompaniment by the teacher.
Resources: Java Language; Eclipse IDE; resources available in the curricular unit page in MOODLE

Body of Work

Abstract data structures (ADTs): stacks, queues, lists, trees, graphs
Behavior of each ADT
Sequential and dynamic representation of ADTs
Java Implementation of each of the ADTs
Problems resolution using the ADTs in Java

Demonstration of the syllabus coherence with the curricular unit's objectives

The objectives of this course are: 1. To know the operation and understand the usefulness of the most relevant abstract data structures: lists, stacks, queues, trees and graphs
2. To Know how to choose and use the appropriate data structures to solve a problem.
3. To know how to implement the data structures in particular using dynamic memory management.
Thus the contents to be addressed include a description of each abstract data structures (ADTs): stacks, queues, lists, trees, graphs, and a description of their behavior. In order to know how to implement the ADTs they will be analyzed comparing the sequential and linked representations, using the Java language. So that students know how to choose the appropriate ADT to solve a given problem, cases will be presented.

Demonstration of the teaching methodologies coherence with the curricular unit's objectives

The course is developed in theoretical / practical and laboratory classes.
The objectives include: 1. To know the operation and understand the usefulness of the most relevant abstract data structures: lists, stacks, queues, trees and graphs
2.To Know how to choose and use the appropriate data structures to solve a problem.
3. To know how to implement the data structures in particular using dynamic memory management.
The lectures / practices will allow students to know and understand the ADTS and understand their use in solving different problems. The practical exercises allows students to know how to implement the ADTs and also how to choose a particular ADT to use in certain situation.