PROMOTE MY BLOG: JUST CLICK BELOW BUTTON

Search Any Paper On This Blog

Wednesday, February 23, 2011

MTH202 Solved Subjectives for Final Term Exam Success

Question: Difference between sentence and statement.
Answer: A sentence is a statement if it have a truth value otherwise this sentence is not a statement.By truth value i www.allvupastpapers.blogspot.com
mean if i write a sentence "Lahore is capital of Punjab" Its truth value is "true".Because yes Lahore is a capital of Punjab. So the above sentence is a statement. Now if i write a sentence "How are you" Then you cannot answer in yes or no.So this sentence is not a statement. Every statement is a sentence but converse is not true.

Question: What is the truth table?
Answer: Truth table is a table which describe the truth values of a proposition. or we can say that Truth table display the complete behaviour of a proposition. There fore the purpose of truth table is to identify its truth values. A statement or a proposition in Discrete math can easily identify its truth value by the truth table. Truth tables are especially valuable in the determination of the truth values of propositions constructed from simpler propositions. The main steps while making a truth table are "first judge about the statement that how much symbols(or variables) it contain. If it has n symbols then total number of combinations=2 raise to power n. These all the combinations give the truth value of the statement from where we can judge that either the truthness of a statement or proposiotion is true or false. In all the combinations you have to put values either "F" or "T" against the variales.But note it that no row can be repeated. For example "Ali is happy and healthy" we denote "ali is happy" by p and "ali is healthy" by q so the above statement contain two variables or symbols. The total no of combinations are =2 raise to power 2(as n=2) =4 which tell us the truthness of a statement.

Question: how empty set become a subset of every set.
Answer: If A & B are two sets, A is called a subset of B, if, and only if, every element of A is also an element of B. Now we prove that empty set is subset of any other set by a contra positive statement( of above statement) i.e. If there is any element in the the set A that is not in the set B then A is not a subset of B. Now if A={} and B={1,3,4,5} Then you cannot find an element which is in A but not in B. So A is subset of B.

Question: What is rational and irrational numbers.
Answer: A number that can be expressed as a fraction p/q where p and q are integers and q\not=0, is called a rational number with numerator p and denominator q. The numbers which cannot be expressed as rational are called irrational number. Irrational numbers have decimal expansions that neither terminate nor become periodic where in rational numbers the decimal expansion either terminate or become periodic after some numbers.
www.allvupastpapers.blogspot.com

Question: what is the difference between graphs and spanning tree?
Answer: First of all, a graph is a "diagram that exhibits a relationship, often functional, between two sets of numbers as a set of points having coordinates determined by the relationship. Also called plot". Or A pictorial device, such as a pie chart or bar graph, used to illustrate quantitative relationships. Also called chart. And a tree is a connected graph that does not contain any nontrivial circuit. (i.e., it is circuit-free) Basically, a graph is a nonempty set of points called vertices and a set of line segments joining pairs of vertices called edges. Formally, a graph G consists of two finite sets: (i) A set V=V(G) of vertices (or points or nodes) (ii) A set E=E(G) of edges; where each edge corresponds to a pair of vertices. Whereas, a spanning tree for a graph G is a subgraph of G that contains every vertex of G and is a tree. It is not neccesary for a graph to always be a spanning tree. Graph becomes a spanning tree if it satisfies all the properties of a spanning tree.

Question: What is the probability ?
Answer: The definition of probability is : Let S be a finite sample space such that all the outcomes are equally likely to occur. The probability of an event E, which is a subset of S, is P(E) = (the number of outcomes in E)/ (the number of total outcomes in S) P(E) = n (E) / n ( S ) This definition is due to ‘Laplace.’ Thus probability is a concept which measures numerically the degree of certainty or uncertainty of the occurrence of an event. Explaination The basic steps of probability that u have to remember are as under 1. First list out all possible out comes. That is called the sample space S For example when we roll a die the all possible outcomes are the set S i.e. S = {1,2,3,4,5,6} 2. Secondly we have to find out all that possible outcomes, in which the probability is required . For example we are asked to find the probability of even numbers. First we decide any name of that event i.e E Now we check all the even numbers in S which are E = {2,4,6} Remember Event is always a sub-set of Sample space S. 3. Now we apply the definition of probability P(E) = (the number of outcomes in E)/ (the number of total outcomes in S) P(E) = n (E) / n ( S ) So from above two steps we have n (E) = 3 and n (S) = 6 then P(E) = 3 / 6 = 1/2 which is probability of an even number.
www.allvupastpapers.blogspot.com

Question: what is permutation?
Answer: Permutation comes from the word permute which means " to change the order of." Basically permutation means a "complete change." Or the act of altering a given set of objects in a group. In Mathematics point of view it means that a ordered arrangement of the elements of a set (here the order of elements matters but repetition of the elements is not allowed).

Question: What is a function.
Answer: A function say 'f' is a rule or machine from a set A to the set B if for every element say a of A, there exist a unique element say b of set such that b=f(a) Where b is the image of a under f,and a is the pre-image. Note it that set A is called the domain of f and Y is called the codomain of f. As we know that function is a rule or machine in which we put an input,and we get an output.Like that a juicer machine.We take some apples(here apples are input) and we apply a rule or a function of juicer machine on it,then we get the output in the form of juice.

Question: What is p implies q.
Answer: p--- >q means to "go from hypothesis to a conclusion" where p is a hypothesis and q is a conclusion. And note it that this statement is conditioned because the "truth ness of statement p is conditioned on the truth ness of statement q". Now the truth value of p--->q is false only when p is true and q is false otherwise it will always true. E.g. consider an implication "if you do your work on Sunday ,I will give you ten rupees." Here p=you do your work on Sunday (is the hypothesis) , q=I will give you ten rupees ( the conclusion or promise). Now the truth value of p---->q will false only when the promise is braked. i.e. You do your work on Sunday but you do not get ten rupees. In all other conditions the promise is not braked.

Question: What is valid and invalid arguments.
Answer: As "an argument is a list of statements called premises (or assumptions or hypotheses) which is follwww.allvupastpapers.blogspot.com
owed by a statement called the conclusion. " A valid argument is one in which the premises entail(or imply) the conclusion. 1)It cannot have true premises and a false conclusion. 2)If its premises are true, its conclusion must be true. 3)If its conclusion is false, it must have at least one false premise. 4)All of the information in the conclusion is also in the premises. And an invalid agrument is one in which the premises do not entail(or imply) the conclusion. It can have true premises and a false conclusion. Even if its premises are true, it may have a false conclusion. Even if its conclusion is false, it may have true premises. There is information in the conclusion that is not in the premises. To know them better,try to solve more and more examples and exercises.

Question: What is domain and co -domain.
Answer: Domain means "the set of all x-coordinates in a relation". It is very simple,Let we take a function say f from the set X to set Y. Then domain means a set which contain all the elements of the set X. And co domain means a set which contain all the elements of the set Y. For example: Let we define a function "f" from the set X={a,b,c,d} to Y={1,2,3,4}. such that f(a)=1, f(b)=2, f(c)=3, f(d)=1 Here the domain set is {a,b,c,d} And the co-domain set is {1,2,3,4} Where as the image set is {1,2,3}.Because f(a)=1 as 1 is the image of a under the rule 'f'. f(b)=2 as 2 is the image of b under the rule 'f'. f(c)=3 as 3 is the image of c under the rule 'f'. f(d)=1as 1 is the image of d under the rule 'f'. because "image set contains only those elements which are the images of elements found in set X". Note it that here f is one -one but not onto,because there is one element '4' left which is the image of nothing element under the rule 'f'.

Question: What is the difference between k-sample,k-selection, k-permutation and k-combination?
Answer: Actually, these all terms are related to the basic concept of choosing some elements from the given collection.

For it, two things are important:
1) Order of elements .i.e. which one is first, which one is second and so on.
2) Repetition of elements

So we can get 4 kinds of selections:

1) The elements have both order and repetition. ( It is called k-sample )
2) The elements have only order, but no repetition. ( It is called k-permutation )
3) The elements have only repetition, but no order. ( It is called k-selection )
4) The elements have no repetition and no order. ( It is called k-combination )
www.allvupastpapers.blogspot.com

Question: What is a combination?
Answer: A combination is an un-ordered collection of unique elements. Given S, the set of all possible unique elements, a combination is a subset of the elements of S. The order of the elements in a combination is not important (two lists with the same elements in different orders are considered to be the same combination). Also, the elements cannot be repeated in a combination (every element appears uniquely once

Question: why is 0! equal to 1?
Answer: Since n! = n(n-1)!
Put n =1 in it.
1! = 1x(1 – 1)!
1! =1x0!
1! = 0!
Since 1! = 1
So 1 = 0!
0! = 1.




www.allvupastpapers.blogspot.com

Question: What is the main deffernce between Calculus and Discrete Maths?
Answer: Discrete mathematics is the study of mathematics which concerns to the study of discrete objects. Discrete math build students approach to think abstractly and how to handle mathematical models problems in computer While Calculus is a mathematical tool used to analyze changes in physical quantities. Or "Calculus is sometimes described as the mathematics of change." Also calculus played an important role in industrial area as well discrete math in computer.
Discrete mathematics concerns processes that consist of a sequence of individual steps. This distinguishes it from calculus, which studies continuously changing processes. the ideas of discrete mathematics underline the science and technology specific to the computer age. An important goal of discrete mathematics is to develop students’ ability to think abstractly.


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.