|Kursusnavn (dansk):||IT-matematik |
|Kursusnavn (engelsk):||IT Mathematics |
|Semester:||Forår 2003 |
|Udbydes under:||cand.it., internet- og softwareteknologi (int) |
|Omfang i ECTS:||7,50 |
|Min. antal deltagere:||0 |
|Forventet antal deltagere:||21 |
|Maks. antal deltagere:||61 |
|Formelle forudsætninger:||Curiousity and interest in being precise |
|Læringsmål:||The goal of the course is to introduce the students to basic discrete mathematics relevant to IT and computer science.|
After the course the student should be able to:
- fear neither sets nor functions nor relations
- establish facts by induction;
- count numerous objects;
- abandon the decimal system;
- address real-world problems via graphical models;
- quantitatively evaluate the likelihood of various events;
- construct finite-state machines;
- recognize and perform mathematical proofs.
|Fagligt indhold:||A solid footing in basic math is highly advisable for both aspiring computer scientists and practitioners.|
As we move through the world of limited resources and (almost) no second chances, it often pays to see a few steps ahead and to be able to calculate in advance your response to whatever fate may toss your way.
Whether it is stars, money, sheep, time, or angels that you count, whether it is unfounded recursions, flawed business models, or invaded privacy that you seek to avoid,
the present time demands probing insight as well as a healthy amount of rigour.
The carp of truth captured in the nets of mathematically informed reason is more than adequate reward
for the reasonable investment of effort required for this course.
This course offers among other topics:
- pigeons and pigeonholes;
- binomial coefficients;
- discrete probability;
- an asymptotic perspective on the behaviour of functions;
- trees and forests;
- mastery of propositional and quantified logic.
|Eksamensform og -beskrivelse:||X. experimental examination form (7-scale; external exam), 13-skala, Ekstern censur|
|Litteratur udover forskningsartikler:||S.Washburn, T. Marlowe, C.T. Ryan|
Discrete Mathematics. Addison-Wesley 2000.