Scribd
Upload
11 views3 pages

Model Paper 1

Uploaded by

shreyas19052006
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
11 views3 pages

Model Paper 1

Uploaded by

shreyas19052006
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

I SEMESTER BCA

DISCRETE STRUCTURES
Model Paper 1
Duration : 3 Hours Max.Marks:80
Section A
I Answer any FIVE of the following questions 5 X 2 = 10

1. If 𝑨 = { 𝟏, 𝟐, 𝟑, 𝟒 }𝒂𝒏𝒅 𝑩 = { 𝟑, 𝟒, 𝟕, 𝟖 } find A – B and B – A


2. Define an equivalence Relation on a set.
3. Construct a truth table for the proposition ~𝒑 → 𝒒
4. Define Permutation and Combination.
5. Define scalar matrix with an example.
𝟑 𝟎
6. Find the characteristic equation of the matrix [ ]
𝟓 𝟐
7. What is the minimum cost of spanning tree?
8. Define Complete graph. Draw K 5 graph.

Section B
II Answer any SIX of the following questions 6 X 5 = 30

9. If 𝑨 = {𝟏, 𝟐, 𝟑, 𝟒 } , 𝑩 = { 𝟑, 𝟒, 𝟓 } and 𝑪 = { 𝟑, 𝟓, 𝟔, 𝟕} then Verify 𝑨𝑿(𝑩𝑼𝑪) =


(𝑨𝑿𝑩)𝑼(𝑨𝑿𝑪)
10. If 𝒇: 𝑹 → 𝑹 is defined by 𝒇(𝒙) = 𝟐𝒙 + 𝟑 prove that ‘f’ is one-one and onto and
hence find inverse of ‘f’.
11. Show that ~(𝒑 → 𝒒) ↔ (𝒑ʌ~𝒒) is a tautology.
12. If 2n C 3 : n C 2 = 44 : 3, find n.
𝟑 −𝟏
13. If 𝑨 = [ ] then find A-1 using Cayley Hamilton theorem.
𝟒 𝟓
14. Solve 𝟐𝒙 + 𝟑𝒚 + 𝒛 = 𝟗; 𝟒𝒙 + 𝒚 = 𝟕; 𝒙 − 𝟑𝒚 − 𝟕𝒛 = 𝟔 using Cramer’s rule
15. Define Isomorphism of graphs. Verify that the two graphs shown below are
isomorphic or not.
16. What is Hamiltonian circuit? Check whether the following graph contains
Hamiltonian circuit. Justify your answer.

Section C
II Answer any FIVE of the following questions 5 X 8 = 40

17. (a) In a group of 65 people, 40 like cricket, 10 like both cricket and tennis. How
many like tennis only and not cricket? How many like tennis?

(b) Using Mathematical Induction prove that


𝒏(𝒏+𝟏)
𝟏 + 𝟐 + 𝟑 + 𝟒 + − − − − − − − − +𝒏 = 𝟐

18. (a) In how many ways can the letters of the word “LEADING” be arranged in
such a way that the vowels always come together?
(b) Write the inverse, converse and contrapositive of the given conditional “ If
two triangles are congruent, then they are similar”.
𝟐 −𝟏
19. (a) If 𝑨 = [ ] show that 𝑨𝟐 − 𝟒𝑨 + 𝟑𝑰 = 𝟎.
−𝟏 𝟐
𝟏 𝟐
(b) Find the eigen values and the eigen vectors of the matrix [ ]
𝟑 𝟐

𝟏 −𝟏 𝟏
20. Find the inverse of the matrix 𝑨 = [ 𝟐 −𝟏 𝟑]
−𝟑 −𝟐 𝟒
21. Obtain the minimum cost spanning tree for the following graph using Kruskal’s
algorithm.

22. Traverse the following tree in preorder, postorder and inorder.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy