| Kursusnavn (dansk): | IT-matematik |
| Kursusnavn (engelsk): | IT-mathematics |
| Semester: | Efterår 2002 |
| Udbydes under: | cand.it., internet- og softwareteknologi (int) |
| Omfang i ECTS: | 7,50 |
| Kursussprog: | Engelsk |
| Kursushjemmeside: | https://learnit.itu.dk |
| 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 provide a solid footing in basic mathematics as used in IT and computer science.
After the course the student will be able to:
- recognize and perform mathematical proofs
- fear neither sets nor functions nor relations
- establish facts by induction and define functions by recursion
- compose permutations
- address real-world problems via graphical models
- calculate in residue rings
- quantitatively evaluate the likelihood of various events
- construct and analyze finite-state machines
- apply counting techniques
|
| 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 impeccable 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:
- mastery of propositional and quantified logic;
- an asymptotic perspective on the behaviour of functions;
- modular arithmetic;
- probability, most likely discrete;
- trees and forests;
- transpositions and other permutations.
|
| Læringsaktiviteter: | |
| Eksamensform og -beskrivelse: | X. experimental examination form (7-scale; external exam), 13-skala, Ekstern censur Written exam (four hours). 13-scale. The course material will be available at the exam.
External censor.
|
| Litteratur udover forskningsartikler: | R.Johnsonbaugh. Discrete Mathematics. 5th ed. Prentice-Hall 2001 |
| | |
Kursusoversigt