Discrete Mathematics - II transitions from foundational concepts to applied discrete mathematics, emphasizing graph theory, algebraic structures, algorithmic techniques, and probabilistic reasoning. Students engage with problems that directly mirror real-world computational challenges: network design, resource allocation, efficient multiplication, cryptographic systems, and decision-making under uncertainty. Through hands-on experiments, this part demonstrates how abstract mathematical structures translate into practical algorithms and applications. The topics bridge pure mathematics and computer science, showcasing how graph algorithms optimize networks, how algebraic structures enable cryptography, and how probabilistic reasoning informs artificial intelligence and data analysis.