FOUNDATIONS OF COMPUTER SCIENCE

Ingegneria Elettronica FOUNDATIONS OF COMPUTER SCIENCE

0612400005
DIPARTIMENTO DI INGEGNERIA INDUSTRIALE
EQF6
ELECTRONIC ENGINEERING
2022/2023

OBBLIGATORIO
YEAR OF COURSE 1
YEAR OF DIDACTIC SYSTEM 2018
AUTUMN SEMESTER
CFUHOURSACTIVITY
990LESSONS
ExamDate
FONDAMENTI DI INFORMATICA10/02/2023 - 09:00
FONDAMENTI DI INFORMATICA10/02/2023 - 09:00
Objectives
THE MAIN AIM OF THE COURSE IS TO INTRODUCE THE BASIC PRINCIPLES OF COMPUTER SCIENCE BY CONTEXTUALIZING THEM FROM BOTH ARCHITECTURAL AND SOFTWARE PERSPECTIVES.

STUDENTS IN THE COURSE WILL MATURATE BASIC KNOWLEDGE ABOUT THE MAIN ARCHITECTURAL MODELS OF ELECTRONIC CALCULATORS, THEIR STRUCTURE, AND THEIR GENERAL PRINCIPLES OF OPERATION. THE PRINCIPLES AND METHODOLOGIES UNDERLYING THE DESIGN AND SYNTHESIS OF COMBINATORY MACHINES WILL BE INTRODUCED. FOR THIS PURPOSE, SOFTWARE SIMULATORS WILL BE USED IN ORDER TO ENABLE THE SYNTHESIS OF SIMPLE COMBINATORIAL MACHINES. LEARNERS WILL ALSO ACQUIRE SKILLS SUCH AS TO ENABLE THEM TO DESIGN AND IMPLEMENT ALGORITHMS TO BE THEN IMPLEMENTED THROUGH THE USE OF THE C LANGUAGE. THIS LANGUAGE, WHICH STUDENTS WILL USE IN COURSES IN SUBSEQUENT YEARS, WILL ENABLE THEM TO BETTER UNDERSTAND THE CLOSE RELATIONSHIP BETWEEN THE HARDWARE AND SOFTWARE COMPONENTS OF AN ELECTRONIC COMPUTER. THE COURSE WILL END WITH THE INTRODUCTION OF A LOW-LEVEL PROGRAMMING LANGUAGE, MIPS ASSEMBLY, TO BETTER ILLUSTRATE THE PECULIARITIES OF MACHINE-LEVEL PROGRAMMING.
Prerequisites
SINCE THIS IS THE FIRST COMPUTER SCIENCE COURSE IN THE STUDENTS' COURSE OF STUDY, NO ENTRANCE PREREQUISITE IS PROVIDED.
Contents
THE ARTICULATION OF THE COURSE IS THE FOLLOWING

- INTRODUCTION TO THE CONCEPT OF INFORMATION (2 HOURS OF THEORETICAL LESSONS)
- ANALOGUE AND DIGITAL INFORMATION (2 HOURS OF THEORETICAL LESSONS)
- INFORMATION MANAGEMENT AND DIGITAL REPRESENTATION (2 HOURS OF THEORETICAL LESSONS - 4 HOURS OF ASSISTED TRAINING)
- INFORMATION PROCESSING SYSTEMS (2 HOURS OF THEORETICAL LESSONS)
- BASIC PRINCIPLES OF BOOLEAN ALGEBRA (4 HOURS OF THEORETICAL LESSONS - 4 HOURS OF ASSISTED TRAINING - 6 HOURS OF LABORATORY ACTIVITY)
- COMBINATORY MACHINES: DESIGN AND SYNTHESIS (4 HOURS OF THEORETICAL LESSONS - 4 HOURS OF ASSISTED TRAINING- 6 HOURS OF LABORATORY ACTIVITY)
- THE CONCEPT OF ALGORITHM AND METHODOLOGIES FOR THEIR DESIGN (4 HOURS OF THEORETICAL LESSONS - 6 HOURS OF ASSISTED TRAINING - 6 HOURS OF LABORATORY ACTIVITY)
- PROGRAMMING LANGUAGES (2 HOURS OF THEORETICAL LESSONS)
- LANGUAGE C AND ITS MAIN FUNCTIONAL CHARACTERISTICS (4 HOURS OF THEORETICAL LESSONS - 6 HOURS OF ASSISTED TRAINING - 6 HOURS OF LABORATORY ACTIVITY)
- DESIGN AND IMPLEMENTATION OF ALGORITHMS IN LANGUAGE C (4 HOURS OF THEORETICAL - 3 HOURS OF ASSISTED TRAINING - 3 HOURS OF LABORATORY ACTIVITY)
- MIPS ASSEMBLY (2 HOURS OF THEORETICAL - 2 HOURS OF ASSISTED TRAINING - 2 HOURS OF LABORATORY ACTIVITY)
Teaching Methods
THE COURSE IS SO ORGANIZED:

THEORETICAL LESSONS: 32 HOURS

ASSISTED EXERCISES: 29 HOURS

DURING THE ASSISTED EXERCISES STUDENTS WILL DEVELOP, INDEPENDENTLY OR IN SMALL GROUPS, EXERCISES ON THE THEORETICAL TOPICS PREVIOUSLY INTRODUCED.

LABORATORY ACTIVITIES: 29 HOURS.

DURING THE LABORATORY ACTIVITIES STUDENTS WILL DEVELOP, THROUGH A PROBLEM SOLVING APPROACH, EXERCISES OR PROJECT WORKS
Verification of learning
THE REACHING OF THE TRAINING OBJECTIVES SET BY THE TEACHING DEPARTMENT IS CERTIFIED BY THE PASSING OF AN EXAMINATION WITH EVALUATION EXPRESSED IN THIRTY (THE MINIMUM LEVEL TO BE ACQUIRED FOR PASSING CORRESPONDS TO "18" AND THE MAXIMUM LEVEL TO "30 AND HONOR"). THE EXAMINATION PROVIDES A WRITTEN TEST OF INDICATIVE DURATION OF TWO HOURS AND AN ORAL TEST, OF INDICATIVE AVERAGE DURATION OF 30 MINUTES.
BOTH TESTS ARE AIMED AT:

1) TO CHECK THE LEARNING OF THE TOPICS COVERED IN THEORETICAL LESSONS;
2) VERIFY THE ABILITY TO EXPOUND ON THE TOPICS COVERED;
3) TO VERIFY THE AUTONOMY OF JUDGMENT IN PROPOSING 'THE MOST APPROPRIATE APPROACH TO ARGUE WHAT IS REQUIRED.
4) TO ASCERTAIN THE STUDENT'S ABILITY TO IDENTIFY STRATEGIES FOR SOLVING COMPLEX PROBLEMS
5) TO ASCERTAIN THE LEARNER'S ABILITY TO TRANSFORM WHAT WAS DESIGNED INTO SOFTWARE ARTIFACTS

IN MORE DETAIL, THE ORAL TEST WILL INVOLVE THREE QUESTIONS: THE FIRST CONCERNING THE WRITTEN TEST AND ITS SOLUTION STRATEGY (ALGORITHM IDENTIFIED,
PROPOSED IMPLEMENTATION, EFFICIENCY OF THE PROPOSED SOLVING SOLUTION, DESIGN OF COMBINATORIAL MACHINES AND THEIR SYNTHESIS), THE SECOND AND THIRD WILL COVER THE TOPICS
COVERED DURING THE LECTURES (EXAMPLE: ARCHITECTURE OF ELECTRONIC COMPUTERS, COMBINATORIAL MACHINES, C LANGUAGE, AND ITS FEATURES).

IN ORDER TO PASS THE EXAM, IT IS NECESSARY TO ACHIEVE SUFFICIENCY IN BOTH THE TEST OF LEARNING OF THE TOPICS COVERED IN THE THEORY HOURS AND THE WRITTEN TEST.

THE STUDENT ACHIEVES THE LEVEL OF EXCELLENCE IF HE/SHE DEMONSTRATES THE ABILITY TO MAKE CONNECTIONS BETWEEN THE THEORETICAL TOPICS COVERED AND DEMONSTRATES FULL MASTERY OF THE ACTIVITIES CARRIED OUT FOR THE DEVELOPMENT OF THE WRITTEN TEST.
Texts
IL LINGUAGGIO C. FONDAMENTI E TECNICHE DI PROGRAMMAZIONE. EDIZ. MYLAB. DI PAUL J. DEITEL (AUTORE), HARVEY M. DEITEL (AUTORE), G. MASELLI (TRADUTTORE) - PEARSON

LINGUAGGIO C DI ALESSANDRO BELLINI (AUTORE) ANDREA GUIDI (AUTORE)
MCGRAW-HILL EDUCATION

BRIAN W. KERNIGHAN, DENNIS M. RITCHIE - IL LINGUAGGIO C. PRINCIPI DI PROGRAMMAZIONE E MANUALE DI RIFERIMENTO - PEARSON PRENTICE HALL

LUCIDI E APPUNTI FORNITI DAL DOCENTE
More Information
LANGUAGE: ITALIAN
  BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2023-01-23]