Autenticação

Utilizador:

Senha:

Iniciar sessão

Esqueceu-se da senha?

Introduction to Programming

Code:

LACI11005

Sigla:

IP

Áreas Científicas
Classificação	Área Científica
OFICIAL	Informática

Ocorrência: 2022/2023 - 1S

Ativa?	Yes
Unidade Responsável:	Departamento de Sistemas e Informática
Curso/CE Responsável:

Ciclos de Estudo/Cursos

Sigla	Nº de Estudantes	Plano de Estudos	Anos Curriculares	Créditos UCN	Créditos ECTS	Horas de Contacto	Horas Totais
EACI	28	Plano de Estudos 14	1	-	6	75	162

Língua de trabalho

Portuguese

Objetivos

• Understand basic concepts and principles of computer operation.


• Development of logical and formal thinking skills for complex problems analysis.


• Understanding of conceptual foundations related to computer programming:




• Understand the general principles of software engineering;


• Understand the central role of Algorithm


• Ability to code (implement) algorithms using programming languages.

Resultados de aprendizagem e competências

Programming framework

• The student should be able to describe the basic architecture of a computer.


• The student must be able to describe and relate the concepts of program and programming language.


• The student must be able to describe how information is represented on a computer.


• The student must be able to represent integer values ​​using different bases (decimal, binary, octal, hexadecimal)

Algorithms

• The student must be able to describe different ways to represent algorithms.


• The student should be able to solve simple problems and use algorithms to formalize the problem solving process.


• The student should be able to use a top-down approach to solving problems with some complexity.

Programming in a high-level language

• The student should be able to use an IDE to develop, test and run programs using the C programming language.


• The student should be able to implement, in C language, algorithms specified in pseudocode.


• The student should be able to use and describe the mechanisms for passing arguments to subprograms. T


• he student should be able to implement and use search and sorting algorithms.


• The student must be able to develop programs that store information in data files.

Modo de trabalho

Presencial

Programa

1.Programming framework

1. Definition of computer.


2. Basic description of a computer.


3. Definition of a program.


4. Programming and solving problems.


5. Representation of Information.


6. Concepts of: natural language, programming language and machine language.


7. Programming Languages and Levels.

2.Algorithms

1. Algorithm concept


2. Representation of algorithms in Pseudocode.


3. Top-down approach.

3. Programming in a high level language: C language

1. Program structure.


2. Elementary Data Types.


3. Expressions


4. Input and Output Instructions.


5. Control structures.


6. Sub-programs.


7. Structured Data Types.


8. Search and ordering algorithms.


9. Files.

Bibliografia Obrigatória

António Adrego da Rocha; Introdução à Programação usando C. ISBN: 972-722-524-1

Bibliografia Complementar

Luís Damas; Linguagem C, FCA. ISBN: 972-722-156-4

Métodos de ensino e atividades de aprendizagem

TP Classes: Exposition of the subject followed by problem solving;
PL classes: Laboratory work and problem solving.

Software

CodeBlocks
https://replit.com/

Palavras Chave

Technological sciences

Tipo de avaliação

Distributed evaluation without final exam

Componentes de Avaliação

Designation	Peso (%)
Teste	65,00
Trabalho laboratorial	35,00
Total:	100,00

Componentes de Ocupação

Designation	Tempo (Horas)
Elaboração de projeto	25,00
Total:	25,00

Obtenção de frequência

• Continuous evaluation




• T - Theoretical component:


• 4 Mini Tests – (15%) [MT1(3%), MT2(3%), MT3(4%), MT4(5%)];


• TE – Test (50%).


• P – Practical component (Project) (35%) – 2 students.


• N – Final Grade: Theoretical Component (65%) + Practical Component (35%).

• Restrictions (20 Values):




• Test (TE) >= 9.5;


• Theoretical Component (T) >= 9.5;


• Practical Component (P) >= 9.5;


• Final grade (N) >= 9.5;


• There is no minimum grade for the Mini Tests.

• Exam




• Final Note (N):




• Exam (E) * 65% + Practice Component (P) * 35%.

• Restrictions (20 Values):




• Exam (E) >= 9.5;


• Practical Component (P) >= 9.5;


• Final grade (N) >= 9.5.

NOTES to the assessment by exam:

• Mini assessment tests carried out in class are not included in the assessment by exam;


• Projects carried out in the continuous evaluation phase may be used in the evaluation by exam in normal or appeal season;


• Students who do not present a project with a positive evaluation will have to carry out the practical component on the date of the respective exam (any season).

Fórmula de cálculo da classificação final

Continuous assessment

• T - Theoretical component:




• 4 forms (F1, F2, F3, F4) carried out online (5% each);


• TE – Test (80%).




• P – Practical component (Project) – 2 students.


• N – Final Grade: Theoretical Component * 65% + Practical Component * 35%.

Restrictions (20 Values):

• Test (TE) >= 9.5;


• Theoretical Component (T) >= 9.5;


• Practice Component (P) >= 9.5;


• Final grade (N) >= 9.5;


• There is no minimum mark for the forms.

The final grade is rounded up to units. For approval, the final grade must be greater than or equal to 10 points.


Assessment in (any) exam season

• Final Note (N):

• Exam (E) * 65% + Practice Component (P) * 35%.

Restrictions (20 Values):

• Exam (E) >= 9.5;


• Practice Component (P) >= 9.5;

• Final grade (N) >= 9.5.

The final grade is rounded up to units. For approval, the final grade must be greater than or equal to 10 points.

Avaliação especial (TE, DA, ...)

Assessment in special season

Conditions equal to those indicated in the evaluation at the time of the exam.

The final grade is rounded up to units. For approval, the final grade must be greater than or equal to 10 points.

Melhoria de classificação

The grade improvement can only be performed in
recourse exam and requires prior enrollment in the Academic Division.