Discrete Mathematics
General
Code: BSC_IT4
Language: English
Delivery: In person
Prerequisites: No formal prerequisites. Basic mathematical skills are recommended.
Workload
- Lectures: 39.0 hours
- Lab: 0.0 hours
- Study: 78.0 hours
- Project: 33.0 hours
Course Content
Logic (propositional and predicate logic)
Proof techniques (direct, contradiction, induction)
Sets, functions, and relations
Combinatorics (counting, permutations, combinations)
Recursion and recurrence relations
Graph theory (graphs, trees, basic traversal)
Introduction to Boolean algebra
Learning Outcomes
Upon successful completion of the course, students will be able to:
Apply propositional and predicate logic
Construct and evaluate mathematical proofs
Analyze sets, functions, and relations
Solve combinatorial problems
Apply recursive definitions and solve recurrence relations
Model and analyze problems using basic graph theory
Skills
Analytical and critical thinking
Problem-solving skills
Logical reasoning and structured thinking
Abstraction and mathematical modeling
Ability to construct and evaluate arguments
Attention to detail and precision
Independent learning and study skills
Application of theoretical knowledge to computational problems
Search for, analysis and synthesis of data and information, with the use of the necessary technology
Adapting to new situations
Decision-making
Working independently
Team work
Working in an international environment
Working in an interdisciplinary environment
Production of new research ideas
Project planning and management
Respect for difference and multiculturalism
Respect for the natural environment
Showing social, professional and ethical responsibility and sensitivity to gender issues
Criticism and self-criticism
Production of free, creative and inductive thinking
……
Others…
…….