PROGRAMMING MOD. B
- Overview
- Assessment methods
- Learning objectives
- Contents
- Full programme
- Bibliography
- Teaching methods
The suggested pre requisite is module A programming course
The exam will consist in a written trial to solve a problem using Java similar to the ones written during the year and som questions about theory of computational complexity
Increase the knowledge of programming by objective. In details:inheritance, polymorphism and encapsulation.
Increase the knowledge about computational complexity verifying the supposed models with the real computation times series using Matlab.
How to use external libraries in example to plot functions or GUI usage (swing etc.). I/O management with Scanner class etc.
The final objective for the student will be: to identify data structure and algorithms to solve even quite complex problems; to implant algorithms and data structures using Java; deeply know programming by objectives; to use the mai tools for programming
See extend program paragraph
Programming by objective (java environment using Netbeans).
Main topics: Inheritence, Polymophism, Encapsulation.
File managemente using Scanner (to read) and Filewriter (to write) classes using try catch structure.
Use of Javaplot classes to plot functions (gnu plot)
Deeply go inside to computational complexity models defining O and o complexity models
Sort algorithms and their complexity, studying the bad and best cases: mainly quit sort and bubble sort.
Define a complexity model for an algorithm and compare this with real execution time using Matlab spline functions
Recursive algorithms and their implementation: in examples: quick sort and brute force
Large numbers management: big integrity and big decimal classes
Lessons given using Teams and exercises in the main way.
Final exam to check learning both written and oral.
Java documentation provided by Oracle and available via internet
Frontal lessons and solve exercises using Java is the mai methods.