# Matematica | METHODS FOR INFORMATION MANAGEMENT

## Matematica METHODS FOR INFORMATION MANAGEMENT

 0512300029 DIPARTIMENTO DI MATEMATICA EQF6 MATHEMATICS 2022/2023

 YEAR OF COURSE 3 YEAR OF DIDACTIC SYSTEM 2018 SPRING SEMESTER
SSD CFU HOURS ACTIVITY TYPE OF ACTIVITY INF/01 6 48 LESSONS OPTIONAL SUBJECTS
 GIUSEPPE SCANNIELLO T
Objectives
THE OBJECTIVE OF THIS COURSE IS TO PROVIDE STUDENTS WITH THE BASIC TECHNIQUES OF STRUCTURED PROGRAMMING AND TO INTRODUCE THE BASIC CONCEPTS OF OBJECT-ORIENTED PROGRAMMING THROUGH THE DESIGN AND IMPLEMENTATION OF PROGRAMS USING THE PYTHON PROGRAMMING LANGUAGE (PYTHON 3).

KNOWLEDGE AND UNDERSTANDING

STUDENTS WILL ACQUIRE THE KNOWLEDGE OF STRUCTURED PROGRAMMING AND BASIC CONCEPTS OF OBJECT ORIENTED PROGRAMMING.

ABILITY TO APPLY KNOWLEDGE AND UNDERSTANDING

THANKS TO THE THEORETICAL NOTIONS AND PRACTICAL EXAMPLES PROVIDED IN THE LESSONS, STUDENTS WILL BE ABLE TO IMPLEMENT PROGRAMS USING THE PYTHON PROGRAMMING LANGUAGE.
Prerequisites
THE TOPICS COVERED IN THE COURSE ONLY REQUIRE BASIC NOTIONS OF COMPUTER SCIENCE.
Contents
INTRODUCTION: COMPUTERS AND PROGRAMS, THE ANATOMY OF A COMPUTER, THE PYTHON PROGRAMMING LANGUAGE, VARIABLES, ARITHMETIC OPERATORS AND FUNCTIONS, STRINGS, I / O, HINTS OF GRAPHICS.
DECISIONS: THE STATEMENT IF. COMPARISON OF VALUES. STRING COMPARISON. COMPARISON OF OBJECTS. COMPARISON WITH NULL. MULTIPLE ALTERNATIVES. USE OF BOOLEAN EXPRESSIONS.
ITERATIONS: WHILE LOOPS. FOR LOOPS. NESTED LOOPS. PROCESSING OF INCOMING DATA. RANDOM NUMBERS AND SIMULATION.
COMPLEXITY ANALYSIS: COMPUTATIONAL AND ASYMPTOTIC COMPLEXITY.O AND O NOTATIONS. PROPERTIES OF THESE NOTATIONS. EXAMPLES OF COMPLEXITY. ASYMPTOTIC COMPLEXITY. THE BEST, MEDIUM AND WORST CASES.
FUNCTIONS: FUNCTIONS SUCH AS BLACK BOXES, IMPLEMENTATION AND TESTING OF FUNCTIONS, PASSAGE OF PARAMETERS, RETURNED VALUES, DESIGN OF TOOLS FOR IMAGE PROCESSING, HINTS ON RECURSIVE FUNCTIONS.
LISTS: BASIC PROPERTIES OF LISTS, OPERATIONS WITH LISTS, ELEMENTARY ALGORITHMS, USE OF LISTS IN FUNCTIONS, ADAPTATION OF ALGORITHMS, TABLES.
EXCEPTIONS AND FILES: READ AND WRITE TEXT FILES, BINARY FILES AND RANDOM ACCESS, EXCEPTION HANDLING.
SETS AND DICTIONARIES: SETS, CREATING AND USING SETS, DICTIONARIES, COMPLEX STRUCTURES.
OBJECTS AND CLASSES: OBJECT-ORIENTED PROGRAMMING, DEFINE THE PUBLIC INTERFACE OF A CLASS, CONSTRUCTORS, CREATE METHODS, OBJECT REFERENCES, SHARED REFERENCES, NONE AND SELF, INHERITANCE HIERARCHIES, INVOKE THE SUPERCLASS CONSTRUCTOR, OVERRIDE METHODS, POLYMORPHISM.
SORTING AND SEARCH: SORTING BY SELECTION AND ITS ANALYSIS, SORTING BY MERGING (MERGE SORT) AND ITS ANALYSIS, LINEAR AND BINARY SEARCH AND COMPUTATIONAL ANALYSIS.
Teaching Methods
THE COURSE INCLUDES FRONTAL LESSONS FOR 48 HOURS IN TOTAL, WHICH TAKE PLACE IN THE CLASSROOM. THE TOPICS COVERED ARE ALWAYS ACCOMPANIED BY EXAMPLES AND EXERCISES (TO BE ACCOMPLISHED AT HOME OR IN THE CLASSROOM) RELATED TO CONCRETE PROBLEMS, THEREFORE THE EXERCISES ARE TO BE CONSIDERED AN INTEGRAL PART OF THE LESSONS.
Verification of learning
THE ACHIEVEMENT OF THE TEACHING OBJECTIVES IS CERTIFIED BY PASSING A WRITTEN AND/OR ORAL EXAM/S WITH A MARK OUT OF THIRTY. IN PARTICULAR, THE STUDENT WILL BE ASKED QUESTIONS ON THE THEORETICAL AND METHODOLOGICAL CONTENTS INDICATED IN THE TEACHING PROGRAM. THE PURPOSE OF THESE QUESTIONS IS TO ASSESS THE LEVEL OF KNOWLEDGE AND UNDERSTANDING THE STUDENT ATTAINED, AS WELL AS TO VERIFY THE ABILITY TO ORGANISE THE EXHIBITION AUTONOMOUSLY AND THE ABILITY TO USE THE TERMINOLOGY APPROPRIATELY IN THE EXHIBITION ITSELF.
Texts
CAY HORSTMANN - RANCE D. NECAISE, “CONCETTI DI INFORMATICA E FONDAMENTI DI PYTHON” SECONDA EDIZIONE, APOGEO EDUCATION.