Giuseppe PERSIANO | LABORATORY OF INFORMATICS
Giuseppe PERSIANO LABORATORY OF INFORMATICS
cod. 0512600017
LABORATORY OF INFORMATICS
| 0512600017 | |
| DIPARTIMENTO DI FISICA "E.R. CAIANIELLO" | |
| PHYSICS | |
| 2015/2016 |
| OBBLIGATORIO | |
| YEAR OF COURSE 1 | |
| YEAR OF DIDACTIC SYSTEM 2010 | |
| PRIMO SEMESTRE |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| INF/01 | 3 | 24 | LESSONS | |
| INF/01 | 3 | 36 | LAB |
| Objectives | |
|---|---|
| THE OBJECTIVE OF THE COURSE IS TO TEACH HOW TO CREATE COMPUTATIONAL ABSTRACTION USING THE PYTHON PROGRAMMING LANGUAGE AND TO LEARN THE CONCEPTUAL FOUNDATIONS OF COMPUTER SCIENCE AND COMPUTATIONAL PROBLEM SOLVING. KNOWLEDGE AND UNDERSTANDING THE COURSE WILL PRESENT TECHNIQUES TO SOLVE SIMPLE COMPUTATIONAL PROBLEMS AND TO IMPLEMENT THE SOLUTION USING THE PYTHON PROGRAMMING LANGUAGE. APPLYING KNOWLEDGE AND UNDERSTANDING AT THE END OF THE COURSE, THE STUDENTS WILL BE ABLE TO ANALYZE COMPUTATIONAL PROBLEMS, TO DESIGN SOLUTIONS FOR THEM, AND TO IMPLEMENT THEN IN PYTHON. MAKING JUDGMENTS: THE STUDENT WILL ACQUIRE THE ABILITY TO IDENTIFY THE STRUCTURAL CHARACTERISTIC OF A COMPUTATIONAL PROBLEM AND DECIDE ON THE TECHNIQUE TO BE USED IN ORDER TO SOLVE IT. COMMUNICATION SKILLS: STUDENTS WILL BE ABLE TO DESCRIBE, WITH AN APPROPRIATE LANGUAGE, INFORMATION EXTRACTED FROM THE ANALYSIS OF A COMPUTATIONAL PROBLEM. UNDERSTANDING SKILLS: STUDENTS WILL BE ABLE TO UNDERSTAND THE CHARACTERISTICS OF A COMPUTATIONAL PROBLEM THAT MAKE IT APPROACHABLE WITH THE KNOWN TECHNIQUES. |
| Prerequisites | |
|---|---|
| NONE. |
| Contents | |
|---|---|
| DECLARATIVE AND IMPERATIVE LANGUAGES. FLOW CONTROL. FIXED PROGRAMS COMPUTERS AND STORED-PROGRAM COMPUTERS. INTERPRETERS, COMPILERS, SYNTAX, SEMANTICS, AND TYPES OF ERRORS. OBJECT TYPES, OPERATORS, OVERLOADING, COMMANDS, VARIABLES, INPUT, STRAIGHT LINE E BRANCHING, LOOP, CONDITIONALS AND NESTING. EXHAUSTIVE ENUMERATION AND BRUTE FORCE. LOOP WHILE AND FOR. BISECTION SEARCH. DECREMENTING FUNCTIONS, BISECTION SEARCH, FUNCTIONS, FORMAL AND ACTUAL PARAMETERS. TUPLES, STRINGS AS TUPLES. RICORSIVE FUNCTIONS AND SCOPE STACKES. GLOBAL VARIABLES. LISTS AND THE EFFECT OF MUTABILITY. DICTIONARIES. INPUT/OUTPUT AND ERROR HANDLING. THE HALTING PROBLEM. INTRODUCTION TO COMPUTATIONAL COMPLEXITY. |
| Teaching Methods | |
|---|---|
| LECTURES AND PROGRAMMING ASSIGNMENTS. |
| Verification of learning | |
|---|---|
| PRACTICAL PROGRAMMING ASSIGNMENT AND ORAL EXAM. |
| Texts | |
|---|---|
| JOHN GUTTAG, INTRODUCTION TO COMPUTATION AND PROGRAMMING USING PYTHON, MIT PRESS. |
| More Information | |
|---|---|
| EMPTY. |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2016-09-30]
