Programming 1 (P1)

-

Knowledges

1. Syntax and semantics of the expressions and instructions used in an imperative programming language (C++). Basic and structured data types. Functions and actions.
2. Iterative and recursive design.
3. Basic schemes on sequences and tables, classical algorithms.

Abilities

1. When facing an elementary problem, find an elegant algorithm for solving it. Be able to code it with a subgroup of basic instructions of the imperative language C++
2. Use editing, compiling and running tools to develop programs.
3. Have resources to correct the programs when they don't work.
4. Write programs with good style, with a relevant documentation, with the precise comments and the necessary specifications.
   
   
   
   .

Competences

1. Ability to argue in a critical and logical-mathematical manner.
2. Ability to think in abstract terms. Ability to tackle new problems by consciously using strategies that have proved useful in solving previous problems.
3. Ability to understand problems: given a problem, distinguish between data (or starting elements), unknowns (or what is asked for), hypotheses, and the laws applicable.

(-)

There are several tests, all in front of computer
and consistent in resolving a problem.

During the course, there will be from 4 to 7 controls (including the partial exam) that evaluate the monitoring of the agenda contents up
to then. Teachers will be able to require that the
students deliver a few exercises of the collection
to be been able to present to the controls.

Let C be the weighted average of the controls. At the beginning of the course, the weights of each control will be made public.

In the period of exams, three tests will be
carried out (F1, F2 and F3) that evaluate the
totality of the contents. Not attending these tests will imply a qualification of NP.

Each problem is evaluated independently of the
others and receives a grading between 0 and 10 points,
according to the criteria that are given further
down on the correction of the problems. The final
note of the subject is

Max {(C + F1 + F2 + F3) / 4, (F1 + F2 + F3) / 3}.

Any attempt of fraud during the course will entail the application of the UPC's general academic normative and the beginning of a disciplinary process.


Problem correcting criteria:

A problem is defined with a description and one or more public tests.
Solving a problem consists on writing a correct program (according to the following) that passes all tests, both public and private. When a student considers his/her program is correct will send it to an automatic judge which, in a few seconds, will return a verdict about the behaviour of his program. No matter whether the program passes the private tests, the student can upload many solutions for the same problem. If, at the end of the exam, the student didn't send any program that passes all tests, the grade will be 0.

Otherwise, from all the successful programs, the teachers will manually correct the last one. If they detect that the student hasn't followed the basic programming rules, the program doesn't satisfy the problem or the algorithm is clearly inadequate, the grade will be 0

Otherwise, let v be the grade, between 0 and 5, given by the teachers to the corrected program (according to the clarity, style, etc), and let p be the number of programs sent that do not pass the tests. The grade is

5 + v - max{ p-1, 0 }.

According to this, a point on ten will be subtracted for each solution that doesn't pass the tests, but the first incorrect solution isn't penalized. Logically, a negative grade is converted to 0 (so 10 is the maximum number of incorrect uploads)

• J. Petit, S. Roura Col·leció de Problemes de P1, , .

• F. Xhafa, P-P. Vázquez, J. Marco, X. Molinero, Á. Martín Programación en CPP para ingenieros, Thomson, 2006.
• X. Franch, J. Marco, X. Molinero, J. Petit, F. Xhafa Introducció a la Programació - Exercicis resolts, Edicions UPC, 2006.

1. http://p1.lsi.upc.edu
   

(-)