Rosalba ZIZZA | PROGRAMMING I
Rosalba ZIZZA PROGRAMMING I
cod. 0512100005
PROGRAMMING I
| 0512100005 | |
| COMPUTER SCIENCE | |
| EQF6 | |
| COMPUTER SCIENCE | |
| 2022/2023 |
| OBBLIGATORIO | |
| YEAR OF COURSE 1 | |
| YEAR OF DIDACTIC SYSTEM 2017 | |
| AUTUMN SEMESTER |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| INF/01 | 6 | 48 | LESSONS | |
| INF/01 | 3 | 24 | LAB |
| Exam | Date | Session | |
|---|---|---|---|
| APPELLO PROFF. ZIZZA/DE MARCO | 03/07/2023 - 09:00 | SESSIONE ORDINARIA | |
| APPELLO PROFF. ZIZZA/DE MARCO | 18/07/2023 - 09:00 | SESSIONE ORDINARIA |
| Objectives | |
|---|---|
| KNOWLEDGE AND UNDERSTANDING: KNOWLEDGE OF THE LANGUAGE CONSTRUCTS OF PROCEDURAL HIGH-LEVEL PROGRAMMING TO SOLVING SMALL PROBLEMS. KNOWLEDGE OF THE BASIC PRINCIPLES OF STRUCTURED AND MODULAR PROGRAMMING. KNOWLEDGE OF THE PRINCIPLES AND INSTRUMENTS TO TRANSLATE PROGRAMMS WRITTEN IN HIGH LEVEL LANGUAGE IN MACHINE LANGUAGE. KNOWLEDGE OF THE MAIN ALGORITHMIC SCHEMES FOR SCANNING OF LINEAR STRUCTURES USING ARRAY AND FILE. APPLYING KNOWLEDGE AND UNDERSTANDING: ABILITY TO USE THEORETICAL KNOWLEDGE IN THE CONCEPTION, DESIGN, CODING, COMPILATION, EXECUTION AND VERIFICATION OF SIMPLE PROGRAMMING PROJECTS FOR SMALL PROBLEMS. |
| Prerequisites | |
|---|---|
| NO PREREQUISITE (FIRST YEAR COURSE). |
| Contents | |
|---|---|
| THE COURSE WILL TREAT THE FOLLOWING TOPICS: 1. FUNDAMENTALS OF PROGRAMMING (1H) 2. ALGORITHMS AND PROGRAMS (1H) 3. PROBLEM ANALYSIS (1H) 4. ABSTRACT SYNTACTIC AND SEMANTIC DEFINITION, PRECONDITIONS, POSTCONDITIONS (1H) 5. DESIGN A SOLUTION BY USING A STEPWISE REFINEMENT AND DIVIDE ET IMPERA APPROACH (2H) 6. EDITING AND COMPILING A SOURCE PROGRAM (2H, 1H LAB.) 7. STANDARD LIBRARY (2H, 1H LAB.) 8. FORMATTED INPUT/OUTPUT, EXPRESSIONS (2H, 1H LAB.) 9. SELECTION INSTRUCTIONS (2H, 2H LAB.) 10. LOOPS (2H, 2H LAB.) 11. ELEMENTARY DATA TYPES (2H, 2H LAB.) 12. ONE-DIMENSIONAL AND MULTIDIMENSIONAL ARRAY, FILE (6H, 3H LAB.) 13. FUNCTIONS (2H, 1H LAB.) 14. PROGRAM ORGANIZATION: SCOPE OF VARIABLES (2H, 1H LAB.) 15. STACK AND ACTIVATION RECORD (2H, 1H LAB.) 16. POINTERS (6H, 4H LAB.) 17. DYNAMIC STORAGE ALLOCATION/DEALLOCATION (5H, 2H LAB.) 18. STRINGS, STRUCTURES (5H, 2H LAB.) 19. INTRODUCTION TO RECURSION (2H, 1H LAB.) |
| Teaching Methods | |
|---|---|
| THE COURSE REQUIRES 72 HOURS OF TEACHING BETWEEN LESSONS AND LABORATORY EXERCISES: 48 HOURS OF LESSONS IN THE CLASSROOM (6 CFU) AND 24 HOURS OF GUIDED EXERCISES IN THE LABORATORY (3 CFU). THE LABORATORY EXERCISES WILL BE ENHANCED BY CASE STUDIES WITH PROGRAMS DEVELOPED IN THE CLASSROOM WITH THE HELP OF THE TEACHER, WHO WILL SUGGEST ADDITIONAL EXERCISES ON WHICH STUDENTS MAY APPLY WITH INDIVIDUAL STUDY. THE FREQUENCY OF CLASSROOM LECTURES AND LABORATORY EXERCISES, WHILE NOT REQUIRED, IS STRONGLY RECOMMENDED IN ORDER TO OBTAIN FULL ACHIEVEMENT OF THE LEARNING OBJECTIVES. |
| Verification of learning | |
|---|---|
| THE ACHIEVEMENT OF THE OBJECTIVES OF TEACHING IS CERTIFIED BY PASSING AN EXAMINATION WITH AN ASSESSMENT OUT OF THIRTY. THE EXAM INCLUDES A PRACTICAL TEST (OR WRITTEN TEST) AND AN ORAL TEST. THE PRACTICAL OR WRITTEN TEST IS USED TO ASSESS THE CURRENT ABILITY OF THE STUDENT TO APPLY THE KNOWLEDGE ACQUIRED AND DEMONSTRATE COMPREHENSION SKILLS IN DEALING WITH A PRACTICAL PROBLEM IN PROGRAMMING, DESIGN AN ALGORITHMIC SOLUTION AND WRITE THE PROGRAM THAT SOLVES IT. THE PRACTICAL OR WRITTEN TEST IS PREPARATORY TO THE ORAL EXAMINATION, AND REQUIRES THE ACHIEVEMENT OF PREDETERMINED MINIMUM SCORE. IT USUALLY IS AT LEAST 60 MINUTES LONG. THE ORAL TEST IS USED TO ASSESS THE DEGREE OF ATTAINMENT OF THE LEARNING OBJECTIVES, PARTICULARLY REGARDING THE LEVEL OF KNOWLEDGE AND UNDERSTANDING AND COMMUNICATION ACHIEVED BY THE STUDENT. THE FINAL SCORE IS OBTAINED BY CONSIDERING BOTH TESTS. TWO INTERMEDIATE TESTS ARE PLANNED IN THE MIDDLE AND AT THE END OF THE COURSE. IF THE OBTAINED SCORRE IS AT LEAST 18/30, STUDENTS ARE ALLOWED TO ACCESS TO THE ORAL TEST, THROUGHOUT THE EXAM SESSION. IN THE EVENT THAT THE COVID-19 EMERGENCY CONDITIONS AND THE RESTRICTIONS ASSOCIATED WITH THEM ARE STILL ACTIVE, THESE TESTS COULD BE CARRIED OUT IN TELEMATICS MODE |
| Texts | |
|---|---|
| TEACHING MATERIALS, TEACHER HANDOUTS, SAMPLE EXERCISES AND FURTHER SUPPLEMENTARY TEACHING MATERIALS, ARE AVAILABLE ONLINE FOR STUDENTS. FOR INDIVIDUAL STUDY, THE STUDENT MUST REFER TO AT LEAST ONE OF THE SUGGESTED TEXTS BELOW. •THE ART AND SCIENCE OF C, E.S. ROBERTS, ADDISON-WESLEY, 1995, ISBN: 978-0201543223 •C PROGRAMMING: A MODERN APPROACH, K.N. KING W.W. NORTON & COMPANY, SECONDA EDIZIONE, 2008. ISBN-10: 0393979504 ISBN-13: 978-0393979503 •PAUL J. DEITEL, HARVEY M. DEITEL, C. CORSO COMPLETO DI PROGRAMMAZIONE. APOGEO, 2010 ISBN-10: 8850329547 ISBN-13: 978-8850329540 |
| More Information | |
|---|---|
| CONDUCTING TIMELY SUGGESTED EXERCISES BY THE TEACHER IS USUALLY THE BEST WAY FOR THE STUDENT TO PREPARE FOR THE EXAM. |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2023-06-06]
