Danilo CAVALIERE | ALGORITHMS AND DATA STRUCTURES
Danilo CAVALIERE ALGORITHMS AND DATA STRUCTURES
cod. 0212700138
ALGORITHMS AND DATA STRUCTURES
| 0212700138 | |
| DEPARTMENT OF MANAGEMENT & INNOVATION SYSTEMS | |
| EQF6 | |
| BUSINESS MANAGEMENT | |
| 2024/2025 |
| OBBLIGATORIO | |
| YEAR OF COURSE 3 | |
| YEAR OF DIDACTIC SYSTEM 2014 | |
| AUTUMN SEMESTER |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| INF/01 | 5 | 30 | LESSONS |
| Exam | Date | Session | |
|---|---|---|---|
| FURNO | 08/01/2025 - 09:30 | SESSIONE ORDINARIA | |
| FURNO | 08/01/2025 - 09:30 | SESSIONE DI RECUPERO | |
| FURNO | 22/01/2025 - 09:30 | SESSIONE ORDINARIA | |
| FURNO | 22/01/2025 - 09:30 | SESSIONE DI RECUPERO |
| 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 THE COURSE WILL PRESENT TECHNIQUES TO SOLVE SIMPLE COMPUTATIONAL PROBLEMS AND TO IMPLEMENT THE SOLUTION APPLYING KNOWLEDGE TO THE DESIGN OF SOLUTIONS FOR COMPUTATIONAL PROBLEMS. THE STUDENT WILL BE ABLE TO IDENTIFY THE STRUCTURAL PROPERTIES OF A COMPUTATION PROBLEM IN ORDER TO PICK THE APPROPRIATE TECHNIQUE FOR ITS SOLUTION. THE STUDENT WILL ALSO BE ABLE TO DESCRIBE THE INFORMATION GATHERED FROM THE ANALYSIS IN PROPER TECHNICAL LANGUAGE. FINALLY, THE STUDENT WILL BE ABLE TO UNDERSTAND THE FEATURES OF A COMPUTATIONAL PROBLEM THAT MAKE IT APPROPRIATE TO SOLVE THE PROBLEM BY MEANS OF A SPECIFIC TECHNIQUE |
| Prerequisites | |
|---|---|
| NO SPECIFIC PREREQUISITE. |
| Contents | |
|---|---|
| - DEFINITION OF ALGORITHM. THE RAM MODEL -- 2 HOURS - PSEUDO-CODE -- 2 HOURS - OBJECT-ORIENTED PROGRAMMING IN PYTHON -- 6 HOURS - DEFINITION AND IMPLEMENTATION IN PYTHON OF ELEMENTARY DATA STRUCTURES: VECTORS, STACKS, QUEUES AND LISTS -- 6 HOURS - ANALYSIS OF ALGORITHMS -- 4 HOURS - SORTING ALGORITHMS: INSERTION SORT, SELECTION SORT, MERGE SORT, RADIX SORT, COUNTING SORT, QUICKSORT -- 10 HOURS |
| Teaching Methods | |
|---|---|
| THE COURSE INCLUDES LECTURES FOR A TOTAL OF 30 HOURS (5 CREDITS). DURING THE LECTURES, THE MAIN THEORETICAL CONCEPTS RELATED TO ALGORITHMS AND DATA STRUCTURES WILL BE COVERED, SUPPLEMENTED BY PRACTICAL EXAMPLES AND CLASS DISCUSSIONS. THIS TEACHING APPROACH WILL ENABLE STUDENTS TO DEVELOP A SOLID UNDERSTANDING OF THE TECHNIQUES AND METHODOLOGIES USED TO SOLVE COMPLEX COMPUTATIONAL PROBLEMS. WHILE ATTENDANCE AT THE LECTURES IS NOT MANDATORY, IT IS STRONGLY RECOMMENDED TO BENEFIT FROM DIRECT INTERACTION WITH THE INSTRUCTOR AND TO DEEPEN THE ANALYSIS OF REAL CASE STUDIES AND PRACTICAL APPLICATIONS. |
| Verification of learning | |
|---|---|
| THE ACHIEVEMENT OF THE COURSE OBJECTIVES IS CERTIFIED BY PASSING AN EXAM GRADED OUT OF THIRTY, WHICH INCLUDES A WRITTEN TEST AND AN ORAL EXAM, EACH GRADED OUT OF THIRTY. THE WRITTEN TEST IS AIMED AT ASSESSING THE OPERATIONAL SKILLS IN THE STUDY OF ALGORITHMS AND DATA STRUCTURES. IT EVALUATES THE ABILITY TO IMPLEMENT ALGORITHMS TO SOLVE COMPUTATIONAL PROBLEMS SIMILAR TO THOSE DISCUSSED IN CLASS, AND THE APPLICATION OF THE ALGORITHMS PRESENTED ON SMALL-SCALE CONCRETE INPUTS. THE TEST, LASTING 90 MINUTES, IS DIVIDED INTO: - DESIGN AND IMPLEMENTATION OF AN ALGORITHMIC SOLUTION (15 POINTS). - EXERCISES ON THE DEFINITION AND IMPLEMENTATION IN PYTHON OF BASIC DATA STRUCTURES (7 POINTS). - EXERCISES ON SORTING ALGORITHMS (8 POINTS). THE WRITTEN TEST IS CHOSEN TO ASSESS THE PRACTICAL SKILLS OF STUDENTS IN PROGRAMMING AND IMPLEMENTING ALGORITHMIC SOLUTIONS, FUNDAMENTAL ELEMENTS FOR ACHIEVING THE COURSE OBJECTIVES. THE WRITTEN TEST WILL TAKE PLACE AT THE END OF THE COURSE AND WILL PRECEDE THE ORAL EXAM. TO ACCESS THE ORAL EXAM, THE STUDENT MUST HAVE PASSED THE WRITTEN TEST WITH A MINIMUM OF 18/30. THE ORAL EXAM IS AIMED AT DEEPENING THE LEVEL OF THEORETICAL KNOWLEDGE, ANALYSIS AND JUDGMENT AUTONOMY, AND THE STUDENT'S PRESENTATION SKILLS. DURING THE ORAL EXAM, THE STUDENT WILL BE QUESTIONED ON THE CONCEPTS INTRODUCED DURING THE COURSE. - THE MINIMUM SCORE OF 18/30 IS GIVEN TO THOSE WHO SHOW UNCERTAINTY IN THE APPLICATION OF THE STUDIED CONCEPTS, LIMITED KNOWLEDGE OF THE MAIN TOOLS, AND POOR PRESENTATION SKILLS. - THE MAXIMUM SCORE OF 30/30 IS GIVEN TO THOSE WHO SHOW COMPLETE KNOWLEDGE AND OPERATIONAL SKILLS IN THE WRITTEN TEST AND THE PROJECT CARRIED OUT. THE ORAL EXAM IS CHOSEN TO ASSESS THE STUDENTS' ABILITY TO EXPLAIN AND ARGUE THE THEORETICAL CONCEPTS STUDIED, THUS ENSURING A COMPLETE VERIFICATION OF THE ACQUIRED SKILLS, INCLUDING CRITICAL ANALYSIS AND EFFECTIVE COMMUNICATION. THE ORAL EXAM WILL TAKE PLACE AT THE END OF THE COURSE, AFTER THE WRITTEN TEST. THE FINAL GRADE, EXPRESSED OUT OF THIRTY WITH POSSIBLE HONORS, IS OBTAINED AS THE AVERAGE OF THE TWO TESTS. HONORS ARE AWARDED TO THOSE WHO DEMONSTRATE SIGNIFICANT MASTERY OF THE THEORETICAL AND OPERATIONAL CONTENTS, AND PRESENT THE TOPICS WITH NOTABLE LANGUAGE SKILLS AND AUTONOMOUS ELABORATION CAPABILITY EVEN IN CONTEXTS DIFFERENT FROM THOSE PROPOSED BY THE TEACHER. THE EVALUATION OF THE TESTS TAKES INTO ACCOUNT THE ABILITY TO IDENTIFY THE MOST APPROPRIATE ANALYSIS METHODS, THE ABILITY TO CLEARLY AND CONCISELY PRESENT THE OBJECTIVES, THE PROCEDURE, AND THE RESULTS OF THE PERFORMED TASKS, AS WELL AS THE ABILITY TO DEEPEN THE TOPICS USING MATERIALS DIFFERENT FROM THOSE PROPOSED. |
| Texts | |
|---|---|
| RANCE D. NECAISE, DATA STRUCTURES AND ALGORITHMS USING PYTHON, JOHN WILEY & SONS INC, 2011 - ISBN: 0470618299 DZEJLA MEDJEDOVIC, EMIN TAHIROVIC, AND INES DEDOVIC ALGORITHMS AND DATA STRUCTURES FOR MASSIVE DATASETS MANNING, ISBN 9781617298035 |
| More Information | |
|---|---|
| NOTHING |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2024-12-13]
