Pierluigi SIANO | FOUNDATIONS OF INFORMATICS
Pierluigi SIANO FOUNDATIONS OF INFORMATICS
cod. 0112100006
FOUNDATIONS OF INFORMATICS
| 0112100006 | |
| DIPARTIMENTO DI SCIENZE GIURIDICHE (SCUOLA DI GIURISPRUDENZA) | |
| EQF6 | |
| BUSINESS AND NEW TECHNOLOGIES LAWYER | |
| 2021/2022 |
| OBBLIGATORIO | |
| YEAR OF COURSE 1 | |
| YEAR OF DIDACTIC SYSTEM 2020 | |
| SPRING SEMESTER |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| INF/01 | 6 | 36 | LESSONS |
| Objectives | |
|---|---|
| THE AIM OF THE COURSE IS TO INTRODUCE THE CONCEPTS ("KNOWLEDGE") AND THE FUNDAMENTAL TECHNIQUES ("KNOW HOW TO DO") OF INFORMATION AND COMMUNICATION TECHNOLOGIES (ICT) THAT CAN BE USEFUL BOTH FOR THE CONTINUATION OF STUDIES AND FOR FUTURE WORK. THE EDUCATIONAL OBJECTIVES OF THE COURSE ARE: 1) TO PROVIDE KNOWLEDGE ON COMPUTER ARCHITECTURE, BINARY REPRESENTATION AND TREATMENT OF THE MAIN TYPES OF DATA (SIMPLE AND MULTIMEDIA), HARDWARE AND SOFTWARE, OPERATING SYSTEMS AND COMPUTER NETWORKS; 2) INTRODUCE STUDENTS TO COMPUTATIONAL THINKING AND THE BASIC CONCEPTS OF ALGORITHMS; 3) PROVIDE KNOWLEDGE ON THE MAIN METHODS OF ORGANIZING DATA (E.G. SIMPLE TABULAR FORMS, RELATIONAL MODEL, HIERARCHICAL MODEL) WITH RELATED TOOLS AND MECHANISMS FOR STORING AND SEARCHING. AT THE END OF THE COURSE, THE STUDENT WILL HAVE ACQUIRED BASIC KNOWLEDGE ON: •HARDWARE ARCHITECTURE OF A COMPUTER. •ANALOG / DIGITAL DICHOTOMY. •BINARY REPRESENTATION AND TREATMENT OF THE MAIN TYPES OF SIMPLE AND MULTIMEDIA DATA. •OPERATING SYSTEM AND APPLICATION SOFTWARE. •INTRODUCTION TO COMPUTATIONAL THINKING, THE BASIC CONCEPTS OF ALGORITHMS AND PROGRAMMING. •BASIC CONCEPTS ON DATABASE MANAGEMENT SYSTEMS. •INTRODUCTION TO "LEGAL" INFORMATION TECHNOLOGY AND RELATED TOOLS. AT THE END OF THE COURSE, THE STUDENT WILL BE ABLE TO: •IDENTIFY AND CONFIGURE, IN BROAD TERMS, THE HARDWARE/SOFTWARE SYSTEM SUITABLE FOR CARRYING OUT ITS ACTIVITIES. •CHOOSE THE DATA REPRESENTATION (COMPRESSED AND UNCOMPRESSED) MOST APPROPRIATE FOR THE MAIN APPLICATION AREAS. •DEFINE AND DESCRIBE AN ALGORITHM. •TRANSFORM ANALOG DATA INTO BINARY DATA AND VICE VERSA, CHOOSING THE APPROPRIATE REPRESENTATIONS. •USE A RELATIONAL DBMS: CREATE, ASSIGN THE CORRECT PROPERTIES, POPULATE AND QUERY A RELATIONAL DB WITH A DECLARATIVE LANGUAGE (SQL). |
| Prerequisites | |
|---|---|
| NO PARTICULAR PREREQUISITES ARE REQUIRED, EVEN IF THE KNOWLEDGE OF ELEMENTARY TECHNIQUES OF USING A COMPUTER IS RECOMMENDED. |
| Contents | |
|---|---|
| THE COURSE INCLUDES 36 HOURS OF TEACHING (6 CFU). IN PARTICULAR, 4 CFU (24 HOURS) WILL BE DEDICATED TO THE "THEORETICAL" PART AND 2 CFU (12 HOURS) TO THE EXERCISES. •(8 HOURS) HARDWARE ARCHITECTURE OF A COMPUTER: CPU, RAM, INPUT / OUTPUT DEVICES, MASS STORAGE DEVICES AND INTERFACES, ADVANCED I / O (IMAGE SCANNING AND FAST TEXT INPUT, VOICE INPUT, HELP TOOLS FOR DISABLED). BACKUP / RECOVERY, HIERARCHY OF MEMORIES, CLOUD COMPUTING. CLASSIFICATION OF COMPUTERS BASED ON PERFORMANCE. •(4 HOURS) ANALOG / DIGITAL DICHOTOMY AND BINARY INFORMATION ENCODING - BINARY REPRESENTATION OF TEXTS AND NUMBERS, TRANSFORMATIONS FROM DECIMAL BASE TO BINARY BASIS AND VICE VERSA, MAIN MATHEMATICAL OPERATIONS IN BINARY (ADDITION AND MULTIPLICATION). •(2 HOURS) DIGITIZATION OF MULTIMEDIA DATA: IMAGES (BITMAP AND VECTOR), SOUND, AND VIDEO AND 2D AND 3D ANIMATIONS. VISUALIZATION AND PRINTING OF DATA: RGB AND CMYK COLOR MODELS. DATA COMPRESSION AND MAIN AUDIO / VIDEO FORMATS. AUDIO / VIDEO STREAMING. •(2 HOURS) BASIC SOFTWARE CONCEPTS (HORIZONTAL AND VERTICAL, OLE TECHNOLOGY, INTELLECTUAL PROPERTY ISSUES, OPEN-SOURCE). BASIC CONCEPTS OF OPERATING SYSTEMS (BASIC FUNCTIONALITY, MULTIPROGRAMMED CATEGORIES AND SYSTEMS, FILE SYSTEMS, UTILITIES). •(2 HOURS) CONCEPT OF AN OBJECT AS A MODEL TO REPRESENT REALITY IN A COMPUTER (PROPERTIES, EVENTS AND METHODS). CONCEPT AND EXAMPLES OF ALGORITHM. BASIC CONSTRUCTS OF AN ALGORITHM AND THEIR REPRESENTATION THROUGH FLOW-CHART. PROGRAMMING LANGUAGE CONCEPT (DIFFERENCE BETWEEN SYNTACTIC ERRORS AND LOGICAL ERRORS). •(6 HOURS) INTRODUCTION TO RELATIONAL DBMS: INFORMATION SYSTEMS, INFORMATION AND DATA, RELATIONAL MODEL, INTEGRITY CONSTRAINTS AND KEY CONSTRAINTS, ELEMENTARY QUERIES IN QBE AND SQL. •(12 HOURS) BASIC TECHNIQUES FOR PROGRAMMING A DBMS APPLICATION: CREATION AND MODIFICATION OF THE STRUCTURE AND PROPERTIES OF TABLES, CORRECT DEFINITION OF DATA TYPES, INSERTION OF DATA INTO TABLES, CREATION AND USE OF FORMS AND REPORTS; DATABASE QUERY WITH THE LANGUAGES QBE AND SQL. |
| Teaching Methods | |
|---|---|
| THE COURSE INCLUDES 36 HOURS OF TEACHING (6 CFU). IN PARTICULAR, 4 CFU (24 HOURS) WILL BE DEDICATED TO THE "THEORETICAL" PART AND 2 CFU (12 HOURS) TO THE EXERCISES. DURING THE COURSE THE TEACHER WILL MAKE AN EXTENSIVE USE OF SLIDES, APPROPRIATELY ACCOMPANIED BY MULTIMEDIA ELEMENTS, AND EXAMPLES, GUIDED EXERCISES AND EXERCISES TO BE DONE AT HOME. FROM A STRUCTURAL POINT OF VIEW, THE LESSONS WILL CONSIST OF •FRONTAL LESSONS WITH GUIDED EXERCISES. •EXERCISES AT HOME, WITH CORRECTION TO THE NEXT LESSON. •EXAM SIMULATIONS, UNDER THE CONDITIONS AND WITH ACTUAL EXAM TESTS. |
| Verification of learning | |
|---|---|
| THE EXAM WILL TAKE PLACE THE DAY AND TIME SET FOR THE APPEAL AND WILL START FOR EVERYONE AT THE SAME TIME. IN THE PRESENCE OF HIGH NUMBERS, STUDENTS WILL BE DIVIDED INTO GROUPS. AT THE END OF THE WORK OF THE LAST GROUP, THE TEACHER WILL SHOW ALL THE SOLUTIONS, IN ORDER TO ALLOW A FIRST SELF-CORRECTION BY THE STUDENTS. DEPENDING ON THE NUMBER OF STUDENTS WHO PRESENT THEMSELVES AT THE EXAM, THE EXAM CAN BE CONCLUDED IN THE DAY OR REQUEST MORE TIME: BY THE END OF THE WORK OF THE LAST GROUP, THE TEACHER WILL COMMUNICATE THE DAY AND TIME WHEN THE FINAL EXAMINATION WILL TAKE PLACE. THE EXAM IS DIVIDED INTO TWO PARTS, A "THEORETICAL" AND A "PRACTICE"; EACH PART HAS A MINIMUM THRESHOLD OF SUFFICIENCY, BELOW WHICH THE WHOLE EXAM IS NOT EXCEEDED. THE EXAM WILL END WITH THE DISCUSSION OF THE TESTS, IF REQUESTED BY THE STUDENT, AND WITH A POSSIBLE SUPPLEMENTARY INTERVIEW THAT, IF THERE ARE THE CONDITIONS, CAN MODIFY, IN NEGATIVE OR POSITIVE, THE RESULT OF THE EXAMINATION. THE EXAMINATION MUST BE FULLY COMPLETED IN A SINGLE APPEAL. THIS MEANS THAT A SINGLE TEST PASSED IN AN APPEAL WILL NOT BE VALID IN ANY FURTHER APPEAL (IE THE EVIDENCE IS NOT CONSERVATIVE). PART 1: QUESTIONNAIRE COVERING ALL THE "THEORETICAL" TOPICS OF THE WHOLE COURSE: •THE TEST CONSISTS OF MULTIPLE CHOICE OR OPEN ANSWER QUESTIONS. •MAXIMUM TIME AVAILABLE: 30 MINUTES •TEST SCORE: UP TO 30 POINTS, WITH THE SUFFICIENCE TO 18. •THE QUESTIONNAIRES ARE CARRIED OUT DIRECTLY ON THE COMPUTER USING A SPECIAL SOFTWARE, WHICH IMMEDIATELY COMMUNICATES THE TEST RESULT TO THE STUDENT. PART 2: DEVELOPMENT OF A DBMS APPLICATION •THE TEST CONSISTS OF CREATING QUERIES IN SQL LANGUAGE. •MAXIMUM TIME AVAILABLE: 30 MINUTES •TEST SCORE: UP TO 30 POINTS, WITH WITH THE SUFFICIENCE TO 18. |
| Texts | |
|---|---|
| •CURTIN, FOLEY, SEN, MORIN "INFORMATICA DI BASE – V EDIZIONE“ - MC GRAW HILL •ATZENI, CERI, PARABOSCHI, TORLONE, - “BASI DI DATI - MODELLI E LINGUAGGI DI INTERROGAZIONE 4/ED” (CAP. 1, 2, 4.2 E 4.3) MCGRAW HILL |
| More Information | |
|---|---|
| SLIDES AND FURTHER DIDACTIC MATERIALS OF THE COURSE CAN BE REQUESTED TO THE TEACHER RECEPTION TIME: MONDAY FROM 14:00 TO 16:00 |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2022-11-21]
