Roll No. Total No. of Pages : 02
Total No. of Questions : 18
--- Content provided by FirstRanker.com ---
MCA (2015 to 2018) (Sem.-2)
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
Subject Code : MCA-201
M.Code : 72876
Time : 3 Hrs. Max. Marks : 60
--- Content provided by FirstRanker.com ---
INSTRUCTIONS TO CANDIDATES :
- SECTIONS-A, B, C & D contains TWO questions each carrying TEN marks each and students has to attempt any ONE question from each SECTION.
- SECTION-E is COMPULSORY consisting of TEN questions carrying TWENTY marks in all.
- Use of non-programmable scientific calculator is allowed.
SECTION-A
--- Content provided by FirstRanker.com ---
- Define Simple and Multi-graph. Prove that an undirected graph possesses an Eulerian path if it is connected and has either zero or two vertices of odd degree.
- a) State and prove Five color theorem.
b) Explain the shortest path problem and also explain the algorithms used to find shortest path.
SECTION-B
- a) Show that A n (B n C) = (A n B) n C.
--- Content provided by FirstRanker.com ---
b) Define intersection and union of sets. Prove that A ? B = A n B if A = B. - a) Define Minsets. Let B1, B2, B3 are the subsets of a universal set U. Find all minsets generated by B1, B2, and B3.
b) Define Partitions of sets. Give all the partitions of {a, b, c, d, e}.
SECTION-C
- a) Test the validity of: If he works hard then he will be successful. If he is successful then he will be happy. Therefore, hard work leads to happiness.
--- Content provided by FirstRanker.com ---
b) Prove that disjunction distributes over conjunction. - a) Use Mathematical induction to show that 1 + 2 + ... + 2m = 2m+1 - 1.
b) Define Quantifiers. Explain different types of quantifiers along with examples.
SECTION-D
- Solve by Gauss Elimination method : x – 2y – 6z = 12, 2x + 4y + 12z = -17, x – 4y – 12z = 22.
- Solve by matrix inversion method : x – y + 3z = 2, 2x + y + 2z = 2, -2x – 2y + z = 13.
--- Content provided by FirstRanker.com ---
SECTION-E
Answer briefly :
- Define Complete Bipartite graph and give one example.
- Define Euler and Hamilton graphs.
- Define Complement of set and give example.
- Can we say that Cartesian product is commutative? Justify.
- Define Uncountable set.
- Define tautologies and contradictions.
- Prove that p ? q = q ? p.
- Define Symmetric and Skew-Symmetric.
- If A =
1 -2 \\ 3 0 \end{bmatrix} and B = 2 1 \\ 1 3 \end{bmatrix} Find AB. - Define inverse of a Square matrix and find the inverse of
3 1 \\ 1 -1 \end{bmatrix}
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
NOTE: Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: GTU BE 2020 Summer Question Papers || Gujarat Technological University
--- Content provided by FirstRanker.com ---