Assignment 1
Assignment 1 is a combination of Chapter 1: Set Theory and Logic, and Chapter 2: Relationd and Functions.
Reflection: A deeper understandings of both the topics were fulfilled.
Discrete Structure
This course introduces the fundamentals of discrete structures in computer science, covering topics like set theory, proof techniques, relations, functions, recurrence relations, counting methods, graph theory, trees, and finite automata. Students will learn to apply these concepts to solve problems, model systems, and address real-world challenges in computer science.
Assignment 2
Assignment 2 includes Chapter 2: Relations and Functions, and Chapter 3: Counting Methods and Probability.
Reflection: The concepts were explored and applied, leading to a better understanding of their practical use in problem-solving. A deeper comprehension of these topics was gained through the assignment.
Assignment 3
Assignment 3 is a combination of Chapter 3: Counting Methods and Probability, and Chapter 4: Graph Theory.
Reflection: The concepts from both chapters were explored, enhancing the understanding of their application in solving problems. A deeper insight into counting methods, probability, and graph theory was gained through this assignment.