انت هنا الان : شبكة جامعة بابل > موقع الكلية > نظام التعليم الالكتروني > مشاهدة المحاضرة

Counting Methods

الكلية كلية العلوم للبنات     القسم قسم الحاسبات     المرحلة 1
أستاذ المادة زينب عبد المنعم عبد الهادي محمد شربة       12/04/2017 21:00:18
Counting Methods
Combinatorics is a fascinating branch of discrete mathematics, which deals with the art of counting. Very often we ask the question, In how many ways can a certain task be done? Usually combinatorics comes to our rescue. In most cases, listing the possibilities and counting them is the least desirable way of finding the answer to such a problem. Often we are not interested in enumerating the possibilities, but rather would like to know the total number of ways the task can be done.
Since in most cases it not feasible to list all the outcomes, we use the following techniques to COUNT them when listing them:

The Fundamental Counting Principle
- Permutations
- Combinations
Counting Methods
Combinatorics is a fascinating branch of discrete mathematics, which deals with the art of counting. Very often we ask the question, In how many ways can a certain task be done? Usually combinatorics comes to our rescue. In most cases, listing the possibilities and counting them is the least desirable way of finding the answer to such a problem. Often we are not interested in enumerating the possibilities, but rather would like to know the total number of ways the task can be done.
Since in most cases it not feasible to list all the outcomes, we use the following techniques to COUNT them when listing them:

The Fundamental Counting Principle
- Permutations
- Combinations


المادة المعروضة اعلاه هي مدخل الى المحاضرة المرفوعة بواسطة استاذ(ة) المادة . وقد تبدو لك غير متكاملة . حيث يضع استاذ المادة في بعض الاحيان فقط الجزء الاول من المحاضرة من اجل الاطلاع على ما ستقوم بتحميله لاحقا . في نظام التعليم الالكتروني نوفر هذه الخدمة لكي نبقيك على اطلاع حول محتوى الملف الذي ستقوم بتحميله .