Data Structures and Algorithms Code:  M0.529    :  6
View general information   Description   The subject within the syllabus as a whole   Professional fields to which it applies   Prior knowledge   Information prior to enrolment   Learning objectives and results   Content   View the learning resources used in the subject   Support tools and learning resources   Guidelines on assessment at the UOC   View the assessment model  
This is the course plan for the second semester of the academic year 2023/2024. To check whether the course is being run this semester, go to the Virtual Campus section More UOC / The University / Programmes of study section on Campus. Once teaching starts, you'll be able to find it in the classroom. The course plan may be subject to change.

When designing a program it is very important to take efficiency into account, that is to say, let it consume the minimum quantity of resources in order to carry out its goal. Therefore, computational time and memory space to store the data is to be minimized, as well as the number of messages to be sent through the network, the amount of consumed energy, etc.

There exist two fundamental tools to achieve this: data structures and algorithmic schemes:

  • The data structures focus on how information is managed: they consist of strategies to organise data and reduce the access and manipulation time, as well as the storage space required.
  • Algorithmic schemes focus on the computational process: they are general patterns that describe the necessary steps to reach a solution and they have to be particularized for the specific problem to solve.

This course presents the concepts on data structures and algorithms necessary for research. In particular, the subject reviews fundamental concepts of algorithmic complexity (space and temporary costs, calculation of the cost of an algorithm, typical orders of magnitude) as well as basic concepts of data structures (abstract data types, management of pointers and memory, etc). From this base, the subject deepens in usual data structures (stacks, queues, lists, trees, heaps, hash tables) and presents an introduction to algorithms on graphs (paths, shortest paths, tree generators, etc.).

The master has had a modification of the curriculum to improve and update the contents of the courses. This means that there are some credit changes in courses that share a classroom and / or nomenclature changes in some courses. In the cases that this happens, there are no substantial changes in the contents, although some additional activity may be requested for the 6-credit courses.

Amunt

Data structures and algorithms is an optional course of the Interuniversity Master in Computational and Mathematical Engineering.

The knowledge acquired in this course will be useful in the development of practical activities in other courses of the master. In particular, it is recommended to enroll this course before enrolling Combinatorial optimisation.

Amunt

The concepts acquired in this course are essential to develop software that efficiently uses any available computational resources. For this reason, this course is relevant to any work related to the design and implementation of software, especially in the field of R&D or applied mathematics.

Amunt

This course requires basic knowledges of algorithmics: knowing the basics of programming (loops, conditionals, etc.) and understanding algorithms described in pseudocode. Also it requires a previous knowledge of the Java object-oriented programming language sufficient to write, execute and test programs.

On the other hand, the central materials of the course are in English. By this reason, having a good level of written comprehension of technical English is recommended.

Amunt

Before enrolling this subject, it is necessary to have previous knowledge about algorithmics and Java programming and have a good level of technical English for written comprehension.

Amunt

The general competences of the master taught in this course are:

  • Understanding and applying advanced knowledge about computing and numerical or computational methods to engineering problems.
  • Applying the mathematical and computational methods to the resolution of technological and engineering problems, particularly in tasks of research, development and innovation.
  • Design, implement and validate algorithms using the most convenient structures.

The specific competences of this course are:

  • Knowing the concept of abstract data type and knowing how to define an abstract data type for a concrete problem.
  • Knowing the sequential abstract data types (stacks, queues, lists) and their operations, and knowing how to use them to resolve problems.
  • Knowing the concept of asymptotic complexity, knowing how to calculate it for a given algorithm and being able to use it to compare two different algorithms from efficienncy point of view.
  • Knowing different sorting algorithms, their advantages and disadvantages and how to choose the most appropriate in a concrete context.
  • Knowing different strategies of information search (hashing, search trees), their advantages and disadvantages and know how to choose the most appropriate in a specific context.
  • Knowing the main algorithms on graphs, their complexity and being able to use them to resolve concrete problems.
  • Being able to choose the most appropriate data structure for a problem according to efficiency criteria and justify the decision.

Amunt

The course is structured in four thematic blocks:

Thematic block

Contents

1. Sequential data structures

Abstract data types

Stacks, queues, lists

2. Sorting

Asymptotic complexity

Sorting algorithms

Priority queues

3. Searching

Trees

Search trees

Hash tables

4. Algorithms on graphs

Directed and undirected graphs

Traversals: DFS, BFS

Connected components and cycles

Shortest paths

Tree generators

Amunt

DiseƱo de estructuras de datos PDF

Amunt

The central material of the course is a book of reference in this field: "Algorithms, 4th Edition", by Robert Sedgewick and Kevin Wayne. The contents of the book go further of what we will study in the course and will be useful as a reference during your professional career.

To guide the study of the book and highlight the important contents of the book within the course, there will be a study guide in the classroom every week with advice on how to review the contents of the book.

As complementary material, there are some didactic UOC modules titled "Design of data structures". These materials can be used to solve any doubts that you may have when reviewing the book of the course. However, these materials mainly focus on how the data structures are implemented, whereas in this course we will focus more in knowing how to use them and the criteria to choose the most appropriate.

Amunt

The assessment process is based on the student's personal work and presupposes authenticity of authorship and originality of the exercises completed.

Lack of authenticity of authorship or originality of assessment tests, copying or plagiarism, the fraudulent attempt to obtain a better academic result, collusion to copy or concealing or abetting copying, use of unauthorized material or devices during assessment, inter alia, are offences that may lead to serious academic or other sanctions.

Firstly, you will fail the course (D/0) if you commit any of these offences when completing activities defined as assessable in the course plan, including the final tests. Offences considered to be misconduct include, among others, the use of unauthorized material or devices during the tests, such as social media or internet search engines, or the copying of text from external sources (internet, class notes, books, articles, other students' essays or tests, etc.) without including the corresponding reference.

And secondly, the UOC's academic regulations state that any misconduct during assessment, in addition to leading to the student failing the course, may also lead to disciplinary procedures and sanctions.

Amunt

You can only pass the course if you participate in and pass the continuous assessment. Your final mark for the course will be the mark you received in the continuous assessment.

 

Amunt