PROGRAMMING AND ALGORITHMS 1

Single discipline educational activity

Course Sheet

Course code:

000507L

Academic Year of enrolment:

2022

Year of supply:

2022/2023

Degree:

Course of 1st Cycle Degree in ECONOMICS AND BUSINESS INFORMATICS

Language:

Italian

Moduls:

PROGRAMMING AND ALGORITHMS 1 - 6 credits
PROGRAMMING LABORATORY 1 - 3 credits

Location:

PESCARA

Credits:

Programme Year:

Cycle:

First semester

Hours of classroom activity:

Prerequisites:

Nothing

Objectives

The aim of this course is to teach the principles of structured programming using Java as a programming language. It is not the aim of the course to teach object-oriented programming, which will instead be one of the main topics of the course "Programmazione e Algoritmi 2".

EXPECTED LEARNING RESULTS

KNOWLEDGE AND UNDERSTANDING:

At the end of the course, the student must be able to:
* illustrate the basic inner working of a computer and the meaning of algorithm;
* illustrate the concept of asymptotic computational complexity of an algorithm;
* illustrate the principles of structured programming;
* illustrate the basic methods that Java provides for input/output from/to the console;
* illustrate the most important methods of Java's String and Math classes;
* illustrate the the algorithms for linear and binary search and the the most common sorting algorithms.

KNOWLEDGE AND UNDERSTANDING APPLIED:

At the end of the course, the student must be able to:
* manually generate the execution trace of a program written in the Java language;
* write simple structured programs in Java language;
* calculate the asymptotic computational complexity of simple Java programs;
* use a Java development environment such as Visual Studio Code in both the development and debugging stages.

COMMUNICATION SKILLS:

At the end of the course, the student must be have to explain the inner workings of programs and algorithms using correct and precise language

Contents

Introduction to programming. First steps with Java. Conditional statements and operators. Definite iteration. Indefinite iteration. Subprograms and static methods. Arrays. Recursion. Asymptotic computational complexity. Search and sorting algorithms. Concatenated data structures.

Extended Syllabus

Introduction to programming.
* Hardware and Software
* Programming languages, interpreters and compilers
* The Java bytecode and the Java Virtual Machine
* Structured and object-oriented programming
* Testing and debugging
* Software reuse

First steps with Java.
* A simple Java program
* The Visual Studio Code development environment
* Numeric variables and data types
* Arithmetic expressions
* Assignment
* Binary representation of numeric data
* Casting and promotion of numerical values
* Input and output
* The String type
* Constants
* Programming style

Conditional statements and operators.
* The if-then-else statement
* The ternary operator
* The boolean type
* Boolean expressions and the logic of propositions
* Equality in Java
* The switch statement and the switch operator

Definite iteration.
* Definite iteration in Java
* Examples of programs that use the definite iteration
* Break and continue statements
* Using the debugger in Visual Studio Code

Indefinite iteration
* While and do-while statements
* Examples of programs that use indefinite iteration
* Write bug-free loops
* The for statement

Subprograms and static methods.
* Subprograms and static methods
* Parameter passing
* Methods that return a result
* Documentation with Javadoc

Arrays
* Carriers
* Linear search and binary search
* Sorting a vector: selection sort, bubble sort, quicksort
* Multidimensional arrays
* Asymptotic computational complexity

Recursion.
* Recursive programs
* The stack of activation records

Recommended Bibliography

Walter Savitch
Programmazione di base e avanzata con Java (seconda edizione)
Pearson

Methods of Provision

Conventional

Teaching Methods

The course will be divided into:
* a module of 6 CFU (48 hours) consisting of lectures in the classroom.
* a module of 3 CFU (24 hours) consisting of laboratory exercises. To allow all students to work with their own PC, the laboratory module is split into two channels, according to the first letter of the surname.

Evaluation methods

Verification of learning:

The exam consists of a project, a practical test and a written test, plus an oral test, normally optional.

The project consists in developing a program (or part of it) according to a specification given by the teacher. The project can be carried out in group. The project may be evaluated positively or negatively. The positive evaluation is a necessary condition to proceed with the practical test. Once the project has been positively evaluated, it remains valid for the entire academic year.

The practical test takes place in the computer room on the computer, and consists of a modification to be made to the project. The evaluation is a point from 0 to 30.

The written test, usually carried out immediately after the oral test, consists of a series of exercises on the course program. The evaluation is a point from 0 to 30.

The final grade is the average of the grades of the practical test and the written test.

It is foreseen that, during the course of the lessons, there will be some "homework" in class, optional exam tests which, if carried out correctly, will give additional points to the final exam grade.

Contacts/More Information

Further information is available from the website on the e-learning platform fad.unich.it

Università degli Studi
"G. d'Annunzio"

Chieti - Pescara

Aree