Scribd
Upload
107 views1 page

Dms 1sess

This document is the question paper for a discrete mathematical structures exam for computer science students. It contains 6 questions testing various concepts: 1) Relations and their representations as sets of ordered pairs and graphs. Also, finding the inverse of a relation. 2) Composition of functions and determining if they are injective, surjective, or bijective. Also defining recursive functions like factorial. 3) Set operations and Venn diagrams. Properties of sets, power sets, and relationships between sets. 4) Graph theory concepts like isomorphism, handshaking lemma, Hamiltonian and regular graphs, binary search trees. 5) Equivalence relations and determining if a given binary relation is reflexive

Uploaded by

Vaibhav Mittal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
107 views1 page

Dms 1sess

This document is the question paper for a discrete mathematical structures exam for computer science students. It contains 6 questions testing various concepts: 1) Relations and their representations as sets of ordered pairs and graphs. Also, finding the inverse of a relation. 2) Composition of functions and determining if they are injective, surjective, or bijective. Also defining recursive functions like factorial. 3) Set operations and Venn diagrams. Properties of sets, power sets, and relationships between sets. 4) Graph theory concepts like isomorphism, handshaking lemma, Hamiltonian and regular graphs, binary search trees. 5) Equivalence relations and determining if a given binary relation is reflexive

Uploaded by

Vaibhav Mittal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Vidya College of Engineering, Meerut

Sessional Exam: I (Odd Semester, 2010-2011)

Subject Title & Code: Discrete Mathematical Structures & ECS – 303
Branch / Sem: CS / III Time: 2 hours M.M: 30
Roll No.: ……………………………

Note: Attempt all questions. All questions carry equal marks. (6*5=30)

Q1. a) Let A = {1, 2, 3, 4, 5, 6} and R be a Relation defined by “x divides y” written as x/y


i) Write R as set of ordered pairs
ii) Draw its directed graph
iii) Find R-1
b) Show the function f(x) = K, where K is constant, is primitive recursive?

Q2. a) Let f: RR and g: RR, where R is the set of real numbers. Find fog and gof, where
f(x) = x2-2 and g(x) = x+4. State whether these functions are injective, subjective and bijective.
b) What is meant by recursively defined function? Give the recursive function of factorial
function.

Q3. a) i) Show that for any two sets A and B


A - (A ∩ B) = A – B
ii) Give the power set of the set given below-
A = {a, {b}}
b) Draw Venn diagram showing
i) A U B A U C but B C
ii) A ∩ B A ∩ C but B C

Q4. a) What do you understand by the following:-


i) Graph Isomorphism
ii) Handshaking Lemma
iii) Hamiltonian Graph
iv) Complete and Regular Graph
v) BST
b) Prove that if the graph has ‘n’ vertices and vertex ‘u’ is connected to vertex ‘w’ then there
exists a path from ‘u’ to ‘w’ of length no more than ‘n’.

Q5. a) Let x = {1, 2, …. , 7} and R is defined as:


R = {<x, y> | x-y is divisible by 3}
Show that R is equivalence relation?
b) Let R be a binary relation on the set of all strings of 0’s and 1’s such that
R = {(a, b)| a and b are strings that have the same number of 0’s},
Is R reflexive, symmetric or transitive?

Q6. Fibonacci numbers Fn are defined by: F0 =1, F1 =1, Fn = Fn-1 + Fn-2 for all n>=2. Let the sequence
of numbers Gn be defined by, G1 =1, G2 =3, Gn = Gn-1 + Gn-2+1 for all n>=3. Prove with induction
that Gn =2Fn-1 for all n>=1.

You might also like