Unit GEOMETRY AND COMPUTER SCIENCE
 Course
 Industrial engineering
 Studyunit Code
 GP004985
 Curriculum
 In all curricula
 Teacher
 Walter Didimo
 CFU
 10
 Course Regulation
 Coorte 2020
 Offered
 2020/21
 Type of studyunit
 Obbligatorio (Required)
 Type of learning activities
 Attività formativa integrata
COMPUTER SCIENCE BASIS 1
Code  GP004992 

CFU  5 
Teacher  Walter Didimo 
Teachers 

Hours 

Learning activities  Base 
Area  Matematica, informatica e statistica 
Academic discipline  INGINF/05 
Type of studyunit  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: (i) Knowledge on basic concepts on computer architecture, operating systems, and information binary encoding. (ii) Knowledge of the principles and of the basic elements of objectoriented programming. (iii) Ability in designing and writing simple Java programs, correctly using the principles of the objectoriented paradigm. 
Prerequisites  Students should have basic logicmath skills, acquired in the mathematics courses of highschool. 
Teaching methods  The course consists of two main kinds of lessions: (i) 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 predefined slides, and executes practical excercises. (ii) 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. 
Other information  None 
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 objectoreinted 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 
Teacher  Daniele Bartoli 
Teachers 

Hours 

Learning activities  Base 
Area  Matematica, informatica e statistica 
Academic discipline  MAT/03 
Type of studyunit  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. They must understand and write mathematical sentences. 
Prerequisites  Basic notions about mathematics and logic. 
Teaching methods  Face to face lectures on all the topics in the program. Exercises in classroom. 
Other information  http://www.unipg.it/disabilitaedsa 
Learning verification modality  The final mark is obtained summing the marks of 4 partial exams (30 minutes each) on Linear Systems, Matrices, Homomorphisms, Affine and Euclidean Geometry and a final exam which consists of 5 exercises and a theoretical exercise. Each of the 4 partial exams can be repeated once per week and only the best score for each type is considered. Each of the partial exams gives between 0 and 10 points, the final exam from 0 to 60. Also, at most five extra points are given to the students for their active participation. Before the final exam the student must pass a test consisting of 10 questions about definitions and stametents of theorems. The student must answer correctly at 8 questions at least in 20 minutes and the questions will be taken from an online database of roughly 70 questions availlable in advance for the students. The final mark is the scaled between 0 and 30. 
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. 