Free University of Bolzano/Bozen
Faculty of Computer Science - Bachelor in Applied Computer Science
Bachelor in Production Engineering
Introduction to Programming
Lectures A.A. 2004/2005
Teaching material
[M1] Lecture Notes for
Introduction to Programming. Diego Calvanese.
[M2]
Big Java. Cay
S. Horstmann. John Wiley & sons, 2002.
Lectures
Summary
| Week |
Topics |
Monday
8:30-10:30
(lecture) |
Wednesday
8:30-10:30
(lecture) |
Wednesday
14:00-16:00
(lab) |
#1
Oct. 11 |
Introduction to programming
|
Introduction to programming
(Lec 1,2)
|
Use of objects, invocation of methods
(Lec 3,4)
|
Java development environment
(Exer 1)
|
#2
Oct. 18 |
Use of objects and variables
|
Variables, object references
(Lec 5,6)
|
Costructors, input/output
(Lec 7,8)
|
Invocation of methods
(Exer 2)
|
#3
Oct. 25 |
Definition of methods and classes
|
Modularization,
definition of static methods
(Lec 9,10)
|
Definition of classes, instance variables
(Lec 11,12)
|
Constructors, Inheritance
(Lec 13,14)
|
#4
Nov. 1 |
Inheritance
| -- |
Overriding and polymorphism
(Lec 15,16)
|
Definition of classes
(Exer 3)
|
#5
Nov. 7 |
Primitive data types
|
Primitive types for integers
(Lec 17,18)
|
Primitive types for reals, characters, booleans
(Lec 19,20)
|
Inheritance, primitive types
(Exer 4)
|
#6
Nov. 15 |
Conditional statements
|
if-else statement
(Lec 21,22)
|
Complex conditions, comparing objects, switch st.
(Lec 23,24)
|
Conditional statements
(Exer 5)
|
#7
Nov. 22 |
Loop statements
|
while loop, loop schemes
(Lec 25,26)
|
for loop, do loop
(Lec 27,28)
|
Midterm lab exam
(Midterm)
|
#8
Nov. 29 |
Arrays
| Nested loops
(Lec 29,30)
|
Arrays
(Lec 31,32)
|
Loop statements
(Exer 6)
|
#9
Dec. 13 |
Arrays, files
| Matrices, Exercises on arrays
(Lec 33,34)
|
Files and streams
(Lec 35,36)
|
Arrays and matrices
(Exer 7)
|
#10
Dec. 20 |
Error handling, exceptions
| Streams, Exercises on files
(Lec 37,38)
|
Errors and exceptions
(Lec 39,40)
|
Matrices and files
(Exer 8)
|
#11
Jan. 10 |
Recursion
| Exceptions, Recursion
(Lec 41,42)
|
Memory management, recursive methods
(Lec 43,44)
|
Recursion
(Exer 9)
|
#12
Jan. 17 |
Linked lists
| Multiple recursion, dynamic arrays
(Lec 45,46)
|
Linked lists
(Lec 47,48)
|
Dynamic arrays
(Exer 10)
|
#13
Jan. 24 |
Exam exercises
| Exam exercise
(Exer 12)
|
-- |
Exam exercise
(Exer 11)
|
Details
Week 1:
Introduction to programming (Unit 1)
Lectures 1,2 - 11/10/2004
- Topics
[M1: Unit 1]
- course presentation
- programming languages
- program = objects + operations
- first Java program
- writing, compiling, and executing a program
- What you should know after the lecture
- distinction between objects and operations
- how to input, compile, and execute a simple Java program
Lectures 3,4 - 13/10/2004
- Topics
[M1:
Unit 1,
Unit 2]
- program errors
- objects and classes in Java
- the class
String
- method invocation
- static methods
- What you should know after the lecture
- writing simple programs consisting only of the
main method that manipulate String
objects
Lab exercise 1 - 13/10/2004
Week 2:
Use of objects and variables (Unit 2)
Lectures 5,6 - 18/10/2004
- Topics
[M1:
Unit 2]
- variables
- assignment
- object references and referenced objects
- What you should know after the lecture
- memory model for objects and variables
- writing simple programs consisting only of the
main method that make use of String
variables
- illustrating with appropriate diagrams what happens in memory
during the execution of such simple programs
Lectures 7,8 - 20/10/2004
- Topics
[M1:
Unit 2]
- creation of new objects: constructors
- mutable and immutable objects in Java
- methods that have side-effect
- the class
StringBuffer
- video output and keyboard input
- What you should know after the lecture
- write simple programs constituted only by the
main method that use variables of type
String and StringBuffer
- illustrate by means of diagrams what happens in memory during the
execution of the above programs
Lab exercise 2 - 20/10/2004
Week 3:
Definition of methods and classes (Unit 3)
Lectures 9,10 - 25/10/2004
- Topics
[M1:
Unit 3]
- modularization of programs
- abstraction on operations
- definition of static methods
- parameter passing
- scope of local variables
- What you should know after the lecture
- illustrate by means of diagrams what happens in memory during the
call of a static methods and during parameter passing (activation
record)
- write simple programs consisting of static methods that use
variables of type
String and StringBuffer
- illustrate by means of diagrams what happens in memory during the
execution of the above programs
Lectures 11,12 - 27/10/2004
- Topics
[M1:
Unit 3]
- lifetime of local variables
- abstraction on objects
- definition of a class
- access modifiers:
public and private
- instance variables
- definition of instance methods
- constructors
- What you should know after the lecture
- understand a class definition: data and operation fields
- how to define and use constructors of a class
Lectures 13,14 - 27/10/2004
- Topics
[M1:
Unit 3]
- design methodology for a class
- inheritance
- static type-checking
- What you should know after the lecture
- realize simple Java classes starting from their specification, and
using the proposed methodology
- understand the basic principles of inheritance
Week 4:
Inheritance (Unit 3)
Lectures 15,16 - 3/11/2004
- Topics
[M1:
Unit 3,
Unit 4]
- overriding and polymorphism
- the class
Object
- an example of realizzation of a Java class:
the class
Book and a
client of the class (Exercises 3.1 and 3.2)
- primitive data types in Java and variables of primitive data types
- wrapper classes
- What you should know after the lecture
- how to do overriding of methods
- realize simple Java classes starting from their specification, and
using the proposed methodology
- the difference between variables of type reference to object and
variables of primitive data types
Lab exercise 3 - 3/11/2004
- Exercises on the invocationn of static methods and on the
definition of classes that realize abstraction on objects
[English,
Italian]
- Solutions [English,
Italian]
Week 5:
Primitive data types (Unit 4)
Lectures 17,18 - 8/11/2004
- Topics
[M1:
Unit 4]
- primitive data types to represent integer numbers:
int, byte short,
long
- numeric overflow
- operators
- constants and magic numbers
- primitive data types to represent real numbers:
double, float
- What you should know after the lecture
- how to use primitive types for integer and real numbers
- how to define constants
Lectures 19,20 - 10/11/2004
- Topics
[M1:
Unit 4]
- type conversions
- primitive data type to represent characters:
char
- primitive data type to represent booleans:
boolean
- What you should know after the lecture
- how implicit and explicit type conversions work
- how to use primitive types in Java
Lab exercise 4 - 10/11/2004
Week 6:
Conditional statements (Unit 5)
Lectures 21,22 - 15/11/2004
- Topics
[M1:
Unit 5]
- conditional statement
if-else
- variant without
else
- block statement and scope of variables defined inside a block
- nested
if-else statements
- use of complex conditions in
if-else statements
- conditional expression
- What you should know after the lecture
- how to use the
if-else statement and the
if variant in simple programs
- how to use
if-else statements with complex conditions
- Proposed exercises
Lectures 23,24 - 17/11/2004
- Topics
[M1:
Unit 5]
- comparison between
String objects
- equality of objects vs. equality of references to objects
- the
switch statement
- What you should know after the lecture
- how to test equality of strings and objects
- how to use the
switch statement
Lab exercise 5 - 17/11/2004
Week 7:
Loop statements (Unit 6)
Lectures 25,26 - 22/11/2004
- Topics
[M1:
Unit 6]
- definite and indefinite loops
- the
while statement
- loop schemes (counter, accumulator, characteristic values in a set)
- What you should know after the lecture
- how to use the
while statement in simple programs
- how to distinguish the control part of a loop from the part
containing the specific actions
- how to implement loops of various kinds
- Solved exercises
Lectures 27,28 - 24/11/2004
- Topics
[M1:
Unit 6]
- the
for statement
- the
do statement
- What you should know after the lecture
- how to use the
for and dostatements in
simple programs
- Solved exercises
- length of the longest subsequence
[Unit 6, Section
6.39]
- Proposed exercises
Midterm lab exam - 23-24/11/2004
Week 8:
Arrays (Unit 7)
Lectures 29,30 - 29/11/2004
- Topics
[M1:
Unit 6]
- What you should know after the lecture
- how to use
while, for and
do statements to write programs that use nested loops
- how to use the class
StringTokenizer
- Solved exercises
- Proposed exercises
Lectures 31,32 - 1/12/2004
- Topics
[M1:
Unit 7]
- storing collections of elements in memory
- declaration and initialization of arrays
- access to the elements of an array
- declaration and initialization of matrices
- access to the elements of a matrix
- What you should know after the lecture
- how to use arrays in simple programs
- how to use matrices in simple programs
Lab exercise 6 - 1/12/2004
Week 9:
Arrays (Unit 7) and files (Unit 8)
Lectures 33,34 - 13/12/2004
- Topics
[M1:
Unit 7]
- exercises on arrays and matrices
- classes that make use of arrays
- What you should know after the lecture
- how to use arrays and matrices in simple programs
- Solved exercises
- the class
ApartmentOwner
[Unit 7, Sections
7.19 to
7.22]
- Proposed exercises
Lectures 35,36 - 15/12/2004
- Topics
[M1:
Unit 8]
- the concept of file
- opening and closing a file
- writing to a text file using the classes
FileWriter
and PrintWriter
- reading from a text file using the classes
FileReader
and BufferedReader
- input and output streams
- What you should know after the lecture
- how to read from and write to a text file in Java programs
- how to open various types of input and output streams
- how to read from an input stream and how to write to an output
stream
Lab exercise 7 - 15/12/2004
Week 10:
Error handling and exceptions (Unit 9)
Lectures 37,38 - 20/12/2004
- Topics
[M1:
Unit 8]
- reading data from a formatted text file
- exam exercise
- What you should know after the lecture
- how to define and use a static method for reading from a text file
an object of a class
- Solved exercises
- Proposed exercises
- car sales
[Unit 8, Sections
8.19 to
8.22]
Lectures 39,40 - 22/12/2004
- Topics
[M1:
Unit 9]
- types of program errors
- detecting and correcting errors
- exceptions in Java
- declaring exceptions
- throwing exceptions (
throw statement)
- catching exceptions (
try-catch statement)
- the
getMessage method
- What you should know after the lecture
- how program errors can be classified
- how one can detect and correct errors
- what exceptions are and how they are classified
- how to handle errors in Java through exceptions
Lab exercise 8 - 22/12/2004
Week 11:
Recursion (Unit 10)
Lectures 41,42 - 10/1/2005
- Topics
[M1:
Unit 9,
Unit 10]
- propagation and handling of exceptions
- inductively defined domains (natural numbers, strings, files, ...)
- recursive functions
- recursive methods
- What you should know after the lecture
- how a chain of exception propagations can be blocked
- how we can define a domain inductively
- characterizing recursively an operation over an inductively defined
domain
- design and realize in Java simple recursive methods that operate on
natural numbers and strings
Lectures 43,44 - 12/1/2005
- Topics
[M1:
Unit 10]
- examples of recursive methods that make use of simple recursion
- activation record
- evolution of the stack of activation records during the execution
of methods at runtime:
example program
- evolution of the stack of activation records during the execution
of recursive methods:
example program
- What you should know after the lecture
- design and realize in Java simple recursive methods that operate on
natural numbers, on strings, and on files
- know about the notions of activation record and of stack of
activation records
- understand how such notions support the invocation of methods in
programs, specifically for recursive methods
- Proposed exercises
Lab exercise 9 - 12/1/2005
Week 12:
Linked lists (Unit 11)
Lectures 45,46 - 17/1/2005
- Topics
[M1:
Unit 10,
Unit 11]
- multiple recursion
- use of dynamic arrays to handle collections of elements
- representation of linked lists
- What you should know after the lecture
- design and realize in Java recursive methods that make use of
multiple recursion
- understand the possible implications of using multiple recursion
from the computational complexity point of view
- what the advantages and disadvantages are of using arrays to handle
collections of elements
- how to used dynamic arrays to handle collections of elements
- Solved exercises
- towers of Hanoi
[Unit 10, Sections
8.23 and
8.24]
- Proposed exercises
- recusive methods on arrays
(with solutions)
- static method that takes as parameter a string and prints all
strings that are obtained by permuting the character of the string
passed as parameter (exercise 7 on
strings.
- traversal of a moor
[Unit 10, Sections
8.25 and
8.28]
- handling a dictionary
Lectures 47,48 - 19/1/2005
- Topics
[M1:
Unit 11]
- operations on linked lists
- iterative implementation of operations on linked lists through
static methods
- inductive characterization of linked lists
- recursive implementation of operations on linked lists through
static methods
- What you should know after the lecture
- what the basic operations on linked lists are
- how to provide a recursive characterization of operations on linked
lists
- how to implement operations on linked lists using recursive methods
- Solved exercises
Lab exercise 10 - 19/1/2005
Week 13:
Exam exercises
Exercise 12 (in class) - 24/1/2005
- Solved exercises
- Proposed exercises
Lab exercise 11 - 26/1/2005
course home page
Last modified:
Monday, 24-Jan-2005 4:16:50 CET