[ Assignments ]

In this subject, I was given four assignments to complete during this first semester. All the assignments were group-based, consisting of 3-4 members. My group members, Kalaitharan, Ahmad Irfan, and I, worked together to complete each assignment by evenly dividing the questions among ourselves. Through these assignments, we learned to manage our time effectively, enhance our communication skills, and practice effective teamwork.

Introduction of Discrete Structure

Discrete Structure is an important subject in computer science and mathematics that focuses on studying individual and separate objects, rather than continuous ones. It forms the foundation for many areas in computing, like algorithms, programming, cryptography, and data structures, helping us understand how these systems work and interact.

Knowledge :

• Logic and Propositions: : Covers propositional logic, truth tables, predicates, and quantifiers. Helps in forming valid arguments and reasoning systematically.
• Set Theory : Explores concepts like sets, subsets, unions, intersections, and Cartesian products. Provides a basis for understanding databases, relations, and functions.
• Relations and Functions: Examines the relationship between elements and their mappings. Important for designing algorithms and understanding databases.
• Graph Theory: : Studies graphs, trees, and networks. Applications include social networks, transportation systems, and computer networks.
• Combinatorics :Focuses on counting, permutations, and combinations. Essential for solving optimization problems and analyzing algorithms.

Reflection : What is your comment for this subject ?

This subject is found to be both enjoyable and quite challenging as it tests the speed of critical thinking. However, it is considered suitable for those who prefer subjects involving a lot of calculations, such as mathematics or additional mathematics, which are believed to be mastered quickly and easily. Therefore, confidence is felt in scoring well in the final exam for this subject.

Answer Sheet : Click here

Assignment 1 : Sets and SubSets

This assignment for the Discrete Structure course focuses on fundamental topics like sets, logical reasoning, and proof techniques. It encourages collaboration, critical thinking, and a deeper understanding of the mathematical concepts essential for computer science.

Advantages after Done the Assignment Given :

• Better Problem-Solving : You’ll improve your ability to think critically and solve tricky problems using sets, logic, and proofs.
• Stronger Basics : It helps you understand important concepts in discrete mathematics, which are super useful for programming and designing algorithms.
• Teamwork Skills : Working with your group teaches you how to collaborate, share tasks, and communicate effectively.

Reflection for Lab 1 : Do you think this assignment is worth it to be done ?

Completing this assignment has been a valuable experience. It challenged me to apply concepts like set theory, logic, and proofs while working collaboratively with my team. The process improved my problem-solving skills, time management, and teamwork abilities. Overall, it was a rewarding task that deepened my understanding of the subject.

Answer Sheet : Click here

Assignment 2 : Permutations and Combinations

This group assignment dives into key concepts of discrete structures, covering topics like permutations, combinations, and logical reasoning. Through engaging problems such as route planning, word arrangements, and group selections, it challenges us to apply theory in practical ways. Working as a team, we aim to solve these questions while sharpening our understanding of discrete mathematics.

Advantages after Done the Assignment Given :

• Deepened Understanding of Concepts : The assignment explores permutations, combinations, logical reasoning, and probability. Solving these problems ensures a thorough grasp of discrete mathematics, building confidence in applying these concepts.
• Practical Application of Theory : This assignment bridges the gap between theoretical learning and real-world applications. It provides opportunities to apply formulas and methods in situations like route optimization, committee selection, and seating arrangements.
• Understanding Practical Implications of the Pigeonhole Principle : Problems such as ensuring a specific grade distribution or finding shared computer connections leverage the pigeonhole principle.

Reflection : Do you think this assignment is worth it to be done ?

This assignment is valuable because it applies concepts like permutations and probability to real-world problems, making them easier to understand. It helps develop critical thinking and teamwork skills, useful for both studies and future careers. The knowledge gained is relevant to fields like logistics and data analysis, preparing you for practical challenges.

Assignment 3 : Deterministic Finite Automata (DFA) and Finite-State Machine (FSM)

In progress ....