Universidad de Jaén

Menú local

Syllabus 2018-19 - 13312009 - Algorithm Design (Diseño de algoritmos)

Caption
  • Level 1: Tutorial support sessions, materials and exams in this language
  • Level 2: Tutorial support sessions, materials, exams and seminars in this language
  • Level 3: Tutorial support sessions, materials, exams, seminars and regular lectures in this language
DEGREE: Grado en Ingeniería informática
FACULTY: SCHOOL OF ENGINEERING OF JAÉN

ACADEMIC YEAR: 2018-19
SYLLABUS
1. COURSE BASIC INFORMATION
NAME: Algorithm Design
CODE: 13312009 ACADEMIC YEAR: 2018-19
LANGUAGE: English LEVEL: 1
ECTS CREDITS: 6.0 YEAR: 2 SEMESTER: SC
 
2. LECTURER BASIC INFORMATION
NAME: GARCÍA VEGA, MANUEL
DEPARTMENT: U118 - INFORMÁTICA
FIELD OF STUDY: 570 - LENGUAJES Y SISTEMAS INFORMÁTICOS
OFFICE NO.: A3 - 126 E-MAIL: mgarcia@ujaen.es P: 953212465
WEBSITE: http://blogs.ujaen.es/mgarcia/
LANGUAGE: - LEVEL: 1
 
3. CONTENT DESCRIPTION

Lectures

Unit I: Finite automata. Review of regular languages and their abstract machines. Review of several types of finite autómata. Design of finite automata. Definition of regular languages using regular expresions. Definition and design of regular grammars. Transformation between these abstract elements.

1. Finite Automata, Regular Grammars and Expresions

Unit II: Algorithms Design. Review of fundamental programming techniques for efficient algorithms designing. 

2. Divide and Conquer Algorithms
3. Greedy Algorithms
4. Dynamic Programming
5. Backtracking
6. Probabilistic Algorithms

Practice sessions

Grammar and Languages
Finite Automata 
Regular Expresions
Greedy Algorithms
Divide and Conquer Algorithms
Dynamic Programming

4. COURSE DESCRIPTION AND TEACHING METHODOLOGY

Lectures

These sessions are organized into two hours per week during the course. The methodologies used are the lecture and presentations of examples and problems. During these sessions, student participation is encouraged by the teacher conducting questions.

The contents of the examples and problems will be focused on the CB2R , CB3R CB5R and CC6R skills, using the knowledge acquired in the theory classes.

In the learning management system will be available the entire material theory and exercises. This material must be revised before each session of theory with the help of the course booklist.

Practice sessions

Practice sessions will be two hours long, and will be held weekly during the semester. The practice script for each session will be available beforehand, so that the students can work on the exercises on their own before the session. During the practice session, the teacher will give a short lecture about themain concepts in the script, and will solve questions from the students. Then, the students will work with the computers to implement the practice exercises from the script under the teacher guidance.

There are four mandatory deliverables to accomplish practical tasks.

Group seminars

There will be several group seminars during the semester. The students will have to solve practical exercises by working in groups of two or three persons, and applying the theoretical concepts explained in normal lectures. The teacher will help the groups by solving any question they ask. At the end of the seminar, the teacher will pick up each group's work, and will mark them; these marks will included in the final marks of the students. The seminar dates will be published in the official schedule at the beginning of the semester.

Students with special educational needs should contact the Student Attention Service (Servicio de Atención y Ayudas al Estudiante) in order to receive the appropriate academic support

5. ASSESSMENT METHODOLOGY

Under the provisions of art. 13 of the Regulation of Academic Regime and Evaluation of the Students of the University of Jaén, the evaluation of the course is global.

To pass the course, the student must obtain a score of 5.0 after adding the grades of the following sections:

  • S1. 5% obtained in the class participation using a reward system, based on "Unibadges: learning goals gamification" project, getting 1-50 tickets for the final mark.
  • S2. 65 % of the grade obtained in the theory exam (22.75% for Unit I and 42.25% for Unit II) ). A minimum of 4.0 out of 10 is required in this exam.
  • S3. 5 % of the grade obtained from the exercises delivery and virtual seminars participation.
  • S4. 25 % of the grade obtained in the practical part (8.75% for Unit I, 16.75 for Unit II)

The final marks of the S1 , S3 and S4 blocks are valid for the entire year.

6. BOOKLIST
MAIN BOOKLIST:
  • Fundamentals of algorithmics. Edition: -. Author: Brassard, Gilles. Publisher: Upper Saddle River, N.J. Prentice Hall, cop. 1996  (Library)
  • Introduction to automata theory, languages and computation. Edition: -. Author: Hopcroft, John E.. Publisher: Reading [etc.]: Addison-Wesley, cop. 1979  (Library)
ADDITIONAL BOOKLIST:
  • Introduction to Algorithms. Edition: 3rd ed.. Author: Cormen, Thomas H.. Publisher: Cambridge (Massachusetts) : MIT Press, cop. 2009  (Library)