Are you looking for MTH202 Past Papers final term? This is the right website for you. Here you can find all the MTH202 past papers for Final Term Solved Past Papers. The past papers for MTH202 final term can be downloaded from this website.

You can find past papers for all subjects of VU’s final term at TheINFO.pk. At the end of this post are the past papers for MTH202 for the final term of the university.

## MTH202 Past Papers Final Term Solved

The MTH202 past papers were prepared by experienced and hardworking students from the Virtual University of Pakistan. If you want to prepare for the Final term exams quickly, you can consult MTH202 past papers.

## MTH202 Past Papers Solved MCQs By VU

This will help students gain a better understanding of the exam, such as what kind of MCQs and subjective questions will be on the exams.

If you are trying to get high grades in MTH202 VU Final term exams, past papers can be a useful resource. Furthermore, students must use VU handouts, PPT slides, and video lectures to guide them.

- CS201 Final Term Past Papers 2022
- MGT211 Past Papers Final Term 2022
- MTH202 Final Term Past Papers Solved 2022

## MTH202 Past Papers Final Term Solved Objective Part 1

**1.An arrangement of objects without the consideration of order is called**

**â–º Combination**

â–º Selection

â–º None of these

â–º Permutation

**2.The list of the degrees of the vertices of graph in non increasing order is called**

â–º Isomorphic Invariant**â–º Degree Sequence**

â–º Order of Graph

**3.A vertex of degree greater than 1 in a tree is called a**

**â–º Branch vertex**

â–º Terminal vertex

â–º Ancestor

**4.The sum of two irrational number must be an irrational number**

**â–º True**

â–º False

**5.An integer n is prime if, and only if, n > 1 and for all positive integers r and s, ifn = rÂ·s, then**

**â–º r = 1 or s = 1**

â–º r = 1 or s = 0.

â–º r = 2 or s = 3.

â–º None of these

**6.For any two sets A and B, A â€“ (A â€“ B) =**

â–º A Ã‡ B

â–º A Ãˆ B**â–º A â€“ B**

**7.Associative law of union for three sets is**

**â–º A Ãˆ (B Ãˆ C) = (A Ãˆ B) Ãˆ C**

â–º A Ã‡ (B Ã‡ C) = (A Ã‡ B) Ã‡ C

â–º A Ãˆ (B Ã‡ C) = (A Ãˆ B) Ã‡ (A Ãˆ B)

â–º None of these

**8.If p and q are statement variables, the biconditional of p and q isdenoted by**

â–º p Â« q

â–º ~q Â®~p

â–º ~p Â®~q

**â–º None of these**

**9.When 5k is even, then 5k+5k+5k is odd.**

â–º True**â–º False**

**10.An integer n is even if, and only if, n = 2k for some integer k.****â–º True**

â–º False

â–º Depends on the value of k

**11.In a directed graph of a Irreflexive relation, there should be**

â–ºLoop on a one point**â–ºNo loop at any point (Page 89)**

â–ºNo point connected

**12.How many functions are there from a set with three elements to a set with two elements?**

â–º 6**â–º 8**

â–º 12

**13.If a set contains exactly m distinct elements where m denotes some non negative integer then the set is.****â–º Finite (Page 40)**

â–º Infinite

â–º None of these

**14.Suppose that a connected planar simple graph has 30 edges. If a plane drawing of this graph has 20 faces, how many vertices does the graph have?****â–º12 (Page 318)**

â–º13

â–º14

**15.Among 200 people, 150 either swim or jog or both. If 85 swim and 60 swim and jog, how many jog?****â–º 125 (Page 241)**

â–º 225

â–º 85

â–º 25

**16.If a graph is a tree then**

â–º it has 2 spanning trees

â–º it has only 1 spanning tree (Page 329)

â–º it has 4 spanning trees

â–º it has 5 spanning trees

**17.The part of definition which can be expressed in terms of smaller versions of itself is called**

â–º Base

â–º Restriction**â–º Recursion (page 159)**

â–º Conclusion

**18.A rule that assigns a numerical value to each outcome in a sample space is called**

â–º One to one function

â–º Conditional probability**â–º Random variable (Page 274)**

**19.In how many ways can a set of five letters be selected from the English Alphabets?****â–º C(26,5)â€¦..**

â–º C(5,26)

â–º C(12,3)

â–º None of these

**20.An integer n is prime if and only if n > 1 and for all positive integers r and s, ifn = rÂ·s, then**

â–º r = 1 or s = 2.

â–º r = 1 or s = 0.

â–º r = 2 or s = 3.

**â–º None of these (Page 187)**