Discrete Mathematics
About
The course treats areas of mathematics with a combinatorial character, which are important for mathematical schooling in general and applications in computer science in particular. You will learn about combinatorial concepts such as permutations, combinations, partitions, Stirling numbers, and 鈥漛alls in bins鈥. The course also includes recursive formulas, generating functions, graph theory and elementary algorithms.
Prerequisites and selection
Entry requirements
Knowledge equivalent to 60 credits in mathematics.
Selection
All eligible applicants who have applied before the deadline will be granted a place.
Facilities
Mathematical 91探花s is a joint department of Chalmers/University 91探花. Your education takes place in the spacious and bright premises of Mathematical 91探花s at the Chalmers campus Johanneberg, where there are lecture halls, computer rooms and group rooms. Here you can also find student lunch room and reading room, as well as student counsellors and student office.
