Discrete Mathematics

2
Biyani's Think Tank

Concept based notes
Discrete Mathematics
(BCA Part-I)
Varsha Gupta
M.Sc. (Maths) Revised by: Shiv Kishore Sharma
Lecturer Deptt. of Information Technology Biyani Girls College, Jaipur
For free study notes log on: www.gurukpo.com
Published by :
Think Tanks Biyani Group of Colleges
Concept & Copyright :
Biyani Shikshan Samiti

Sector-3, Vidhyadhar Nagar, Jaipur-302 023 (Rajasthan) Ph : 0141-2338371, 2338591-95 Fax : 0141-2338007 E-mail : acad@biyanicolleges.org Website :www.gurukpo.com; www.biyanicolleges.org
ISBN : 978-93-81254-37-3
Edition : 2011 Price :
While every effort is taken to avoid errors or omissions in this Publication, any mistake or omission that may have crept in is not intentional. It may be taken note of that neither the publisher nor the author will be responsible for any damage or loss of any kind arising to anyone in any manner on account of such errors and omissions.
Leaser Type Setted by : Biyani College Printing Department
Preface
am glad to present this book, especially designed to serve the needs of the
students. The book has been written keeping in mind the general weakness in understanding the fundamental concepts of the topics. The book is self-explanatory and adopts the Teach Yourself style. It is based on question -answer pattern. The language of book is quite easy and understandable based on scientific approach. Any further improvement in the contents of the book by making corrections, omission and inclusion is keen to be achieved based on suggestions from the readers for which the author shall be obliged. I acknowledge special thanks to Mr. Rajeev Biyani, Chairman & Dr. Sanjay Biyani, Director (Acad.) Biyani Group of Colleges, who are the backbones and main concept provider and also have been constant source of motivation throughout this Endeavour. They played an active role in coordinating the various stages of this Endeavour and spearheaded the publishing work. I look forward to receiving valuable suggestions from professors of various educational institutions, other faculty members and students for improvement of the quality of the book. The reader may feel free to send in their comments and suggestions to the under mentioned address. Author
Syllabus
B.C.A. Part-I
Number Systems : Natural Numbers, Integers, Rational Numbers, Real Numbers, Complex Numbers, Arithmetic Modulo a Positive Integer (Binary, Octal, Decimal and Hexadecimal Number Systems), Radix Representation of Integers, Representing Negative and Rational Numbers, Floating Point Notation. Binary Arithmetic, 2s Complement Arithmetic, Conversion of Numbers from One of Binary / Octal / Decimal / Hexadecimal Number System to other Number System, Codes (Natural BCD, Excess-3, Gray, Octal, Hexadecimal, Alphanumeric EBCDIC and ASCII), Error Codes. Logic and Proofs : Proposition, Conjunction, Disjunction, Negation, Compound Proposition, Conditional Propositions (Hypothesis, Conclusion, Necessary and Sufficient Condition) and Logical Equivalence, De Morgans Laws, Quantifiers, Universally Quantified Statement, Generalized De Morgans Laws for Logic, Component of Mathematical System (Axiom, Definitions, Undefined Terms, Theorem, Leema and Corollary), Proofs (Direct Proofs, Indirect Proofs, Proof by Contra-Positive), Valid Argument, Deductive Reasoning, Modus Ponens (Rules of Inference), Universal Instantiation, Universal Generalization, Existential Instantiation, Universal Generalization Resolution, Principle of Mathematical Induction, Structural Induction. Sets, Venn Diagrams, Ordered Pairs, Sequences and Strings, Relation (Reflexive, Symmetric, Anti-symmetric, Transitive, Partial Order), Inverse Relation (Injective, Subjective, bijective), Coposition of Functions, Restriction and Function Overriding, Function Spaces, Lambda Notation for functions, Lambda Calculus, Equivalence Relations, Interpretation using Digraphs. Cardinals, Countable and Uncountable Sets, Infinite Cardinal Numbers, Russells Paradox, Operations on Cardinals, Laws of Cardinal Arithmetic. Graph Theory, Undirected Graph, Digraph, Weighted Graph, Similarity Graphs, Paths and Cycles, Hamiltonian Cycles, Shortest Path Algorithm, Isomorphism of Graphs, Planar Graphs. Trees, Characterization of Trees, Spanning Trees, Breadth First Search and Death First Search Method, Minimal Spanning Trees, Binary Trees, Tree Traversals, Decision Trees and the Minimum Time for Sorting, Isomorphism of Trees.
Content
S.No. 1. Name of Topic Graph Theory 1.1 Simple Graph 1.2 Isomorphism 1.3 Dijekstra Algorithm 1.4 Non-Planarity 1.5 Matrix Representation 1.6 Regular Graph and Complete Graph Trees 2.1 2.2 2.3 2.4 Definition and Properties of Trees Prims Methods Tree Transversal m-ary and Full m-ary Tree
2.
3.
Number System 3.1 Conversion from Decimal to Binary Number System 3.2 Sum of Binary Numbers 3.3 Conversion from Decimal to Octal Number System 3.4 Conversion from Hexadecimal to Decimal Form Binary Arithmetics 4.1 2s Complement 4.2 8-bit 2s Complement 4.3 BCD Code 4.4 Gray Code 4.5 EBCDIC Code
4.
S.No. 5.
Name of Topic Sets 5.1 5.2 5.3 5.4 5.5 Power Set Operations on Sets Symmetric Difference of Two Sets De-Margans Law Russells Paradox
6. 7. 8.
Relations Functions Proportional Calculus 8.1 Converse, Inverse and Contraposition 8.2 De-Margans Law 8.3 Quantifiers Unsolved Papers 2011 to 2006
9.
Chapter-1
Graph Theory
Q.1 Ans.: Simple graph with one vertex V1 Draw simple graphs with one, two, three and four vertices.
Simple graph with two vertices
V1
V2
Simple graph with three vertices V1
V3 V2
Simple graph with four vertices
V4 V1
V3 V2
Q.2
Show that if G = (V, E) is a complete bipartite graph with n vertices then the n2 total numbers of edges in G cannot exceed . 4
Ans.: Let Kp,q be a complete bipartite graph. The total no. of edges in K p,q is p.q and n total no. of vertices will be (p+q). If we take p = q = then in complete bipartite 2 n n n2 n . graph K n no. of edges will be which is maximum (If two numbers , 2 2 2 2 4 are equal then their product is maximum). Hence in a complete bipartite graph of n2 n vertices the no. of edges cannot exceed . 4 Q.3 Show that following two graphs are not isomorphic. V5 V1 V2 V3 G Ans.: In graph G and G we find that (i) (ii) (iii) No. of vertices in G = No. of vertices in G = 6. No. of edges in G = No. of edges in G = 5. No. of vertices of degree one in G and G = 3. No. of vertices of degree two in G and G = 2 No. of vertices of degree three in G and G = 1 i.e. Number of vertices of equal degree are equal. Although it satisfies all the three conditions but then also G and G are not isomorphic because corresponding to vertex V4 in G there should be a vertex U3 because in both G and G there is only one vertex of degree three. But two pendent V4 V6 G U1 U2 U6 U3 U4 U5
10
vertices V5 and V6 are incident on the vertex V4 in G whereas only one pendent vertex U6 is incident on the vertex U3 in G. Hence G and G are not isomorphic. Q.4 Define the followings :(i) Ans.: (i) Walk (ii) Trail (iii) Path (iv) Circuit (v) Cycle Walk : An alternating sequence of vertices and edges is called a Walk. It is denoted by W. Example : a e1 e6 e5 e Figure (1) Here W = ae1 b e2 c e3 d is a walk. Walk is of two types :(a) Open Walk : If the end vertices of a walk are different then such a walk is called Open Walk. Example from fig.(1) : W = a e1 b e2 c e3 d is an open walk. (b) Closed Walk : If a walk starts and end with same vertex then such a walk is called closed walk. Example from fig.(1) : W = a e6 e e5 b e1 a is a closed walk as it starts and end with same vertex a. (ii) Trail : An open walk in a graph G in which no edge is repeated is called a Trail. Example from fig.(1) : (iii) W = a e1 b e2 c e3 d is a trail. Path : An open walk in which no vertex is repeated except the initial and terminal vertex is called a Path. b e2 c e4 e3 d
11
Example for fig.(1) : W = a e1 b e4 d e3 c is a path. (iv) (v) Circuit : A closed trail is called a Circuit. Example for fig.(1) : W = a e1 b e5 e e6 a is a circuit. Cycle : A closed path is called a Cycle. Example for fig.(1) : W = a e1 b e5 e e6 a is a cycle. Q.5 Find the shortest path between the vertex a and z in the following graph. b 4 a 3 c
a 0 0 0 0 0 0 0 0 b 4 4 4 4 4 4 4 c 3 3 3 3 3 3 3
5 3 33 6
d 1
5 2
f 7 z 4 g
f 11 11 11 11 g 12 12 12 h 18 16
e
d 6 6 6 6 6 6
5
e 9 9 7 7 7 7
Ans.: First we label the vertex a by permanent label 0 and rest by .
Hence shortest path is a c d e g z = 16 Q.6 Prove that K5 is non-planar. Ans.: Let the five vertices of K5 be V1, V2, V3, V4 and V5. Since K5 is a complete graph so every vertex of K5 is joined to every other vertex by means of an edge. Therefore
12
we must have a circuit going from V1 to V2, to V3, to V4, to V5 and to V1 i.e. a pentagon. V2 V1 V3 V1 V2 V3
V5 (a) V2 V1
V4
V5 (b) V2
V4
V3
V1
V3
V5 (c)
V4 V2 V1 V3
V5 (d)
V4
V5 (e)
V4
Since vertex V1 is to be connected to V3 by means of an edge, this edge may be drawn inside or outside the pentagon (without intersecting the five edges drawn previously). Suppose we draw a line from V1 to V3 inside the pentagon. Now we have to drawn an edge from V2 to V4 and another one from V2 to V5. Since
13
neither of these edges can be drawn inside the pentagon without crossing over the already drawn edge. We draw both these edges outside the pentagon. Now the edge from V3 to V5 cannot be drawn outside the pentagon without crossing the edge between V2 to V4. Therefore V3 and V5 have to be connected with an edge inside the pentagon. Now we have yet to draw an edge between V1 and V4. This edge cannot be placed inside or outside the pentagon without a crossover. Hence K 5 is not a planar graph. Q.7 State and prove Handshaking Theorem.
Ans.: Handshaking Theorem : The sum of degrees of all the vertices in a graph G is equal to twice the number of edges in the graph. Mathematically it can be stated as :
deg(v)
v V
2e
Proof : Let G = (V, E) be a graph where V = {v1, v2, . . . . . . . . . .} be the set of vertices and E = {e1, e2, . . . . . . . . . .} be the set of edges. We know that every edge lies between two vertices so it provides degree one to each vertex. Hence each edge contributes degree two for the graph. So sum of degrees of all vertices is equal to twice the number of edges in G. Hence
v V
deg(v)
2e
Q.8
Explain Matrix Representation of Graphs.
Ans.: Although a pictorial representation of a graph is very convenient for a visual study, other representations are better for computer processing. A matrix is convenient and useful way of the representation of a graph to a computer for a graph. There are different types of matrices : (i) (ii) (iii) Incidence Matrix Circuit Matrix Adjacency Matrix
14
(iv)
Path Matrix etc.
Q.9 How many edges are there with 7 vertices each of degree 4? Ans.: In graph G, there are 7 vertices and degree of each vertex is 4. So sum of the degrees of all the vertices of graph G = 7 x 4 = 28. According to Handshaking Theorem
deg(v)
v V
2e
28 = 2e e = 14
So, total no. of edges in G = 14. Q.10 Define Regular and Complete Graph. Ans.: Regular Graph : A simple graph G = (V, E) is called a Regular Graph if degree of each of its vertices are equal. Examples : 1V1 V2 Here degree of each vertex is one. So it is regular graph.
2V1 3V4 V1
V3 V2 V3 V2
Degree of each vertex is two.
Degree of each vertex is two.
15
Complete Graph : A simple graph G = (V, E) is called a Complete Graph if there is exactly one edge between every pair of distinct vertices. A complete graph with n-vertices is denoted by Kn. K1 K2 K3
K4 K5 K6 In a complete graph Kn total no. of edges = i.e. size of Kn =

n(n 1) 2
n(n 1) 2
Multiple Choice Question 1. The graph is : u v
(a) (b) (c) (d)
Simple graph Directed graph Directed multigraph Pseudograph
16
2. In the graph the vertices of equal degree are : a u v d e (a) a and b (b) b and c (c) b and d (d) a and d 3. The number of edges in a graph with 10 vertices each of degree 6 are : (a) 60 (b) 120 (c) 15 (d) 30 4. The cycle C6 is also: (a) a wheel (b) a bipartite graph (c) not a complete graph (d) a complete bipartite graph 5. The adjacency matrix for the graph is given below:
The value of x is :
17
(a) 1 (b) 2 (c) 3 (d) 4 6. The length of path a,b,d,e,b in the following graph is :
C b a
(a) 2 (b) 4 (c) 3 (d) 5 7. The true statement is : (a) There is a simple path between every pair of distinct vertices of a connected directed graph. (b) There is a simple circuit between every directed graph (c) If there is a path then there is a circuit (d) All the above statements are true. 8. In the following graph, the true statement is : (a) No Euler path but Euler circuit exists (b) Euler path but no Euler circuit exists (c) Euler circuit anct Euler path both exist (d) None of the above statement is true 9. In the following weighted simple graph the length of the shortest path from p to r is: U 3 t 4 2 2 p 3 r 2 1 q 3 s (a) 8 (b) 6
18
(c) 9 (d)10 10. The planner graph is : (a) K3.3 (b) Q3 (c) K4.4 (d) K5 11. Let G be a connected planner simple graph with e edges and v vertices. If r is the number of regions in its planner representation, then: (a)r=2+e-v (b) r=2-e+v (c)r=2+e+v (d)r=e+v 12. The chromatic number of a planner graph is not greater than: (a) 3 (b) 5 (c) 2 (d) 4 13. If a connected planner simple graph has e edges and v vertices with v and no circuits of length 3, then (a) e (b) e (c) (d) e 14. If G is a connected planner simple graph with e edges and v vertices where v 3 then: (a) e (b) e (c) (d) e 15. A graph is non planner if and only if it contains a sub graph homeomorphic to: (a) C6 (b) Q3 (c) 2.2 (d) K3.3 or K5 16. The chromatic number of a complete bipartite graph is (a) 1 (b) 2 (c) (d) 4 17. How many colors are required to color properly the following graph.
(a) 1 (c)
(b) 2 (d) 4
19
18. A graph has n vertices then how many edges contained by a Hamiltonian path. (a) n-1 (b) n (c) (d) n+2 19. In a graph there are 7 vertices each of degree 4 , then the number of edges in the graph is : (a) 4 (b) 7 (c) (d) 28 20. Out degree of the vertex V4 in the following diagraph is : V1
v2
v5
v3
v4
(a) 4 (c)
(b) 7 (d) 28
1-d 11-a
2-b 12-d
3-d 13-a
4-a 14-b
5-a 15-b
6-b 16-b
7-a 17-b
8-b 18-b
9-b 19-c
10-b 20-b
20
Chapter-2
Trees
Q.1 Define a Tree. Prove that there is one path between every pair of distinct vertices in a Tree T.
Ans.: Tree : A Tree is a connected graph without any circuit i.e Tree is a simple graph.
Trees with one, two, three, and four vertices. Proof : Since T is a connected graph. Let a and b be any two vertices of T. If it is possible let there are two different paths between the vertices a and b. P = a u1, u2, . . . . . . . . . . um b and Q = a v1, v2, . . . . . . . . . . vn b are those two different paths between a and b. In both these paths vertices after a can be common also. Let w be the first common vertex then for any i and j W = ui = v j Where i = 1, 2, . . . . . . . . . . m j = 1, 2, . . . . . . . . . . n Then we get a cycle a u1, u2, . . . . . . . . . . ui-1 , ui , vj-1 , vj-2 , . . . . . . . . . . v2, v1 a
21
which contradicts our assumption that T is a Tree. Hence there is only one path between a and b.
Q.2
A Tree with n-vertices has (n-1) edges.
Ans.: Let T be a tree having n vertices. We shall prove the theorem by mathematical induction. If n=1 then T contains only one vertex and 1-1=0 edges. Hence the theorem is true for n=1. Let it be true for k vertices. Now we shall prove it for (k+1) vertices. Since T is a connected graph so let P be a path of maximum length in T. P cannot be a circuit. Hence P contains atleast one vertex of degree one. Let this vertex be v. Now this vertex v and edge incident on it are eliminated from T so that we obtain a new tree T* which contains k vertices. According to our assumption T* contains (k-1) edges. Now if in T* the vertex v and edge is again included we again get T in which no. of edges are k. Hence the theorem is true for (k+1) vertices also. Thus by mathematical induction theorem is true for all n N. Hence proved. Q.3 If G is an acyclic graph with n vertices and k connected components then G has (n-k) edges.
Ans.: Proof : Let G be an acyclic graph. Let G1, G2, . . . . . . . . . . GK be its k connected components. For every i (1 i k ) ith component Gi has ni vertices then clearly n1 + n2 + n3 +. . . . . . . . . .+ nK = n Again since every Gi is a tree. Hence no. of edges in every Gi will be (ni-1) so total no. of edges in G = (n1 1) + (n2 1) + . . . . . . . . . . + (nk 1) = (n1 + n2 + . . . . . . . . . . + nk) k =nk Hence proved. Q.4 Find eccentricity, centre radius and diameter of the following graph. Eccentricity : V1 V2 Ans.: (i)
22
E(V1) = 2 E(V2) = 2 E(V3) = 1 E(V4) = 2 (ii) minimum eccentricity. (iii) (iv) Radius : Radius (eccentricity of the centre) = 1 Diameter : Maximum eccentricity = 2 Diameter of the given graph = 2 V4 Centre : Centre of the given graph is the vertex V3 because it has V3
Q.5 Ans.:
Prove that every tree has either one or two centres. Let T be a tree if T contains only one vertex then this vertex will be centre of T. If T contains two vertices then both vertices are centre of T. Now let T contains more than two vertices. The maximum distance max.d (v, vi) from a given vertex v to any other vertex vi occurs only when vi is a pendent vertex. Tree T must have two or more pendent vertices. Delete all pendent vertices form T. The resulting graph T is still a tree in which the eccentricity of all vertices is reduced by 1. Hence the centre of T will also be centre of T. From T, we can again remove all pendent vertices and we get another tree T. We continue this process until we are left with a vertex or an edge. If a vertex is left then this vertex is the centre and if an edge is left then both its end vertices are centre of T. Example : e(6) d(5) f(6) g(6) h(6)
23
m(6) a(6) b(5) c(4) i(5) Removing all pendent vertices d(4) j(3) k(4) l(5) n(6)
b(4)
c(3)
j(2)
k(3)
l(4)
Removing all pendent vertices
c(2) Q.6 Ans.:
j(1)
k(2)
j (centre)
Find minimal spanning tree for the following weighted graph (use Primes Method). V1 3 V2 3 V3 4 V4 3 4 5 1 2 1 4 V6 2 V5
24
V1 V1 V2 V3 V4 V5 V6 3 3 1 4 1 V3
V2 V2 3 3
VV 1 3 3 3 1 4 4 1
V4 1 V6 5 4 2 V5 1
V5 4 2 2
V6 1 4 2
3 3 5
V4 Minimal Spanning Tree Q.7 Ans.: b e k Pre-order In-order Post-order : : : l m abeklmfgchdij kelmbfgachidj klmefgbhcijda f g Write Pre-order, In-order and Post-order transversal of the following graph. a c h i d j
25
Q.8
Define m-ary and Full m-ary Tree. Gives an example for each.
Ans.: m-ary Tree : A rooted tree is said to be m-ary Tree if every internal vertex or branch node has not more than m-children. a b e g 2 Ary Tree Full m-ary Tree : A rooted tree is said to be Full m-ary Tree if every internal vertex or branch node has exactly m-children. a1 a3 a2 a8 a5 a6 Q.9 Ans.:
*235/ 23 234
c d f h
a4 a9 a10 a11 Full 3 Ary Tree a12 a13 a7
Find the value of following prefix expression.
*235 / 84
8/ 4
*2352
2 x3
*652
6 5
12
26
1 2
3
Q.10 In any tree with 2 or more vertices there are atleast two pendent vertices. Ans.: Let T be a tree with n vertices and (n-1) edges. Since all the edges are connected with 2 vertices at a time. Hence the sum of the degree of all the vertices is = 2 x (no. of edges) = 2 x (n - 1) = 2n 2 Now, we have to prove that in tree T there are atleast two vertices of degree one and rest of vertices are of degree two or higher. Since no vertex in T has zero degree so let us assume that there is only one vertex of degree one and rest (n-1) vertices are of degree two or higher. Then the sum of the degrees of vertices is 1 + 2(n 1) = 2n 1 which is contradiction of (2n 2). Hence there is another vertex of degree one. If we take two vertices of degree 1 and remaining (n - 2) vertices of degree 2 or more than two then sum of the degrees of vertices = 2 + 2(n 2) = 2n 2 which is correct. Hence proved.
Multiple Choice Question

1 . The correct statement is : (a) A tree contains multiple edges (c) tree is a simple graph graph (b) A tree contains loops (d) A tree is a connected directed
2 . In a binary tree every internal vertex contains : (a) Exactly two children (b) Two children or more (c) (d) Any number of children 3. A rooted m-ary tree of height h is balanced if all the leaves are at level.: (a) h-2 (b) h or (h-1) (c) (d) 4. The maximum number of leaves in an m-ary tree of height h are :
27
(a) hm (c) mh-1 5. The preorder traversal to tree T IS e k j I o T (a) j e k n o p (c) e j k n o p 6. The in-order traversal of tree T1 is : e k j n o T1 (a) j e k n o p (c) e j k n o p 1. j k n o T2
(b) hm+h (d) mh
(b) j e n k o p (d) j e k p o n
(b) j e n k o p (d) j e k p o n The post order traversal of tree T2 is : e p
28
(a) j n o p k e (c) j k e n o p 9. A spanning tree of a graph G contains (a) All vertices of G (c) Maximum two vertices G
(b) j e k n o p (d) p o n k e j (b) At least one vertex of G (d) All the edges of G
10. The correct statement is : (a) A connected simple graph may not have a spanning tr (b) A simple graph is connected if and only if has a spanning tree (c) A simple graph is connected if it has a spanning tree (d) None of the above is true 11. What will be the right preorder of following graph: a
b h d e f g (a) abdechfthgi (c) debfgihca 1-c 2-a 3-b 4-d 5-c (b) dbeafeghi (d) none of the above 6-b 7-a 8-c 9-a 10-c i
29
Chapter-3
Number System
Q.1 Convert (111001101)2 into decimal form and 96 into binary number.
1* 28 1* 27 1* 26 0* 25 0* 2 4 1* 23 1* 2 2 0* 21 1* 2 8
Ans.: (111001101) 2
256 128 64 0 0 8 4 0 1
(461)10
For converting 96 into binary number 2 2 2 2 2 2 96 Remainders 48 . . . . . . . . . . . . . . . 0 24 . . . . . . . . . . . . . . . 0 12 . . . . . . . . . . . . . . . 0 6 ...............0 3 ...............1 1 ...............1 (96)10 = (110000) 2
Q.2
Find the value of (195) 10 + (105)10 in binary code. So, we have to find (300) 10
Ans.: Since (195 + 105) = 300
300
Remainders
30
2 2 2 2 2 2 2
150 . . . . . . . . . . . . 0 75 . . . . . . . . . . . . 0 37 . . . . . . . . . . . . 1 18 . . . . . . . . . . . . 1 9 4 2 1 1 ............0 ............1 ............0 ............0 ............1 (195)10 +(105)10 = (100101100) 2
Q.3 Ans.:
Convert (175) 10 into hexadecimal number. 16 16 175 Remainder (175)10 = (AF) 16 10 . . . . . . . . . . . . 15 = F 10 . . . . . . . . . . . . 10 = A
Q.4 Ans.:
Find the sum of (1011)2 and (10111)2. 0 1 1 So, 0 1 0 0 0 1 0 1 1 1 1 1 0
(1011)2 + (10111)2 = (100010) 2
Q.5 Ans.:
Find fixed point representation for the decimal no. 3.056 E-5. 3.056 E-5 = 3.056 x 10-5 = 0.00003056
31
Q.6
Convert the decimal number 692.625 into octal form. 8 8 8 692 Remainders
Ans.: Integral Part : 86 . . . . . . . . . . . . 4 10 . . . . . . . . . . . . 6 1 1 Fractional Part : 0.625 x8 5.000 So, Hence, Q.7 Ans.: 0.625)10 = (.5)8 (692.625)10 = (1264.5)8 ............2 ............1 (692)10 = (1264)8
Convert hexadecimal no. ABC.2 into decimal form. (ABC.2)16 = = = A x 162 + B x 161 + C x 160 + 2 x 16-1 10 x 256 + 11 x 16 + 12 x 1 + 2 x 0.0625 2748.125
Multiple Choice Questions 1Which of the following number -1,1,2,3 are natural number s? (a) All (b) Only-1,2,3 (c) Only-1 (d) None 2. (a) (c) Is 2 an integer or a rational number Both Rational number
(b) Integer (d) None
32
3. (a) (c) 4. (a) (c) 5. (a) (c) 6. (a) (c)
Solution of the equation x+5=3 is a/an: Natural number (b) Integer No solution (d) None of the above Solution of the equation x2+1=0 is a : Real number Rational number
(b) Complex number (d) None of the above
Solution of the equation 2x=3 is a/an: Rational number (b) Integer None of the above (d) Natural Number The total number of symbols used to represent a number in Hexadecimal number system is : 16 (b) 15 6 (d) 8
7. The base or radix of octal number system is : (a) 7 (b) 8 (c) 2 (d) 16 8. The decimal number 25 is binary number system can be written as : (a) 100112 (b) 110012 (c) 101012 (d) None of the above 9. What is the normalized floating-point representation for the decimal number 15.854 ? (a) 1.5854E+1 (b) .15854E+2 (c) .015854E+3 (d) None of the above 10. Fill in the correct number at the place of question mark 1010102=?8 (a) 210 (b) 222 (c) 52 (d) None of the above
33
11. The value of 67458+3768 is : (a) 71218 (c) 73433 12. Addition of 10102 and 1102 is : (a) 100002 (c) 11012 13. 100002-1012 is equal to : (a) 110112 (c) 1112 14. is : (a) a real number (c) an integer
(b) 73238 (d) None of the above
(b) a rational number (d) None of the above
15. Which of the following statements is false? (a) All the natural numbers are integers (b) All the rational number are integers (c) All the rational numbers are real number (d) All the number are real numbers 16. The decimal equivalent of the bineary number (-10011)2 is: (a) -12 (c) -19 (b) -15 (d) -21
17. The number (680)10 of the decimal system is equivalent to which number in octal system? (a) (85)8 (b) (1012)8
34
(c) (1250)8
(d) (1300)8
18. The symbol N stand for the set of : (a) Real numbers (c) Integers (b) Natural numbers (d) Rational numbers
19. 13/5 is a : (a) Irrational number (c) Integer (b) Rational number (d) none of the above
20. Which is the decimal equivalent of the binary number 000100112 (a) 6 (c) 19 Answer Key : 1-b 11-c 2-a 12-a 3-b 13-d 4-b 14-a 5-a 15-b 6-a 16-c 7-b 17-c 8-b 18-b 9-c 19-b 10-b 20-c (b)11 (d) 35
35
Chapter-4
Binary Arithmetic's
Q.1 Find 2s complement of the binary no. 1101100. Adding 1 to this 0 0 So, Q.2 Ans.: 0 0 1 1 0 0 0 1 1 + 0 1 1 0
Ans.: 1s complement of 1101100 is 0010011
2s complement is 0010100.
Find 8-bit 2s complement of (35)10. (35)10 Let X = = = (100011)2 (00100011)2 00100011 = = 11011100 11011100 +1 11011101 So, 8-bit 2s complement of (35)10 is 11011101 (12)10 = (0001 0010)BCD
1s complement of X 2s complement of X
Q.3 Ans.:
Write BCD code for decimal number 12.
36
Q.4 Ans.: Q.5 Ans.:
Write Gray code of the no. (1111)2. Gray code of (1111)2 is 1000. Represent SHORT in EBCDIC code. 11100010 S 11001000 H 11010110 O 11011001 R 11100011 T
Multiple Choice Questions

1. 1s complement of the number 1011001 is (a) 0100110 (c) 0110010 (b) 1100110 (d) 0110011
2 . 2s complement of the number 1011001 is (a) 0100110 (c) 1110010 3 . Natural BCD code of 4210 is : (a)01000010 (c)010010 4 . Natural BCD code of 4210 is : (a)01000010 (c)010010 5.
(b)0100111 (d) None of the above
The Gray code of a number whose binary representation is 1000 is : (a)0110 (b) 0111 (c)1100 (d) 0100 EBCDIC is a code with : (a) 8 bits (c) 4 bits
6.
(b) 6bits (d) None of the above
37
7.
In ASCII, the symbol II stands for : (a) International information (c) Information Interchange Most of the errors occur at : (a) One bit position (c) Three bit position The parity bit is : (a) (b) (c) (d)
(b) International Information (d) International Interchange (b) Two bit position (d) None of the above
8-
9-
A bit at one position in any transmitted An extra bit attached to each code word for detecting the error An extra bit attached to each code word for correcting the error None of the above (b) Error deducting code (d) None of the above
10-
Hamming code is a : (a) Gray code (c) Error correcting code
11-
2s complement of the 2s complement of a number is : (a) Double the number (b) Half of the number (c) Ten times the number (d) The number it self 1s complement of the number 010101012 is : (a) 101010102 (b) 101010112 (c) 010101002 (d) 010101012 1s complement of the number 010101012 is : (a) 101010102 (b) 101010112 (c) 010101002 (d) 010101012 The Gray code of the number 01002 : (a) 101010102 (c) 010101002 1-a 11-d 2-b 12-a 3-d 13-d 4-a 5-c (b) 101010112 (d) 010101012 6-a 7-c 8-a 9-b 10-c
12-
12-
13-
38
Chapter-5
Sets
Q.1 Define Power Set. Write Power Set of A = {1, 2, 3}.
Ans.: Let B be a set then the collection of all subsets of B is called Power Set of B and is denoted by P(B). i.e. P(B) = {S : S B} If A = {1, 2, 3} Then P(A) = {, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}} Q.2 Explain the following operations (a) Union Ans.: (a) (b) Intersection (c) Difference Union : Let A and B be two sets then union of A and B which is denoted as A B is a set of elements which belongs either to A or to B or to both A and B. So,
A B {x : x A.or.x B}
Example : If A = {1, 2, 3, 4} and B = {3, 4, 5, 6} then A B = {1, 2, 3, 4, 5, 6} U
A B
(b) Intersection : Intersection of A and B which is denoted as A B is a set which contains those elements that belong to both A and B. So,
A B {x : x A.and .x B}
39
Example : If A = {1, 2, 3, 4} and B = {3, 4, 5, 6} then A B = { 3, 4}
A B
(c) Difference : Let A and B be two sets. The difference of A and B which is written as A - B, is a set of all those elements of A which do not belongs to B. So, Similarly,
A B {x : x A.and .x B}
A}
B A {x : x B.and .x
Example : If A = {1, 2, 3, 4} and B = {3, 4, 5, 6} then A - B = { 3, 4} and B A = {5, 6}
B AB
A B-A
Q.3
Define symmetric difference of two sets If A = {2, 3, 4} and B = {3, 4, 5, 6}, Find A B.
Ans.: Let A and B be two sets, the symmetric difference of A and B is the set ( A B) ( B A) and is denoted by A B or A B
U For free study notes log on: www.gurukpo.com
40
Thus, A B ( A B) ( B A) = {x : x
A B}
A = {2, 3, 4} and A B = {2} and
B = {3, 4, 5, 6} B A = {5, 6}
A B ( A B) ( B A) {2} {5,6} {2,5,6}
A B
Q.4 State De Margans Law. (i) Q.5
( A B)' A ' B '
Ans.: If A and B are any two sets then and (ii)

( A B)' A ' B '
Prove the following relation

n( A B) n( A) n( B) n( A B)
Ans.: If A and B are two sets then we know that

A B ( A B ') ( A B) ( A ' B)
Hence by sum rule

n( A B) n( A B ') n( A B) n( A ' B)
(1)
Again A ( A B ') ( A B) By sum rule

n( A) n( A B ') n( A B)
(2) (3)
Similarly
n( B) n( A B) n( A ' B)
Now eq^(2) + eq^(3) gives

n( A) n( B) n( A B) n( A B) n( A B ') n( A ' B)
41
=>
n( A) n( B) n( A B) n( A B) n( A B ') n( A ' B)
From eq^(1)
n( A) n( B) n( A B) n( A B)
Hence proved. Q.6 State and prove Rusells Paradox.
Ans.: See B.C.A. (Discrete Mathematics) CBH Pg. 4.22 Article No. 4.20.
42
Chapter-6
Relations
Q.1 Prove that AxB Ans.: A = {a, b} BxA and B = {1, 2, 3}
A x B = { (a, 1) (a, 2) (a, 3) (b, 1) (b, 2) (b, 3)} B x A= { (1, a) (1, b) (2, a) (2, b) (3, a) (3, b)} Here A x B Q.2 BxA
Show that the relation is congruent to on the set of all triangles in plane is an equivalence relation.
Ans.: Proof : Let S be the set of all triangles in a plane and R be the relation on S defined by ( 1 , 2 ) R triangle 1 is congruent to triangle 2 . (i) Reflexivity : for each triangle
( , ) R
S , we have
S
R is reflexive on S. (ii) Symmetry : Let

( 1,
1
and
) R
S such that ( 1 ,
1
R , then
R is symmetric on S. (iii) Transitivity : Let

1
S such that ( 1 ,
R and (
R , then
43
( 1, (
2
2 3
) )
1
R R
2
3 2 3 1 3
Since
and
So, R is transitive. Hence R is on equivalence relation. Q.3 Let N be the set of all natural numbers and Let R be a relation on Nx N, defined by (a, b) R (c, d) ad = bc for all (a, b), (c, d) N x N. Show that R is an equivalence relation on Nx N. Reflexivity : Let (a, b) be an arbitrary element of N x N, then
(a, b) NxN a, b N
Ans.: (i)
ab ba
(a, b) R (b, a) (by commutativity of multiplication on N) Thus (a, b) R (b, a) for all (a, b) NxN . So, R is reflexive. (ii) Symmetry : Let (a, b), (c, d) (a, b) R (c, d) N x N be such that (a, b) R (c, d), then
ad
bc
cb da
(by commutativty of multiplication on N) (c, d) R (a, b) Thus, (a, b) R (c, d) N (iii) Transitivity: Let (a, b), (c, d), (e, f) (c, d) R (e, f), then (a, b) R (c, d) and (c, d) R (e, f) (c, d) R a, b) for all (a, b), (c, d) Nx
So, R is symmetric on N x N. N x N be such that (a, b) R (c, d) and
ad
bc
cf de
44
(ad )(cf ) (bc)(de) af be
(a, b) R (e, f) Thus (a, b) R (c, d) and (c, d) R (e, f) b), (c, d), (e, f) N x N So, R is transitive. Hence, R being reflexive symmetric and transitive is an equivalence relation on N x N. Q.4 Prove that the relation congruence modules m on the set z of all integers is an equivalence relation. Reflexivity : Let a be an arbitrary integer, then aa=0=0xm a a is divisible by m a Thus, a (ii) Symmetry : Let a, b a ab= a (mod m) a (mod m) for all a z such that a b is divisible by m z z - z] [ m for all z (a, b) R (e, f) for all (a,
Ans.: (i)
So, congruence modules m is reflective. b (mod m) b a = (- )m b (iv) a (mod m) z such that a b (mod m) and b c (mod m),
(b a ) is divisible by m So, congruence modules m is symmetric on Z. Transitivity: Let a, b, c then a ab=
b (mod m)
1
a b is divisible by m
1
m for some
45
c (mod m) bc=
2
b c is divisible by m
2
m for some
1
z
2
(a b) + (b c) = (a c) = a
3
m+ +
2
m z} (
3
c (mod m)
So, congruence modules m is transitive. Hence, congruence modules m is an equivalence relation. Q.5 If A = {1, 2, 3, 4, 5, 6, 7} which of the following two is a partition giving rise to an equivalence relation. (i) (ii) Ans.: (i) A1 = {1, 3, 5} B1 = {1, 2, 5, 7} A2 = {2} B2 = {3} A A3 = {4, 7} B3 = {4, 6}
Since A1 A2 A3 = {1, 2, 3, 4, 5, 7}
So sets A1 , A2 , A3 do not form a partition of A. (ii) Since B1 B2 B3 = {1, 2, 3, 4, 5, 7} =A and B1 , B2 , B3 are disjoint sets. Hence B1 , B2 , B3 form a partition of A. Q.6 If R and S are two equivalence relations on a set A, then prove that R S is an equivalence relation.
Ans.: It is given that R and S are equivalence relation on A. We have to show that R S is an equivalence relation. (i) Reflexivity : Let a A then S [ R & S are reflexive] R S A such that (a, b) R S (a, b) R S S (a, a) R and (a, a) (a, a) Thus (a, a) (ii) Symmetry : Let a, b (a, b)
R S for all a A, so R S is a reflexive relation on A. R and (a, b)
46
(b, a) (b, a) Thus (a, b) (iii) Transitivity: Let a, b, c (a, b) (a, b) (a, b) (a, b) R S
R and (b, a) R S (b, a) R S
[ R & S are symmetric]
R S is symmetric relation. A such that (a, b) R S S and (b, c) (a, c) (a, c) S R S (a, c) R S R and (b, c) S R [ R is transitive] S [ S is transitive] R and (a, b) R S R S and (b, c) R S R S and (b, c) R and (b, c) S and (b, c) R S R S and (b, c)
(a, c) (a, c)
R and (a, c)
Thus (a, b)
So, R S is transitive Hence R S is an equivalence relation on A.
Q.7
Represent the following relation by digraph. R = {(1, 1), (1, 4), (1, 3), (2, 1), (2, 2), (3, 4), (4, 1)}
Ans.: Digraph is :-
47
Q.8
If A = {1, 2, 3} , B = {4, 5, 6} which of the following are relation from A to B. Give reason in support of your answer. R1 = {(1, 4), (1, 5), (1, 6)} Clearly R1 (ii) (iii) Clearly R2 A x B. So, it is a relation from A to B. A x B. So, it is a relation from A to B. A x B. So, it is not a relation. R2 = {(1, 5), (2, 4), (3, 6)} R3 = {(4, 2), (2, 6), (5, 1), (2, 4)} Since (4, 2) R4 but (4, 2)
Ans.: (i)
48
Chapter-7
Functions
Q.1 Ans.: A = {-1, 0, 2, 5, 6, 11} and B = {-2, -1, 0, 18, 28, 108} and f(x) = x2 x-2 find f(A). Is f(A) = B? f(-1) = (-1)2 (-1) 2 = 0 f(0) = 0 0 2 = -2 f(2) = (2)2 2 2 = 0 f(5) = (5)2 5 2 = 18 f(6) = (6)2 6 2 = 28 f(11) = (11) 2 11 2 = 108 f(A) = {f(x) : x A} = {f(-1), f(0), f(2), f(5), f(6), f(11)} = {0, -2, 18, 28, 108} We observe that -1 B but -1 f(A) So f(A) Q.2 If a, b (a) Ans.: (a) B
{1, 2, 3, 4} then which of the following are functions. f1 = {x, y : y = x + 1} (b) f2 = {(x, y) : x + y > 4} Here f1 = {(1, 2), (2, 3), (3, 4)} We observe that an element 4 of the given set has not mapped to any element of {1, 2, 3, 4}. So f1 is not function.
(b)
f2 = {(1, 4), (4,1), (2,3), (3, 2), (2, 4), (4, 2), (3, 4), (4, 3)} Here we observe that 2, 3, 4 are mapped to more than element of the set {1, 2, 3, 4}. So f2 is not a function.
49
Q.3
Prove that function f : QQ given by f(x) = 2x - 3 f(x) = f(y) 2x = 2y (ii) 2x 3 = 2y 3 x=y
x Q is a bijection.
Ans.: (i)
Injectivity : Let x, y be two arbitrary elements in Q then
So f is injective map. Surjectivity : Let y be an arbitrary element of Q f(x) = y

x y 3 2
2x 3 = y
Clearly for all y There exist x
Q,
y 3 . Thus for all y 2 x
Q (Codomain)
Q (domain) given
y 3 such that 2
f(x) = f(
y 3 y 3 ) = 2( )3=y 2 2
Thus every element in the co-domain has its pre-image in x. So f is surjective. Hence f : QQ is a bijection. Q.4 Ans.: If f : RR such that f(x) = x2 and g : RR such that g(x) = 2x + 1 then prove that gof fog = = = Now (fog)(x) = = = g{f(x)} g(x2) 2(x2) + 1 f{g(x)} f(2x + 1) (2x + 1)2 = 2x2 + 1 (gof)(x)
50
Since 2x2 + 1 So, Q.5 gof
(2x + 1)2 fog
Define the following functions (1) (2) (3) Constant Function Identify Function Modulus Function
Ans.: Constant Function : A function f : RR is a constant function if f(x) = c for all x R where C is a real constant. y f(x) = C x y Identify Function : A function f : RR is known as identify function if f(x) = x for all x R y f(x) = x x 0 x x
y Modulus Function : A function f : RR defined by f(x) = x, -x, x 0 x<0
is called the modulus function and is denoted by x . y
51
y = -x x
y=x x
y Q.6 Prove that the identity function on a set A is a bijection. IA (x) = (x) for all x A (i) Injectivity : Let x, y be any two elements of A, then IA (x) = IA (y) x=y So IA is an injective map. (ii) Surjectivity : Let y A then there exist x = y A such that IA (x) = x =y So IA is surjective map. Hence IA is bijection. Q.7 Show that the function f : RR given by f(x) = Cos x for all x one-one nor onto. R is neither =1 [By definition of IA]
Ans.: The identity function IA : AA is defined as
Ans.: Injectivity : We know that f(0) = Cos 0 = 1 and f(2 ) = Cos 2 Hence f is not an injective.
So different elements in R may have the same image. Surjectivity : Since the value of Cos x lie between -1 and 1, it follows that the range of f(x) is not equal to its co-domain so f is not surjection.
52
Q.8
Show that f : NN defined by f(x) =
n 1 , if n is odd 2
n , 2
if n is even
is many one function. Ans.: We observe that

f (1) 1 1 1 2
and
f (2)
2 1 2
Thus 1 2 but f(1) = f(2) so f is many-one function. Q.9 Let f : RR and g : RR be defined by f(x) = x + 1 and g(x) = x 1, show that fog = fog (x) gof = = = = = gof(x) = = = = IR(x) fog = = gof IR f[g(x)] f[x - 1] (x 1) + 1 x g[f(x)] g[x + 1] (x + 1) - 1 x x = IR (2) (3) (1)
Ans.: Since f : RR such that f(x) = x + 1 and g : RR such that g(x) = x 1
So by equation (1), (2) and (3), we find that
53
Q.10 Check whether the function f(x) = x is injective and surjective or not? Ans.: Given function f(x) = x (i) Injectivity : Since 1 R and -1 R
1 = 1 and
1 =1
So different elements in R may have the same image. Hence f is not an injection. (iii) Surjectivity : Since x = x and
x =x
So all negative and positive elements are mapped to positive element. Hence it follows that range of f(x) is not equal to its codomain. So f is not bijection.

1. Two sets A and B are said to be disjoint if: (a) (b) (c) 2. (d) None of the above
In the following venn diagram the shaded portion denotes the set: (a) B-A (b)A (c) A (d) A-B
3.
Which of the following is true for two sets A and B? (a) AxB=BxA (b)A-B=B-A (c) A (d) None of the above
4.
Which of the following is false for two sets A and B: (a) A (b)
54
(c) A-B=B-A 5.
(d) None of the above
Which of the following is correct? (a) A reflexive relation is always an identity relation (b) An identity relation is always reflexive relation (c)A reflexive relation is always equivalence relation (d)None of the above (a) (b) (c) (d) The relation of equality (=) in the set of real numbers is :? Reflexive Symmetric Transitive All(a) , (b) and (c)
6.
7.
If R ={(1,2),(2,3)} is a relation, then R-1is given by? (a) {(2,3),(1,2) (b) {(2,1),(3,2)} (c) {(1,2)-1,(2,3)-1} (d) None of the above
8.
If R is a relation defined from the set A to set B, then : (a) R AxB
(b) R=AxB (c) R BxA (d) None of the above 9. A relation R that is reflexive, anti symmetric and transitive is called: (a) Equivalence relation (b) Partial order relation (c) Total order relation (d) None of the above 10. The set { x:x is an integer and 0 x } is equal to : (a) {1,2}
55
(b) {0,1,2} (c) {0,1} (d) None of the above 11. If X= {a, b,c}, Y={1,2,3,4} and f={a,2),(b14),(c,2)}, then domain of f is : (a) X (b) Y (c) {2,4} (d) None of the above 12. If A={ , b}, then A- is equal to : (a) A (b) { (c) {b} (d) None of the above 13. A function f is said to be bijection if it is : (a) One-one (b) Onto (c) Both one-one and onto (d) None of the above 14. The cardinality of the set {1,2.,n} where n is a positive integer is : (a) n (b) infinite (c) n(n+1)/2 (d) None of the above 15. The set of all natural numbers N is : (a) finite (b) Countable infinite (c) Uncountable infinite (d) None of the above 16. The set of all integer Z is : (a) finite
56
(b) Countable infinite (c) Uncountable infinite (d) None of the above 17. The set of all real numbers R is : (a) finite (b) Countable infinite (c) Uncountable infinite (d) None of the above 18. If A={a,b,c,d} and B={d,f,e,g} then A = (a) {a,b,c,d} (b) {d,e,f,g} (c) {a,b,c,d,e,f,g} (d) None of the above 19. Which one of the following is true (a) A >A (b) A A (c) A A (d) None of the above 20. If A={a,b,c,d} and B={1,2,3,4} then which relation is a function from A to B (a) R={(a,1), (b,2), (a,3) ,(c,4)} (b) R={(a,2), (b,2); (c,3)} (c) R={(a,1), (b,1); (c,2);(d,3)} (d) None of the above 21. If A={a,b,c,d} and B={1,2,3,4} then which is bijection (a) f={(a,1), (b,1), (c,2) ,(d,4)} (b) f={(a,2), (b,3); (c,4),(d,3)} (c) f={(d,1), (b,2); (b,3);(a,4)} (d) f={(a,1), (d,2); (b,2);(c,1)} 22. The set A={x:x (a) {1,2,3} (b) {0,1,1,2,3} (c) {-3,-2,-I,0,1,2,3}
57
(d) none of the above 23. In following diagram shaded portion denote the set
A
(a) A (b) A (c) (d) ( )
24. If A is subset of a universal set U , them A U (a) A (b) U (c) 0 (d) none of the above 30. In the set of straight lines in the plane, R is the relation paralle then R is: (a) not reflexive (b) antisymmetric (c) not transitive (d) an equivalent relation ANSWER KEY: 1-b 11-a 23-d 2-d 14-a 24-c 3-c 15-a 25-d 4-c 16-a 26-a 5-a 17-b 27-b 6-d 18-b 28-d 7-a 19-c 29-b 8-b 20-c 30-d 9-b 21-b 10-a 22-c
58
59
Chapter-8
Proportional Calculus
Q.1 Write converse, inverse and contraposition of the implication If I am hungry, then I will eat. and q = I will eat Converse : If I will eat then I am hungry. Inverse : If I am not hungry, then I will not eat. Contraposition : It I will not eat, then I am not hungry. Q.2 Ans.: p T T F F Q.3 Ans.: I p T II p F III q T IV q F V pq T VI p q T VII q p T VIII ( p q) ( q T
p)
Ans.: Let p = I am hungry
Complete truth table for (pq)( q p) q T F T F
p
T F T T
q
F T F T
p
F F T T
q
T F T T
(p
q)
( q
p)
T T T T
Using the truth table show that

p q ( p q) ( q p)
60
T F F
F T T
F T F
T F T
F F T
F T T
T F T
F F T
Column (V) and Column (VIII) are identical. Hence the statement is true. Q.4 Ans.: p T T F F Hence it is tautology. Q.5 State and prove De-Margans Law by Proportional Calculus. (i) (ii) (i) I p T T F F (ii) I p
( p q) ( p) ( q) ( p q) ( p) ( q) ( p q) ( p) ( q)
Show that ( p q)
p is a tautology.
q T F T F
p q
T F F F
( p q)
T T T T
Ans.: The following statements are known as De-Margans Law :
II q T F T F
III p q T F F F
IV
( p q)
V
p
VI
q
VII
( p ) ( q)
F T T T
F F T T
F T F T
F T T T
Column (IV) and (VII) are identical.

( p q) ( p) ( q)
II q
III p q
IV
( p q)
V
p
VI
q
VII
( p ) ( q)
61
T T F F
T F T F
T T T F
F F F T
F F T T
F T F T
F F F T
Here Column (IV) and (VII) are identical. Hence Proved. Q.6 If A = {1, 2, 3, 4, 5, 6, 7, 8}, then examine the truth value of the following predicates (i) (ii) Ans.: (i) (ii)
x x
Since 6
A , p(x) = x + 3 = 9 A , p(x) = x + 4 = 13
If x = 6 then x + 3 = 9 is true.
A,
A for which p(x) is true.
x + 4 = 13 is true only for x = 9 But 9 A the given predicate p(x) is false.
Q.7
Using proper logical statement variables and logical connectives answer the following question A person got a note about some treasure hidden in the vicinity of his home. If the statements are taken as true then where is treasure hidden? (a) (c) If this house is next to lake, then treasure is not in the kitchen. This house is next to a lake. (b) If there in the front yard is neem, then the treasure is in the kitchen. (d) The tree is in the front yard is neem, or the treasure is buried under the flagpole. (e) p If the tree in the backyard is an oak, then the treasure is in the garage. : House is next to a lake.
Ans.: We assign symbols to the proportions as given below :-
62
q r s t u (1) (2) (3) (4) (5) (i)
: : : : :
Treasure is in the kitchen. Tree in the front yard is neem. Treasure is buried under the flagpole. Tree in the backyard is oak. Treasure is in the garage.
Then the given data can be put as follows :-
p r p
r s
q p
t
p
p
u
q
[by (1)] [by (3)]
q
(ii)
[Modulus Ponens] [by (2)] [Modulus Tollens] [by (4)] [Disjunctive Syllogism]
r q
(iii)
r
s
Hence treasure is buried under the flagpole.

1. is logically equivalent to : (a) (c) p q is logically equivalent to : (b) (d) )
2.
63
(a) (c) ) 3. The converse of p q is : (a) (c) ) p q means: (a) (c) ) The argument relates to if p then q
(b) (d) )
(b) (d) ) (b) (d) )
4.
5.
23
(a) modus ponens (b) (c) ) (d) ) For the argument If today is Holi Dahan , then today is full moon day. Today is Holi Dahan Today is full moon day. The fact that this argument form is valid is called (a) modus ponens (b) (c) ) (d) )
22. An argument is valid means that it has valid: (a) Logic (c) Form (b) Hypothesis (d) Assumption
21. The contra positive of a conditional if p then q is : (a) Logic (b) Hypothesis
64
(c) Form
(d) Assumption
18. A proposition (or statement) is a sentence that is : (a) True or false (c) True 14. What will be the contra positive of p (a) q (c) ) Answers key: 1-c 2-a 3-d 4-c 5-b 23-c 22-b 21-d 18-d 14-b (b) (d) None of the above (b) False+ (d) True or false but not both
65
BACHELOR OF COMPUTER APPLICATIONS (Part-I) EXAMINATION

(Faculty of Science) (Three Year Scheme of 10+2+3 Pattern)
Discrete mathematics Paper-114

OBJECTIVE PART- I Year - 2011
Time allowed : One Hour Maximum Marks : 20 This question paper contains 40 multiple choice questions with four choices and student will have to pick the correct one (each carrying mark). 1. Which is the false statement? (a) All the integers are real numbers (b) All the integers are rational numbers (c) All the natural numbers are rational numbers (d) All the rational numbers are integers The antecedent in the conditional statement p q is: (a) p (b) q (c) (d) p
( )
2.
( )
3.
For any two complex numbers z1 and z 2 . which is correct? (a) (c)
z1 z1 z1 z2
z1 z1
z2 z2
(b) (d)
z1 z1 z1 z2
z1 z1
z2 z2
( )
66
4.
The decimal form of (101) 2 is: (5) 2 (a) (3)10 (c) Binary numeral of 109 is: (1100111) 2 (a) (1101101) 2 (c)
(10000) 2 (1011) 2 is equal to:
(b) (d)
(4)10 (6)10
( )
5.
(b) (d)
(1110011) 2 (1011011) 2
( )
6.
(a) (b) (c) (d) 7.
(1011) 2 (101) 2 (1110) 2 (111) 2
( )
What is the normalized floating point representation for the decimal number 88.95? (a) 8.8954E+1 (b) .88954E+22n1 (c) .08954E+2 (d) .08954E+1 ( ) 2s complement of the number 101101 is: (a) 1001100 (c) 010011 If p (a) (c)
8.
(b) (d)
0100110 0100111
( )
9.
q is an implication, then its contra positive is: (b) p q q (d) q p p

x, P ( x ) :
p q
( )
10.
Which quantifier is used in (a) Universal (c) Propositional Which is true? ( n N )(n 7 4) (a) ( n N )(n 2 6) (b) ( n N )(n 7 4) (c)
(b) (d)
Existential None of the above
( )
11.
67
(d) 12.
( n N )(n 2 6)
( )
The law of syllogism is: p q (a)
p
(b)
p _____ q
p q
_____
(c)
(d)
p q p
13.
q r r
q p q q _____
( )
_____
P (Q R) ( P Q) ( P R) is known as: (a) Associative Law (b) (c) Detachment Law (d)
Idempotent Law Distributive Law
( )
14.
Let P (n) be a statement for mathematical induction technique, then n belongs to: (a) Natural number (b) Integer (c) Real number (d) Complex number ( ) If A= {1, 2, 3}, then cardinality of the set P (A) is: (a) 3 (b) 4 (c) 8 (d) If A= range (a) (c) {2, 3}, B= {3, 4, 5} and R is a relation such that R= {(2, 3), (2, 4), (3, 5)}, then of R 1 is {2, 3, 4} (b) {2, 3} {3, 4, 5} (d) {2, 3, 5} ( )
15
16.
17.
If A is a subset of a universal set U, then A U equals to: (a) A (b) U1 (c) (d) A If a, b N such that a is a divisor of b, then the relation Is a divisor of is: (a) reflexive, symmetric and transitive
( )
18.
68
(b) (c) (d) 19.
reflexive, antisymmetric and transitive reflexive, symmetric and antisymmetric Only antisymmetric
N and g : N N are defined as f ( x) (b) (d)
x 2 and g ( x) 3 5
( )
x 1 , then gof (2) is:
If f : N (a) 2 (c) 4
( ) is a set of
20.
z is defined as f ( x) x 2 1 for all x z , where z A function f : z positive integers, then the function f is: (a) one-one onto (b) many one onto (c) many one into (d) one-one into
( )
21.
A relation R: A (a) AxB (b) BXA (c) A B (d) A B
B is a subset of:
( )
22.
If aRb aRc aRc , then the relation R is: (a) Reflexive (b) (c) (d) Transitive
Symmetric antisymmetric
( )
23.
EBCDIC code expresses any character in low many binary numbers? (a) 4 (b) 6 (c) 8 (d) 16 The gray code of the binary number 1101 is: (a) 1100 b) (c) 1001 (d)
( )
24.
1011 1110
( )
25.
If the statement p is false and q is true, then p q is: (a) False (b) True (c) True or False (d) True or False
( )
26.
p (a) (c)
q is equivalent to: p q p q
(b) (d)
p q p q
( )
69
27.
If A and B be two finite sets having m and n elements respectively, then number of relation from A to B are: (a) (b) 2m n 2m (c) (d) ( ) 2n 2mn A function is said to be a bijection if it is: (a) one-one (c) many one onto
28.
(b) (d)
onto both one-one and onto
( )
29.
The number of vertices in a graph is called (a) order of graph (b) (c) degree of graph (d) This size of 5 regular graph with 20 vertices is: (a) 30 (b) (c) 50 (d)
size of graph length of graph
( )
30.
40 100
( )
31.
( 3) is a/an: (a) real number (c) complex number

Which is true of the following? (a) The trial is an open walk (c) The circuit is a closed walk A complete graph with n vertices has (a) (c) odd edges even edges
(b) (d)
rational number irrational number
( )
32.
(b) (d)
The path ia a trial All of the above
( )
33.
n(n 1) : 2 (b) (d)
odd vertices even vertices
( )
34.
A complete graph k n is plannar graph if and only if: (a) n>8 (b) n< 5 (c) n=6 (d) n>5 A connected plannar grapg eith n vertices, e edges and r regions gives: (a) (b) 3r 2e e 3n (c) (d) All of the above 3n e 6
( )
35.
( )
70
36.
How many pendent vertices are there in a tree? (a) Two (b) (c) Three (d) Hamiltonian path ia a: (a) Euler circuit (c) Spanning tree ( )
Atleast two Atleast three
( )
37.
(b) (d)
Rooted tree None of the above
38.
A graph with 2n vertices of degree one, 3n vertices of degree two and n vertices of degree three is called: (a) tree (b) minimal spanning tree (c) Hamilton circuit (d) Complete graph ( ) The symmetric difference of two sets A and B is: (a) (b) ( A B) ( A B) (c) (d) ( A B) ( B A) ( ) An argument is valid means it has valid: (a) Hypothesis (c) Assumption
39.
( A B) ( A B) ( A B) ( B A)
40.
b) (d)
Logic Premises
( )
Answer Key 1. ( ) 2. ( ) 11. ( ) 21. ( ) 31. ( ) 12. ( ) 22. ( ) 32. ( )
3. ( ) 13. ( ) 23. ( ) 33. ( )
4. ( ) 14. ( ) 24. ( ) 34. ( )
5. ( ) 15. ( ) 25. ( ) 35. ( )
6. ( ) 16. ( ) 26. ( ) 36. ( )
7. ( ) 17. ( ) 27. ( ) 37. ( )
8. ( ) 18. ( ) 28. ( ) 38. ( )
9. ( ) 19. ( ) 29. ( ) 39. ( )
10. ( ) 20. ( ) 30. ( ) 40. ( )
______
71
DESCRIPTIVE PART- II
Year- 2011
Time allowed: 2 Hours Maximum Marks : 30 Attempt any four questions out of the six. All questions Carry 7 marks each. Q.1 (a) (b) (c) Q.2 (a) Convert ( FO)16 into octal form. Find the hexadecimal equivalent of (32.4)8 .31/ 2 . Evaluate : (11) 2 (111)2 (1111)2 (11111) 2 Check the validity of the following argument: r
p q p
(b) Q.3 (a)
q r
_________
Prove that: ( p q)
(p
r ) (q
r)
Prove by mathematical induction that the sum of the cubes of three consecutive integers is divisible by 9(nine) A survey shows that 74% of the Indians like apples, whereas 68% like oranges. What percentage of the Indians like both apples and oranges? If R and S are equivalent relations on a set A, then prove that R equlvalence relation. Show that the function f : R bijection
(b)
Q.4
(a)
S is also an
(b)
R defined by the f ( x) 3x3 7 for all x
R is a
Q.5
(a)
Find the shortest path between the vertices a and z in the following graph:
72
b 4 a 3 c 6 e 2 3 1 5 g 2 4 5 d 5 f 7 z
(b)
Are the following graphs isomorphic ? Explain your answer:

V5 V4
V1
V2
V1 V2
V3
V4
V3
Q.6
(a)
Find the minimal spanning tree of the following graph:

V1 11 V2 9 1 6
V3 5 V4
10
V5
(b)
Prove that a tree with n vertices has n-1 edges.
73

Time allowed : One Hour Maximum Marks : 20 This question paper contains 40 multiple choice questions with four choices and student will have to pick the correct one (each carrying mark). 1. The largest four digit number in hexadecimal system is: (a) 7777 (b) 1111 (c) FFFF (d) 9999 The value of the number 11.0011 E-112 is: (a) 3.1875 (b) (c) 3.1875 (d) (A (a) (c) B)' is equal to: A' B' A B
( )
2.
.398437 0.398437
( )
3.
(b) (d)
A A'
B B'
( )
4.
If R = {(1,4), (1,8), (3,4,) ,(3,6), (3,8)} is a relation, then the range of R is equal to: (a) (1,3) (b) (1,3,4) (c) (4,6,8) (d) (3,4,6) ( ) If A = { , { }}, then cardinal number of A is: (a) 0 (b) (c) 2 (d) Relation R = {(1,1), (2,2) (3,3)} is: (a) Only reflexive (b) Only symmetric (c) Only reflexive and symmetric (d) Reflexive, symmetric and transitive
5.
1 None of the above
( )
6.
( )
74
7.
Number or reflexive relations formed on a set of n elements: (a) 2n (b) 2n1 (c) 2n(n-1) (d) None of the above (p (a) (c) q) is logically equivalent to: p q p q
( )
8.
(b) (d)
p (q
f1 o g1 fog
q p)
( )
9.
(g o f)1 is equal to: (a) (f o g)1 (c) g1 o f1 If A = (8n 7n1/n (a) A B (c) A=B
(b) (d)
( )
10.
N) and B = (49 (n1)/n N then: (b) B A (d) None of the above
( )
11.
Which of the following is the empty set? (a) {x/x is a real number and x2 1 = 0} (b) {x/x is a real number and x2 + 1 = 0} (c) {x/x is a real number and x2 9 = 0} (d) {x/x is a real number and x2 = x +2}
( )
12.
Let A and B be two finite sets having m and n elements, respectively. Then the total number of mappings from A to B is: (a) mn (b) 2mn n (c) m (d) nm ( ) Let f : R R be defined by f(x) = 3x4 then f(x) is: (a) (b) (c) 3x +4 (d) None of the above Degree of isolated vertex is: (a) 0 (c) Infinite
13.
( )
14.
(b) (d)
1 None of the above
( )
15.
Number of edges in a complete graph Kn is: (a) n (b)
2n
75
(c) 16.
(d)
n (n1)
( )
If G is connected planner graph with n vertices, e edges and r regions then ne + r is equal to : (a) 0 (b) 1 (c) 2 (d) 3 ( ) A vertex v in a nontrivial tree T is a cut vertex is and only if: (a) d (v) < 0 (b) d (v) > 0 (c) d (v) < 1 (d) d (v) > 1 Conversion the binary number 1011100012 into the octal number system is: (a) 6518 (b) 7618 (c) .2358 (d) 561g 10101012 + 111001012 is equal to: (a) (01001000)2 (c) (11010111)2 (b) (d) (100111010)2 (00010111)2 R, f(x) = sin x and g : R (sin x)2 ( )
17.
( )
18.
( )
19.
( ) R, g(x) =
20.
The composite mapping f o g of the maps f : R x2, is : (a) x2 sin x (b) 2 (c) sin x (d) Which one of the following is not a function? (a) {(x,y)}/x,y R, x2 = y} (b) {(x,y)/x, y R, y2 = x} (c) {(x,y)/x, y R, x =y3} (d) {(x,y)/x, y R, y = x3} If A = {1,2,3,4}, B = {3,4,5,6}, then AB =: (a) {1,2} (b) (c) (d)
21.
( )
22.
{5,6} {1,2,3,4,5,6}
( )
23.
If A = {1,2,3,4} B = {2,3,6,7} C = {2,5,8} then A (a) {2} (b) (c) {2,3,6,7} (d)
(B C) =: {1,2,3,4} {2,5,8}
( )
76
24.
Shaded portion of the following Venn diagram denotes:

A B
(a) (c) 25.
A B AB R}, then R1 is :
(b) (d)
A B BA
( )
If R1 {(x,y)/x2 +y2 = 1, x,y (a) Reflexive (c) Transitive
(b) (d)
Symmetric Antisymmetric
( )
26.
The void relation on a set A is: (a) reflexive (c) reflexive and symmetric If R1 = {(x,y)/ y,x,y R}, then R1 is: (a) Partial order relation (c) both
(b) (d)
symmetric and transitive Reflexive and transitive
( )
27.
(b) (d)
equivalence relation none of the above
( )
28.
If G is a simple planer graph, then there is a vertex is a vertex v in G such that: (a) deg (v) 1 (b) deg (v) 3 (c) deg (v) 5 (d) deg (v) 7 Completes bipartite graph K3,3 is: (a) Planner graph (c) both This graph is:
V2 e2 e1 e4 e5 e6 e3 V1 V3
( )
29.
(b) (d)
non-planer graph None of the above
( )
30.
V4
77
(a) (b) (c) (d) 31.
Eulerian Eulerian and Hamiltonian Eulerian but not Hamiltonian Hamiltonian but not Eulerian
( )
If f(x) = loge x, the f(xy) is : (a) f(x) + f(y) (c) f (x) f(y) is a : (a) Natural Number (c) Irrational Number The argument is valid if: (a) p q is tautology (c) p q is fallacy Number of vertex in a wheel Wn is: (a) n (c) 2n
(b) (d)
f (x) f(y) f(x) / f (y)
( )
32.
(b) (d)
Rational Number Imaginary Number
( )
33.
(b) (d)
q is false None of the above
( )
34.
(b) (d)
(n +1) n2
( )
35.
A tree with n vertices has exactlyedges. (a) n (b) (c) 2n (d) For n N, 32n + 7 is divisible by: (a) 16 (c) 8 The negation of a conditional statement p p q (a) q p (c)
n +1 n 1
( )
36.
(b) (d)
9 6
( )
37.
q is equal to : (b) q p (d) p^ p
( )
38.
Number of maximum leaves in an m-ary tree of height h is: (a) hm (b) hm1 (c) mh (d) mh1 How many edges are there in a graph with ten vertices each of degree 6? (a) 30 (b) 60 (c) 20 (d) 10
( )
39.
( )
78
40.
Which of the following is true ? (a) domain range (c) range codomain
(b) (d)
codomain codomain
domain range
( )
Answer Key 1. (c) 2. (c) 11. (b) 21. (b) 31. (a) 12. (b) 22. (a) 32. (c)
3. (a) 13. (c) 23. (b) 33. (a)
4. (c) 14. (a) 24. (b) 34. (b)
5. (c) 15. (c) 25. (b) 35. (c)
6. (d) 16. (c) 26. (b) 36. (c)
7. (c) 17. (d) 27. (a) 37. (c)
8. (b,c) 18. (d) 28. (c) 38. (c)
9. (b) 19. (b) 29. (b) 39. (a)
10. (a) 20. (c) 30. (c) 40. (c)
______
79
Year- 2010
Time allowed: 2 Hours Maximum Marks : 30 Attempt any four questions out of the six. All questions Carry 7 marks each. Q.1 (a) (b) Convert, 561, into hexadecimal number system. Write the full form of BCD and EBCDIC. Why was BCD code extended to EBCDIC? (c) Q.2 Write the bit pattern for the word CISTEMS using the ASCII-7 coding scheme.
Test the validity of the argument p p^q rvs q s r (b) Prove that P q = (p ^ q ) v ( p ^ q) If A, B, C and D are any four sets, then prove that : (A X B) (C X D) = (A C ) X (B B) Prove by the principle of mathematical induction that 9n 8n1 is divisible by 64, for all integers n 2. The relation R defined on a non-empty set A is antisymmetric if and only if R R-1 IA. If f : R (x). R, f(x) = 2x + 5, then prove that f is one-one onto function. Also find f-1
Q.3
(a)
(b)
Q.4
(a)
(b)
Q.5
(a)
Define Euler graph. Prove that if G is simple planar graph, then there is a vertex v is G such that deg (v) 5.
80
(b)
Find the shortest path between the vertices a and f, in the following weighted graph.
b 4 a 1 2
d 6 2 f
3 5 C 10 e
Q.6
(a)
Define Binary tree. Prove that if T is a binary tree with a n vertices and of height h then. h + 1 n 2 h+1 1 Find the minimal spanning tree of the graph.
b 1 4 a 3 5 f 3 e 4 1 2 c 2 d 4
(b)
__________
81

Time allowed : One Hour Maximum Marks : 20 This question paper contains 40 multiple choice questions with four choices and student will have to pick the correct one (each carrying mark). 1. (17)10 in binary system is: (a) (1001)2 (c) (10001)2 0.5452E3 0.5424E3 is: (a) 0.0024E3 (c) 0.002E3 If A = { , { (a) 0 (c) 2 (A (a) (c)
(b) (d)
(100001)2 (01001)2 0.0028E3 0.003E3
( )
2.
(b) (d)
( )
3.
}}, then cardinal number of A is: (b) (d)
1 None of these
( )
4.
B)' is equal to: (A' B') (A' B')
(b) (d)
(A (A
B) B')
( )
5.
Relation R = {(1,1), (1,2) (1,3) (2,2) (2,3), (3,3)} is : (a) Only reflexive (b) Only symmetric (c) Only reflexive and transitive (d) Reflexive, symmetric and transitive (g o f)1 is equal to: (a) (f o g)1 (b) g1 o f-1
( )
6.
82
(c) (d) 7.
f1 o g1 fog
( )
Degree of pendant vertex is: (a) 0 (c) infinite
(b) (d)
1 none of the above
( )
8.
The number of vertices of odd degrees in a graph G is always. (a) even (b) odd (c) zero (d) rational number Number of edges in a graph with 7 vertices each of degree 4 will be: (a) 28 (b) 14 (c) 7 (d) 4 A tree with n vertices has exactly..edges. (a) n (b) n 1 (c) n +1 (d) n 2 (25.6)8 can be represented as: (a) (21)10 (c) (21.75)10
( )
9.
( )
10.
( )
11.
(b) (d)
(12.75)10 (168)10
( )
12.
If n(A) = r, then total number of non empty subsets of A are: (a) 2r (b) 2r1 (c) 2r 1 (d) 2r +1 (00010111)2 + (00010001)2: (a) (01001000)2 (c) (11010111)2 Hamming code is: (a) error finding code (c) error correcting code Contra positive statement of p q (a) p (c) q p {a,b} {{a,b} } = q is : (b) (d)
( )
13.
(b) (d)
(00101000)2 (00010111)2 error detecting code error approximation code
( )
14.
(b) (d)
( )
15.
q q
p p
( )
16.
83
(a) (c) 17.
{a,b} {a,b, {a,b}}
(b) (d)
{{a,b}} ( )
Incoming degree of the root of the rooted tree is: (a) 0 (b) (c) 2 (d) A connected graph is a tree if: (a) e=v (c) e = v1
1 Infinite ( )
18.
(b) (d)
e = v +1 none of the above
( )
19.
Conversion of the decimal number (58)10 into hexadecimal is: (a) (3B)16 (b) (2A)16 (c) (3A)16 (d) (2B)16 If A = {a,c,d}, B = {c,d,e}, then A B = (a) {a, e} (c) {a} (b) (d) {e} {c,d}
( )
20.
( )
21.
Shaded portion of the following venn diagram denotes:

A B U
(a) (c) 22.
A Ac
(b) (d)
A B AB
( )
If aRb ^ bRc aRc, then relation R is: (a) Reflexive (c) Transitive If f (x) = eax, the f (x +y) is : (a) f (x) + f(y) (c) af (x) f (y)
(b) (d)
Symmetric Antisymmetric
( )
23.
(b) (d)
f (x) f (y) f (x)/f (y)
( )
84
24.
If P: It is raining and q : team wins, then "if the team does not win, then it is not raining is: (a) p q (b) q p (c) q (d) p ( ) p q
25. (a) (c) 26. natural number irrational number (b) (d) rational number imaginary number ( )
Number of different edges in the complete graph Kn is: (a) n (b) n (n1) (c) (d) ( )
27.
P = 2 > 3, q = Earth does not rotate, then: (a) p is true (c) p q is true The argument is valid if: (a) P q is fallacy (c) q is false Graph G = (V, E) is called infinite graph if: (a) Only set V is infinite (b) Only set G is infinite (c) Both sets V and G are finite (d) Both sets V and G are infinite
(b) (d)
q is true p ^ q is false
( )
28.
(b) (d)
p q is tautology none of the above
( )
29.
( )
30.
Degree of each vertex of complete graph k4 is: (a) 2 (b) (c) 3 (d) This graph is:
4 5
31.
a
85
e1
e2 e3
e4
c5
(a) (b) (c) (d) 32.
Eulerian Eulerian and Hamiltonian Eulerian but not Hamiltonian Hamiltonian but not Eulerian
( )
If G be a connected planer graph with v vertices, e edges and r region, then: (a) v + e r =2 (b) e+rv=2 (c) v+re=2 (d) v+r+e =2 A connected graph that contains no cycle is: (a) simple graphs (b) (c) tree (d) Which of the following is true? (a) domain range (c) co-domain domain A function is called bijection if it is: (a) only one-one (c) one-one and onto
( )
33.
planar graph circuit
( )
34.
(b) (d)
range co-domain co-domain range
( )
35.
(b) (d)
only onto None of the above
( )
36.
If R be an equivalence relation in A, then R1 in the set A is: (a) Partial order relation (b) Equivalence relation (c) Anit-symmetric relation (d) None of the above The universal quantifier of P (x) is denoted by : (a) x P (x) (b) (c) x P (x) (d) A relation R: A (a) A B (c) AxB B is subset of : (b) (c) BxA A B
( )
37.
x x
P (x) P (x)
( )
38.
( )
86
39.
If x is element of A B then: (a) A B = {x x A ^ x B} (b) (c) (d) A A A B = {x x B = {x x B = {x x A^x A x ^x B} B} B} ( )
40.
If F: R (a) (c)
R be defined by f (x) = 5 x + 7, then F 1 (x) is: (b) (d) ( )
Answer Keys 1. (c) 2. (b) 11. (a) 21. (d) 31. (b) 12. (b) 22. (c) 32. (c)
3. (c) 13. (b) 23. (b) 33. (c)
4. (c) 14. (c) 24. (c) 34. (d)
5. (c) 15. (b) 25. (c) 35. (c)
6. (c) 16. (c) 26. (c) 36. (b)
7. (b) 17. (a) 27. (d) 37. (c)
8. (a) 18. (c) 28. (b) 38. (c)
9. (b) 19. (c) 29. (a) 39. (a)
10. (b) 20. (a) 30. (c) 40. (b)
__________
87
Year- 2009
Time allowed: 2 Hours Maximum Marks : 30 Attempt any four questions out of the six. All questions Carry 7 marks each. Q.1 (i) (ii) (iii) Q.2 (a) Convert (0.65625)10 into binary system. Encode the following in ASCII code: 'How are you? Explain the error detecting and error correcting codes. Prove that: (p q) ^ (P
r)
(q ^ r)
(b)
Test the validity of the argument : If you do every problem in this book, Then you will learn discrete mathematics, You have learned discrete mathematics, You did every problem in this book.
Q.3
(a)
Prove by mathematical induction that : P (n) = 1.2 + 2.22 + ..n.2n = (n 1)2n+1 +2; for n For the sets A,B, C prove that : A X (B C) = (A X B) (A X C)
(b)
Q.4
(a) (b)
Show that a relation R defined in a set A is symmetric if and only if R = R1 The function f: R R is defined by f (x) = x2 +3 and g : R g (x) Find f o g and g o f. R is defined by :
Q.5
(a)
Prove that a connected graph G is Eulerian if and only if the degree of every vertex is even.
88
(b)
Find the shortest path between the vertices V1 and V8 in the following weighted graph:
V2 2 4 2 V1 V4 4 3 1 V6 5 V7 V5 7 2 3 V3 1 V8
Q.6
(a) (b)
Prove that a tree with n vertices has exactly (n1) edges. Write a short note on minimal spanning tree.
_________
89

Time allowed : One Hour Maximum Marks : 20 This question paper contains 40 multiple choice questions with four choices and student will have to pick the correct one (each carrying mark). 1. The number 2.444 .is called a or an: (a) Natural number (b) (c) Rational number (d)
Integer Irrational number
( )
2.
If n is composite integer, then n has prime divisor less than or equal to: (a) (b) n2 (c) (d) n +2 ( )
3.
The range of unsigned integers stored in N bits computer is from zero to: (a) 2N (b) 2N1 N+1 (c) 2 (d) None of these
The decimal equivalent of the binary number (101111)2 is:
( )
4.
(a) (c)
5.
(74)10 (46)10 (67)16 (2 F)16
(b) (d) (b) (d)
(64)10 (47)10 (3 E)16 (2 A)16 (101)2 (111)2
( )
Conversion of the decimal number (47)10 into hexadecimal is:
(a) (c) 6.
( )
The binary number of a octal number (7)8 is : (a) (110)2 (b) (c) (1101)2 (d)
( )
90
7.
An element x belongs to the difference of a and B, this tells us: (a) A B= {x/x A ^ x B} (b) A B = {x/x A ^ x B} (c) A B = {x/x A x B} (d) A B = {x/x A x B} The difference of {1,3,5} and {1,2,3} is the set: (a) {1} (b) (c) {3} (d) What is the power set of the empty set : (a) (c) { , { }}
( )
8.
{2} {5} { } None of these
( )
9.
(b) (d)
( )
10.
Two sets are equal if any only if they have: (a) Same elements (b) (c) Unequal elements (d)
Equal elements Different elements
( )
11.
The solution of the linear congruence 3x = 4 (mod 7) is: (a) 2 (b) 4 (c) 6 (d) 8 The identity law is: (a) A =A (c) A =
( )
12.
(b) (d)
A U=U All of the above
( )
13.
The universal quantifier of P (x) is denoted by : (a) x P (x) (b) (c) x P (x) (d)
x P (x) P (x)
( )
14.
Let Q (x, y) denote the statement 'x = y +3:' what is the truth value of the proposition Q (3,0) (a) True (b) False (c) Empty (d) Not exist ( ) Shaded Portion of the following Venn diagram denotes:
15.
A B U
91
(a) (c) 16.
A A
B B
C C
(b) (d)
A A
B B
C C
( ) B is a subset of: ( )
Let A and B be two non empty sets, then a binary relation R: A (a) B (b) BxA A (c) AxB (d) B A
17.
If the sets A and B having n element, then total number of relation defined from A to B are: (a) 2n (b) 2n2 (c) n (d) ( ) n2 If aRb ^ bRa a=b, then the relation R is called: (a) Reflexive (b) (c) Antisymmetric (d)
18.
Symmetric Transitive
( )
19.
If R is an equivalence rlation in a set, A, then the relation R1 in the set a is: (a) An equivalence relation (b) a partial order relation (c) an ant symmetric relation (d) None of these If f (x) = log, x then f (x) is: (a) f (x) + f (y) (c) F (x) . f (y) If f : N Z, f (x) = x2, then f is called: (a) many one function (c) onto function If A = {2, 1, 0, 1, 2} and f : A (a) {5, 6, 3, 4} (c) {4, 3, 0, 5} f (x) F (y) f (x) / f (y)
( )
20.
(b) (d)
( )
21.
(b) (d)
one-one function one one onto function
( )
22.
Z given by f (x) = x2 2x 3, then range of f is: (b) {4, 3, 5, 8} (d) {4, 3, 0, 5 ,6} ( )
23.
For the principle of mathematical induction the statement should include n as:
92
(a) (c) 24. If f: R (a) (c) 25.
a natural number any rational number
(b) (d)
an integer an irrational number
( )
R be defined by f (x) = 2x 3, then f1 (x) is: (b)
x+2 (d) ( ) 3 If p is ' roses are red' and q is 'violets blue', then 'roses are not red, or violets are not blue' is: (a) (p q) (b) P q (c) P^ q (d) None of these ( ) Negation of the statement (a) x y P (x,y) (c) x y P (x, y) x y, P (x, y) is: (b) (d)
26.
x, y P (x and y) x y P (x, y)
( )
27.
The bit strings of the set {1,2,4,6,9} is: (a) 1110101010 (c) 1101010010
(b) (d)
1100011010 1001011001
( )
28.
P: I am hungry and q : I will eat. ' If I am hungry then I will eat' stands for : (a) p q (b) q p (c) p q (d) p q The compound statement p q is true if: (a) At least one of p or q is true (b) Both p and q are true (c) Either p is true or q is true but not both (d) Conjunction of p and q is true A vertex of degree zero is called: (a) Pendent vertex (c) Point to point vertex
( )
29.
( )
30.
(b) (d)
Isolated vertex Simple vertex
( )
31.
The sum of the degree all all vertices in a graph G is equal to: (a) Number of edges in G (b) twice the number of edge in G (c) One more the number of edges in G (d) two more the number of edges in G
( )
93
32.
Maximum number of edges in a simple graph with n vertices is : (a) n (n +1) (b) n (n 1) (c) (d) ( )
33.
A graph with a closed path that includes every vertex exactly once is called is: (a) Hamiltonian graph (b) Simple graph (c) Diagraph (d) Euler graph For the following two graphs, we have:
( )
34.
(a) (b) (c) (d) 35.
Isomorphic graphs Planar graphs Isomorphic and planer graphs None of the above
( )
Let G be a connected planer graph with n vertices, edges and r regions, then which of the following is true: (a) 3r 2e (b) e 3n (c) r = en+2 (d) All of the above ( ) Let A = {1,2,3} and B = {2,4,5,7}, then [A B] is given by: (a) 3 (b) 4 (c) 6 (d) 12 A graph containing no simple circuit but not connected is called a: (a) (b) forest tree (c) (d) 12 binary tree
36.
( )
37.
( )
94
38.
Let T be a sub graph of a connected graph G, IF T is a tree and it contains all the vertices of G, then T is called : : (a) a spanning tree (b) skeleton (c) maximal tree subgraph (c) all of the above ( ) Identify binary tree from the following three trees T1, T2 and T3:
A
39.
T1
D T3
(a) (c) 40.
T1 T3
(b) (d)
T2 All T1, T2 and T3 Maximally connected Without pendant vertices
A graph G is a tree if and only if it is: (a) Minimally connected (c) Not connected`
(b) (d)
Answer Keys 1. (c) 2. (a) 11. (c) 21. (c) 31. (b) 12. (d) 22. (c) 32. (d)
3. (b) 13. (b) 23. (a) 33. (a)
4. (d) 14. (a) 24. (b) 34. (c)
5. (c) 15. (d) 25. (b) 35. (c)
6. (d) 16. (c) 26. (d) 36. (c)
7. (a) 17. (d) 27. (c) 37. (b)
8. (d) 18. (c) 28. (a) 38. (d)
_________
( )
( )
9. (b) 19. (a) 29. (a) 39. (d)
10. (a) 20. (a) 30. (b) 40. (a)
95
Year- 2008
Time allowed: 2 Hours Maximum Marks : 30 Attempt any four questions out of the six. All questions carry 7 marks each. Q.1 Solve the following: (i) (ii) (iii) (iv) Convert (101.001)2 in decimal number system Convert (14.875)10 into binary system. Write the binary representation of 47 in one's complement scheme Write 0.0007 into equivalent normalized floating point number with mantissa and exponent. ( v) Q.2 (a) Convert the decimal number 28.4 into an equivalent number in octal system. Let S be the set of all number and R is a relation in S defined by ' a R is a partial order relation. b'. Prove that
(b)
Let p be the proposition that the sum of the first n odd numbers is n2. Prove it byusing the mathematical induction principle. Let the functions f: R R, g : R be defined by f (x) = 2x +1, g (x) = x2 2 find the formula for gof and fog. Out of 1000 students, 750 offer Hindi and 400 offer English. How many can offer Hindi only and how many can offer English only? Prove that p If U = {x : x q uis a valid argument. 8, x N} A = {x : x 6, x N} and B = {3,4,5,7,8} then find B, A, B and A B.
Q.3
(a)
(b)
Q.4
(a) (b)
the bit string for the set, A, B, A Q.5 (a)
B, A
Show that e 3 v 6. Where v vertices and e (>2) edges are of a loop free connected planar graph. Find the incidence matrix of the following diagraph:
(b)
96
V4 e4
V3 e7
e5 e6
1 a
e3
b
e2 V5
V1
e1
V2
Q.6
Find the minimal spanning tree of the following labeled connected graph:
V1 5 V5 2 V2 8 V1 3 4 9 7 6 V2 1 V3
97

Time allowed : One Hour Maximum Marks : 20 This question paper contains 40 multiple choice questions with four choices and student will have to pick the correct one (each carrying mark). 1. (a) (c) 2. a rational number an irrational number (b) (d) a real number none of the above ( )
A bit has how many possible values? (a) (c)
(b) (d)
Two Eight
( )
3.
Let x, y and z be integers. Then which is true: (a) if x/y and x/z, then x (y +z) (b) if x/y, then x/yz for all integers z (c) if x/y and y/z then x/z (d) all of the above
What is the decimal expansion of the (2 AEOB) 16?
( )
4.
(a) (c)
5.
(175629)10 (175827)10 (3071)8 (2071)8
(b) (d)
(175627)10 (175829)10 (30071)8 (3007)8 neither true nor false
( )
Base 8 expansion of (12345)10 is given by:
(a) (c) 6.
(b) (d)
( )
A proposition is a statement that is : (a) either true or false
(b)
98
(c) 7.
true
(d)
false q, p is called the: Conclusion None of the above
( )
Let p and q be propositions. In the implication P (a) Hypothesis (b) (c) Consequence (d) The contra positive of p (a) p q (c) p q q is the proposition: (b) (d)
( )
8.
q q p`
p ( )
9.
a variable is called a Boolean variable if its value is: (a) (b) true false (c) either true or false (d) neither true nor false ( )
10.
Bitwise XOR of the bit string 0110110110 and 1100011101: (a) 1010111010 (b) 1010101011 (c) 1110101011 (d) 11101010 P and q propositions that always have the same truth value are called: (a) Logically equivalent (b) p q is a tautology (c) p q (d) All the above are true Which is de Morgan's law? (a) p q p q (c) (p q) p q
( )
11.
( )
12.
(b) (d)
(p (p
q) q)
q p
q q y ( ) x (x, y)? ( )
13.
Let Q (x,y) denote "x + y =0". What is the truth value of the quantification (a) (b) true false (c) neither true nor false (d) none of the above If n is a positive integer then n3 n is divisible by: (a) 2 (b) (c) 4 (d) The statement n P (n) is true if P (1) is true and as known as: (a) Principle of mathematical induction (b) Second principle of mathematical induction (c) Rule of inference
14.
3 5 n [p (n)
( ) p (n + 1)] is true, known
15.
99
(d) 16.
None of the above B} tells us as: (b) (d) A B
( )
The set {x/x A ^ x (a) A B (c) AB
( )
17.
How many elements in the set of Cartesian product of A = {1,2}and B = {a,b,c} are : (a) 2 (b) 3 (c) 6 (d) ( ) 5 Let A, B and C be three sets A (a) A (B C ) (c) (C B) A If f (x) f (y) whenever x (a) Oneone (c) One-one onto The function f (x) = x2 is: (a) oneone (c) oneone onto If f(x) = ex then f (xy) is: (a) f (x) f (y) (c) f (x) . f (y) (B C) is equivalent to: (b) (C B ) (d) (C B)
18.
A B
( )
19.
y then the function f is called: (b) on to (d) oneone into
( )
20.
(b) (d)
on to neither one one nor onto
( )
21.
(b) (d)
f (x) +f (y) f (x)/f (y)
( )
22.
A relation "=" (equipment to) defined in any set A is: (a) Reflexive relation (b) Symmetric relation (c) Transitive relation (d) Equivalence relation A partial order relation is not a: (a) Symmetric relation (c) Transitive relation If an function f : R F (x) = 1 1 x x Q Q
( )
23.
(b) (d)
Reflective relation Transitive relation
( )
24.
R be defined as follows:
then f (
) is :
100
(a) (c) 25.
1 1 and 1
(b) (d)
1 none of the above
( )
If f : A B and g : B (a) gof : A B (c) gof: B B
C such that A = C, then which is true: (b) gof : A A (d) gof: A C
( )
26.
What is cardinality of the set {x x is a subset of the set {a,b}} : (a) Two (b) Three (c) Four (d) Infinite A compound proposition that is sometimes true and sometimes false is called: (a) Contradiction (b) Tautology (c) Contingency (d) Logical equivalence The bit string of the set {1,3,5,7,9}is : (a) 1111100000 (c) 1001001011 The bit string of the set {1,3,5,7,9} is: (a) |A B|= |A||B|+|A B| (b) |A B| = |A|+|B||A B| (c) |A B| = |A|+|B|+|A B| (d) |A B| = |A|+|B||A B| If f: R R is a function such that f (x) = 4x +3 for x R, then f1 (x) is: (a) 34 x (b) 3x+4 (c) (x 3) (d) (x 3) How many edges are there in a graph with ten vertices each of degree six? (a) 10 (b) 20 (c) 30 (d) 16 An undirected graph has an even number of vertices: (a) of odd degree (b) of even degree (c) of zero degree (d) None of the above
( )
27.
( )
28.
(b) (d)
1011001101 1010101010
( )
29.
( )
30.
( )
31.
( )
32.
( )
101
33.
A connected multi graph has an Euler path but not an Euler circuit if and only if it has exactly: (a) two vertices of odd degree (b) two vertices of even degree (c) (a)and (b) are true (d) None of the above ( ) Which is of the following graph has a Hamilton circuit?
a b a b
34.
c e
(a)
a b a
(b)
b
c c d
(d)
()
(c)
35.
If G is a connected planar simple graph with four vertices, then number of edges are less than or equivalent to: (a) Four (b) Five (c) Six (d) Seven ( ) A vertex of degree one is called: (a) Isolated vertex (c) point vertex
36.
(b) (d)
Pendant vertex Simple vertex
( )
37.
A connected undirected graph with no simple circuits is known as a: (a) (b) Directed Graph Planar graph (c) (d) Tree Weighted graph
( )
102
38.
Every non-=trivial tree has at least two vertices of degree: (a) one (b) two (c) three (c) zero The number of vertices in a full ary tree with I internal vertices are: (a) mi +1 (b) mi 1 (c) m+i (d) mi A visiting of the vertices of a tree is called : (a) decision tree (b) (c) tree traversal (d)
( )
39.
( )
40.
ordered tree tree balance
( )
Answer Keys 1. (a) 2. (d) 11. (d) 21. (d) 31. (c) 12. (d) 22. (d) 32. (a)
3. (d) 13. (a) 23. (a) 33. (a)
4. (b) 14. (b) 24. (b) 34. (c)
5. (b) 15. (a) 25. (b) 35. (c)
6. (a) 16. (b) 26. (a) 36. (b)
7. (a) 17. (c) 27. (a) 37. (d)
8. (b) 18. (a) 28. (d) 38. (b)
9. (c) 19. (a) 29. (d) 39. (a)
10. (b) 20. (d) 30. (d) 40. (c)
__________
103
Year- 2007
Time allowed: 2 Hours Maximum Marks : 30 Attempt any four questions out of the six. All questions carry 7 marks each.
Q.1
Solve the following: (a) (b) (c) (d) (e) Find the product of (110)2 and (101)2 Convert the decimal 43.375 into its binary equivalent. Convert the hexadecimal number 39.B8 to an octal number. Represent 13 in binary form. To write hexadecimal number to a decimal number, Show that 12 AF16 = 478310
Q.2
(a)
Prove that a relation R defined in a set A is a symmetric relation if and only if R = R 1 Show that the propositions p equivalent. (q ^ r) and (p q ) ^ ( P r) are logically
(b)
Q.3
(a) (b)
Use set builder notation and logical equivalences to show that A If f : R R be given by f (x) = x2 +2 and g : R
B=A
B.
R be given by g (x) = 1
find (gof) x and (fog)x, R being the set of real numbers. Q.4 (a) Use mathematical induction to show that: 1+2 +22 ++2n = 2 n+1 1for all non negotiable integers n. How many paths of length four are from a to d in the following simple graph:
(b)
104
a b
Q.5
(a)
If G is a connected simple graph with e edges and v vertices where v then prove that e 3v, 6. Determine whether the following graphs G and H are isomorphic.
3v,
(b)
1 5 6 4
Q.6 (a) (b)
3 2 6
Show that there are at most mh leaves in an mary tree of height h. Use a breadth first search to find a spanning tree for the following graph:
a b c I
105

Time allowed : One Hour Maximum Marks : 20 This question paper contains 40 multiple choice questions with four choices and student will have to pick the correct one (each carrying mark). 1. (a) (c) 2. is: a rational number an integer (b) (d) a real number none of the above ( )
Which of the following statements is false? (a) All the natural numbers are integers (b) All the rational numbers are integers (c) All the rational number are real numbers (d) All the integers are real numbers The decimal equivalent of the binary number (10011)2 is: (a) 12 (b) 15 (c) 19 (d) 21
( )
3.
( )
4.
The number (680)10 of the decimal system equivalent to which number in octal system? (a) (85)8 (b) (1012)8 (c) (1250)8 (d) (1300)8 ( ) EBCDIC code expresses any character in hot many binary numbers? (a) 2 (b) 4 (c) 8 (d) 16 (11011)2 + (10011)2 is equal to: (a) (45)10 (c) (48)10
5.
( )
6.
(b) (d)
(46)10 (49)10
( )
106
7.
Shaded portion following Venn diagram denotes:

A B
(a) (c) 8.
A B AB
(b) (d)
A B BA
( )
If A is subset of a universal set U, then A (a) A (c) If a, b (a) (b) (c) (d)
, then A U equals: (b) U (d) None of the above
( )
9.
N such that a is a divisor of b then the relation "is a divisor of" is: Reflexive, symmetric, transitive Reflexive, anti-symmetric, transitive Symmetric, anti-symmetric, transitive Reflexive, symmetric, anti-symmetric
( )
10.
If f: N N and g: N N are defined as f (x) = x2 and g (x) = x + 1, then (g o f) (2) is : (a) 2 (b) 3 (c) 4 (d) 5 ( ) A function F: z+ Z+ is defined as f (x) x2 +1 for all x Z+ where z+ is a set of positive integers, then the function F is: (a) oneone into (b) manyone onto (c) manyone into (d) oneone into ( ) In the set of straight lines in the plane, R is relation "parallel" R is: (a) not reflexive (b) anti-symmetric (c) (d) not transitive an equivalent relation For two distinct non-void sets A and B, (A (a) Ac Bc (c) (A B)c )c is equal to : (b) (Ac Bc) (d) AB
11.
12.
( )
13.
( )
107
14.
R = {(1,1), (2,3), (3,2)} is a relation in X = {1,2,3} then R1 : (a) does not exist (b) is an equivalent relation (c) equals R (d) is only reflexive
( )
15.
Which of the following diagrams defines a function from A = {a,b,c} into B = {x, y, z}?
A
a b
B
x y
A
a b
B
x y
(i) A
a b
(ii) B
x y
A
a b
B
x y
(iii)
(iv)
(a) (c) 16.
(i) (iii)
(b) (d)
(ii) (iv) ( )
Let p be "Sita speaks English" and q be "Sita speaks German" then "Sita speaks English but not German" is described by: (a) p^ q (b) pv q (c) p ^ q (d) p v q ( ) p v (q ^ r) is equivalent to: (a) (p v q) v (q ^ r) (c) (p ^ q) v (q ^ r) The statement p (a) p v q (c) p^q (p v q) ^ (p ^ r) (p ^ q) ^(q ^ r)
17.
(b) (d)
( )
18.
q is logically equivalent to the proposition: (b) pvq (d) p ^ q
( )
19.
If p denotes "It is cold" and q denotes "it rains" then the statement" it reins only if it is cold" can be written symbolically as: (a) p q (b) p p
108
(c) 20.
(d)
( )
If p denotes "He studies" and q denotes" He will pass" then the negation of the statement "If he studies, he will pass" can be written symbolically as: (a) p q (b) q p (c) (p q) (d) (q p) ( ) The set of all not-negative even integers is: (a) finite (b) (c) uncountable (d)
21.
countable infinite none of the above
( )
22.
If |P| denotes the cardinality of the finite set P then for any such non void finite disjoint sets P and Q : (a) |P Q|=|P| |Q| (b) |P Q| |P|+|Q| (c) |P Q|=|P|+|Q| (d) |P Q| |P|+|Q| ( ) For the principle of mathematical induction the statement should include as: (a) an integer (b) any rational number (c) a natural number (d) an irrational number In the following graph the degree of vertex B is:
A B
23.
( )
24.
(a) (c) 25.
4 6
(b) (d)
5 7
( )
Number of edges in a graph is : (a) equal to the sum of the degress of all vertices
109
(b) (c) (d) 26.
double of the sum of the degress of all vertices half of the sum of the degrees of all vertices having no relation with the sum of the degrees of all vertices
( )
Out degree of the vertex V4 in the following diagram is:

V1 V2 V1
V1
V1
(a) (c) 27.
(b) (d)
3 ( )
In a graph there are 7 vertices each of degree 4, and then the number of edges in the graph is: (a) 4 (b) 7 (c) 14 (d) 28 ( ) If G is a connected planar graph with n vertices, e edges, and r regions, then: (a) n+r=2+e (b) n+r=2e (c) n+r=e2 (d) none of the above The number of edges in a tree with its vertices is: (a) n (b) n +1 (c) n1 (d) 1
28.
( )
29.
( )
30.
In an acyclic graph with n vertices and k connected components, the number of edges is: (a) n + k +1 (b) n + k (c) (d) ( ) For arbitrary sets A,B and C (AB) C equals: (a) A (B C) (b) (c) (AB) C (d) (AB) C none of the above
31.
( )
32.
In the following weighted graph, the minimum distance between A and f is:
110
B 1 A 5 3 D 2
4 C 1 E
(a) (c)
15 10
(b) (d)
11 9
( )
33.
The following rooted tree represents:
+ x y z 2
(a) (c) 34.
[{xy}3] (x y)3
(b) (d)
(x y)3 (z2 +2) ( )
The following graph is:

V1 e1 V2 e3 V3 e5 e4 e2 V6
(a) (c)
Hamiltonian Both Hamiltonian and Eulerian
(b) Eulerian (d) Neither hamiltonian nor Eulerian ( )
111
35.
A void set is: (a) Non existing (c) A sub set of all sets
(b) (d)
having zero as an element not a subset of any set
( )
36.
If f: R R is a function such that f (x) = 2x 3 for x R, R f1 (x): (a) is not defined (b) will have different range (c) is (3 2 x) (d) is (x +3) If f: X Y and g : Y (a) g1 o f-1 (c) (g o f)1 if q p, then : (a) p q q (c) p Tautology is a proposition which is: (a) false under all circumstances (b) false under a few circumstances (c) true under all circumstances (d) true under a few circumstances Bijection is: (a) Only into function (c) a one-one onto function Z are bijections then (f o g)1 equals: (b) f1 o g1 (d) gof
( )
37.
( )
38.
(b) (d)
q q
p p
( )
39.
( )
40.
(b) (d)
only onto function a many-one function ( )
Answer Keys 1. (d) 2. (b) 11. (d) 21. (b) 31. (c) 12. (d) 22. (c) 32. (d)
3. (c) 13. (b) 23. (c) 33. (c)
4. (c) 14. (c) 24. (c) 34. (a)
5. (c) 15. (c) 25. (c) 35. (c)
6. (b) 16. (a) 26. (b) 36. (d)
7. (d) 17. (b) 27. (c) 37. (a)
8. (a) 18. (d) 28. (a) 38. (c)
9. (b) 19. (a) 29. (c) 39. (c)
10. (d) 20. (a) 30. (c) 40. (c)
__________
112
Year- 2006
Time allowed: 2 Hours Maximum Marks : 30 Attempt any four questions out of the six. All questions carry 7 marks each. Q.,1 (a) (b) (c) (d) (e) Q.2 Q.3 Convert (111001101)2 into decimal form. Represent "SHORT" in EBCDIC code. Find the value of (195)10 + (105)10 in binary code. Convert (175)10 to hexadecimal number. Show that (1101.01011)2 = (15.26)8 Z where f (x) = x2 + x for all x Z, then show that f is a many one function.
Let f: Z (a)
If C (A) = m, C (B) = n and C (A B) = r, where C (P) is cardinal number of the set P and r < m + n, Find C (A B). Define a symmetric and an ant symmetric relation and give an example in each case. Construct truth tables for the following compound propositions. (p q (ii) (p q) ^ ( p q ) q) Find the shortest path between the vertices a and z in the following weighted graph.
b 4 a 2 3 3 5 C 6 e g 2 1 4 5 d 5 f 7 z
(b)
Q.4
(a)
(c)
Q.5
(a)
Show that, if G is simple planar graph, then there is vertex V in G such that deg (V) 5.
113
(b)
Show that in the following graph. Is not Hamiltonian while (ii) is Hamiltonian
e1 V1 V2 e1 e4 e3 V5 e2 e4 V3 e5 V4 V2 e3 e2 V3 V4 V1
e6
Q.6
(a) (b)
Show that a tree with a vertices has exactly (n1) edges. Construct a minimum spanning tree for the following weighted graph.
2 11 2 9 8 10 7 5 1
4 3
114
Keyterms
EBCDIC:- extended binary coded decimal interchange code BCD:- binary coded Deccimal ASCII: american standard code for information interchange A circuit is a trail that begins and ends on the same vertex. A cycle is a path that begins and ends on the same vertex. A trail is a walk that does not pass over the same edge twice. A trail might visit the same vertex twice, but only if it comes and goes from a different edge each time.
A path is a walk that does not include any vertex twice, except that its first vertex might be the same as its last. a graph consists of a finite nonempty set. whose elements are the vertices (or nodes) of the graph, together with a (possibly empty) set of unordered pairs of distinct vertices called edges (or arcs). (A single one of the vertices is called a vertex.) Graphs:Graphs that have arrows added to each edge are called directed graphs or digraphs (pronounced "DYE-graphs"). The arrows show that the edge has a direction associated with it. Forest:A forest is a graph with no cycles. It may or may not be connected. So a single tree is a forest, and a forest consists of one or more trees Kuratowski's theorem:Kuratowski's theorem is the statement that a graph is planar if and only if it has no subgraph that can be "collapsed" to the complete graph K(5) or the bipartite graph K(3, 3) Function:A function from set S to set T is a set of ordered pairs, the first element of which is in S and the second of which is in T, such that no first element occurs in pairs with two different second elements.
115
Reference Books
1. 2. 3. 4. 5. Discrete Mathematics and Its Applications by Kenneth Rosen Discrete Mathematics by Gary Chartrand and Ping Zhang Discrete Mathematics with Applications by Susanna S. Epp Discrete Mathematics by Kevin Ferland DiscreteMathematicsby Norman L. Biggs
Websites:1. 2. 3. 4. 5. www.graphtheory.com www.purplemath.com www.mathwarehouse.com www.wikipedia.org www.geeksforgeeks.org
***********

Discrete Mathematics

Uploaded by

Document Information

Copyright

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Discrete Mathematics

Uploaded by

Copyright:

2

Biyani's Think Tank

Lecturer Deptt. of Information Technology Biyani Girls College, Jaipur

For free study notes log on: www.gurukpo.com

Think Tanks Biyani Group of Colleges

Concept & Copyright :

Biyani Shikshan Samiti

Edition : 2011 Price :

Leaser Type Setted by : Biyani College Printing Department

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

Simple graph with two vertices

Simple graph with three vertices V1

Simple graph with four vertices

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

Ans.: First we label the vertex a by permanent label 0 and rest by .

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

Explain Matrix Representation of Graphs.

For free study notes log on: www.gurukpo.com

Path Matrix etc.

Degree of each vertex is two.

Degree of each vertex is two.

For free study notes log on: www.gurukpo.com

K4 K5 K6 In a complete graph Kn total no. of edges = i.e. size of Kn =

Multiple Choice Question 1. The graph is : u v

(a) (b) (c) (d)

Simple graph Directed graph Directed multigraph Pseudograph

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

A Tree with n-vertices has (n-1) edges.

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

Removing all pendent vertices

c(2) Q.6 Ans.:

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

a4 a9 a10 a11 Full 3 Ary Tree a12 a13 a7

Find the value of following prefix expression.

For free study notes log on: www.gurukpo.com

Multiple Choice Question

For free study notes log on: www.gurukpo.com

(b) hm+h (d) mh

(b) j e n k o p (d) j e k p o n The post order traversal of tree T2 is : e p

For free study notes log on: www.gurukpo.com

For free study notes log on: www.gurukpo.com

Ans.: Since (195 + 105) = 300

For free study notes log on: www.gurukpo.com

150 . . . . . . . . . . . . 0 75 . . . . . . . . . . . . 0 37 . . . . . . . . . . . . 1 18 . . . . . . . . . . . . 1 9 4 2 1 1 ............0 ............1 ............0 ............0 ............1 (195)10 +(105)10 = (100101100) 2

Convert (175) 10 into hexadecimal number. 16 16 175 Remainder (175)10 = (AF) 16 10 . . . . . . . . . . . . 15 = F 10 . . . . . . . . . . . . 10 = A

Find the sum of (1011)2 and (10111)2. 0 1 1 So, 0 1 0 0 0 1 0 1 1 1 1 1 0

(1011)2 + (10111)2 = (100010) 2

For free study notes log on: www.gurukpo.com

(b) Integer (d) None

For free study notes log on: www.gurukpo.com

3. (a) (c) 4. (a) (c) 5. (a) (c) 6. (a) (c)

(b) Complex number (d) None of the above

For free study notes log on: www.gurukpo.com