Computer Programming
A.Y. 2019/2020
Learning objectives
This is an introductory class on programming, its principles, and techniques. Its aim is to make the student, who might never have been exposed to programming, familiar with this discipline and to provide those insights and tools required to approach all further classes that assume some knowledge of programming.
Expected learning outcomes
At the end of the course the student will be able to devise and write solutions to average difficult problems using an imperative programming language. They will also be able to solve some simle problems using the object oriented paradigm.
Lesson period: First semester
Assessment methods: Esame
Assessment result: voto verbalizzato in trentesimi
Single course
This course cannot be attended as a single course. Please check our list of single courses to find the ones available for enrolment.
Course syllabus and organization
Single session
Responsible
Lesson period
First semester
Course syllabus
BASIC CONCEPTS
· Algorithms.
· Phases of programming.
· Modeling tools.
· Documentation.
· A brief history of programming.
· Programming languages
STRUCTURED PROGRAMMING
· Principles of structured programming.
· C Language: expressions and assignments, control structures, predefined types, arrays, matrices, and strings, structured types, pointers, and memory management, functions and parameter passing, main and parameters to main, standard library, file management.
· Jumps elimination: the Böhm-Jacopini Theorem, Ashcroft and Manna's transformation.
· Code correctness: elements of validation and verification.
OBJECT ORIENTED PROGRAMMING
· Modularity, abstraction and abstract data type, encapsulation classes and objects, inheritance and polymorphism
· Design pattern, Aspect oriented programming
· Java programming
· Advanced software development practices
· Algorithms.
· Phases of programming.
· Modeling tools.
· Documentation.
· A brief history of programming.
· Programming languages
STRUCTURED PROGRAMMING
· Principles of structured programming.
· C Language: expressions and assignments, control structures, predefined types, arrays, matrices, and strings, structured types, pointers, and memory management, functions and parameter passing, main and parameters to main, standard library, file management.
· Jumps elimination: the Böhm-Jacopini Theorem, Ashcroft and Manna's transformation.
· Code correctness: elements of validation and verification.
OBJECT ORIENTED PROGRAMMING
· Modularity, abstraction and abstract data type, encapsulation classes and objects, inheritance and polymorphism
· Design pattern, Aspect oriented programming
· Java programming
· Advanced software development practices
Prerequisites for admission
This is an introductory class on programming, its principles, and techniques. The scope is to provide all the knowledge to model, solve and develop software solution to simple problems. Therefore, there are no specific pre-requisites to address the course.
Teaching methods
Lectures for the theoretical part and laboratory exercises mainly for practicing C and Java programming.
Teaching Resources
Slides and additional documents available on the course web site.
Assessment methods and Criteria
The exam is divided into three different parts. A written exam for the theoretical part where competences in terms of computer programming concepts and algorithmic thinking are evaluated. A laboratory exam based on simple problems to be solved writing simple C programs. A project in Java (that need to be agreed with the teacher) where the OO competences in Java, the quality and complexity of the project are evaluated.
The vote of theoretical and laboratory parts of the exam is expressed in thirtieths. The vote of the project is expressed as an increment of a maximum 2 points on the average of the theoretical and laboratory parts.
The three parts of the exam can be done even in separated distinct exam sessions. The project can be presented just when a vote greater or equal than 17 has been obtained for both the theoretical and the laboratory exams (but with an average vote greater or equal to 18).
The vote of theoretical and laboratory parts of the exam is expressed in thirtieths. The vote of the project is expressed as an increment of a maximum 2 points on the average of the theoretical and laboratory parts.
The three parts of the exam can be done even in separated distinct exam sessions. The project can be presented just when a vote greater or equal than 17 has been obtained for both the theoretical and the laboratory exams (but with an average vote greater or equal to 18).
INF/01 - INFORMATICS - University credits: 12
Laboratories: 48 hours
Lessons: 72 hours
Lessons: 72 hours
Professors:
Anisetti Marco, Ferrari Stefano, Tresoldi Emanuele
Shifts:
Turno B
Professor:
Tresoldi EmanueleProfessor(s)