Mathematical Methods of Information Technology
Module Number: EI5035
Duration: 1 Semester
Occurence: Winter Semester
Number of ECTS: 6
Professor in charge: Ulf Schlichtmann
Amount of work
Contact hours: 60
Self-study hours: 120
Description of achievement and assessment methods
Exam tpye: written
Exam duration (min.): 90
Possibility of retaking: In the next semester: YesAt the end of the semester: No
Written paper: No
Propositional Logic (Boolean Algebra): Propositions, Laws of propositional logic, binary decision diagrams; Predicate Logic: laws of predicate logic, Deduction, Induction; Sets: representation forms, set relations, boolean algebra of sets; Relations: closures, order relations, equivalence relations, binary graphs; Finite State Machines
At the end of the module students are capable of employing fundamentals of discrete mathematics to design digital systems (circuits as well as more complex systems such as e.g. communication networks or IT-systems). Students are also capable of performing proofs using deduction method, equivalence transformations and resolution method. Student are also familiar with formal descriptions for technical problems and how to employ them e.g. in simulation, synthesis as well as in everyday problems.
Teaching and learning methods
- Learning method: In addition to the individual methods of the students consolidated knowledge is acquired by exemplary solutions to exercises and plentiful examples in the lectures.
- Teaching method: During the lectures students are instructed in a teacher-centered style. The exercises are held in a teacher-centered way, but with plenty of potential for interaction. The lecturer also welcomes discussions.
The following kinds of media are used: Blackboard presentations; Comprehensive collection of formulas and algorithms; Catalog of exercises with solutions
- D.F. Stanat, D.F. McAllister: Discrete Mathematics in Computer Science, Prentice-Hall, Englewood Cliffs, N.J., 1986