DISCRETE MATHEMATICS

Computer science DISCRETE MATHEMATICS

0512100040
DIPARTIMENTO DI INFORMATICA
EQF6
COMPUTER SCIENCE
2018/2019

OBBLIGATORIO
YEAR OF COURSE 1
YEAR OF DIDACTIC SYSTEM 2017
PRIMO SEMESTRE
CFUHOURSACTIVITY
648LESSONS
324EXERCISES


Objectives
KNOWLEDGE AND UNDERSTANDING:
THIS COURSE WILL PROVIDE FUNDAMENTAL CONCEPTS OF THE DISCRETE STRUCTURES, WITH EMPHASYS ON APPLICATIONS.
STUDENTS WILL GET USED TO FORMALIZE PROBLEMS PROPERLY AND TO THINK STRICTLY.
APPLYING KNOWLEDGE AND UNDERSTANDING:
COURSE AIMS ALSO TO ENABLE STUDENTS TO SOLVE SIMPLE PROBLEMS AND EXERCISES APPLYING THE ACQUIRED THEORETICAL
KNOWLEDGE. IN PARTICULAR, STUDENTS SHOULD BE ABLE TO PERFORM SET AND MATRICES OPERATIONS, TO FIND
CORRESPONDENCES, APPLICATIONS, ORDINGS AND LATTICES, EQUIVALENCE RELATIONS, PARTITIONS, ALGEBRAIC
STRUCTURES AND SUBSTRUCTURES, TO USE THE EUCLIDEAN ALGORITHM AND THE INDUCTION PRINCIPLE, TO SOLVE SYSTEMS OF
LINEAR AND CONGRUENTIAL EQUATIONS, TO DETERMINE BASES AND DIMENSION OF A VECTOR SPACE, CARTESIAN AND
PARAMETRIC EQUATIONS OF LINES AND PLANES IN THE EUCLIDEAN SPACE.
Prerequisites
THE KNOWLEDGE OF BASIC MATHEMATICAL TOPICS COVERED IN HIGH SCHOOL COURSES IS REQUIRED.
Contents
THE TOPICS OF THE COURSE ARE GROUPED IN 12 UNITS. TO EACH OF THEM WILL BE DEDICATED ABOUT 6 HOURS OF LESSON AND / OR EXERCISES.
1. SETS. SET OPERATIONS: UNION, INTERSECTION, DIFFERENCE, SYMMETRIC DIFFERENCE, CARTESIAN PRODUCT. THE SET OF SUBSETS OF A SET. PARTITIONS OF A SET.
2. RELATIONS AND MAPS. IMAGES AND INVERSE IMAGES. INJECTIVE, SURJECTIVE, BIJECTIVE MAPS. COMPOSITION OF MAPS. THE INVERSE OF A BIJECTIVE MAP. EQUIVALENCE RELATIONS. EQUIVALENCE CLASSES. QUOTIENT SET. FUNDAMENTAL THEOREM.
3. NATURAL NUMBERS AND INTEGER NUMBERS. THE PRINCIPLE OF MATHEMATICAL INDUCTION. DIVISIBILITY. EUCLIDEAN DIVISION. REPRESENTATION OF NATURAL NUMBERS IN A FIXED BASE. PRIME NUMBERS. THE FUNDAMENTAL THEOREM OF ARITHMETIC. EUCLID'S THEOREM ON THE EXISTENCE OF INFINITE PRIME NUMBERS. THE GREATEST COMMON DIVISOR AND THE LEAST COMMON MULTIPLE. EXTENDED EUCLIDEAN ALGORITHM. BEZOUT'S THEOREM. CONGRUENCES.
4. LINEAR CONGRUENTIAL EQUATIONS. THE CHINESE REMAINDER THEOREM.
5. MATRICES. MATRIX OPERATIONS: MATRIX SUM, SCALAR MULTIPLICATION, MATRIX PRODUCT, POWERS OF A MATRIX. TRANSPOSE OF A MATRIX. SCALING MATRIX. EQUIVALENT MATRICES. TRIANGULAR MATRIX. INVERTIBLE MATRICES. DETERMINANT OF A SQUARE MATRIX AND ITS REMARKABLE PROPERTIES. THE BINET'S THEOREM. CALCULATION OF THE INVERSE MATRIX OF AN INVERTIBLE MATRIX. THE RANK OF A MATRIX.
6. ALGEBRAIC STRUCTURES. BINARY OPERATIONS IN A SET. MULTIPLICATION TABLE. STABLE SUBSETS AND INDUCED OPERATION. ASSOCIATIVE OPERATIONS. COMMUTATIVE OPERATIONS. IDENTITY ELEMENT. INVERTIBLE ELEMENTS. HOMOMORPHISMS. FUNDAMENTAL CONCEPTS ABOUT SEMIGROUPS, MONOIDS, GROUPS. THE GROUP OF UNITS OF A MONOID. MODULAR ARITHMETIC. FUNDAMENTAL CONCEPTS ABOUT RINGS, INTEGRAL DOMAINS, FIELDS.
7. VECTOR SPACES. SUBSPACES AND GENERATORS. LINEAR DEPENDENCE, BASES AND DIMENSION. LINEAR APPLICATIONS. ISOMORPHIC VECTOR SPACES.
8. SYSTEMS OF LINEAR EQUATIONS. BASIC CONCEPTS AND SOLVING METHODS: CRAMER, GAUSS-JORDAN, ROUCHE-CAPELLI.
9. DIAGONALIZATION OF A SQUARE MATRIX. EIGENVALUES AND EIGENVECTORS OF A SQUARE MATRIX. EIGENSPACES. SIMILAR MATRICES. DIAGONALIZABLE MATRICES.
10. COMBINATORIAL CALCULUS. THE PRINCIPLE OF ADDITION. THE PRINCIPLE OF INCLUSION-EXCLUSION. THE PRINCIPLE OF MULTIPLICATION. FACTORIAL OF A NATURAL NUMBER. BINOMIAL COEFFICIENTS. DISPOSITIONS. DISPOSITIONS WITH REPETITIONS. PERMUTATIONS. PERMUTATIONS WITH REPETITIONS. COMBINATIONS.
11. ORDER RELATIONS. MINIMAL ELEMENTS AND MAXIMAL ELEMENTS. MINIMUM AND MAXIMUM. UPPER BOUNDS AND LOWER BOUNDS. LEAST UPPER BOUND AND GREATEST LOWER BOUND. HASSE DIAGRAMS. TOTALLY ORDERED SETS. WELL-ORDERED SETS. SUBSETS OF AN ORDERED SET AND INDUCED ORDER. LATTICES. THE LATTICE OF SUBSETS OF A SET. THE LATTICE OF NON-NEGATIVE INTEGERS. SUBLATTICES.
12. ELEMENTS OF ANALYTICAL GEOMETRY IN THE PLANE AND IN THE SPACE. APPLIED VECTORS AND RELATED OPERATIONS. AFFINE COORDINATES. PARAMETRIC AND CARTESIAN STRAIGHT LINE EQUATIONS IN THE PLANE AND IN THE SPACE. PARAMETRIC AND CARTESIAN PLANE EQUATIONS IN THE SPACE. PARALLELISM AND INCIDENCE CONDITIONS.


Teaching Methods
THIS COURSE CONSISTS ON THEORETICAL LESSONS AND EXERCITATIVE LESSONS. DURING THEORETICAL LESSONS STUDENTS LEARN BASIC NOTIONS AND SEVERAL TECHNIQUES TO PROVE RESULTS. DURING EXERCITATIVE LESSONS STUDENT LEARN HOW THE GAINED THEORETICAL KNOWLEDGE MAY BE USED TO SOLVE SIMPLE PROBLEMS.
Verification of learning

THE LEVEL OF ACHIEVEMENT OF THE TEACHING OBJECTIVES IS CERTIFIED BY PASSING AN EXAM WITH OVER 30 POINTS EVALUATION. VERIFICATION INVOLVES A WRITTEN TEST AND ORAL EXAM THAT TAKE PLACE ON DIFFERENT CALENDARED DAYS.
THE WRITTEN TEST, WHICH LASTS ABOUT 2 HOURS, CONSISTS OF 4 EXERCISES RELATING TO THE SUBJECTS OF THE COURSE. THE EXERCISES PROPOSED ARE SIMILAR TO THOSE RESOLVED DURING CLASS LESSONS. STUDENTS WHO GET A SCORE OF AT LEAST 18/30 ARE ADMITTED TO THE ORAL EXAM.
THE ORAL EXAM CONSISTS OF A DISCUSSION ON THE TOPICS OF THE COURSE, AND IS PASSED IF THE STUDENT REACHES A MINIMUM OF 18/30.
THE FINAL VOTE COMES FROM THE AVERAGE OF THE WRITTEN TEST AND ORAL EXAM. THE MINIMUM VOTE FOR PASSING THE EXAM IS 18/30.


Texts
G. VINCENZI, ALGEBRA PER INFORMATICA, ARACNE 2015 (IN ITALIAN)

C. DELIZIA, P. LONGOBARDI, M. MAJ AND C. NICOTERA, MATEMATICA DISCRETA, MCGRAW-HILL, 2009
(IN ITALIAN).
More Information
CONTACT THE TEACHER GILENZI@UNISA.IT
  BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2019-10-21]