Learning objectives
A goal of the course is to provide the student with the basic knowledge for the design and implementation of simple programs written in a conventional programming language. In particular, the student will acquire in-depth knowledge about the programming tools provided by the imperative fragment of C++.
The course also aims to provide students with the ability to apply the acquired knowledge about programming tools and the acquired problem analysis techniques to solve simple practical problems (such as, for example, mathematical calculation problems, sorting, file management, etc.) and then translate these solutions into executable programs.
Finally, the course aims to help students to develop more general skills of analysis, abstraction (mainly intended as the ability to describe and understand an entity in terms of the features rather than the details of its implementation), the decomposition of problems into subproblems, and development of solutions "from top to bottom" ("top-down") and by stepwise refinements.
Prerequisites
Basics of functions, sets and logical connective and expressions. Basics of computer architecture and information representation.
Course unit content
The course introduces the basics of imperative programming, using the imperative fragment of C++ as the reference language.
In particular, the first part of the course introduces basics of programming such as algorithms, flowcharts, variables, simple and structured data types, expressions, and control statements.
The second part of the course deals with the development of more complex programs, introducing, on the one hand, the notion of sub-program and other related concepts, such as recursive functions and scope rules, on the other hand, other forms of data management, such as files and manipulation of dynamic data structures with pointers.
For both parts, the course shows the implementation of simple C++ programs that use the introduced concepts.
Full programme
- Problems and algorithms: basic notions, flow-charts.
- Programming languages and tools. A sample program in C++.
- Constants and variables.
- Elementary data types in C++.
- Assignment and compound statements - Basic input/output.
- Operators and expressions.
- Control structures (selection, iteration).
- Data structures (abstract vs. concrete). Arrays in C++. Matrices. Strings. 'struct'. Tables.
- The 'typedef' declaration.
- Subprograms: motivations. Function declaration and call in C++.
- Parameter passing: by value, by reference.
- 'void' functions.
- Recursive functions.
- Scope rules in C++. Local vs. global declarations.
- File management in C++.
- Pointers and dynamic memory allocation. Simple linked lists.
- Program development. Integrated Development Environments.
- Developing simple programs using the imperative part of C++.
- Using library functions.
Bibliography
- L.J. Aguilar. Fondamenti di programmazione in C++ , McGraw-Hill, 2008.
- R. Miller, D. Clark, B. White, e W. Knottenbel: An Introduction to the Imperative Part of C++, 1999, disponibile su WEB all'indirizzo http://www.doc.ic.ac.uk/~wjk/C++Intro/CourseStructure.html#S
- Teacher lecture notes, available on the course Web page (at https://elly2022.smfi.unipr.it/).
- C++ programs shown in class, available on the course Web page (at nella pagina web del corso (https://elly2022.smfi.unipr.it/)
Teaching methods
Teaching takes place mainly through lectures and computer-based exercises, either assisted or carried out independently by the students.
The lectures provide, among other, the presentation of a number of practical examples, along with the related solutions written in C++, that will be made available on the Web site of the course (at elly.smfi.unipr.it/).
The computer-based exercises consist of the assignment, about each ten days, of one or more problems related to the topics covered in class. The student will have to solve the exercises independently and deliver solutions within a week, using the Parma University e-learning platform (elly.smfi.unipr.it/). The platform allows, among other, the teacher to monitor the delivery of the exercises and to provide suggestions for their implementation.
Physical meetings with the teacher are scheduled for all those students who have difficulties in achieving the assigned exercises.
Assessment methods and criteria
The final examination of the Fundamentals of Computing A course consists of a written theory test and a written programming test.
The theory test consists in answering on paper ten closed questions on the most basic and general topics treated throughout the course. This test serves as a barrier for the second programming test. To pass the theory test and access the programming test, 70% of the questions are required to be answered correctly. If the student does not correctly answer at least 70% of the questions, the exam is considered not passed and will not be able to access the programming test.
The programming test consists in the solution on paper of some programming exercises, using the imperative fragment of C++ presented in the course.
For students of the Degree in Computer Science, this course exam is integrated with that of the course "Fundamentals of Programming B"
Fundamentals of Programming A+B: For students of the Degree in Computer Science, this course exam is integrated with that of the course "Fundamentals of Programming B". A mark out of thirty is assigned to each of the exams (part A and part B). The exam of Fundamentals of Programming A + B is considered passed if the arithmetic average between the grade obtained in Fundamentals of Programming A and that obtained in Fundamentals of Programming B is greater than or equal to 18 and each of the two grades is greater than or equal to 16.
Other information
The course includes its own Web page, managed directly by the teacher, based on the e-learning platform of the University of Parma (at https://elly2022.smfi.unipr.it/).
2030 agenda goals for sustainable development
- - -
