: Informatica: programmazione () by Stefano Ceri; Dino Mandrioli; Licia Sbattella and a great selection of similar New, Used and. Informatica: programmazione: Dino Mandrioli, Licia Sbattella Stefano Ceri: Books – Displaying all 2 entries for query ‘Dino Mandrioli, Licia Sbattella Stefano Ceri’. Informatica: programmazione · by Dino Mandrioli, Licia Sbattella Stefano Ceri.
|Published (Last):||17 July 2017|
|PDF File Size:||10.78 Mb|
|ePub File Size:||10.74 Mb|
|Price:||Free* [*Free Regsitration Required]|
Informatica A (Computer Science A) | Informatica A
Information on the course unit. None Target skills and knowledge: Understanding the basic concepts of: Learning how to apply these concepts to problems related to: Acquiring the skills needed to develop simple applications in Python.
The writtn exam includes: Acquired knowledge will be evaluated by the ability to apply the methodologies studied independently and consciously, and to implement problem solutions in Python language. Computers as algorithms automated performers. Logical organization and operating principles of computers: Central processing unit, central memory, mass storage devices, input and output devices, Hierarchy of memory cache, main, secondary and tertiary memory ; Pipeline design, CISC and RISC, multiprocessor and multi-core architectures.
The operating system Functions and organization of operating systems.
29227 – Foundations of Informatics T (L-Z)
Binary encoding of information The concept of encoding information Computer architecture Background. Central processing unit, central memory, mass storage devices, input and output devices Hierarchy of memory cache, main, secondary and tertiary memory unformatica Pipeline design, CISC and RISC, multiprocessor sbqttella multi-core architectures.
Binary encoding of information The cerri of information encoding. Calling on positional numbering and base numbering systems; Encoding of integers no sign, sign and value, complement to two and fractional numbers fixed and floating point. Coding of non-numeric information: Introduction to algorithm analysis, examples of a problem and their size.
Sequential and binary search algorithms. Sorting algorithms selection sort, bubble sort, insertion sort. Implementing Search and Sorting algorithms in Python. Recursion, elimination of recursion. Arrays, lists, piles and tails. Translated and interpreted languages. Executing a program by compiling and interpreting. Elements of C language and compiling a program.
Python language Main data types: Mathematical and logical operators. Accessing the elements of a sequence: The break and continue instructions.
The standard Python library. Msndrioli math and random libraries. Defition of new functions, parameters, call, arguments, local visibility of the parameters and variables of a function. Passage of arguments as reference. File types, file operations, access modes, opening and closing modes. The open, close, read, readline, readlines, write functions.
Planned learning activities and teaching methods: It is recommended to use the manual suggested and the slides of the lectures. In addition, the following books can be used: Lambert, Programmazione in Python. First cycle degree courses.
Single cycle degree courses. Department of General Psychology. Planned learning activities and teaching methods:. Textbooks and optional supplementary readings.