Welcome to Moodle's page of Big Data Computing 2022-23!
Class ScheduleMonday from 2:00 p.m. to 5:00 p.m.Tuesday from 8:00 a.m. to 10:00 a.m.
Course website: Click here
Description and GoalsThe amount, variety, and rate at which data is
More InfoClass ScheduleMonday from 2:00 p.m. to 5:00 p.m.Tuesday from 8:00 a.m. to 10:00 a.m.
Course website: Click here
Description and GoalsThe amount, variety, and rate at which data is
Welcome to Moodle's page of Big Data Computing 2021-22!
Class Schedule Tuesday from 5:00 p.m. to 7:00 p.m.Wednesday from 8:00 a.m. to 11:00 a.m.
How to Attend Classes According to the guidelines provided by
More InfoClass Schedule Tuesday from 5:00 p.m. to 7:00 p.m.Wednesday from 8:00 a.m. to 11:00 a.m.
How to Attend Classes According to the guidelines provided by
Syllabus
1. Basic on Complexity Classes
1.1 Theoretical models of computations and time and space resources
1.2 Time and space complexity classes
1.3 The P = NP problem
1.4 NP and NP-completeness
1
More Info1. Basic on Complexity Classes
1.1 Theoretical models of computations and time and space resources
1.2 Time and space complexity classes
1.3 The P = NP problem
1.4 NP and NP-completeness
1
DESCRIPTIONTheory and practice of software security, focusing in particular on some common software security risks, including buffer overflows, race conditions and random number generation, and on the identification of potential threats and vulnerabi
More InfoObiettivi formativi Il corso ha i seguenti argomenti principali:- Un'introduzione alla meccanica quantistica.- Un'introduzione al calcolo quantistico e alle prospettive di realizzazione.- Descrizione di alcuni Qbit in corso di sviluppo.- Esempi
More Info DESCRIPTION
Theory and practice
of software security, focusing in particular on some common software
security
risks, including buffer overflows, race conditions and random number
generation, and on the identification of potential threats
More Info
Basic Complexity Classes
NP and NP-completeness
Diagonalization
Space Complexity
Boolean Circuits
Polynomial Hierarchy
Barriers Results
Intro To Proof Complexity
- Theoretical model of resource running time
- Theoretical model of
More Info- Theoretical model of
The course will be about various methods of teaching computer scence using different methods
More InfoWelcome to the Moodle's page of Big Data Computing 2020-21!
Class ScheduleTuesday from 5:00PM to 7:00PMWednesday from 4:00PM to 7:00PM
How to Attend ClassesAccording to the guidelines provided by Sapienza University to contrast the COVID-19 p
More InfoClass ScheduleTuesday from 5:00PM to 7:00PMWednesday from 4:00PM to 7:00PM
How to Attend ClassesAccording to the guidelines provided by Sapienza University to contrast the COVID-19 p
DESCRIPTION
Theory and practice of software security, focusing in particular on
some common software security risks, including buffer overflows, race
conditions and random number generation, and on the identification of
potential threats and
More InfoSyllabus
1. Basic on Complexity Classes
1.1 Theoretical models of computations and time and space resources
1.2 Time and space complexity classes
1.3 The P = NP problem
1.4 NP and NP-completeness
1
More Info1. Basic on Complexity Classes
1.1 Theoretical models of computations and time and space resources
1.2 Time and space complexity classes
1.3 The P = NP problem
1.4 NP and NP-completeness
1
Intelligent Systems (ISs) are systems with the capability to sense the environment and react to it in order to attain given goals. Typically, intelligent systems have two main components: one focusing on learning the environment behavior on the basis
More InfoWelcome to the Moodle's page of Big Data Computing 2019-20!
Class Schedule
- Tuesday from 8:00AM to 10:00AM (Room Alfa, Via Salaria 113)
- Wednesday from 3:00PM to 6:00PM (Room Alfa, Via Salaria 113) &nbs
More Info- Tuesday from 8:00AM to 10:00AM (Room Alfa, Via Salaria 113)
- Wednesday from 3:00PM to 6:00PM (Room Alfa, Via Salaria 113) &nbs
Syllabus
1. Basic on Complexity Classes
1.1 Theoretical models of computations and time and space resources
1.2 Time and space complexity classes
1.3 The P = NP problem
1.4 NP and NP-completeness
1
More Info1. Basic on Complexity Classes
1.1 Theoretical models of computations and time and space resources
1.2 Time and space complexity classes
1.3 The P = NP problem
1.4 NP and NP-completeness
1
This is the Modelling Practices unit of the course in Formal Methods in Software Development AY 2017/18. This unit addresses the use of formal methods for mathematical modelling of dynamical systems and for specification of logic properties invo
More InfoGeneral objectives
Information systems course analyses types of info systems and how they can contribute to firm’s business objectives success; the course allows to understand approaches and models to evaluate quality of ICT process , software and
More Info DESCRIPTION
Theory and practice of software security, focusing in particular on some common software security risks, including buffer overflows, race conditions and random number generation, and on the identification of potential threats and vuln
More Info