Giuseppe PERSIANO | ALGORITHMS AND DATA STRUCTURES
Giuseppe PERSIANO ALGORITHMS AND DATA STRUCTURES
cod. 0212700138
ALGORITHMS AND DATA STRUCTURES
| 0212700138 | |
| DIPARTIMENTO DI SCIENZE AZIENDALI - MANAGEMENT & INNOVATION SYSTEMS | |
| EQF6 | |
| BUSINESS MANAGEMENT | |
| 2018/2019 |
| YEAR OF DIDACTIC SYSTEM 2014 | |
| PRIMO SEMESTRE |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| INF/01 | 10 | 60 | LESSONS |
| Objectives | |
|---|---|
| THE OBJECTIVE OF THE COURSE IS TO LEARN THE CONCEPTUAL FOUNDATIONS OF ALGORITHMS AND DATA STRUCTURE AND 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 APPLYING KNOWLEDGE AND UNDERSTANDING AT THE END OF THE COURSE, THE STUDENTS WILL BE ABLE TO ANALYZE COMPUTATIONAL PROBLEMS, TO DESIGN SOLUTIONS FOR THEM. 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 | |
|---|---|
| NO SPECIFIC PREREQUISITE. |
| Contents | |
|---|---|
| - DEFINITION OF ALGORITHM. THE RAM MODEL -- 2 HOURS - PSEUDO-CODE -- 2 HOURS - RECURSION -- 6 HOURS - ANALYSIS OF ALGORITHMS -- 6 HOURS - SORTING ALGORITHM: INSERTION SORT, SELECTION SORT, MERGE SORT, RADIX SORT, COUNTING SORT -- 10 HOURS - ELEMENTARY DATA STRUCTURES: QUEUES, LISTS, STACKS -- 9 HOURS - TREES: ABR, HEAP -- 8 HOURS - HEAPSORT, QUICKSORT -- 10 HOURS - GRAPHS: VISITS -- 7 HOURS |
| Teaching Methods | |
|---|---|
| LECTURES (40 HOUR) AND SUPERVISED PROBLEM SOLVING (20 HOURS). |
| Verification of learning | |
|---|---|
| THE EXAM CONSISTS OF A WRITTEN TEST IN WHICH THE STUDENTS WILL BE ASKED TO DESIGN AN ALGORITHM FOR A COMPUTATIONAL PROBLEM SIMILAR TO THE ONES DISCUSSED DURING THE COURSE AND TO APPLY ONE OF THE DISCUSSED ALGORITHMS TO A SPECIFIC SMALL INPUT. THE WRITTEN EXAMS WILL BE DISCUSSED WITH THE INSTRUCTORS. |
| Texts | |
|---|---|
| JOHN GUTTAG, INTRODUCTION TO COMPUTATION AND PROGRAMMING USING PYTHON, MIT PRESS. REVISED AND EXPANDED EDITION -- AUG 2013 |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2019-10-21]
