SCCI Digital Library and Forum

Menu

Home
About Us
Video Library
eBooks
SCCI Forum

Home » Basic and Health Sciences » Mathematics » Discrete Mathematics (V-U) » 28. Loop to compute a Product , Division Algorithm ,Euclidean Algorithm (V-U)

28. Loop to compute a Product , Division Algorithm ,Euclidean Algorithm (V-U)

Course:Discrete Mathematics (V-U)
Discipline:Basic and Health Sciences
Institute:Virtual University
Instructor(s): Dr. Shoaib-ud- Din
Level:Graduate

Discrete Mathematics (V-U)

1. Introduction to Discrete Math , Statements, Negation, Conjunction and Disjunction (V-U)
10. Application of Venn Diagram, Partition of a set , Power set (V-U)
11. Cartesian Product ,Relations And Their Representations (V-U)
12. Reflexive,Symmetric and Tranisitive and Equivalence Relations (V-U)
13. Irreflexive,Anti-symmetric and Partial order Relations (V-U)
14. Inverse ,Complementary ,Composite Relations (V-U)
15. Functions,Arrow Diagram,Grapgh of Functions (V-U)
16. Injective,Surjective and Bijective Functions (V-U)
17. Equality,Inverse and Composition of Functions (V-U)
18. Algebra of Functions, Image& Inverse Image Functions,Finite & Infinite sets (V-U)
32. Ordered and unordered Partitions,Permutations with repititons (V-U)
19. Arithmetic and Geometric Sequences (V-U)
33. Tree Diagram , Inclusion – Exclusion Principle (V-U)
2. Truth Tables, Logical Equivalence and De Morgan`s Law (V-U)
34. Pigeonhole Principle (V-U)
20. Series, Arithmetic and Geometric Series (V-U)
35. Introduction to Probability (V-U)
21. Recursion , Recursively defined Functions and Sequences (V-U)
36. Addition Law of Probability (V-U)
22. Recursive definition of Sets ,Union, Intersection ,Boolean Expressions etc (V-U)

Sialkot Chamber of Commerce & Industry P.O. Box 1870, Shahrah-e-Aiwan-e-Sanat-o-Tijarat, Sialkot City 51310 – Pakistan

Facebook Twitter Instagram

Need help?

+92-52-4261881-3

sialkot@scci.com.pk

Copyright © 2026 SCCI Digital Library and Forum | All Right Reserved. Developed By FARAZ SALEEM