Master's Degree in Computer Science

		Study programme 2017-2018	Français
		Faculty of Science
		Master's Degree in Computer Science (Mons)

Hide 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
			S-INFO-029 Software Evolution
		US-M1-INFO60-002-M Approximation Algorithms		30	15	0	0	0	45	Q2	4	4
			S-INFO-021 Approximation Algorithms
		US-M1-INFO60-003-M Algorithms and Bioinformatics		15	0	30	0	0	45	Q1	4	4
			S-INFO-022 Algorithms and Bioinformatics
		US-M1-INFO60-004-M Computability and Complexity		30	30	0	0	0	60	Q1	6	6
			S-INFO-023 Computability and Complexity
		US-M1-INFO60-005-M Datawarehousing and Datamining		30	0	30	0	0	60	Q2	6	6
			S-INFO-027 Datawarehousing and Datamining
			S-INFO-888 Datawarehousing and Datamining: Practical Work
		US-M1-INFO60-006-M High performance and cloud computing		18	18	12	0	0	48	Q1	3	3
			I-INFO-009 High performance and cloud computing
		US-M1-INFO60-007-M Management I		30	15	0	0	0	45	Q1	3	3
			W-EGEE-001 Management 1
		US-M1-INFO60-008-M Networks II		30	30	0	0	0	60	Q1	6	6
			S-INFO-028 Networks II
		US-M1-INFO60-009-M Cryptography and Computer Security		30	0	15	0	0	45	Q1	3	3
			S-INFO-026 Cryptography and Computer Security
		US-M1-INFO60-010-M Master Thesis		0	0	0	0	0	0	Y	15	15
			S-INFO-066 Master Thesis


	Options										4



	Extra Courses										0

		US-M1-INFO60-011-M Databases I		30	25	0	0	0	55	Q1	5	5
			S-INFO-005 Databases I
			S-INFO-101 Databases I (part B)
		US-M1-INFO60-012-M Databases II		30	30	0	0	0	60	Q2	6	6
			S-INFO-011 Databases II
		US-M1-INFO60-013-M Software Engineering		30	0	30	0	0	60	Q1	6	6
			S-INFO-013 Software Engineering
		US-M1-INFO60-014-M Optimisation		14	14	0	0	0	28	Q1	4	4
			I-MARO-035 Linear Optimization
		US-M1-INFO60-015-M Artificial Intelligence		30	15	0	0	0	45	Q2	5	5
			S-INFO-014 Artificial Intelligence
		US-M1-INFO60-016-M Graphs and Combinatorial Optimisation		36	12	0	0	0	48	Q1	5	5
			I-MARO-011 Graph Theory and Combinatorial Optimization
		US-M1-INFO60-017-M Software Engineering Project		15	0	45	0	0	60	Y	6	6
			S-INFO-015 Software Engineering Project
		US-M1-INFO60-018-M Networks I		30	30	0	0	0	60	Q2	7	7
			S-INFO-008 Networks I
		US-M1-INFO60-019-M Data Structures II		30	0	30	0	0	60	Q1,Y	6	6
			S-INFO-020 Data Structures II
			S-INFO-820 Data Structures II Project
		US-M1-INFO60-020-M Elementary Mathematics		15	57	0	0	30	102	Q1	4	4
			S-MATH-700 Elementary Mathematics Tutorials
			S-MATH-701 Exercises in Elementary Mathematics
			S-MATH-702 Elementary Mathematics - Continuous Assessment
		US-M1-INFO60-021-M Mathematics for Computer Science I		20	40	0	0	0	60	Q1	6	6
			S-INFO-601 Mathematics for Computer Science I



											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.

More information on Higher Education Structure (’Paysage’ Decree)

Date de génération : 16/05/2018

20, place du Parc, B7000 Mons - Belgique
Tél: +32 (0)65 373111
Courriel: info.mons@umons.ac.be