Giuseppe SCANNIELLO | METHODS FOR INFORMATION MANAGEMENT
Giuseppe SCANNIELLO METHODS FOR INFORMATION MANAGEMENT
cod. 0512300029
METHODS FOR INFORMATION MANAGEMENT
| 0512300029 | |
| DEPARTMENT OF MATHEMATICS | |
| EQF6 | |
| MATHEMATICS | |
| 2024/2025 |
| YEAR OF COURSE 3 | |
| YEAR OF DIDACTIC SYSTEM 2018 | |
| SPRING SEMESTER |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| INF/01 | 6 | 48 | LESSONS |
| Exam | Date | Session | |
|---|---|---|---|
| METODI PER IL TRATTAMENTO DELL'INFORMAZI | 07/01/2025 - 11:00 | SESSIONE DI RECUPERO | |
| METODI PER IL TRATTAMENTO DELL'INFORMAZI | 27/01/2025 - 15:00 | SESSIONE DI RECUPERO | |
| METODI PER IL TRATTAMENTO DELL'INFORMAZI | 25/02/2025 - 11:00 | SESSIONE DI RECUPERO |
| 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 OBJECTIVES IS CERTIFIED BY PASSING A WRITTEN/PRACTICAL AND ORAL EXAMINATION WITH ASSESSMENT IN THIRTIETH GRADE. THE STUDENT WILL BE ASKED TO SOLVE PROGRAMMING PROBLEMS IN THE CLASSROOM (PRACTICAL TEST) AND, IF NECESSARY, QUESTIONS WILL BE ASKED ABOUT THE THEORETICAL AND METHODOLOGICAL CONTENTS OF THE TEACHING PROGRAMME. THE PURPOSE OF THE TEST IS TO ASCERTAIN THE LEVEL OF KNOWLEDGE AND COMPREHENSION ATTAINED, AND TO VERIFY THE ABILITY OF AUTONOMOUS EXPOSURE ORGANISATION AND THE CAPACITY FOR APPROPRIATE USE OF THE KNOWLEDGE GAINED. THE PRACTICAL EXAMINATION IS PASSED BY A VOTE OF 18 OUT OF 30. THE ORAL EXAM POSSIBLY INCLUDES A DISCUSSION OF THE WRITTEN/PRACTICAL EXAMINATION. THE FINAL VOTE IS THE RESULT OF THE AVERAGE OF THE TWO OBTAINED SCORES IN THE TWO EXAMINATIONS. PRAISE IS AWARDED TO STUDENTS WHO SHOW THAT THEY HAVE ACQUIRED SOLID SKILLS AND HIGH ABILITY IN DEALING WITH THE TOPICS COVERED. |
| Texts | |
|---|---|
| CAY HORSTMANN - RANCE D. NECAISE, “CONCETTI DI INFORMATICA E FONDAMENTI DI PYTHON” SECONDA EDIZIONE, APOGEO EDUCATION. |
| More Information | |
|---|---|
| THE STUDENTS CAN REACH THE LECTURER AT THE FOLLOWING EMAIL ADDRESS: GSCANNIELLO@UNISA.IT |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2024-11-18]
