Economia e Management | ADVANCED DATA STRUCTURES AND ALGORITHMS

cod. 0212700168

ADVANCED DATA STRUCTURES AND ALGORITHMS

	0212700168
	DEPARTMENT OF MANAGEMENT & INNOVATION SYSTEMS
	EQF6
	BUSINESS MANAGEMENT
	2021/2022

CURRICULUM MARKETING AND TOURISM MANAGEMENT

	YEAR OF COURSE 2
	YEAR OF DIDACTIC SYSTEM 2014
	SPRING SEMESTER

TEACHING UNITS

	SSD	CFU	HOURS	ACTIVITY	TYPE OF ACTIVITY
	INF/01	10	60	LESSONS	OPTIONAL SUBJECTS

PROFESSORS

	CARLO BLUNDO T Curriculum
	MARIACRISTINA GALLO Curriculum

	Objectives
	THIS COURSE AIMS TO LET STUDENTS KNOW SOME ADVANCED DATA STRUCTURES (E.G., TREES AND GRAPHS) AND RECURSIVE SORTING ALGORITHMS 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.

THIS COURSE AIMS TO LET STUDENTS KNOW SOME ADVANCED DATA STRUCTURES (E.G., TREES AND GRAPHS) AND RECURSIVE SORTING ALGORITHMS

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
	PYTHON OBJECT ORIENTED PROGRAMMING AND BASIC DATA STRUCTURES

	Contents
	- RECURSIVE FUNCTIONS (6 HOURS) - RECURSIVE SORTING ALGORITHMS: QUICKSORT, MERGESORT, HEAPSORT (4 HOURS) - RECURRENCE RELATION (6 HOURS) - HASH TABLES (4 HOURS) - LIST BASED PRIORITY QUEUE (4 HOURS) - DEFINITION AND IMPLEMENTATION OF BINAY TREES (6 HOURS) - HEAP AND HEAPSORT (4 HOURS) - BINARY SEARCH TREE (4 HOURS) - GRAPHS: DEFINITION AND IMPLEMENTATION (8 HOURS) - GRAPH ALGORITHMS: BREADTH FIRST SEARCH, DEPTH FIRST SEARCH, CONNECTED COMPONENTS, MINIMUM SPANNING TREE (6 HOURS)

Contents

- RECURSIVE FUNCTIONS (6 HOURS)
- RECURSIVE SORTING ALGORITHMS: QUICKSORT, MERGESORT, HEAPSORT (4 HOURS)
- RECURRENCE RELATION (6 HOURS)
- HASH TABLES (4 HOURS)
- LIST BASED PRIORITY QUEUE (4 HOURS)
- DEFINITION AND IMPLEMENTATION OF BINAY TREES (6 HOURS)
- HEAP AND HEAPSORT (4 HOURS)
- BINARY SEARCH TREE (4 HOURS)
- GRAPHS: DEFINITION AND IMPLEMENTATION (8 HOURS)
- GRAPH ALGORITHMS: BREADTH FIRST SEARCH, DEPTH FIRST SEARCH, CONNECTED COMPONENTS, MINIMUM SPANNING TREE (6 HOURS)

	Teaching Methods
	THE COURSE REQUIRES 60 HOURS OF TEACHING BETWEEN LESSONS AND LABORATORY EXERCISES: 36 HOURS OF LESSONS IN THE CLASSROOM (6 CFU) AND 24 HOURS OF GUIDED EXERCISES IN LABORATORY (4 CFU). THE LABORATORY EXERCISES WILL BE ENHANCED BY CASE STUDIES. THE TEACHER WILL SUGGEST ADDITIONAL EXERCISES TO BE SOLVED BY STUDENTS WITH INDIVIDUAL STUDY. ATTENDING CLASSROOM LECTURES AND LAB PRACTICE IS NOT REQUIRED. TO OBTAIN FULL ACHIEVEMENT OF THE LEARNING OBJECTIVES ATTENDING LECTURES AND LAB PRACTICE IS STRONGLY RECOMMENDED.

Teaching Methods

THE COURSE REQUIRES 60 HOURS OF TEACHING BETWEEN LESSONS AND LABORATORY EXERCISES: 36 HOURS OF LESSONS IN THE CLASSROOM (6 CFU) AND 24 HOURS OF GUIDED EXERCISES IN LABORATORY (4 CFU). THE LABORATORY EXERCISES WILL BE ENHANCED BY CASE STUDIES. THE TEACHER WILL SUGGEST ADDITIONAL EXERCISES TO BE SOLVED BY STUDENTS WITH INDIVIDUAL STUDY. ATTENDING CLASSROOM LECTURES AND LAB PRACTICE IS NOT REQUIRED. TO OBTAIN FULL ACHIEVEMENT OF THE LEARNING OBJECTIVES ATTENDING LECTURES AND LAB PRACTICE IS STRONGLY RECOMMENDED.

	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 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 WRITTEN TEST IS A PREREQUISITE FOR THE ORAL TEST , 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.

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 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 WRITTEN TEST IS A PREREQUISITE FOR THE ORAL TEST
, 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 MADE AVAILABLE AT THE BEGINNING OF THE COURSE

BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2022-11-21]