Curricular Unit: | Code: | ||

Introduction to Algorithms and Programming | 831IAPG | ||

Year: | Level: | Course: | Credits: |

1 | Undergraduate | Computer Systems Engineering | 6 ects |

Learning Period: | Language of Instruction: | Total Hours: | |

Winter Semester | Portuguese/English | 78 | |

Learning Outcomes of the Curricular Unit: | |||

Upon successful completion of this course unit students should be able to (learning outcomes - LO): LO1 - formulate problems in natural language and their translation into an abstract language LO2 - explain the notion of algorithm, and master its description using various structured notations LO3 - explain and simulate the execution of an algorithm and its results LO4 - correctly distinguish and use programming concepts such as control structures, data types and declarations, operators and expressions LO5 - apply procedures and functions as a way of structuring algorithms LO6 - apply basic data structures such as arrays, and strings in algorithms LO7 - apply structured types and files to algorithms LO8 - apply procedural programming language C to implement introductory algorithms | |||

Syllabus: | |||

1. Algorithms and Computation 1.1 Definitions 1.2 Representation of Algorithms 1.3 Testing Algorithms 2. Introduction to Programming 2.1 Software and program concepts 2.2 Machine language, assembly and high level 3. Types and Declarations of Data, Expressions and Intrinsic Functions 3.1 Data types: ordinal, real, string, definition and type conversion 3.2 Constants 3.3 Operators and expressions 3.4 Intrinsic functions 4. Control structures 4.1 Simple and structured instructions 4.2 Instructions: conditional, repetitive, jumping 4.3 Built-in structures 5. Functions 5.1 Concept 5.2 Local vs. Global Variables 5.3 Functions 5.4 Recursion 6. Indexed Variables and Strings 6.1 Concepts 6.2 Vectors and Matrices 6.4 Character Strings 7. Structured Types 7.1 Definitions 7.2 User-defined records 8. Files 8.1 Notion, type and use of files 8.2 Text and direct access files | |||

Demonstration of the Syllabus Coherence with the Curricular Unit's Objectives: | |||

The syllabus presented are consistent with the learning objectives of the curricular unit since there is a large convergence between the table of contents and the knowledge that the student is supposed to acquire in each of the program topics. The fundamental concepts of algorithm and computation are presented in the introductory chapters, in the following chapters are presented the fundamentals of computer programming. The learning objectives are achieved by supplementing the theoretical concepts with concrete examples and exercises run in lab environment using appropriate software | |||

Teaching Methodologies (Including Evaluation): | |||

Theoretic-Practic (TP) and practic-lab (PL) components. In TP classes, concepts are presented interspersed with examples and exercises. In PL classes are posed and solved exercises and problems, eventually using software. Final_Grade_IAP = (2/3) x Grade_TP + (1/3) x Grade_PL Required: Grade_TP> = 10 Grade_PL> = 10 Grade_PL: compulsory for continuous evaluation and is not subject to examination. It consists of a programming project carried out during the semester. If student does not submit the project will have zero and can only carry out the project in a subsequent edition of the UC. Grade_PL = Practical project grade Grade_TP: In continuous evaluation, two frequencies F1 and F2, Grade_TP = (50%) x F1 + (50%) x F2 On exam, Grade_TP = Grade_TP_Examination If only TP or PL is positive, it is valid for a maximum period of two academic years after the year in which the student has obtained approval in this component. During this period the UC is not completed (NC) | |||

Demonstration of the Coherence between the Teaching Methodologies and the Learning Outcomes: | |||

The teaching/learning methodology applied in this curricular unit as well as its evaluation system is perfectly aligned with the objectives to be attained by the students at the end of the term. The theoretical concepts are presented, discussed, applied and evaluated in the context of lectures, which guarantees students a solid foundation to understand the challenges facing this area of knowledge. On the other hand, so that the study is not restricted to conceptual models, in the practical lessons are presented concrete case studies and implemented solutions for real problems using appropriate software. This combination guarantees training for students that allows them to meet the scientific goals, essential to a good understanding of the theme, as well as the ability to adapt to technological changes. The evaluation process consists of theoretical tests and practical work also guarantees a correct balance between the efforts dedicated to both components. The objective is to train professionals’ specialized in state-of-the-art techniques and tools but also ensure its ability to follow future developments. In this curriculum unit the problem of algorithms and programming are presented and evaluated in theoretical component. These concepts are then applied in the resolution of the worksheets and practical work in the context of practical classes | |||

Reading: | |||

[Sa] Marques de Sá, J. P. “Fundamentos de Programação Usando C”, Editora FCA, 2004, ISBN 972-722-475-X [Damas] Damas, Luis “Linguagem C”, Editora FCA, 1999, ISBN 972-722-156-4 [Samp] Sampaio, Isabel; Sampaio, Alberto “Fundamental da Programação em C”, Editora FCA, 1998, ISBN 972-722-130-0 [Vasc] José Vasconcelos e João Carvalho, “Algoritmia e Estruturas de Dados – Programação nas linguagens C e Java”, Editora, Centro Atlântico, 2005, ISBN 989-615-012-5 [KR] Kernighan, Brian W. “The C Programming Language”, Prentice-Hall International, 1988 [CLR] Cormen, Leiserson, Rivest “Introduction to Algorithms “ MIT-Press, 1990, ISBN: 0-262-03141-8 |