 | Study programme 2017-2018 | Français | |
 | Faculty of Science | ||
| Master's Degree in Computer Science (Mons) |
| Show AAs | |||||||||||||||||
| Bloc 1 | Hours (*) | Term | Credits | Weight. | |||||||||||||
| HT(*) | HTPE(*) | HTPS(*) | HD(*) | HR(*) | Total | ||||||||||||
| Compulsory Courses | |||||||||||||||||
 US-M1-INFO60-001-M Software Evolution | 30 | 15 | 15 | 0 | 0 | 60 | Q2 | 6 | 6 | ||||||||
| US-M1-INFO60-002-M Approximation Algorithms | 30 | 15 | 0 | 0 | 0 | 45 | Q2 | 4 | 4 | ||||||||
| US-M1-INFO60-003-M Algorithms and Bioinformatics | 15 | 0 | 30 | 0 | 0 | 45 | Q1 | 4 | 4 | ||||||||
| US-M1-INFO60-004-M Computability and Complexity | 30 | 30 | 0 | 0 | 0 | 60 | Q1 | 6 | 6 | ||||||||
| US-M1-INFO60-005-M Datawarehousing and Datamining | 30 | 0 | 30 | 0 | 0 | 60 | Q2 | 6 | 6 | ||||||||
| US-M1-INFO60-006-M High performance and cloud computing | 18 | 18 | 12 | 0 | 0 | 48 | Q1 | 3 | 3 | ||||||||
| US-M1-INFO60-007-M Management I | 30 | 15 | 0 | 0 | 0 | 45 | Q1 | 3 | 3 | ||||||||
| US-M1-INFO60-008-M Networks II | 30 | 30 | 0 | 0 | 0 | 60 | Q1 | 6 | 6 | ||||||||
| US-M1-INFO60-009-M Cryptography and Computer Security | 30 | 0 | 15 | 0 | 0 | 45 | Q1 | 3 | 3 | ||||||||
| US-M1-INFO60-010-M Master Thesis | 0 | 0 | 0 | 0 | 0 | 0 | Y | 15 | 15 | ||||||||
| Options | 4 | ||||||||||||||||
| Extra Courses | 0 | ||||||||||||||||
| US-M1-INFO60-011-M Databases I | 30 | 25 | 0 | 0 | 0 | 55 | Q1 | 5 | 5 | ||||||||
| US-M1-INFO60-012-M Databases II | 30 | 30 | 0 | 0 | 0 | 60 | Q2 | 6 | 6 | ||||||||
| US-M1-INFO60-013-M Software Engineering | 30 | 0 | 30 | 0 | 0 | 60 | Q1 | 6 | 6 | ||||||||
| US-M1-INFO60-014-M Optimisation | 14 | 14 | 0 | 0 | 0 | 28 | Q1 | 4 | 4 | ||||||||
| US-M1-INFO60-015-M Artificial Intelligence | 30 | 15 | 0 | 0 | 0 | 45 | Q2 | 5 | 5 | ||||||||
| US-M1-INFO60-016-M Graphs and Combinatorial Optimisation | 36 | 12 | 0 | 0 | 0 | 48 | Q1 | 5 | 5 | ||||||||
| US-M1-INFO60-017-M Software Engineering Project | 15 | 0 | 45 | 0 | 0 | 60 | Y | 6 | 6 | ||||||||
| US-M1-INFO60-018-M Networks I | 30 | 30 | 0 | 0 | 0 | 60 | Q2 | 7 | 7 | ||||||||
| US-M1-INFO60-019-M Data Structures II | 30 | 0 | 30 | 0 | 0 | 60 | Q1,Y | 6 | 6 | ||||||||
| US-M1-INFO60-020-M Elementary Mathematics | 15 | 57 | 0 | 0 | 30 | 102 | Q1 | 4 | 4 | ||||||||
| US-M1-INFO60-021-M Mathematics for Computer Science I | 20 | 40 | 0 | 0 | 0 | 60 | Q1 | 6 | 6 | ||||||||
| 60 | |||||||||||||||||
(*) HT : Hours of theory - HTPE : Hours of in-class exercices - HTPS : hours of practical work - HD : HMiscellaneous time - HR : Hours of remedial classes. - Per. (Period), Y=Year, Q1=1st term et Q2=2nd term
Please note, the course titles given here are translations of the original titles and are provided in English for information only. In order to know in which language the course will be taught, please refer to the French page. There, the titles provided in French indicate that the course is taught in French and the titles provided in English indicate that the course is taught in English.