Carlo BLUNDO | ALGORITHMS AND DATA STRUCTURES
Carlo BLUNDO ALGORITHMS AND DATA STRUCTURES
cod. 0212700138
ALGORITHMS AND DATA STRUCTURES
| 0212700138 | |
| DIPARTIMENTO DI SCIENZE AZIENDALI - MANAGEMENT & INNOVATION SYSTEMS | |
| EQF6 | |
| BUSINESS MANAGEMENT | |
| 2020/2021 |
| YEAR OF COURSE 2 | |
| 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 | |
|---|---|
| BASIC KNOWLEDGE ABOUT COMPUTER PROGRAMMING. KNOWLEDGE OF THE PYTHON PROGRAMMING LANGUAGE WILL FACILITATE THE UNDERSTANDING OF THE ALGORITHMS AS THEY WILL BE DESCRIBED MAINLY IN PYTHON. |
| Contents | |
|---|---|
| OBJECT ORIENTED PROGRAMMING IN PYTHON -- 6 HOURS - DEFINITION OF ALGORITHM, PSEUDO-CODE -- 2 HOURS - RECURSION -- 4 HOURS - ANALYSIS OF ALGORITHMS -- 4 HOURS - SORTING ALGORITHM: INSERTION SORT, SELECTION SORT, MERGE SORT, RADIX SORT, COUNTING SORT -- 10 HOURS - ELEMENTARY DATA STRUCTURES: QUEUES, LISTS, STACKS -- 6 HOURS - TREES: BINARY SEARCH TREE, HEAP -- 8 HOURS - QUICKSORT, HEAPSORT-- 10 HOURS - GRAPHS: DEFINITION AND VISITS -- 10 HOURS |
| Teaching Methods | |
|---|---|
| THE COURSE REQUIRES 60 HOURS OF TEACHING BETWEEN LESSONS AND LABORATORY EXERCISES: 40 HOURS OF LESSONS IN THE CLASSROOM (7 CFU) AND 20 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 WRITTEN TEST AND AN ORAL TEST. THE EVALUATION OF THE WRITTEN TEST WILL ACCOUNTS FOR 80%, WHILE THE INTERVIEW FOR THE REMAINING 20%. THE CUM LAUDE MAY BE GIVEN TO STUDENTS WHO DEMONSTRATE THAT THEY CAN APPLY THE KNOWLEDGE AUTONOMOUSLY EVEN IN CONTEXTS OTHER THAN THOSE PROPOSED IN THE COURSE. THE PRACTICAL 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 TEST IS PREPARATORY TO THE ORAL EXAMINATION, AND REQUIRES THE ACHIEVEMENT OF PREDETERMINED MINIMUM SCORE. 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. |
| Texts | |
|---|---|
| RANCE D. NECAISE DATA STRUCTURES AND ALGORITHMS USING PYTHON JOHN WILEY & SONS INC, 2011 - ISBN: 0470618299 DATA STRUCTURES AND ALGORITHMS IN PYTHON MICHAEL T. GOODRICH, ROBERTO TAMASSIA, MICHAEL H. GOLDWASSER WILEY PUBLISHING, 2013 - ISBN: 1118290275 |
| More Information | |
|---|---|
| STUDENTS CAN FIND ANNOUNCEMENTS, NEWS, MATERIAL, SLIDES, LECTURES' CALENDAR, A SUMMARY OF THE ARGUMENTS TOUCHED IN CLASS, PROJECTS, HOMEWORKS, EXAM TESTS ON THE COMPANION WEB SITE WHOSE URL WILL BE MAKE AVAILABLE AT THE BEGINNING OF THE COURSE |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2022-05-23]
