Roll No. ___________
Total No. of Questions : 07 Total No. of Pages : 02
--- Content provided by FirstRanker.com ---
BCA (2014 to 2018)/B.Tech. (CSE) (Sem.-1)
B.Sc.(IT) (2015 to 2018)
MATHEMATICS - I
Subject Code: BSIT/BSBC-103
M.Code : 10045
--- Content provided by FirstRanker.com ---
Time: 3 Hrs. Max. Marks : 60
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains SIX questions carrying TEN marks each and students have to attempt any FOUR questions.
- Write briefly:
- If A = {1, 2, a, b}, determine the following sets (i) A - ∅ (ii) A - {1, 2}.
- Given an example of a relation which is reflexive and symmetric but not transitive.
- Find relation R if matrix representation of R is
- Prove that p ? (q ? r) = (p ? q) ? (p ? r)
- Use quantifiers to show that v3 is not a rational number.
- Define Planar and Complete Graph.
- List two differences between Tree and Graph.
- Find order of the recurrence Relation T (K) = 2T(k-1) - kT(K-3).
- Define recurrence relation with examples.
- Prove that the maximum number of edges of simple graph is n(n-1)/2
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
-
- State and prove De Morgan's law for sets.
- Let m be a given fixed positive integer. Let R = {(a, b) : a, b ? Z and a - b is divisible by m}, show that R is an equivalence relation on Z.
-
- Prove validity of argument : If man is bachelor, he is happy. Therefore Bachelor dies young.
- By the principle of mathematical induction, prove the following for each n ? N : 1.3 + 3.5 + 5.7 + ... + (2n - 1) (2n + 1) = n(4n²+6n-1)/3
--- Content provided by FirstRanker.com ---
-
- Find minimal spanning tree of weighted graph
This download link is referred from the post: PTU B.Pharma 2nd Semester Last 10 Years 2011-2021 Previous Question Papers|| Punjab Technical University
- Find minimal spanning tree of weighted graph
--- Content provided by FirstRanker.com ---