PROMOTE MY BLOG: JUST CLICK BELOW BUTTON

Search Any Paper On This Blog

Saturday, February 26, 2011

MTH202 Solved subjective

Question: Write the types of functions.
Answer: Types of function:- Following are the types of function
1. One to one function 2. Onto function 3. Into
function 4. Bijective function (one to one and onto
function) One to one function:- A function f : A to B is
said to be one to one if there is no repetition in the
second element of any two ordered pairs. Onto
function:- A function f : A to B is said to be onto if
Range of f is equal to set B (co-domain). Into
function:- A function f : A to B is said to be into
function of Range of f is the subset of set B (co
domain) Bijective function: Bijective function:- A
function is said to be Bijective if it is both one to one
and onto.
Question: Explain the pigeonhole principle.
Question: What is conditional probability with example?.
Question: Explain combinatorics.
Answer: Branch of mathematics concerned with the selection,
arrangement, and combination of objects chosen from
a finite set.
The number of possible bridge hands is a simple
example; more complex problems include scheduling
classes in classrooms at a large university and
designing a routing system for telephone signals. No
standard algebraic procedures apply to all
combinatorial problems; a separate logical analysis may
be required for each problem.
Question: How the tree diagram use in our real computer life?
Answer: Tree diagrams are used in data structure, compiler
construction, in making algorithms, operating system
etc.
Question: Write detail of cards.
Answer: Diamond Club Heart Spade A A A A 1 1 1 1 2 2 2 2 3 3
3 3 4 4 4 4 5 5 5 5 6 6 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10
10 10 10 J J J J Q Q Q Q K K K K Where 26 cards are
black & 26 are red. Also ‘A’ stands for ‘ace’ ‘J’ stands
for ‘jack’ ‘Q’ stands for ‘queen’ ‘K’ stands for ‘king’
Question: what is the purpose of permutations?
Answer: Definition:- Possible arrangements of a set of objects
in which the order of the arrangement makes a
difference. For example, determining all the different
ways five books can be arranged in order on a shelf. In
mathematics, especially in abstract algebra and
related areas, a permutation is a bijection, from a
finite set X onto itself. Purpose of permutation is to
establish significance without assumptions


By ADEEL ABBAS, Bhakkar. AdeelAbbasbk@gmail.com

No comments:

Post a Comment

PLEASE COMMENT ABOUT YOUR VISIT AND MY SITE

Note: Only a member of this blog may post a comment.