Teaching: Programación II

This subject consist of two well distinguished parts. The first one deal with teaching of basic structured programming skills, what it means to continue tackling the contents of "programación I". Moreover, the student will be introduced in new concepts related to Data structure implementation and analysis and design of algorithms (Dynamic data structures, Abstract Data types, Temporal complexity, sorting algorithm, ...). The second one is focused on programming methodologic aspects related to software engineering. In this regards, some concepts of this helpful framework will be presented in order to show our students how to develop a software project.

TOPICS (pdf)

UNIT I: Structured Programming techniques. Abstract Data types. Analysis and Design of Algorithms.

• Topic 1. Recursion.(Exercises)

• Topic 2. Pointers and Dynamic Memory Allocation. (Exercises)

• Topic 3. Dynamic Data structure. Linked List(Exercises)

• Topic 4. Abstract Data Type.

• Topic 5. Algorithm complexity.(Exercises)

  UNIT II: Some development activities to guarantee software quality.

• Topic 6. An introduction to software engineering.

• Topic 7. Testing programs.(Exercises)

• Topic 8. Algorithm correctness.(Exercises)

• Topic 9. The software project report .

Theory

• "Pascal Programming, 2nd Edition". B.J. Holmes.;Thomson, 2003

• "Pascal Plus Data Structures, Algorithms, and advanced programming". Nell Dale, Susan C. Lilly; D.C Heath and Company, 1995

• "Fundamentals of Data Structures in Pascal " Ellis Horowitz, Sartaj Sahni, W H Freeman & Co, 1999.

• "Software Engineering: A Practitioner's Approach ". Pressman R.S.; Mc Graw Hill, 5th edition,2001

• "Logic and Discrete Mathematics: A Computer Science Perspective". Grassman W.K. et al.; Prentice Hall, 2000

• "Software Testing Techniques". Boris Beizer, 2nd Edition; New York: Van Nostrand Reinhold, 1990

• "Black Box Testing: Techniques for functional Testing of Software and System". Boris Beizer, John Wiley and Sons, 1995

Practice

• "Turbo Pascal: Programing and problem solving". Sandford Leestma & Larry Hyhoff.; Prentice Hall, 2001

The laboratory for practical exercises keeps the same scheme followed by programming I (programación I). It means a practical lecture every two weeks per group and using Pascal programming Language for encoding the algorithms. During this lectures several practical exercises related to the theoretical contents will be carried out. The last exercise will be designed taking into account all the contents presented up to now. A correct development of this last one is compulsory to pass the subject.

• Introduction to Units in Turbo Pascal 7.0

• Practical exercise 1

• Practical exercise 2

• Practical exercise 3. Final Exercise.

Grading process will take into account the next aspects:

• Continuous assesment: During the course, the students will be requested to present several homeworks.These works will be take into account on the final grade.

• Attending theory lectures: An attendance of 85% will be compulsory to consider the continuous assesment on the final grade.

• The final exam and the practical exercises (laboratory)

Examination sessions

• Ordinary and extraordinary examination sessions: The final grade is worked out as follows:
  Final grade=0.7 x (theory grade) + 0,3 x (practical exercises grade). The minimum passing grade is "five".
  where:
  (theory grade)= 0,8 x (final exam grade) + 0,2 (continuous assesment). A minimum passing grade of five in this part is also compulsory
  (Practical exercises grade)=0,2 x (last practical exercise) + 0,1 x (Practice exercises remaining). A correct development of the last practical exercise is compulsory to pass the subject
  

Final Exam date

• Final exam date (theory), ordinary examination session: June the 12th, tuesday, at 10:00 a.m.

• Final exam date (theory), extraordinary examination sesssion: September the 11th, tuesday, at 11:15 a.m.

  
  

---

Come back to the main page

---