IT-Universitetet i København
 
  Tilbage Kursusoversigt
Kursusbeskrivelse
Kursusnavn (dansk):Foundations of Computing - Discrete Mathematics 
Kursusnavn (engelsk):Foundations of Computing - Discrete Mathematics 
Semester:Efterår 2013 
Udbydes under:cand.it., softwareudvikling og -teknologi (sdt) 
Omfang i ECTS:7,50 
Kursussprog:Engelsk 
Kursushjemmeside:https://learnit.itu.dk 
Min. antal deltagere:12 
Forventet antal deltagere:45 
Maks. antal deltagere:70 
Formelle forudsætninger:Basic mathematics. Ability to program computer programs using
conditions, loops, arrays, methods/procedures/functions, and simple
recursion.


Information about the course of study
This course is mandatory for students who are enrolled on This course is mandatory for students who are enrolled on on the Master of Science in IT, study programme Software Development and Technology, Development Technology track. 
Læringsmål:After the course the student should be able to:

* Describe and apply formal definitions

* Conduct formal proofs

* Work with regular languages and finite and infinite state machines

* Use models of computation and specification

* Use combinatorial reasoning

* Assess probabilities of events

* Use basic modular arithmetic 
Fagligt indhold:The course is an introduction to discrete mathematics as a foundation to work within the fields of computer science, information technologies, and software development. 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:

* formal reasoning, induction, set theory, relations and functions

* models of computation, such as finite state machines

* basic graph theory, language theory

* combinatorics, probability and number theory

The course aims at providing a basic understanding of the mathematical foundations of computer science.

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

14 weeks of teaching consisting of lectures and exercises

-----
See the schedule here:
link to the time table
-----

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. 

Obligatoriske aktivititer:Der er ingen obligatoriske aktiviteter. Vær venlig KUN at ændre denne tekst når der er obligatoriske aktiviteter./
There are no mandatory activities. Please, change this text ONLY when there are mandatory activities. 
Eksamensform og -beskrivelse:X. experimental examination form (7-scale; external exam), 7-trins-skala, Ekstern censur

The duration of the written examination is 4 hour(s).
Restrictions: students are allowed to bring their notes on paper and a basic calculator, but not the textbook nor any electronic device.  

Litteratur udover forskningsartikler:Course notes.
Kenneth Rosen, Discrete Mathematics and Its Applications, Global Edition, McGraw-Hill Higher Education, 7 edition (1 Sep 2012), ISBN: 978-0071315012 
 
Afholdelse (tid og sted)
Kurset afholdes på følgende tid og sted:
UgedagTidspunktForelæsning/ØvelserStedLokale
Tirsdag 12.00-13.50 Forelæsning ITU 2A14
Torsdag 12.00-13.50 Øvelser ITU 2A14

Eksamen afholdes på følgende tid og sted:
EksamensdatoTidspunktEksamenstypeStedLokale
2014-01-08 9:00-13:00 Skriftlig eksamen ITU Students first names from A to L - room 3A12/3A14
2014-01-08 9:00-13:00 Skriftlig eksamen ITU Students first names from M to Z - room 4A14/4A16