Discrete Mathematics: Logic, Structures, Algorithms

This lecture introduces the basics of discrete mathematics, focusing on logic, structures, and algorithms. It covers propositional logic, truth tables, logical connectives, compound propositions, and implications. The course aims to provide a foundation for understanding computer systems and computational thinking, emphasizing problem-solving and scalability analysis without programming. Topics include sets, functions, relations, sequences, complexity of algorithms, counting, and probability theory. The teaching approach involves interactive sessions, quizzes, and group discussions. Students are encouraged to actively participate, follow the schedule, and engage in problem-solving. The course material closely follows the book 'Discrete Mathematics and Its Applications' by Kenneth H. Rosen.