MVN Mathematical Foundation of Computer Science BCA Previous Year Question Paper
Name of the College : MVN University
Subject Code/Name : CAL 104-Mathematical Foundation of Computer Science
Year : Jan.2014
Degree : BCA
Sem : II
Website : mvn.edu.in
Document Type : Previous Year Question Paper
Download Model Question Paper : https://www.pdfquestion.in/uploads/mvn.edu.in/3137-MFCS-2nd-Sem.pdf
MVN Mathematical Foundation of Computer Science Previous Question Paper
Time Allowed: 03 hours.
Maximum Marks: 100
Related : MVN University CAL102 Fundamental of Internet Technologies BCA Question Paper : www.pdfquestion.in/3135.html
Instructions
** Before answering the question paper the candidate should ensure that they have been supplied the correct question paper.
** Complaints in this regard, if any, shall not be entertained after the examination.
January 2014
Note: Question No. 1 is Compulsory and attempt any two questions from each section. All questions carry equal marks.
1(a) Give one example of each type of the relation R on A={1,2,3} having following properties
(i) R is transitive but not Symmetric
(ii) R is both Symmetric and Antisymmetric (5)
(b) Explain in how many ways a Relation is represented? (5)
(c) Explain all Fundamental Connector with truth Table? (5)
(d) Explain Multigraph & their representation? (5)
SECTION – A :
2(a) Explain the concept of Isomorphic and Homomorphic graph through an example? (10)
(b) What do you mean by Graph? Explain their types also? (10)
3(a) What do you mean by Composition of Relations? (10)
Let X={4,5,6} Y={a,b,c} Z={l,m,n}.Consider the relation
R1 from X to Y and R2 from Y to Z
R1={(4,a),(4,b),(5,c),(6,a),(6,c)}
R2={(a,l),(a,n),(b,l),(b,m),(c,l),(c,m),(c,n)}
Calculate R1oR2
(b) Explain Equivalence Relation with the help of example? (10)
4(a) What do you mean by Algorithm? Write down Merit & Demerit also. (10)
(b) Explain Binary Search with the help of example? (10)
SECTION – B :
5(a)Explain AVL Tree?Construct an AVL Tree by Inserting the following elements 64,1,14,26,13,110,88,95 (10)
(b) Explain Binary search Tree? Write down algorithm for insertion in a Binary Search Tree? (10)
6(a) Explain Bubble Sort with the help of example? (10)
(b) What do you mean by Sorting? Sort the Following element according to Bucket Sort (10)
47,58,23,11,8,44
7(a) Explain Tautologies, Contradiction, Contigency with truth table. (5)
(b) From 10 programmers in how many ways can 5 be selected when
(i)A Particular programmer is included every time.
(ii)A Particular programmer is not included at all. (5)
(c) Explain Pigeonhole principle? (5)
(d) What do you mean by Proposition Statement? (5)
June 2013
Mathematical Foundation of Computer Science
Subject Code: CAL-104
Time Allowed: 03 hours.
Maximum Marks: 100
Instructions
** Before answering the question paper the candidate should ensure that they have been supplied the correct question paper.
** Complaints in this regard, if any, shall not be entertained after the examination.
** Attempt any five questions and all questions carry equal marks.
Section – A :
1.(a) Explain Equivalence Relation and Partial Order Relation with the help of example? (10)
(b) Explain Quanitifier& their Types? (10)
2.(a) Explain the concept of Isomorphic and Homomorphic graph through an example? (10)
(b) What is Relation? Explain types of Relation? (10)
3.Write a Short note on (20)
(a) Give an example of a graph that has Eulerian circuit and but not Hamiltonian circuit.
( b) Domain and Range of Relation
(c) Isolated Vertex, Elementary Path,
(d) Merit and Demerit of Algorithm.
Section – B :
4. (a) Find out the Contradiction of~(pvq)v(~pv~q) (5) (b) 12-22+32+………..(-1)n+1n2=(-1)n+1 n(n+1) (5) 2
(c) Find out the Contingency of (p^~q)v(~p^q) (5)
(d) What do you mean by Propostion and Propositional Variables (5)
5. (a) Construct an AVL Tree by Inserting the following elements in the order of their 64,1,14,26,13,110,88,95 (10)
(b) Explain the concept of Minimum spanning Tree With the help of Example? (10)
6. (a) Explain Selection Sort with the help of example? (10)
(b) Sort the Following element according to insertion Sort 77, 33, 44, 11, 88, 22, 66, 55