The subject of Basic Programming introduces students to the field of software development. This subject is the first step in the training of students in the development of programs in the degree course.





The main goals of this module are:

1. Learn the application developmen methodology: specification, algorithm design following

a top-down approach and implementation.

2. Learn to document the solution following the methodology.

3. Be abble to deal with problems that require working with lists and data sequences.

4. Be able to understan and use the main programming structures:

a. Control structures: sequential, conditional and iterative structures.

b. Functions and procedures.

c. Data structures.

5. Implement the structures in a particular language: Java.

The competences to be acquired in the subject are:



- Ability to analyse and explain the behaviour of programs that contain: instructions, I/O

operations, iteration, sub-programs.

- Ability to divide a problem into logical parts that can be solved (programmed) independently.

- Ability to design simple algorithms to solve problems, implement them, test them and fine-tune

them. Ability to write code in accordance with rules of good practice.

- Knowledge, design and efficient use of the most suitable types and structures of data for

problem-solving.

- Knowledge of basic algorithmic procedures in IT technologies for design solutions to

problems, analysing the suitability and complexity of the algorithms proposed

1.- Introduction

This chapter introduces programming, focusing on the methodology that entails several steps

(specification, algorithm design, implementation and test). It highlights the importance of the

algorithm design.



2.- Elementary concepts for programming

Throughout this chapter, the student will learn the basics of algorithm design and programming.



3.- Functions and procedures

In this chapter the student will learn to design and implement subprograms.



4.- Control structures and algorithm templates

This chapter covers the conditional and iteravi structures. In addition, the main algorithm

templates will be presented.



5.- Data structures

This chapter presents the mechanisms to define complex data structures and lists.

During lectures, explanations of concepts will be combined with the performance of exercises.

In the laboratory, a series of (previously-distributed) exercises will be worked on. The sessions require prior preparation and the presentation of a report using the problem-solving methodology given. A project will also be created, in which the student will put the concepts worked on in the subject into practice.

• Final Assessment System
• Tools and qualification percentages:
  • Written test to be taken (%): 55
  • Realization of Practical Work (exercises, cases or problems) (%): 45

Assessment in the ORDINARY call will be done under continuous assessment or final assessment. By defect, all students will do continuous assessment unless they withdraw from it.



* FINAL ASSESSMENT

The student may withdraw from continuous assessment to do final assessment (final exam). This withdrawal will be presented in writing to the professor responsible for the subject in the periods established in Article 8 of the Rules on Assessment of Students. Exceptional cases will not be accepted, nor can students withdraw from continuous assessment after the stated dates.



* CONTINUOUS ASSESSMENT



The final grade of the subject is calculated on the basis of the exam marks (55%), laboratory work (35%) and individual practical work (15%).



GRADING IN MINUTES:



Students who have not withdrawn from continuous assessment will be considered as presented for the ORDINARY call.



To pass the subject, the student must take all the exams and obtain a minimum final grade of 5 out of 10. The student must also score at least 3 out of 10 and 4 out of 10 in the grade corresponding to the exams, and a weighted average of 4.5, in order to take into account the laboratory and practical work grades. Otherwise, the grade obtained will the average marks of the exams.



* WITHDRAWAL FROM THE EXAM

A student who, having opted for final assessment, does not present him/herself for the ORDINARY call will be graded as "NOT PRESENTED". A student who takes continuous assessment may withdraw from the call as per stipulated in Article 12 of the Rules on Student Assessment.





* CASES OF COPYING/PLAGIARISM

Article 11 of the current rules on student assessment will be applied. Any student involved in a plagiarism/copying case will automatically fail the ordinary call

Assessment in the EXTRAORDINARY call will consist of three parts:



In the extraordinary call, the students may recover the parts corresponding to practical work and laboratory work.

Studends who have passed the laboratory evaluations or the individual practical work, may maintain the grade obtained in the ordinary call. In order to keep the grades of these parts, students must achieve at least a 45% of the grade related to the exam excercised not tied to the laboratory or individual work.



Students who have withdrawn from continuous assessment will have a single final exam in which the aspects worked on in class, the laboratories and practical sessions will be assessed.





To withdraw from this exam, it is sufficient not to appear on the day.



* CASES OF COPYING

Article 11 of the current rules on student assessment will be applied.

Course material in egela

Basic bibliography

"Una Introducción a la programación. Un enfoque algorítmico". J.J.Garcia, F.J. Montoya,J.L Fernandez, M.J. Majado

Thomson Ed. 2005



"Oinarrizko Programazioa. Ariketa-bilduma" Díaz de Ilarraza A., Sarasola K.

Udako Euskal Unibertsitatea, 1999.

In-depth bibliography

"La práctica de la programación". B.W. Kernighan, R. Pike. Prentice Hall. Ed, 2000.
"Code Complete: A Practical Handbook of Software Construction". Steve McConnell.
Microsoft Press, 2004.
"Java 2. Iniciación y Referencia". Sánchez Allende, J., Huecas Fernández-Toribio, G., Fernández
Manjón, B., Moreno Díaz, P. Ed. Mc Graw-Hill, 2005.

Web addresses

es.wikibooks.org/wiki/Fundamentos_de_programación