Educational guide

IDENTIFYING DATA

2023_24

Subject

ALGORITHMS AND GRAPHS

Code

00709014

Study programme

0709 - GRADO EN INGENIERÍA INFORMÁTICA

Descriptors

Credit.

Type

Year

Period

Compulsory

Second

First

Language

Castellano

Prerequisites

Department

MATEMATICAS

Coordinador

BALIBREA INIESTA , FRANCISCO

E-mail

fbali@unileon.es
jgomp@unileon.es

Lecturers

GÓMEZ PÉREZ , JAVIER

BALIBREA INIESTA , FRANCISCO

Web

http://

General description

This course cover fundamental ideas in algorithms and graphs

Tribunales de Revisión

Tribunal titular
Cargo	Departamento	Profesor
Presidente	MATEMATICAS	SUSPERREGUI LESACA , JULIAN JOSE
Secretario		SUAREZ CORONA , ADRIANA
Vocal	MATEMATICAS	SAEZ SCHWEDT , ANDRES

Tribunal suplente
Cargo	Departamento	Profesor
Presidente	MATEMATICAS	FRANCISCO IRIBARREN , ARACELI DE
Secretario	MATEMATICAS	ARIAS MOSQUERA , DANIEL
Vocal	MATEMATICAS	CASTRO GARCIA , NOEMI DE

Competencias

Code
A18096
A18099
A18117
B5618
B5623
B5624
B5625
C2	CMECES2 That students know how to apply their knowledge to their work or vocation in a professional manner and possess the skills that are usually demonstrated through the development and defense of arguments and the resolution of problems within their area of study.

Learning aims

	Competences
To know and apply algorithmic procedures, analysing the convenience and complexity of the proposed algorithms.	A18096 A18099 A18117	B5618 B5623 B5624 B5625	C2
Ability of modelling certain problems using graphs and solving them using algorithms in that setting.	A18096 A18099	B5618 B5623 B5624	C2
Ability of modelling certain problems using networks and solving them using algorithms in that setting.	A18096 A18099	B5618 B5623	C2

Contents

Topic	Sub-topic
Analysis and design of algorithms.	1. Algorithm analysis 2. Algorithm design strategies
Graphs. Algorithms for graphs	3. Graphs. Basic concepts 4. Algorithms for graphs
Networks and network flow	5. Networks and network flow

Planning

Methodologies :: Tests
	Class hours	Hours outside the classroom	Total hours
Lecture	23	31	54

Problem solving, classroom exercises	27	39	66
Assignments	4	4	8
Tutorship of group	0.1	0	0.1

Personal tuition	0.65	0	0.65

Extended-answer tests	4	12	16
	5.25	0	5.25

(*)The information in the planning table is for guidance only and does not take into account the heterogeneity of the students.

Methodologies

Methodologies ::

	Description
Lecture	Theoretical classes. The professor lectures about the theoretical foundations of the course using the blackboard or presentations.
Problem solving, classroom exercises	Problem sessions, where students' participation is fostered.
Assignments	The student should do assignments and turn them in.
Tutorship of group	Small group activity to follow the students' learning process
Personal tuition	The student can ask the professor to clear up some questions outside the classroom.

Personalized attention

Tutorship of group

Personal tuition

Description

The student can ask questions in the group tutoring sessions or ask for individual tutoring, by requesting it previously by email. This office hours can be done at the professor office or through a videoconference platform, or the doubts can be solved by using the forum of the course in Moodle or by email.

Assessment

	Description	Qualification
Extended-answer tests	In class-test	70%
	Assignments, that can be required to be done individually or in groups. They can be required to be done in class and/or to do a presentation about them.	30%

Other comments and second call
<p>The grade wil be computed attending to two types of assessment: summative and continuous. In order to pass the course, it is necessary to obtain a grade of at least 50%. The final grade will be computed only if the student has a grade of at least 30% in every assignment and test.  </p><p>The sumative part will be assessed with at least a test, accounting for 50% of the total grade, which might contain both theoretical and practical questions. </p><p>As for the continuous assessment, the students will need to elaborate at least one assignment (to be done individually and /or in groups) which will be proposed along the term. This part will account for 30% of the total grade. </p><p>The grade of the second call will be the grade obtained in a theoretical-practical test. The grade obtained in the assignments (if greater than 30%) could also be taken into account. </p><p>The use of any electronic device (cell phones, tablets, etc) allowing the student to have communication with other people will be forbidden while doing the tests, as well as any material not explicitly allowed by the professor. </p><p> If a student breaks this rule, he will fail the exam and the Academic Authority of the Center will be informed so that they can follow the procedure approved by the Governing Council of the University on January 29th, 2015.</p>

Sources of information

Access to Recommended Bibliography in the Catalog ULE

Basic	Alsuwaiyel, Algorithms, World Scientific, 2004 Brassard, G.; Bratley, P., Fundamentos de Algoritmia, Prentice-Hall, 1997 Gross, J.L; Yellen, J., Graph Theory and its applications, Chapman &amp; Hall/ CRC, 2006 Wilson, R.G., Introducción a la Teoría de Grafos, Alianza, 1983 Cormet, T.; Leiserson, C; Rivest, R., Introduction to Algorithms, MIT Press Cambridge, 1999 Ahuja, R.K.; Magnanti, T.L.; Orlin, J.B., Network Flows: Theory, algorithms and applications, Prentice Hall, Upper Saddle River, NJ, 1993

Complementary	Sedgewick, R.; Flajolet, P., An introduction to the analysis of algorithms, Addison Wesley, 1996 Chartrand, G.; Oellermann, O.R., Applied and Algorithmic Graph Theory, McGraw-Hill, 1993 Revilla, M.A.; Skiena, S., Programming Challenges:The Programing Contest Training Manual, Springer-Verlag, 2003 Skiena, S., The Algorithm Design Manual, Telos/Springer-Verlag, 1998

Recommendations

Subjects that it is recommended to have taken before

DIFFERENTIAL AND INGTEGRAL CALCULUS / 00709001

DISCRETE MATHEMATICS / 00709002

ALGEBRA / 00709006

COMPUTER PROGRAMMING I / 00709009