Università degli Studi di Perugia

Skip to content

Study-unit GEOMETRY AND COMPUTER SCIENCE

Course name Industrial engineering
Study-unit Code GP004985
Curriculum Comune a tutti i curricula
Lecturer Walter Didimo
CFU 10
Course Regulation Coorte 2017
Supplied 2017/18
Supplied other course regulation
Type of study-unit Obbligatorio (Required)
Type of learning activities Attività formativa integrata
Partition

COMPUTER SCIENCE BASIS 1

Code GP004992
CFU 5
Lecturer Walter Didimo
Lecturers
  • Walter Didimo - Didattica Ufficiale
Hours
  • 45 Hours - Didattica Ufficiale - Walter Didimo
Learning activities Base
Area Matematica, informatica e statistica
Sector ING-INF/05
Type of study-unit Obbligatorio (Required)
Language of instruction Italian
Contents Fundamentals of computer architectures and programming.Object orienting programming.Elements of Java programming.
Reference texts Book: E. Di Giacomo, W. Didimo, "Fondamenti di Informatica in Java", Ed. Maggioli.Slides: Additional PDF documentation written by the teacher.
Educational objectives At the end of the course, the students should have acquired:Knowledge on basic concepts on computer architecture, operating systems, and information binary encoding.Knowledge of the principles and of the basic elements of object-oriented programming.Ability of designing and writing simple Java programs, correctly using the principles of the object-oriented paradigm.
Prerequisites Students should have basic logic-math skills, acquired in the mathematics courses of high-school.
Teaching methods The course consists of two main kinds of lessions:1) Lessons in the classroom (80% of total time): consists of lessons in the classroom. In each lesson the teacher illustrates new theoretical concepts, by projecting pre-defined slides, and executes practical excercises.2) Practical exercises in the lab (20% of total time): held in the computer science laboratory; they are devoted to the design and implementation of programs, under the supervision of the teacher.
Learning verification modality Written test

Duration: 30 minutes
Score: 10/30
Aim: Assessing the knowledge of theoretical concepts learned in the course and the ability of the student to solve basic algorithmic problem through very simple programs.Programming test

Duration: 60 minutes
Score: 20/30
Aim: Assessing the ability of the student to design and develop simple programs in the Java language
Extended program [Part I - Introduction to computer architecture and software programming]. Fundamentals of computer architectures and Von Neumann's model, operating systems, and information encoding. Languages, programs and programming paradigms. Introduction to object oriented programming: Classes and objects.
[Part II - Elements of object-oreinted programming in Java]. The structure of Java programs. Programming environment. Using objects: creation and method invocation. Data types. Strings. Class definitions. Control instructions. Iterative techniques. Monodimensional and multidimensional arrays.

GEOMETRY I

Code GP004991
CFU 5
Lecturer Daniele Bartoli
Lecturers
  • Daniele Bartoli - Didattica Ufficiale
Hours
  • 45 Hours - Didattica Ufficiale - Daniele Bartoli
Learning activities Base
Area Matematica, informatica e statistica
Sector MAT/03
Type of study-unit Obbligatorio (Required)
Language of instruction ITALIAN
Contents Linear algebra
Matrix theory - Linear systems
Affine geometry in 2 and 3 dimensions.
Reference texts E. Schlesinger, Algebra lineare e geometria. Zanichelli editore.
K. Nicholson, Algebra lineare, McGraw Hill
Notes.
Educational objectives Learning the basic algorithms and solving easy problems in linear algebra and affine geometry
Prerequisites Basic notions about mathematics and logic.
Teaching methods Face to face lectures on all arguments in the program.
Learning verification modality 5 partial exams and one final exam which consists of both exercises and a theoretical part.
Extended program The language of set theory: union, intersection. Maps between sets. Groups and fields: the field of complex numbers (de Moivre formula). Matrix with elements iin a field and their algebraic properties. Basics of linear algebra: vector spaces and subspaces, intersection of subspaces. Generating sets, linearly independent sets. Basis and techniques to determine the linear basis of a given vector space. Linear maps: kernel and image. Isomorphisms. Rank and determinant of a linear map: invertibility. Carmer's theorem on linear systems. Rouchè-Capelli's theorem. Subspaces as solutions of homogeneous lynear systems.
Eigenvalues and eigenvectors of matrices and endomorphisms. Hints on diagonalizability.
Affine coordinate systems on lines, planes, three space.
Go top
Table of content
×