Educational guide
IDENTIFYING DATA 2024_25
Subject ALGORITHMS AND GRAPHS Code 00709014
Study programme
0709 - GRADO EN INGENIERÍA INFORMÁTICA
Descriptors Credit. Type Year Period
6 Compulsory Second First
Language
Castellano
Prerequisites
Department MATEMATICAS
Coordinador
BALIBREA INIESTA , FRANCISCO
E-mail fbali@unileon.es
jgomp@unileon.es
dmorg@unileon.es
Lecturers
GÓMEZ PÉREZ , JAVIER
BALIBREA INIESTA , FRANCISCO
MORALES GONZALEZ , DANIEL
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
Block I: ALGORITHMS Unit 1: Algorithm analysis
Unit 2: Algorithm design strategies
Block II: GRAPHS Unit 1: Graphs. Basic concepts
Unit 2: Algorithms for graphs
Unit 3: Flow networks

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 Two written tests will be carried out throughout the semester, one related to Block I (Algorithms) and another on Block II (Graphs). Al menos el 70 % de la calificación global
One or more works/practises will be proposed throughout the semester, which may be required to be prepared individually or in a group. Hasta un 30 % de la calificación global
 
Other comments and second call

The continuous evaluation (first call) will be summative. To pass the subject it is necessary to obtain an overall grade of 50 %, at least.

The second call (extraordinary) will be evaluated through a theoretical-practical exam that covers the contents taught in the subject. This may be divided into two parts. The parts already evaluated from the first call may be taken into account for the second call.

When carrying out the evaluation tests, the use of electronic devices (mobile phones, tablets, etc.) that allow the student to communicate, receive information, etc., from other people, digital platforms, etc. will not be permitted. The use of notes and other material is also prohibited, except those previously specified by the teacher.

The simple possession of devices as well as various unauthorized materials during the evaluation tests will result in immediate withdrawal from the exam, expulsion from it and qualification as a fail; with the incident being communicated to the Academic Authority of the Center, so that they can carry out the planned actions provided in the Guidelines for Action in Cases of Plagiarism, Copying or Fraud in Exams or Evaluation Tests, approved by the Permanent Commission of the Government Council on January 29, 2015.


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 & 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