Alberto POSTIGLIONE | Foundations of Computer Science
Alberto POSTIGLIONE Foundations of Computer Science
cod. 0212700006
FOUNDATIONS OF COMPUTER SCIENCE
| 0212700006 | |
| DIPARTIMENTO DI SCIENZE AZIENDALI - MANAGEMENT & INNOVATION SYSTEMS | |
| EQF6 | |
| BUSINESS MANAGEMENT | |
| 2017/2018 |
| OBBLIGATORIO | |
| YEAR OF COURSE 1 | |
| YEAR OF DIDACTIC SYSTEM 2014 | |
| PRIMO SEMESTRE |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| INF/01 | 6 | 36 | LESSONS |
| Objectives | |
|---|---|
| THE AIM OF THE COURSE IS TO PROVIDE AN INTRODUCTION TO THE CONCEPTS ("KNOWLEDGE") AND THE FUNDAMENTAL TECHNIQUES ("KNOW HOW TO DO IT") OF INFORMATION AND COMMUNICATION TECHNOLOGIES (ICT) THAT CAN BE USEFUL BOTH FOR THE CONTINUATION OF STUDIES AND FOR THE FUTURE WORK. AT THE END OF THE COURSE, THE STUDENT WILL GAIN KNOWLEDGE ABOUT: •HARDWARE ARCHITECTURE OF A COMPUTER. SPEED OF EVOLUTION OF NEW TECHNOLOGIES. SOFTWARE AND APPLICATION PROGRAMS. MAIN FUNCTIONS OF AN OPERATING SYSTEM. •ANALOGIC / DIGITAL DICOTOMY, DIGITIZATION OF ANALOGUE SIGNALS AND DIGITAL CONVERGENCE PROCESS. •BINARY REPRESENTATION OF THE MAIN DATA TYPES, FROM ELEMENTARY DATA (TEXT, NUMBERS AND BINARY ARITHMETIC OPERATIONS) TO MULTIMEDIA DATA (IMAGES, SOUNDS, MOVIES) AND MAJOR COMPRESSION TECHNIQUES. FAST GRAPHICS INPUT AND FAST TEXT INPUT. •BASIC CONCEPTS ON COMPUTER NETWORKS. DATA AND NETWORK: CLOUD COMPUTING AND AUDIO / VIDEO STREAMING. •BASICS OF DATABASE MANAGEMENT SYSTEMS AND DATA REPRESENTATION MODES IN THE RELATIONAL MODEL. AT THE END OF THE COURSE, THE STUDENT WILL BE ABLE TO: •MAKE INITIAL EVALUATIONS ON THE APPROPRIATE HARDWARE / SOFTWARE IT SYSTEMS FOR CARRYING OUT THEIR ACTIVITIES. •KNOW THE POTENTIAL AND MASTER THE FUNDAMENTAL TERMINOLOGY OF COMPUTER SCIENCE, DATA REPRESENTATION AND HARDWARE / SOFTWARE TECHNOLOGIES. •USE A RELATIONAL DBMS: CREATE, ASSIGN PROPER PROPERTIES, POPULATE AND INTERROGATE A RELATIONAL DB. |
| Prerequisites | |
|---|---|
| PREREQUISITES ARE NOT REQUIRED, THOUGH IT IS ADVISABLE TO KNOW THE BASIC TECHNIQUES OF USING A COMPUTER. |
| Contents | |
|---|---|
| •COMPUTER HARDWARE ARCHITECTURE FUNDAMENTALS: PROCESSOR, CENTRAL MEMORY, INPUT / OUTPUT DEVICES, MASS STORAGE DEVICES AND INTERFACES, ADVANCED I / O TECHNIQUES (SCANNING OF IMAGES AND TEXTS, VOICE INPUTS, DISABLED HELP TOOLS). BACKUP / RECOVERY, MEMORY HIERARCHY, CLOUD COMPUTING AND STREAMING. CLASSIFICATION OF COMPUTERS BASED ON PERFORMANCE. •BINARY REPRESENTATION OF TEXTS AND NUMBERS, DECIMAL BASE TRANSFORMATIONS TO BINARY BASE AND VICE VERSA, MAJOR MATHEMATICAL BINARY OPERATIONS. •ANALOG / DIGITAL AND DIGITIZING ANALOG DATA, WITH PARTICULAR REFERENCE TO MULTIMEDIA DATA, SUCH AS IMAGES (BITMAPS AND VECTORIALS), SOUNDS AND VIDEO. DISPLAY AND PRINT DATA: RGB AND CMYK COLOR MODELS. DATA COMPRESSION AND MAJOR AUDIO/VIDEO FORMATS. •BASIC SOFTWARE CONCEPTS (HORIZONTAL AND VERTICAL, OLE TECHNOLOGY, INTELLECTUAL PROPERTY ISSUES, OPEN-SOURCE SOFTWARE). FUNCTIONAL FUNDAMENTALS OF OPERATIVE SYSTEMS (BASIC FUNCTIONALITY, MULTI-PROGRAM CATEGORIES AND SYSTEMS, FILE SYSTEM, UTILITY). •BASIC CONCEPTS ON COMPUTER NETWORKS: LAN, MAN AND WAN. INTERNET, INTRANET. NETWORK DEVICES. FIREWALL, ROUTER, AND GATEWAY. BANDWIDTH. WIRELESS. •INTRODUCTION TO RELATIONAL DBMS: INFORMATION SYSTEMS, INFORMATION AND DATA, RELATIONAL MODEL, INTEGRITY AND KEY CONSTRAINTS, ELEMENTARY QUERIES IN QBE •BASIC TECHNIQUES FOR PROGRAMMING A DBMS APPLICATION: CREATING AND EDITING TABLE STRUCTURE AND PROPERTIES, CORRECT DEFINITION OF DATA TYPES, INSERTING DATA INTO TABLES, CREATING AND USING MASKS AND REPORTS; QUERYING THE DATABASE WITH THE QBE LANGUAGE. |
| Teaching Methods | |
|---|---|
| THE COURSE INCLUDES 36 HOURS OF TEACHING (6 CFU). IN PARTICULAR, 4 CFUS (24 HOURS) WILL BE DEVOTED TO THE "THEORETICAL" PART AND 2 CFU (12 HOURS) TO THE DBMS EXERCISES. THE COURSE AIMS TO ENTICE STUDENTS TO THE PROCESS OF LIFELONG LEARNING, THAT IS TO PRACTICE CONTINUOUS UPDATING OF KNOWLEDGE AND SKILLS, SEEKING TO STIMULATE CURIOSITY AND INTEREST IN COMPUTING AND NEW TECHNOLOGIES. TO INCREASE THE LEARNING ABILITY, THE TEACHER WILL SHOW THE "PRACTICAL" IMPLICATIONS OF WHAT WILL BE PRESENTED IN LESSON. THE TEACHER WILL TRY TO STIMULATE THE STUDENTS TO A CONTINUOUS INTERACTION WITH HIM AND WITH THE OTHER STUDENTS AND TO PUSH THEM TOWARD A SERIOUS AND CONSTANT STUDY. IN THE CLASSROOM, IN ORDER TO KEEP THE ATTENTION ALWAYS ALERT, SLIDES WILL BE MADE, SUITABLY ACCOMPANIED BY MULTIMEDIA ELEMENTS. IN ORDER TO BECOME ACCUSTOMED TO SELF-LEARNING, STUDENTS WILL BE INVITED TO DEEPEN THE COURSE TOPICS BY ADVISING THEM TO USE ONLINE AND OFFLINE RESOURCES OF PARTICULAR INTEREST. DURING THE COURSE THE TEACHER WILL MAKE EXTENSIVE USE OF EXAMPLES, GUIDED EXERCISES AND EXERCISES TO BE PERFORMED AT HOME BY THE STUDENTS, WITH THE CORRECTION TO THE NEXT LESSON. FROM A STRUCTURAL POINT OF VIEW, LESSONS WILL CONSIST OF •FRONTAL LESSONS WITH GUIDED EXERCISES. •FREE TUTORIALS. •EXAM SIMULATION |
| Verification of learning | |
|---|---|
| ACHIEVEMENT OF THE OBJECTIVES OF THE TEACHING IS CERTIFIED BY PASSING A THIRTY-POINT EVALUATION EXAM TO WHICH A PRAISE MAY BE ADDED. THE EXAM WILL TAKE PLACE AT THE MULTIMEDIA DIDACTIC LAB THE DAY AND TIME FIXED FOR THE APPEAL AND WILL START FOR ALL AT THE SAME TIME. IF THE NUMBER OF STUDENTS IS HIGH, THEY WILL BE DIVIDED INTO GROUPS. DEPENDING ON THE NUMBER OF STUDENTS WHO PRESENT THEMSELVES TO THE ESAM, TESTS CORRECTIONS MAY END IN THE SAME DAY OR TAKE LONGER. WITHIN THE TERM OF THE EXAM (IE BEFORE LEAVING THE CLASSROOM OF THE LAST CANDIDATE) THE TEACHER WILL COMMUNICATE THE DAY AND TIME WHEN THE FINAL EXAMINING OPERATIONS WILL TAKE PLACE. A STUDENT WHO, FOR ANY REASON, DOES NOT SUBMIT TO THE LATTER CONVOCATION WILL BE CONSIDERED A WAIVER AND WILL HAVE TO REPEAT THE EXAM AT A LATER APPEAL. THE EXAM IS DIVIDED INTO TWO TRIALS; EACH TEST PRESENTS A MINIMUM ENOUGH THRESHOLD, BELOW WHICH THE EXAMINATION IS NOT EXCEEDED. THE FINAL VOTE IS USUALLY GIVEN BY THE SUM OF THE VOTES OF THE TWO TRIALS (THE PRAISE CORRESPONDS TO THE ATTAINMENT OF AT LEAST 31 POINTS OUT OF 32) INTEGRATED, POSSIBLY IN NEGATIVE, BY A TALK AND / OR BY THE EVALUATION OF THE TYPE OF MISTAKES MADE BY THE STUDENT IN THE TWO TESTS. THE EXAMINATION MUST BE FULLY PASSED IN A SINGLE APPEAL, SO THE 2 TESTS MUST BE OVERCOME BOTH IN THE SAME APPEAL. THIS MEANS THAT TRIALS ARE NOT CONSERVATIVE. PART 1: QUESTIONNAIRE ON THE "THEORETICAL" ARGUMENTS OF THE ENTIRE COURSE •MAXIMUM TIME AVAILABLE: 30 MINUTES •SCORE OF THE TEST: UP TO 16 POINTS, WITH THRESHOLD FIXED TO 10 •THE TEST CONSISTS OF 32 MULTIPLE-CHOICE QUESTIONS AND COVERS ALL PARTS OF THE COURSE; EVERY CORRECT ANSWER IS 0.5 POINTS, EACH WRONG ANSWER IS - 0.25 POINTS WHILE THE ABSENCE OF RESPONSE IS 0 POINTS. •THE QUESTIONNAIRES WILL BE CONDUCTED DIRECTLY TO THE COMPUTER USING A SPECIAL SOFTWARE, WHICH WILL IMMEDIATELY REPORT THE FINAL EVALUATION AT THE END OF THE TEST. PART 2: DEVELOPMENT OF A DBMS APPLICATION •MAXIMUM TIME AVAILABLE: 30 MINUTES •TEST SCORE: UP TO 16 POINTS, WITH THRESHOLD TO 8 (INCLUDING AT LEAST 4 POINTS RELATED TO THE QUERIES IN QBE) •THE TEST CONSISTS OF DEVELOPING A DBMS APPLICATION THAT INCLUDES CREATING TABLES, INSERTING DATA, CREATING MASKS AND REPORTING, AND CREATING QUERIES IN QBE. |
| 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 ADDITIONAL DIDACTIC MATERIALS OF THE COURSE MAY BE DRAWN FROM THE SITE OF THE TEACHER (HTTP://DOCENTI.UNISA.IT/000794/RISORSE) |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2019-05-14]
