Scribd
Upload
60 views2 pages

Time: 3 Hours Total Marks: 100: Printed Pages:2 Sub Code: EOE 048/NOE 048 Paper Id: 199232 Roll No

This document is a 2-page exam for a Discrete Mathematics course covering topics like relations, functions, graphs, recurrence relations, and other discrete structures. It contains 7 sections with multiple choice and long answer questions. Section A has 10 short answer questions covering topics such as relation matrices, function domains and ranges, types of statements, truth tables, counting arrangements and permutations, recursively defined functions, and graph drawings. Section B has 3 long answer questions choosing from topics on relations, logic validity, and counting committee formations. Section C contains 1 long answer question on functions or groups. Sections D-G each contain 1 long answer question choosing from topics on quantifiers, logic operations, counting solutions to equations, the pigeonhole principle, solving

Uploaded by

Roop Sagar Teella
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views2 pages

Time: 3 Hours Total Marks: 100: Printed Pages:2 Sub Code: EOE 048/NOE 048 Paper Id: 199232 Roll No

This document is a 2-page exam for a Discrete Mathematics course covering topics like relations, functions, graphs, recurrence relations, and other discrete structures. It contains 7 sections with multiple choice and long answer questions. Section A has 10 short answer questions covering topics such as relation matrices, function domains and ranges, types of statements, truth tables, counting arrangements and permutations, recursively defined functions, and graph drawings. Section B has 3 long answer questions choosing from topics on relations, logic validity, and counting committee formations. Section C contains 1 long answer question on functions or groups. Sections D-G each contain 1 long answer question choosing from topics on quantifiers, logic operations, counting solutions to equations, the pigeonhole principle, solving

Uploaded by

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

EOE048/NOE048

Printed Pages:2 Sub Code: EOE 048/NOE 048

Paper Id: 199232 Roll No.

B.TECH
(SEM IV) THEORY EXAMINATION 2018-19
DISCRETE MATHEMATICS
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


a. Let R be the relation from the set A = on itself and defined by R= {(1, 1), (1, 3),
(3, 3), (4, 4)}.then find the relation matrix.
b. Find the domain and range of f(x) =sinx –cosx.
c. What type of sentence is 5+x =9? For what value of x it will become a true statement.
d. Define the Conjunction terms with appropriate truth table.
e. How many ways are there to arrange the nine letters in the word ALLAHABAD?
f. In how many ways can 8 students be arranged in a circle?
www.aktuonline.com

g. Define the Recursively Defined function.


h. Find the Generating function of the following series 1,1,1,1,1,1,1.
i. Draw all simple graphs of one, two, three and four vertices.
j. Define Hamiltonian graph.
SECTION B

2. Attempt any three of the following: 10x3=30


a. Let A= {1, 2, 3, 4, 5, 6} and let R be the relation x divides y. (I) Write R as a set of
ordered pairs (ii) Draw its directed graph (iii) Find R-1.
b. Test the validity of the argument: if 8 is even then 2 does not divide 9. 7 is not prime
or 2 divides 9.But 7 is prime, therefore, 8 is odd.
c. A committee of 5 is to be formed out of 6 gents and 4 ladies. In how many ways this
can be done when (I) at least 2 ladies are included (ii) at most 2 ladies are included.
d. Solve the recurrence relation .
e. Prove that a graph is bipartite if and only if all its circuits are of even length.
SECTION C
3. Attempt any one part of the following: 10x1=10
a. Let be a function defind by Then find
Also find the values of p and q.
b. Prove that the set G= {0, 1, 2, 3, 4, 5} is a finite abelian group of order 6 with
respect to addition modulo 6.

Page 1 of 2
http://www.aktuonline.com
EOE048/NOE048
4. Attempt any one part of the following: 10x1=10
a. Define quantifiers, universal quantifiers and existential quantifiers by giving an
example.
b. Define the following terms with appropriate truth table (I)Conjunction (ii)
Disjunction (iii) conditional (iv) Negation.

5. Attempt any one part of the following: 10x1=10


a. How many integer solutions are there to the equations:

b. State and prove pigeonhole principle.

6. Attempt any one part of the following: 10x1=10


a. Solve the recurrence relation .by the method of generating
function with initial conditions .
b. Solve the recurrence relation
using generating functions.
www.aktuonline.com

7. Attempt any one part of the following: 10x1=10


a. A tree has two vertices of degree 2, one vertex of degree 3 and three vertices of
degree 4.How many vertices of degree 1 does it have?
b. Prove that a binary tree with n nodes has exactly (n + 1) null branches.

Page 2 of 2
http://www.aktuonline.com

You might also like