Discrete Mathematics
Discrete Mathematics introduces both foundational and advanced concepts essential for computer science and information technology. Key topics include logic and proof techniques, set theory, relations and functions, combinatorics, graph theory, algorithms, and Boolean algebra. Students engage in lectures and problem-solving sessions to apply these concepts, focusing on developing analytical and critical thinking skills. Activities involve proving mathematical theorems, analyzing algorithms, modeling computational problems using discrete structures, and collaborating on projects that apply discrete mathematics to real-world ICT scenarios. The course emphasizes best practices and explores current applications of discrete mathematics in areas like cryptography, network design, and software development within the ICT industry.
