Economia e Management | Foundations of Computer Science

cod. 0212700006

FOUNDATIONS OF COMPUTER SCIENCE

	0212700006
	DEPARTMENT OF MANAGEMENT & INNOVATION SYSTEMS
	EQF6
	BUSINESS MANAGEMENT
	2022/2023

CURRICULUM MANAGEMENT E NUOVE TECNOLOGIE

	OBBLIGATORIO
	YEAR OF COURSE 1
	YEAR OF DIDACTIC SYSTEM 2014
	AUTUMN SEMESTER

TEACHING UNITS

	SSD	CFU	HOURS	ACTIVITY	TYPE OF ACTIVITY
	INF/01	6	36	LESSONS	SUPPLEMENTARY COMPULSORY SUBJECTS

EXAMS

Exam	Date	Session
GALLO (D-G)	13/04/2023 - 09:30	SESSIONE ORDINARIA
GALLO (D-G)	08/06/2023 - 09:30	SESSIONE ORDINARIA
GALLO (D-G)	22/06/2023 - 09:30	SESSIONE ORDINARIA
GALLO (D-G)	12/07/2023 - 09:30	SESSIONE ORDINARIA
GALLO (D-G)	11/09/2023 - 09:30	SESSIONE DI RECUPERO

	Objectives
	THE COURSE OFFERS AN INTRODUCTION TO CONCEPTS ("KNOW") AND FUNDAMENTAL TECHNIQUES ("KNOW-HOW") OF INFORMATION AND COMMUNICATION TECHNOLOGIES (ICT). THE OBJECTIVE IS TO TEACH: TERMINOLOGIES, HARDWARE AND SOFTWARE ARCHITECTURES, MAIN TYPES OF DATA AND THEIR REPRESENTATION, AND THE FUNCTIONING OF MODERN COMPUTERS. SUCH KNOWLEDGE WILL BE USEFUL BOTH FOR CONTINUING STUDIES AND FOR WORK. STUDENTS WILL BE ABLE TO DISTINGUISH AND EVALUATE THE CAPABILITIES AND PERFORMANCE OF HARDWARE/SOFTWARE COMPONENTS OF A COMPUTER TO SELECT THE APPROPRIATE MODES OF DATA REPRESENTATION. THE STUDENT WILL BE ABLE TO USE A RELATIONAL DBMS: BASIC TECHNIQUES FOR PROGRAMMING AN APPLICATION; CREATION AND MODIFICATION OF THE STRUCTURE AND PROPERTIES OF TABLES; CORRECT DEFINITION OF DATA TYPES; INSERTION OF DATA IN TABLES; CREATION AND USE OF FORMS AND REPORTS; DATABASE QUERY WITH SQL LANGUAGE. PARTICULAR EMPHASIS IS PLACED ON THE APPLICATION PART, A FUNDAMENTAL ELEMENT OF THE COURSE AND THE FINAL EVALUATION.

THE COURSE OFFERS AN INTRODUCTION TO CONCEPTS ("KNOW") AND FUNDAMENTAL TECHNIQUES ("KNOW-HOW") OF INFORMATION AND COMMUNICATION TECHNOLOGIES (ICT). THE OBJECTIVE IS TO TEACH: TERMINOLOGIES, HARDWARE AND SOFTWARE ARCHITECTURES, MAIN TYPES OF DATA AND THEIR REPRESENTATION, AND THE FUNCTIONING OF MODERN COMPUTERS. SUCH KNOWLEDGE WILL BE USEFUL BOTH FOR CONTINUING STUDIES AND FOR WORK.
STUDENTS WILL BE ABLE TO DISTINGUISH AND EVALUATE THE CAPABILITIES AND PERFORMANCE OF HARDWARE/SOFTWARE COMPONENTS OF A COMPUTER TO SELECT THE APPROPRIATE MODES OF DATA REPRESENTATION. THE STUDENT WILL BE ABLE TO USE A RELATIONAL DBMS: BASIC TECHNIQUES FOR PROGRAMMING AN APPLICATION; CREATION AND MODIFICATION OF THE STRUCTURE AND PROPERTIES OF TABLES; CORRECT DEFINITION OF DATA TYPES; INSERTION OF DATA IN TABLES; CREATION AND USE OF FORMS AND REPORTS; DATABASE QUERY WITH SQL LANGUAGE.
PARTICULAR EMPHASIS IS PLACED ON THE APPLICATION PART, A FUNDAMENTAL ELEMENT OF THE COURSE AND THE FINAL EVALUATION.

	Prerequisites
	NO SPECIFIC PREREQUISITES ARE REQUIRED, EVEN IF KNOWLEDGE OF THE ELEMENTARY TECHNIQUES OF USING A COMPUTER IS RECOMMENDED.

	Contents
	THE COURSE INCLUDES 36 HOURS OF TEACHING (6 CFU). IN PARTICULAR, 4 CFU (24 HOURS) WILL BE DEDICATED TO THE "THEORETICAL" PART AND 2 CFU (12 HOURS) TO THE EXERCISES. • (4 HOURS) HARDWARE ARCHITECTURE OF A COMPUTER: CPU, RAM, INPUT/OUTPUT DEVICES, GROUND STORAGE DEVICES AND INTERFACES, ADVANCED I/O, BACKUP/RECOVERY, HIERARCHY OF MEMORIES. • (4 HOURS) ANALOG/DIGITAL DICHOTOMY AND BINARY CODING OF INFORMATION - BINARY REPRESENTATION OF TEXTS AND NUMBERS, TRANSFORMATIONS FROM DECIMAL BASE TO BINARY AND VICE VERSA, DIGITIZATION OF MULTIMEDIA DATA. • (2 HOURS) BASIC CONCEPTS OF THE OPERATING SYSTEMS (BASIC FUNCTIONALITY, CATEGORIES AND MULTIPROGRAMMING SYSTEMS, FILE SYSTEM, UTILITIES). • (8 HOURS) INTRODUCTION TO COMPUTATIONAL THINKING, EXAMPLES OF ALGORITHM. BASIC CONSTRUCTIONS OF AN ALGORITHM AND THEIR REPRESENTATION BY FLOW-CHART. BASICS OF FORMAL PROGRAMMING LANGUAGE (DIFFERENCE BETWEEN SYNTACTIC AND LOGICAL ERRORS). INTRODUCTION TO PYTHON. • (6 HOURS) INTRODUCTION TO THE ORGANIZATION OF DATA THROUGH DATABASE AND RELATIONAL DBMS: INFORMATION SYSTEMS, INFORMATION AND DATA, RELATIONAL MODEL, INTEGRITY AND KEY CONSTRAINTS, ELEMENTARY QUESTIONS IN QBE AND SQL. • (12 HOURS) EXERCICES IN SQL LANGUAGE, FLOW CHARTS, AND BASIC PROGRAMMING IN PYTHON.

Contents

THE COURSE INCLUDES 36 HOURS OF TEACHING (6 CFU). IN PARTICULAR, 4 CFU (24 HOURS) WILL BE DEDICATED TO THE "THEORETICAL" PART AND 2 CFU (12 HOURS) TO THE EXERCISES.
• (4 HOURS) HARDWARE ARCHITECTURE OF A COMPUTER: CPU, RAM, INPUT/OUTPUT DEVICES, GROUND STORAGE DEVICES AND INTERFACES, ADVANCED I/O, BACKUP/RECOVERY, HIERARCHY OF MEMORIES.
• (4 HOURS) ANALOG/DIGITAL DICHOTOMY AND BINARY CODING OF INFORMATION - BINARY REPRESENTATION OF TEXTS AND NUMBERS, TRANSFORMATIONS FROM DECIMAL BASE TO BINARY AND VICE VERSA, DIGITIZATION OF MULTIMEDIA DATA.
• (2 HOURS) BASIC CONCEPTS OF THE OPERATING SYSTEMS (BASIC FUNCTIONALITY, CATEGORIES AND MULTIPROGRAMMING SYSTEMS, FILE SYSTEM, UTILITIES).
• (8 HOURS) INTRODUCTION TO COMPUTATIONAL THINKING, EXAMPLES OF ALGORITHM. BASIC CONSTRUCTIONS OF AN ALGORITHM AND THEIR REPRESENTATION BY FLOW-CHART. BASICS OF FORMAL PROGRAMMING LANGUAGE (DIFFERENCE BETWEEN SYNTACTIC AND LOGICAL ERRORS). INTRODUCTION TO PYTHON.
• (6 HOURS) INTRODUCTION TO THE ORGANIZATION OF DATA THROUGH DATABASE AND RELATIONAL DBMS: INFORMATION SYSTEMS, INFORMATION AND DATA, RELATIONAL MODEL, INTEGRITY AND KEY CONSTRAINTS, ELEMENTARY QUESTIONS IN QBE AND SQL.
• (12 HOURS) EXERCICES IN SQL LANGUAGE, FLOW CHARTS, AND BASIC PROGRAMMING IN PYTHON.

	Teaching Methods
	THE COURSE INCLUDES 36 HOURS OF TEACHING (6 CFU). IN PARTICULAR, 4 CFU (24 HOURS) WILL BE DEDICATED TO THE "THEORETICAL" PART AND 2 CFU (12 HOURS) TO THE EXERCISES. DURING THE COURSE, THE TEACHER WILL MAKE A WIDE USE OF SLIDES, APPROPRIATELY ACCOMPANIED BY MULTIMEDIA ELEMENTS AND EXAMPLES, GUIDED EXERCISES AND HOMEWORKS. FROM A STRUCTURAL POINT OF VIEW, THE LESSONS WILL CONSIST OF: • LESSONS WITH GUIDED EXERCISES. • HOMEWORKS, WITH CORRECTION DURING NEXT LESSONS. EXAM SIMULATIONS, IN CONDITIONS AND WITH REAL EXAM TESTS.

Teaching Methods

THE COURSE INCLUDES 36 HOURS OF TEACHING (6 CFU). IN PARTICULAR, 4 CFU (24 HOURS) WILL BE DEDICATED TO THE "THEORETICAL" PART AND 2 CFU (12 HOURS) TO THE EXERCISES.
DURING THE COURSE, THE TEACHER WILL MAKE A WIDE USE OF SLIDES, APPROPRIATELY ACCOMPANIED BY MULTIMEDIA ELEMENTS AND EXAMPLES, GUIDED EXERCISES AND HOMEWORKS.
FROM A STRUCTURAL POINT OF VIEW, THE LESSONS WILL CONSIST OF:
• LESSONS WITH GUIDED EXERCISES.
• HOMEWORKS, WITH CORRECTION DURING NEXT LESSONS.
EXAM SIMULATIONS, IN CONDITIONS AND WITH REAL EXAM TESTS.

	Verification of learning
	THE EXAM WILL CONSIST OF A WRITTEN TEST ON THE DAY AND TIME SET FOR THE EXAM. IN THE PRESENCE OF HIGH NUMBERS, THE STUDENTS WILL BE DIVIDED INTO GROUPS. THE EXAM IS DIVIDED INTO TWO PARTS: ONE "THEORETICAL" AND ONE "PRACTICAL". THE EXAM WILL CONCLUDE WITH A POSSIBLE ADDITIONAL INTERVIEW THAT MAY MODIFY, IN NEGATIVE OR POSITIVE, THE EXAM OUTCOME.

	Texts
	• CURTIN, FOLEY, SEN, MORIN, MARENGO, PAGANO "INFORMATICA DI BASE – VII EDIZIONE“ - MC GRAW HILL • KENNETH A. LAMBERT, “PROGRAMMAZIONE IN PYTHON”, APOGEO EDUCATION - MAGGIOLI EDITORE, II EDIZIONE (2018)