This course covers the mathematical foundations of computer science. The aim is to introduce the students to essential discrete structures such as propositions, predicates, sets, functions, sequences, and relations and fundamental principles and techniques of discrete mathematics, which may be employed in a variety of fields in computer science, including algorithms, data structures, theory of computation. The course also equips students with knowledge of concepts and skills that are building blocks in machine learning, databases, data science, cryptography, and networks. These include modeling problems with recurrence relations, counting, and graph and tree structures. A very brief introduction to number theory and cryptography is made. The course focuses on the formal and precise formulation of statements and methods of proof (including proofs by contradiction, contra-position, and mathematical induction). This course introduces students to essential problem-solving tools for tackling complex computational challenges.