Course Details for A.Y. 2015/2016

The information on this page refer to the academic year 2015/2016. Therefore, several links are not available and data may be incomplete. To read the current information on the course, if it is still available, go to the university course catalogue . To read information relating other academic years, use the list at the bottom of this page.

A. Year:

2015/2016

Name:

Fondamenti Di Informatica / Fundamentals of Informatics

Type:

Course

Basic information

Code:

I0265

Sector:

ING-INF/05

Credits:

: Laurea in Ingegneria dell'Informazione 9 CFU (b)

Term:

1^st semester

Degree(s):

Laurea in Ingegneria dell'Informazione 1^st anno curriculum Automatica Compulsory
Laurea in Ingegneria dell'Informazione 1^st anno curriculum Telecomunicazioni Compulsory
Laurea in Ingegneria dell'Informazione 1^st anno curriculum Elettronica Compulsory
Laurea in Ingegneria dell'Informazione 1^st anno curriculum Comune Compulsory
Laurea in Ingegneria dell'Informazione 1^st anno curriculum Informatica Compulsory

Language:

Italian

Teacher(s):

Eliseo Clementini

Course Objectives

The course is aimed at the acquisition of the fundamental concepts of computer science without neglecting the experimental aspects of the discipline and its immediate application. It begins with a description of the computer system in general and then focus on high-level programming techniques with the goal of developing in students the ability to design programs. The reference language will be C++, although the concepts presented in the course are language-independent and easily applicable in any imperative language like Pascal or Java. The course also deals with the study of fundamental algorithms such as sorting and searching algorithms together with the calculation of their running time.

Course Content

1 . Architecture of computer systems. Processes and processors. Problems, algorithms and programs. Programming languages. Computer architecture. Von Neumann model. Positional base-b numeral systems. Base conversions. Representation of negative numbers in sign-magnitude and two's complement. Representation of real numbers in floating-point. ASCII code. Boolean algebra and main logic functions. Dev-C + + Programming Environment.
2 . Programming elements. Development of algorithms. Concept of variable. Elementary operations: reading, writing, assignment, and comparison. Flowcharts. Pseudo-code. Control structure if-then-else. Cycles with pre-condition and post-condition. Control structures while-do and do-while. Algorithm design with cycles. Control over input data. Translation in C++. Basic constructs of C++. Structure of a program. Declaration and code sections. Declaration of variables. Classification of types. Simple types, internal representation and operations. Numeric and conditional expressions. Assignment statement. Compound statement. Binary selection. Standard functions of input/output. Loop statements (WHILE, DO-WHILE, FOR). Construction of nested loops. N-ary selection.
3 . Programming with structured types. Array type: definition and memory representation. Type declarations with typedef. Programs with vectors. Two-dimensional arrays. Programs with matrices. String type. Struct type. File Type. Primitives for sequential files.
4 . Programming with functions. Subroutines. Top-down design. Parameters. Declaration of functions. Global variables. Local variables. Formal and actual parameters. Passing parameters by reference and by value. Memory usage. Variables Life cycle. Visibility of variables. Masking of variables. Recursion.
5 . Efficiency of the programs. The function t (n). Cost model. Calculation of t(n) for iterative programs. Best case, worst case, and average case. Computational complexity. Asymptotic notation , , . Boundaries to the complexity of a problem. Calculation of t(n) for recursive programs. Solution of the recurrence for the factorial and Fibonacci numbers .
6 . Fundamental algorithms. Sequential search. Binary search. Insertion and deletion in a sorted array. SelectionSort. InsertionSort. Bubblesort. Mergesort. Quicksort : analysis of the complexity in the best case and worst case.
7 . Programming with pointers. Static and dynamic memory management. Pointer type. Working with pointers: assignment, new, delete, reference, dereference. Constant null. Use of pointers. Creating dynamic arrays. Similarity between arrays and pointers. Creating dynamic arrays. Linked structures in dynamic memory. Linked lists with pointers. Programs with linked lists .

Learning Outcomes (Dublin Descriptors)

On successful completion of this course, the student should

OF BASICS OF INFORMATICS AND PROGRAMMING LANGUAGES
IN THE DEVELOPMENT OF SIMPLE PROGRAMS IN IMPERATIVE LANGUAGES
OF SIMPLE AND MIDDLE-SIZED COMPUTER PROGRAMS
OF BASIC NOTIONS OF COMPUTER SCIENCE
IN MORE COMPLEX PROGRAMMING ENVIRONMENTS AND COMPUTER SYSTEMS

Prerequisites and Learning Activities

There are no compulsory computer science prerequisites, but a so-called informatics alphabetization would be helpful (such as being able of working with any commonly available personal computer with its windows-based operating system and being able of writing a text). Also helpful are basic notions of algebra and mathematical analysis since they are used during the course to design programs to solve simple mathematical problems.

Assessment Methods and Criteria

Computer programs to be written at home and uploaded online. Written test and oral exam.

Textbooks

E. Clementini, Fondamenti di informatica: Programmazione strutturata in C++ , Carocci Editore. 2006.

Internet Resources

Teaching material:

Teaching material available on the external website http://www.didattica.univaq.it/moodle/course/view.php?id=1224.

Course page updates

This course page is available (with possible updates) also for the following academic years:

To read the current information on this course, if it is still available, go to the university course catalogue .

Course information last updated on: 12 febbraio 2014, 15:45