Introduction to Programming
Keywords |
Classification |
Keyword |
OFICIAL |
Computer Science |
Instance: 2012/2013 - 1S
Cycles of Study/Courses
Teaching language
Portuguese
Objectives
Introduces the basic principles and concepts of imperative and structured programming, based on the C programming language.
The goal is that students get familiar with the algorithmic problem-solving process and simple algorithms and data structures (for counting, searching and sorting) and gain experience in applying them to the design medium scale computer programs, and acquire good programming skills.
Working method
Presencial
Program
Algorithms and computer programs. Fundamental constructs: numeric data, variables and expressions; assignment; basic data types (integers, floating point numbers, characters). Procedures and functions; parameter passing; scope of variables. Conditional and iterative control structures (basic cycles for/while). Simple IO. Structured decomposition. Introduction to compound data types (arrays and linked lists). Recursion. Algorithmic problem solving: iterative and recursive approaches; divide-and-conquer strategies. Elementary algorithms for searching and sorting.
Mandatory literature
000002544. ISBN: 0-393-96945-2
000002798. ISBN: 0-13-089572-5
Complementary Bibliography
000102107. ISBN: 9780262033848
Teaching methods and learning activities
Lectures: Exposition of the program topics and discussion of examples using a computer connected to a multimedia projector.
Labs: Presentation, discussion and development of programming assignments in C language.
Evaluation Type
Distributed evaluation with final exam
Assessment Components
Description |
Type |
Time (hours) |
Weight (%) |
End date |
Attendance (estimated) |
Participação presencial |
70,00 |
|
|
|
Exame |
|
|
|
|
Trabalho laboratorial |
|
|
|
|
Exame |
|
|
|
|
Total: |
- |
0,00 |
|
Eligibility for exams
Required: * NP >= 1, * F >= 7.0, and * Not to exceed the absence limit (25% of total number of estimated lab classes; 25% of total number of estimated TP classes)
Calculation formula of final grade
Provided students meet the above mentioned requirements, the final grade is:
F = (1/4 TE1 + 3/4 TE2)*17/20 + NP
where
NP = 3*P/20
P: computer assignment (submitted to Mooshak for automatic evaluation)
TE1: 1st written test assignment
TE2: 2nd written test assignment (full course program)
Students with final grade F >= 9.5 do not need to attend the final exam. If they attend the exam, the final grade is the average of P (with weight 3/20) and NE (with weight 17/20), where NE is the classification obtained in the written examination (or F if F is higher).
Classification improvement
P,TE1,TE2 cannot be improved.
Observations
For students under special conditions (TE, DA, ...), a classification NP >= 1.0 in the computer assignment is required.