Scribd
Upload
139 views

Math (1st) May2018

This document contains instructions and questions for a mathematics exam. It is divided into two sections, Section A with 10 short questions worth 2 marks each, and Section B with 6 longer questions worth 10 marks each where students must attempt 4. The questions cover topics like sets, relations, graphs, sequences, recurrence relations, and algorithms. The document provides 3 pages of questions to test students' mathematical knowledge and problem solving abilities.

Uploaded by

Imran
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
139 views

Math (1st) May2018

This document contains instructions and questions for a mathematics exam. It is divided into two sections, Section A with 10 short questions worth 2 marks each, and Section B with 6 longer questions worth 10 marks each where students must attempt 4. The questions cover topics like sets, relations, graphs, sequences, recurrence relations, and algorithms. The document provides 3 pages of questions to test students' mathematical knowledge and problem solving abilities.

Uploaded by

Imran
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Roll No. Total No.

of Pages: 03
Total No. of Questions: 07

BCA (2011 & Onward) / B.Sc.(IT) (2015 & Onwards) (Sem. – 1)


MATHEMATICS – I
M Code: 10045
Subject Code: BSIT/BSBC-103
Paper ID: [B1110]
Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATES:
1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains SIX questions carrying TEN marks each and students have to
attempt any FOUR questions.

SECTION A

1. a) If A, B are two sets the prove that B

o
A=B  A .m c

.r c
b) Find all the partitions of the set A = {a, b, c}.
c) Let X = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. The family{{1, 4, 8}, {3, 5, 9}, {2, 7}, {6, 10}} is a

p e o m
partition of X. Determine the equivalence relation corresponding to the above partition.
d) Let B = {2, 3, 4, 6, 12, 36, 48} and S be the relation “divide” on B, Draw Hasse diagram
of the relation S.

p a
e) Using truth table, prove that p → q = ( p)  q. .r c
b r p e
f) If p stands for the statement “I do not like chocolates” and q for the statement “I like ice-
cream”, then what does  p  q stands for?

a
rp
g) Show that the maximum number of edges in a simple graph with n vertices is

h) Give an example of a graph that has


a) Euler circuit but not Hamiltonian circuit.
b) Hamiltonian circuit but not Euler circuit.
b
i) Obtain the linear recurrence relation from the sequence defined by S(K) = 5.2K .

j) Solve the recurrence relation an  7an 1  10an  2  0, given by a0 = 0, a1=3.

M-10045 Page 1 of 3
SECTION B
2. State and prove De Morgan’s Laws for sets.

a c a c
For where ,  Q , where Q is the set of rational numbers, define a relation R as R if
b d b d
and only if ad = bc. Show that R is an equivalence relation on Q.
3. a) Let A = {2, 3, 5, 8}, B = {4, 6, 16}, C = {1, 4, 5, 7}. Let R={(a, b) : a/b}and
S {(b, c): b  c } be relations from A to B and B to C. Find the composite relation S ∘ R.
If L, M and N be the adjacency matrices of S ∘ R, R and S respectively.
Then show that L = M.N.
b) Check the validity of argument:
If I work, I cannot study. Either I work or pass mathematics.
I passed mathematics. Therefore, I study.

o m
4. a) Over the universe of Books, define the proposition B(x): x has a blue cover, M(x): x is a
mathematics book, U(x): x is published in United States and R(x, y): The bibliography

.r c
of x includes y.
Translate into words:

i) ( x)(M(x)   B(x)).

( x)(M(x)  U(x) → B(x))


p e o m
.r c
ii)

iii) ( x)(  B(x))

p a
iv)
b r
Express using quantifiers:
Every book with blue cover is a mathematics book.
p e
v)
a
There are mathematics books that are published outside the United States.
vi) Not all books have bibliography.

b rp
b) Use the principle of mathematical induction to prove

n( n  1( 2n  7 )
1.3 + 2.4 + 3.5 +……. + n(n+2) = , for any natural number n.
6

M-10045 Page 2 of 3
5. Using Dijkstra’s Algorithm, find shortest path from P to Q

o m
6. a) Find the minimal spanning tree for the following weighted connected graph using
Kruskal’s Algorithm.

.r c m
p e o
p a .r c
b r p e
a
rp
b) Solve S(K) - 8S(K - 1) + 16S(K - 2) = 0, where S(2) = 16, S(3) = 80.

b
7. a) Solve S(K) – 3S(K - 1) - 4S(K - 2) = 4K.

1 1 1
 
b) Find inverse of the matrix 1 2 5
1 3 4

M-10045 Page 3 of 3

You might also like