0% found this document useful (0 votes)
286 views

CA3 - BCA - Model Questions

The document contains 29 questions related to set theory, logic, graphs and digraphs. Some questions ask to find set operations like union and intersection of given sets, prove properties of relations, determine if a relation is reflexive, symmetric or transitive, find the maximum number of equivalence relations or equivalence classes of a relation. Other questions involve graph theory concepts like drawing graphs based on degree sequences or adjacency matrices, finding the number of edges or vertices with certain degrees in a graph, proving properties like the handshaking lemma.

Uploaded by

Mouboni 04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
286 views

CA3 - BCA - Model Questions

The document contains 29 questions related to set theory, logic, graphs and digraphs. Some questions ask to find set operations like union and intersection of given sets, prove properties of relations, determine if a relation is reflexive, symmetric or transitive, find the maximum number of equivalence relations or equivalence classes of a relation. Other questions involve graph theory concepts like drawing graphs based on degree sequences or adjacency matrices, finding the number of edges or vertices with certain degrees in a graph, proving properties like the handshaking lemma.

Uploaded by

Mouboni 04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

BCA

BCAC-201

1. If U={1,2,3,4,5,6,7,8,9,10}, A={2,5,6,9} and B={1,3,5}, then find 𝐴𝑐 ∪ 𝐵𝑐 .

2. If 𝐴 and B and C be three sets. Consider the following identity A  B  A  C .


Does it necessarily imply B=C? Either prove it or disprove with counter example.
3. If 𝐴 and B and C be three sets. Consider the following identity A  B  A  C .
Does it necessarily imply B=C? Either prove it or disprove with counter example.

4. a. If 𝐴 ∪ 𝐵 = 𝐴 ∪ 𝐶 and 𝐴 ∩ 𝐵 = 𝐴 ∩ 𝐶, prove that 𝐵 = 𝐶.

b. If 𝐴 ∪ 𝐵 = 𝐴 ∪ 𝐶 and 𝐴𝑐 ∪ 𝐵 = 𝐴𝑐 ∪ 𝐶, prove that 𝐵 = 𝐶.

5. If A={1,3,5} and B={1,3,8}, then find (𝐴 × 𝐵) − (𝐵 × 𝐴).

6. If A = {1, 3, 5}, B = {1, 3, 8}, then find


i. A–B
ii. AxB
iii. 𝐴∆𝐵
iv. (A x B) – (B x A)

7.

8. What is the cardinality of  (X ) (power set of X) where X= {0, 1, 2, 3, 4}.

9. In an examination, out of 90 students 65 passed in Physics and 50 passed in


Mathematics and 35 passed in both Physics and Mathematics.

10. How many students passed in exactly one of the two subjects?

11. How many students failed in both the subjects?


12. In a class of 200 students, 125 students have taken Programming Language
course, 85 students have taken Data Structures course, 65 students have taken
Computer Organisation course; 50 students have taken both Programming
Language and Data Structures, 35 students have taken both Programming
Languages and Computer Organisation; 30 students have taken both Data
Structures and Computer Organisation; 15 students have taken all the three
course. How many students have not taken any of the three courses?
13. Let,
𝑝: It is cold.
𝑞: It is raining.
Then write the sentence for the following logical expression: 𝑝 ⋀ ∼ 𝑞.
14. Let 𝑝 and 𝑞 be any two proposition then write the truth table for
a. ∼ (𝑝 ⋀ ∼ 𝑞)
b. (p  (q  r ) )

15. On the set {1,3,5,7} a relation R={(1,3),(5,3),(3,5),(5,7)} is defined. Then R is


reflexive/symmetric/transitive/none of these.

16. Find the maximum number of equivalence relations on =A{1, 2, 3}

17. Let R be a relation in the set of integers Z defined by xRy if x-y is divisible by 5
for all x,y∊Z. Prove that R is an equivalence relation. Find all the distinct
equivalence classes of R.

18. What degree of a pendant vertex?


19. If the complete graph with four vertices has k edges then find the value of k?
20. Draw the complete graph of K 5 .

21. State and prove handshaking lemma.

22. Show that the number of odd vertices in any graph is even.

23. If for some positive integer k, degree of vertex deg(v)=k for every vertex v of the
graph G. What is name of this above graph G?
24. If G is having the degree sequence {4, 3, 2, 2, 1, 1}. Can you draw G?

25. Draw a simple graph with five vertices v1 , v 2 , v 3 ,…. v 5 such that

deg( v1 )=3, deg( v 2 )=2, deg( v 3 )=2, deg( v 4 )=3, deg( v 5 )=2 and v1 and v 2 are

adjacent to v 5 .

26. A graph has 14 vertices and 27 edges. The degree of each vertex of G is 3, 4 & 5.
There are 6 vertices of degree 4. How many vertices of G has degree 3 and how
many have degree 5?
27. How many nodes are necessary to construct a graph with exactly 6 edges in which
each node is of degree?

28. Draw the graph G whose from adjacency matrix is given below

0 0 0 1 2 1

0 0 0 1 1 1

A(G)= 0 0 0 2 1 1

1 2 1 0 0 0

2 1 0 0 0 0

1 1 0 0 0 0

29. Draw the digraph from the following adjacency matrix

1 0 0 1 0 1
0 0 1 0 1 0
0 2 0 0 0 1
1 0 0 1 0 0
0 0 0 0 1 0
==============================================================================

You might also like