Computer science | MATHEMATICAL METHODS FOR COMPUTER SCIENCE

cod. 0512100041

MATHEMATICAL METHODS FOR COMPUTER SCIENCE

	0512100041
	DIPARTIMENTO DI INFORMATICA
	EQF6
	COMPUTER SCIENCE
	2017/2018

PERCORSO COMUNE

	OBBLIGATORIO
	YEAR OF COURSE 1
	YEAR OF DIDACTIC SYSTEM 2017
	SECONDO SEMESTRE

TEACHING UNITS

SSD	CFU	HOURS	ACTIVITY	TYPE OF ACTIVITY
INF/01	4	32	LESSONS	BASIC COMPULSORY SUBJECTS
INF/01	2	16	EXERCISES	BASIC COMPULSORY SUBJECTS

	Objectives
	KNOWLEDGE. THE STUDENT MUST HAVE KNOWLEDGE: •OF SIMPLE LOGIC TOOLS, PARTICULARLY KNOWLEDGE OF PROPOSITIONAL LOGIC AND PREDICATE CALCULUS AND OF THE LOGIC REASONING THAT IS THE BASIS OF THE PROOF METHODS AND STRATEGY. •OF THE CONCEPTS OF INDUCTION, RECURSION, AND STRUCTURAL INDUCTION. ABILIY TO APPLY KNOWLEDGE. THE STUDENT MUST BE ABLE: •TO GIVE PRECISE AND FORMAL STATEMENTS OF SIMPLE PROBLEMS DESCRIBED IN NATURAL LANGUAGE ON SETS, STRINGS, NUMBERS, TREES, GRAPHS, BY USING CONCEPTS AND TECHNIQUES OF THE MATHEMATICAL AND LOGIC REASONING; TO DEMONSTRATE SIMPLE STATEMENTS ON SETS AND NUMBERS. •TO USE INDUCTION, RECURSION, AND STRUCTURAL INDUCTION.

KNOWLEDGE.
THE STUDENT MUST HAVE KNOWLEDGE:
•OF SIMPLE LOGIC TOOLS, PARTICULARLY KNOWLEDGE OF PROPOSITIONAL LOGIC AND PREDICATE CALCULUS AND OF THE LOGIC REASONING THAT IS THE BASIS OF THE PROOF METHODS AND STRATEGY.
•OF THE CONCEPTS OF INDUCTION, RECURSION, AND STRUCTURAL INDUCTION.

ABILIY TO APPLY KNOWLEDGE.
THE STUDENT MUST BE ABLE:
•TO GIVE PRECISE AND FORMAL STATEMENTS OF SIMPLE PROBLEMS DESCRIBED IN NATURAL LANGUAGE ON SETS, STRINGS, NUMBERS, TREES, GRAPHS, BY USING CONCEPTS AND TECHNIQUES OF THE MATHEMATICAL AND LOGIC REASONING; TO DEMONSTRATE SIMPLE STATEMENTS ON SETS AND NUMBERS.
•TO USE INDUCTION, RECURSION, AND STRUCTURAL INDUCTION.

	Prerequisites
	THE STUDENT SHOULD HAVE KNOWLEDGE OF MATHEMATICS AND LANGUAGE PROFICIENCY AT HIGH SCHOOL LEVEL.

	Contents
	•BASICS ON LOGIC: PROPOSITIONAL LOGIC AND ITS APPLICATIONS, PROPOSITIONAL EQUIVALENCES, PREDICATES AND QUANTIFIERS, METHODS AND STRATEGY OF DIRECT AND INDIRECT PROOFS. BASICS ON SETS, SET OPERATIONS, FUNCTIONS, CARDINALITY OF SETS. •INDUCTION AND RECURSION: INDUCTION, RECURSIVE DEFINITIONS, STRUCTURAL INDUCTION, RECURSIVE ALGORITHMS.

	Teaching Methods
	CLASS LECTURES INCLUDING EXERCISES. THE LECTURE WILL USE EXAMPLES TO ILLUSTRATE THE CONCEPTS, RELATE DIFFERENT TOPICS TO EACH OTHER, AND INTRODUCE THEIR APPLICATIONS.

	Verification of learning
	THE ASSESSMENT OF THE ACQUISITION OF THE BASIC CONCEPTS OF THE MODULE, LISTED IN THE “CONTENTS” SECTION, AND OF THE ABILITY TO APPLY THESE CONCEPTS AS DESCRIBED IN THE “OBJECTIVES” SECTION, WILL TAKE THE FORM OF BOTH A WRITTEN AND AN ORAL EXAM. IT CAN BE SUBSTITUTED BY A MIDTERM PLUS A FINAL WRITTEN TEST.

	Texts
	KENNETH D. ROSEN, DISCRETE MATHEMATICS AND ITS APPLICATIONS, SEVENTH EDITION, MCGRAW-HILL, 2012. FURTHER READING: KEITH DEVLIN, INTRODUCTION TO MATHEMATICAL THINKING, 2012.

	More Information
	E-LEARNING PLATFORM WEB SITE: HTTP://ELEARNING.INFORMATICA.UNISA.IT/EL-PLATFORM/ CONTACT INFORMATION: DEFELICE@DIA.UNISA.IT HTTP://DOCENTI.UNISA.IT/001119/HOME

BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2019-05-14]