BSc Hons /Information Systems/ 2nd Year, Semester 1

Computer Quantitative Methods

QUANTITATIVE METHODS

Definition the range of mathematical + statistical technology used 2 analyze data 4 testing theories + hypothesis. These are research methods that rely less on interviews, observations, small numbers of questionnaires, focus grps, subjective reports + case studies but much more focused on the collection of numerical data + statistics. Theyre about measuring a mkt + quantifying that measurement with data, most often relating 2 mkt size, mkt share, penetration, installed base + mkt growth rate.

Why a w here?

In our dy-2-dy fns as mngers, wre faced with the reality of making decisions based on some statistical inference, where therere always an element of uncertainty becoz of the inference about the population based on incomplete evidence from our samples. As a result, w need some method 2 estimate the likelihood of making correct inferences & the method 4 doing this is supplied by whats called the probability theory.

2 understand the basic properties of this theory, w must possess some familiarization with the quantitative reasoning and this w shall capture by studying a number of mathematics concepts, starting with the algebra of sets, i.e. the elementary set theory and the set notation.

Set Theory
1.

2.

Aims & Objectives 2 introduce some basic concepts or fundamentals in Set Theory, Symbols & Terminology + elementary mathematical creativity. Sets & Elements. Set a grp or collection of objects called elements, expressed as {1,3,5,7,9} or the notation {x|x is an odd counting number less than 10}.

Specification of sets
There are 3 main ways 2 specify a set: 1. By listing all its members (list notation); 2. By stating a property of its elements (predicate notation); 3. By defining a set of rules which generates (defines) its members (recursive rules).

Further set concepts, cont

Empty set denoted O, is a set with no elements. This means that the statement xCO is false no matter what x is. Theorem 1: Given any set A, OCA. Theorem 2: All empty sets are the same, i.e. the empty set is independent of the universe of discourse. If A and B are both empty sets, ACB and BCA. Therefore, A=B.

Basic Concepts

Examples: P = (a,b,c,d,e), is translated as the set of company products, P, consist of members or elements a,b,c,d and e. NOTE: Sets are denoted by a capital letter and the elements by small letters in brackets , separated by commas. P = (Jones, Peter, Mary, Hari), a set of employees of a co working in the IT dept.

Further set concepts

Subsets A set which contains some of the elements of a bigger set. Example, If A = (h,i,j,k,l), then X = (i,j,l) is a subset of A, XCA. Y = (h,l) is a subset of A, YCA. The number of subsets of a set with n elements is 2 . Proper subset Set A is a proper subset of B if every element of A is also an element of B, but A CANNOT be exactly the same as B. Example, If A = (a,b,c,d,e) and B = (a,b,c,d,e,f), then A is said 2 be a subset of B. The number of proper subsets of a set with n elements is 2 -1.

Further set concepts

Number of a set the number of elements that a set contains, n[A]. Example, If A = (a,b,c,d,e), then n[A] = 5; If D = (Sales, Stores, Payroll), then n[D] = 3. Power sets the set of all subsets of a set, denoted as P(A). If A = {a,b}, then P{A} = {O,(a),(b),(a,b)}.

10

Further set concepts, cont.

Set equality Two sets are equal if and only if (iff) they have identical elements. If A = (x,y,z) and B = (x,y,z), then A=B. Universal set In some problems involving sets, its necessary 2 consider one or more sets under consideration as belonging 2 some larger set that contains them. Example: in a set of skilled workers, S, on a production line, it might be convenient 2 consider the universal set, B, as all of the workers on the ln, i.e. SCB.

11

Further set concepts, cont..

Compliment of a set all the elements of a set that are not contained in a set, but are found in its universal set. Of all the workers on the production ln, S was specified as the set of skilled workers within the universal set of all workers on the ln. Therefore, the compliment of set S, denoted as S would be all the workers that were not skilled, i.e. the set of unskilled workers.

12

Venn Diagrams

Definition a simple pictorial representation of a set. They are useful 4 demonstrating general relationships between sets. Example: If a firm maintains a fleet of 7 cars, we might write A = (1,2,3,4,5,6,7) (ea car being numbered 4 convenience). If it was important 2 identify those cars of the fleet being used by directors, we might have D = (3,5), i.e. cars 3 and 5 are directors cars. A venn diagram nicely demonstrates that D is a subset of A, which normally means that n[D] < n[A].

13

Operations on Sets

Union of two sets A and B, written as AUB, is the set that combines all the elements lying within either A or B or both. If A = (c,d,f,h,j) and B = (d,m,c,f,n,p), then AUB = (c,d,f,h,j,m,n,p). Intersection of two sets A and B, A B, is the set which contains all elements lying within both A or B. If A = (a,b,c,d,f,g) and B = (c,f,g,h,j), then A B = (c,f,g).

14

Operations of Sets, cont.

Difference of Sets, A-B is a set of elements belonging 2 set A and NOT to set B. If A = (1,2,3,4,5) and B = (2,3,5), then A-B = (1,4). NOTE: A-B = B-A. Cartesian Product of Sets, AxB = {(a,b)|a is every element in A, b is every element in B}. If A = {1,2} and B = {4,5,6}, then AxB = {(1,4),1,5),(1,6),(2,4),(2,5),(2,6)}.

15

Value of set theory

The purpose of set theory isnt its practical application like other theories. Its value isnt in any particular theorem, but in the language it gives us. 2days computer scientists + mngers describe most basic concepts in the language of set theory. This important in that when w specify objects settheoretically, w stop being ambiguous + become more precise. So, elementary set theory + the ideas about infinite sets in particular are crucial 4 all kinds of practical maths necessary 4 reinforcing + analyzing problems + reports opinions + facts reqd 4 evaluations + decision making.

16

Applications of set theory

In a sense, set theory is just a formalization of what is perhaps the most fundamental of all mathematical activities: identifying that several objects in the world share some properties in common & can be grouped 2gether somehow. Example: One cannot count apples until he/shes able 2 recognize whether a given object is an apple or not, and this the same as identifying a property that characterizes apples and then finding a procedure 2 check whether an arbitrary object possesses this property.

17

Generally, one cannot count objects of a certain type without first grouping the objects that one desires 2 count 2gether into what is intuitively just a set. Set theory is therefore very helpful in elucidating many modern mathematical theories.

18

Set Theory Summary

19