Francesco ORCIUOLI | Programming Techniques
Francesco ORCIUOLI Programming Techniques
cod. 0622700001
PROGRAMMING TECHNIQUES
0622700001 | |
DIPARTIMENTO DI INGEGNERIA DELL'INFORMAZIONE ED ELETTRICA E MATEMATICA APPLICATA | |
COMPUTER ENGINEERING | |
2014/2015 |
OBBLIGATORIO | |
YEAR OF COURSE 1 | |
YEAR OF DIDACTIC SYSTEM 2012 | |
PRIMO SEMESTRE |
SSD | CFU | HOURS | ACTIVITY | |
---|---|---|---|---|
ING-INF/05 | 9 | 90 | LESSONS |
Objectives | |
---|---|
THE COURSE AIMS AT LEARNING THE ADVANCED ALGORITHMS AND DATA STRUCTURES, AS GREEDY AND DYNAMIC PROGRAMMING, RB-TREES, B-TREES, HEAPS AND GRAPHS. KNOWLEDGE AND UNDERSTANDING: KNOWLEDGE OF ADVANCED ALGORITHMS AND DATA STRUCTURES. COMPREHENSION OF THE TERMINOLOGY RELATED THE TOPICS PRESENTED IN THE COURSE, WITH PARTICULAR REFERENCE TO PSEUDO-CODE. APPLYING KNOWLEDGE AND UNDERSTANDING: ANALYSIS AND IMPLEMENTATION IN C AND JAVA OF THE ADVANCED ALGORITHMS AND DATA STRUCTURES AND ABILITY TO USE DATA STRUCTURES AVAILABLE IN JAVA PACKAGES. MAKING JUDGEMENTS: TO CHOOSE THE MOST APPROPRIATE METHODS FOR DESIGNING AND REALIZING A JAVA APPLICATION IN TERMS OF STANDARD ALGORITHMS AND DATA STRUCTURES, EVEN USING AT THE BEST THE JAVA PACKAGES. COMMUNICATION SKILLS: BEING ABLE TO DOCUMENT AND TO COMMUNICATE USING THE APPROPRIATE FORMALISMS THE DESIGN CHOICES OF PROGRAMS USING. ABILITY TO WORK WITH OTHER PEOPLE IN SMALL GROUPS. LEARNING SKILLS: BEING ABLE TO APPLY THE ACQUIRED KNOWLEDGE TO CONTEXTS THAT ARE DIFFERENT FROM THOSE PRESENTED IN THE COURSE, AND TO ACQUIRE MORE KNOWLEDGE USING ADDITIONAL SOURCES WITH RESPECT TO THE ONES PROPOSED IN THE COURSE. |
Prerequisites | |
---|---|
IN ORDER TO ACHIEVE THE GOALS OF THE COURSE, A KNOWLEDGE OF THE BASIC ALGORITHMS AND DATA STRUCTURES AND OF PROCEDURAL AND OBJECT-ORIENTED PROGRAMMING LANGUAGES IS REQUIRED. |
Contents | |
---|---|
ADVANCED ALGORITHMS AND DATA STRUCTURES - RB-TREES, - B-TREES, - HEAPS, - GRAPHS ADVANCED PROGRAMMING TECHNIQUES - GREEDY PROGRAMMING AND - DYNAMIC PROGRAMMING |
Teaching Methods | |
---|---|
THE COURSE CONTAINS THEORETICAL LECTURES, IN-CLASS EXERCITATIONS AND PRACTICAL LABORATORY EXERCITATIONS. DURING THE IN-CLASS EXERCITATIONS THE STUDENTS ARE DIVIDED IN TEAMS AND ARE ASSIGNED A PROJECT-WORK TO BE DEVELOPED ALONG THE DURATION OF THE COURSE. THE PROJECT INCLUDES ALL THE CONTENTS OF THE COURSE AND IS ESSENTIAL BOTH FOR THE ACQUISITION OF THE ABILITY TO SOLVE A PROGRAMMING PROBLEM BY DESIGNING AND IMPLEMENTING AN ADVANCED ALGORITHMIC SOLUTION, AND FOR DEVELOPING AND REINFORCING THE ABILITY TO WORK IN A TEAM. IN THE LABORATORY EXERCITATIONS THE STUDENTS IMPLEMENT THE ALGORITHMS AND THE DATA STRUCTURES PRESENTED AT THE COURSE. |
Verification of learning | |
---|---|
THE EXAM AIMS AT EVALUATING, AS A WHOLE: THE KNOWLEDGE AND UNDERSTANDING OF THE CONCEPTS PRESENTED IN THE COURSE, THE ABILITY TO APPLY THAT KNOWLEDGE TO SOLVE PROGRAMMING PROBLEMS REQUIRING THE USE OF ADVANCED ALGORITHMS AND DATA STRUCTURES AND TO EVALUATE THEIR CORRECTNESS AND EFFICIENCY; INDEPENDENCE OF JUDGMENT, COMMUNICATION SKILLS AND THE ABILITY TO LEARN. THE EXAM INCLUDES THE DISCUSSION OF THE PROJECT-WORK, DEVELOPED DURING THE COURSE, AIMED AT EVALUATION OF THE ABILITY TO APPLY KNOWLEDGE, TO WRITE A TECHNICAL REPORT, THE INDEPENDENCE OF JUDGMENT, THE ABILITY TO WORK IN A TEAM, AND AN ORAL INTERVIEW, THE PURPOSE OF WHICH IS TO ASSESS THE ACQUIRED KNOWLEDGE AND ABILITY TO UNDERSTANDING, THE ABILITY TO LEARN AND TO MAKE A GOOD ORAL PRESENTATION OF TECHNICAL CONTENTS. THE ORAL EXAMINATION WILL COVER ALL THE TOPICS OF THE COURSE AND ASSESSMENT WILL TAKE INTO ACCOUNT THE KNOWLEDGE DEMONSTRATED BY THE STUDENT AND THE DEGREE OF ITS DEPTH, PROVEN ABILITY TO LEARN, THE QUALITY OF THE PRESENTATION. IN THE FINAL EVALUATION, EXPRESSED IN THIRTIETHS, THE EVALUATION OF THE PROJECT WORK WILL ACCOUNT FOR 40% WHILE THE INTERVIEW FOR 60%. 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. |
Texts | |
---|---|
T.H. CORMEN, C.E. LEISERSON, R.L. RIVEST, C. STEIN, “INTRODUZIONE AGLI ALGORITMI E STRUTTURE DATI 2/ED”, MC-GRAW HILL. OTHER SUGGESTED REFERENCES M. VENTO, P. FOGGIA, “ALGORITMI E STRUTTURE DATI”, MC-GRAW HILL. OTHER MATERIAL IS AVAILABLE ON THE WEB: INTEGRATIVE MATERIAL, EXERCISES WITH SOLUTIONS AND EXERCISES’ PROPOSAL. |
More Information | |
---|---|
COMPULSORY ATTENDANCE. TEACHING IN ITALIAN. |
BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2016-09-30]