5023.13 - Mathematics 2 for Information Technology

5023.13

Mathematics 2 for Information Technology

7.5

Mathematics I for Information Technology; Introduction to Computer Science.

To complete an elementary introduction to discrete mathematics with respect to applications in computer science.

(1) Recap: sets, relations, functions, proofs, basics of combinatorics (2) Logic with focus on propositional logic and extensions into predicate logic (3) Linear homogeneous recurrence relations (4) Graphs and trees including tree search, minimum spanning trees, Euler paths and graph coloring (5) Matrices: in particular the solution of systems of linear equations (6) Computational complexity: in particular big-O notation and complexity classes (7) Elementary computability: in particular Turing machines and the Halting problem (8) Discrete probability: finite sample spaces, conditional probability and independent varianles (9) Miscellaneous: review discussed content

The teaching will be based on in-class lectures. It will be enhanced by in-class problem solving sessions. These will be based on home-solved written assignment solutions. 

The successful student will be able to: Apply sets, relations, functions and in particular matrices and counting techniques to solve elementary problems that are close to discrete mathematics. Use basic mathematical knowledge to solve problems within computer science. Explain some of the fundamental limitations of mathematics and computing. Understand elementary complexity assessments of algorithms.

The students are going to be asked to sit a 4 hour final exam. That exam to 100% determines the student's final grade. It is a precondition of attending the final exam to reasonably work on 7 out of 8 of the weekly assignments.

External

13-

Kolman, Busby, and Ross: Discrete Mathematical Structures, 6th ed., Pearson Education. ISBN13: 978-0132078450

Roland Kaschek