# Computer science | MATHEMATICAL METHODS FOR COMPUTER SCIENCE

## Computer science MATHEMATICAL METHODS FOR COMPUTER SCIENCE

 0512100041 COMPUTER SCIENCE EQF6 COMPUTER SCIENCE 2022/2023

 OBBLIGATORIO YEAR OF COURSE 1 YEAR OF DIDACTIC SYSTEM 2017 SPRING SEMESTER
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 AND UNDERSTANDING
THE STUDENT MUST HAVE KNOWLEDGE OF:
1.SIMPLE LOGIC TOOLS, PARTICULARLY KNOWLEDGE OF PROPOSITIONAL LOGIC AND PREDICATE CALCULUS
2.THE MATHEMATICAL REASONING THAT IS THE BASIS OF THE MOST COMMON PROOF METHODS AND STRATEGY, NAMELY PROOFS BY CONTRADICTION, PROOFS BY CONTRAPOSITION, EXHAUSTIVE PROOFS AND PROOFS BY CASES
3.THE CONCEPTS OF INDUCTION, RECURSION, AND STRUCTURAL INDUCTION

APPLYING KNOWLEDGE AND UNDERSTANDING
THE STUDENT MUST BE ABLE TO:
1.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
2.DEMONSTRATE SIMPLE STATEMENTS ON SETS AND NUMBERS, BY APPLYING THE MOST COMMON PROOF METHODS AND STRATEGY, LISTED IN THE PREVIOUS PARAGRAPH
3.USE INDUCTION, RECURSION, AND STRUCTURAL INDUCTION
Prerequisites
THE STUDENT SHOULD HAVE KNOWLEDGE OF MATHEMATICS AND LANGUAGE PROFICIENCY AT HIGH SCHOOL LEVEL.
Contents
48 HOURS FOR CLASSES
24 HOURS FOR LABORATORY

1.INTRODUCTION OF THE ORGANIZATION, THE DATA STRUCTURES AND THE OPERATIONS OF A MODERN OPERATING SYSTEM. PROCESS MANAGEMENT AND MEMORY (2 HOURS OF LECTURES).
2.BASIC ELEMENTS OF THE LINUX OPERATING SYSTEM: INSTALLATION AND ELEMENTS OF A FIRST INTRODUCTION TO BASH (4 HOURS OF LABORATORY).
3.STRUCTURE OF OPERATING SYSTEMS: SERVICES, USER INTERFACE, SYSTEM CALLS, TYPES OF CALLS AND SYSTEM PROGRAMS (2 HOURS OF LECTURES).
4.FILE SYSTEM INTERFACE: THE CONCEPT OF FILE ACCESS METHODS, DIRECTORY STRUCTURE, MOUNTING A FILE SYSTEM BLOCK ALLOCATION METHOD, MANAGEMENT OF FREE SPACE (8 HOURS OF LECTURES).
5.IMPLEMENTATION OF FILE SYSTEM: STRUCTURES OF A FS, FS AND DIRECTORIES (8 HOURS OF LECTURES).
6.I/O FILES: FILE DESCRIPTOR, STANDARD FILE OPERATIONS ON FILES, FILE TABLE, FILE SHARING, ATOMIC OPERATIONS, I/O BUFFER (4 HOURS OF LABORATORY).
7.FILES AND DIRECTORIES: FILE TYPES, STAT STRUCTURE, REAL AND EFFECTIVE USER ID, ACCESS PERMISSIONS, LINKS (6 HOURS OF LABORATORY).
8.PROCESSES: CONCEPT, SCHEDULING, OPERATIONS ON PROCESSES, PID, FORK, WAIT, EXIT, ENVIRONMENT, AND ENVIRONMENT VARIABLES, FILE SHARING, EXEC (4 HOURS OF LECTURES + 4 HOURS OF LABORATORY).
9.SCHEDULING: BASIC CONCEPTS, CRITERIA, SCHEDULING ALGORITHMS, AND EXAMPLES (4 HOURS OF LECTURES).
10.INTERPROCESS COMMUNICATION: UNIX PIPE (4 HOURS OF LABORATORY).
12.PROCESS SYNCHRONIZATION: THE PROBLEM OF CRITICAL REGION, SEMAPHORES, HARDWARE PRIMITIVES (6 HOURS OF LECTURES).
13.MEMORY MANAGEMENT: BACKGROUND, SWAPPING, CONTIGUOUS ALLOCATION, PAGING, AND PAGE TABLE STRUCTURE (8 HOURS OF LECTURES).
14.VIRTUAL MEMORY: BACKGROUND, DEMAND PAGING, COPY ON WRITE, PAGE REPLACEMENT, FRAME ALLOCATION AND THRASHING (4 HOURS OF LECTURES).
15.SIGNALS: CONCEPT, TYPES AND USE THE SIGNALS (2 HOURS OF LABORATORY).
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.
THE EVALUATION CRITERIA INCLUDE THE COMPLETENESS AND CORRECTNESS OF THE LEARNING AND THE CLARITY OF THE PRESENTATION.
THE MINIMUM GRADE (18) IS ASSIGNED WHEN THE STUDENT HAS A LIMITED KNOWLEDGE OF THE STUDIED LOGIC TOOLS, OF THE CONCEPTS OF INDUCTION, RECURSION, STRUCTURAL INDUCTION AND SHOWS UNCERTAINTIES IN THE APPLICATION OF THE STUDIED METHODS.
THE MAXIMUM GRADE (30) IS ASSIGNED WHEN THE STUDENT SHOWS A COMPLETE AND IN-DEPTH KNOWLEDGE OF THE ABOVE MENTIONED CONCEPTS AND OF THE STUDIED METHODS. IT IS ALSO ABLE TO SOLVE THE PROPOSED PROBLEMS GIVING EFFICIENT AND ACCURATE SOLUTIONS AND SHOWS THE ABILITY TO LINK DIFFERENT CONCEPTS TOGETHER.
''LODE'' IS GIVEN WHEN THE CANDIDATE DEMONSTRATES SIGNIFICANT MASTERY OF THE THEORETICAL AND OPERATIONAL CONTENT AND SHOWS THAT SHE/HE IS ABLE TO PRESENT THE TOPICS WITH OWNERSHIP OF LANGUAGE AND AUTONOMOUS PROCESSING SKILLS.
Texts
KENNETH D. ROSEN, DISCRETE MATHEMATICS AND ITS APPLICATIONS, SEVENTH EDITION, MCGRAW-HILL, 2012