IT-Universitetet i København
 
  Tilbage Kursusoversigt
Kursusbeskrivelse
Kursusnavn (dansk):Grundlæggende strukturer for beregninger - Diskret Matematik 
Kursusnavn (engelsk):Foundations of Computing - Discrete Mathematics 
Semester:Forår 2010 
Udbydes under:cand.it., softwareudvikling og -teknologi (sdt) 
Omfang i ECTS:7,50 
Kursussprog:Engelsk 
Kursushjemmeside:http://www.itu.dk/courses/SGSB/F2010/ 
Min. antal deltagere:12 
Forventet antal deltagere:20 
Maks. antal deltagere:80 
Formelle forudsætninger:Basic ability to program in some imperative programming language (Java, Python, C/C++/C#, etc.), using conditions, loops, arrays, methods/procedures/functions, and simple recursion. This may be obtained by following Object Oriented Programming - Introduction, or Introductory Programming or similar courses.
 
Læringsmål: After the course the student should be able to:

* Comprehend a formal definition and follow a formal proof, including
recursive and inductive concepts

* Express simple concepts in the language of mathematics

* Bound the growth rate of functions using asympotic analysis

* Solve recurrence relations, including divide-and-conquer relations

* Enumerate combinatorial structures, assess probabilities of events,
and compute expectations of random variables

* Model phenomena using discrete structures such as relations, graphs,
logic, or finite-state machines
 
Fagligt indhold:The course is a standard introduction to discrete mathematics, but
with focus on applications in the information technologies. In
particular, the course develops the necessary terminology and
conceptual tools needed for later courses such as Advanced Models and
Programs, Algorithm Design, Database Tuning, Mobile and Distributed
Systems and Efficient AI Programming). This includes,

* the analysis of algorithms, including basic randomised algorithms,

* models of computation, such as logic and automata

* databases, such as relations and functions

* models of networks (technological as well as social), such as graphs

The course emphasises the applicability of these its by describing
these applications, including in the research article. Applications
are expected to vary, but can include Google's PageRank algorithm,
natural language processing, Bayesian spam filters, models for social
networks, or data mining.

Central terms and concepts: Logic, sets and sequences, functions,
sums, induction and recursion, permutations and combinations, discrete
probability, recurrence relations, relations, graphs, trees, boolean
Algebra, finite state machines, grammars. 
Læringsaktiviteter:14 ugers undervisning bestående af forelæsninger og øvelser

14 ugers undervisning bestående af forelæsninger, øvelser og vejledning
This description is under development
Around 14 lectures with exercise classes. Twice a week for the first 5 weeks. A larger project corresponding to half the course. All material will be made available on the Web.

-----------

I intro-ugen (uge 5) er der ændrede kursustidspunkter:
Link til skemaoplysninger

In the intro week (week 5) the course time table is changed:
Link to the time table
--------------

Information om studiestruktur / Information about study structure
Dette kursus er en del af SDTs obligatoriske moduler, som du kan finde beskrevet her: SDT studiestruktur
For at blive cand.it. i SDT skal du bestå SDTs backbonekurser, og desuden gennemføre en 22,5 ECTS specialisering samt to 7,5 ECTS valgfag.

This course is part of the SDT mandatory modules – find them described here:
SDT study structure
In order to graduate as a MSc in SDT, you need to pass the SDT backbone courses, and also take a 22.5 ECTS specialization and two 7.5 ECTS electives.

-----
NB!! Course restriction I!!
Please note that there is a course restriction between this course and the SDT course Modelling and Design.
If you have already taken Modeling and Design you need to register for the course Foundations of Computing - Algorithms and Data Structures.

NB!! Course restriction I!!
Please note that there is a course restriction between this course and the SDT course Foundations of Computing.
 

Eksamensform og -beskrivelse:X. experimental examination form (7-scale; external exam), 7-trins-skala, Ekstern censur

Ekstern censur, 7-trins-skala, A2: Skriftlig eksamen med alle skriftlige og trykte hjælpemidler  

Litteratur udover forskningsartikler:Kenneth Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw Hill, ISBN: 007288008 
 
Afholdelse (tid og sted)
Kurset afholdes på følgende tid og sted:
UgedagTidspunktForelæsning/ØvelserStedLokale
Tirsdag 08.30-10.30 Forelæsning ITU 2A18
Tirsdag 10.45-12.45 Øvelser ITU 2A52
Torsdag 08.30-10.30 Forelæsning ITU 2A18
Torsdag 10.45-12.45 Øvelser ITU 2A52

Eksamen afholdes på følgende tid og sted:
EksamensdatoTidspunktEksamenstypeStedLokale
2010-05-31 9:00 - 11:30 Skriftlig eksamen ITU 4A16
2010-08-20 Mulig dag for reeksamen /Possible date for re-exam Skriftlig eksamen ITU Eksamensform kan blive ændret / Examination form may be altered
2010-08-23 Mulig dag for reeksamen /Possible date for re-exam Skriftlig eksamen ITU Eksamensform kan blive ændret / Examination form may be altered
2010-08-25 Mulig dag for reeksamen /Possible date for re-exam Skriftlig eksamen ITU Eksamensform kan blive ændret / Examination form may be altered