Bedër Information System

Java: Tema
1: Elements of mathematical logics: Propositional logics and connectives. Propositional Equivalences. Applications of propositional logics.
2: Predicates and quantifiers. Rules of Interference. Proof methods and strategy.
3: Sets. Sequences and recurrence relations.
4: Number Theory: Divisibility and modular arithmetic. Prime numbers, greatest common divisor and least common multiple.The Euclidian Algorithm and Bezout identity.
5: Solving congruences. Applications of congruences.
6: Mathematical induction, strong induction and well-ordering.
7: Recursive definitions and structural induction. Recursive algorithms.
8: Midterm exam
9: Counting, the basic of counting. The Pigeonhole principle. Permutations and combinations. Binomial coefficients and identities.
10: Advanced counting techniques. Applications of recurrence relations. Solving linear recurrence relations.
11: Relations and their properties. Representing relations. Equivalence relations, partial orderings.
12: Introduction to graph theory. Graphs models. Special types of graphs
13: Representing graphs and graphs isomorphism. Connectivity. Euler and Hamilton paths.
14: Shortest path problems. Planar graphs and graph coloring.
15: Trees and their applications.
16: Final Exam

1: Theoretical and practical training, sufficient for a successful and skillful profession of basic scientific knowledge in student practice.
2: Skills and professional training in description, formulation, modeling and problem analysis, with consideration for appropriate analytical solutions in all necessary situations.
3: Required techincal, academic and practical knowledge and confidence design and evaluation of mechanical systems with consideration for productivity, feasibility, and social and environmental aspects.
4: Ability to design and run experiments, gather data, analyze and draw conclusions

Matematikë Diskrete