Scribd
Upload
28 views

Set A DM

This document contains a 6 question exam on discrete mathematics. It covers topics such as: - Definitions of multisets, semigroups, lattices, quantifiers, and multigraphs. - Determining if relations are reflexive, symmetric, transitive, or partial orders. - Using induction to prove inequalities. - Constructing logic circuits from NAND gates. - Evaluating the truth values of logical statements. - Using rules of inference to derive conclusions from hypotheses. - Solving recurrence relations using generating functions. - Defining graph theory concepts like isomorphism, subgraphs, trees, and chromatic number. The exam tests knowledge of core

Uploaded by

Neeraj Baishwar
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
28 views

Set A DM

This document contains a 6 question exam on discrete mathematics. It covers topics such as: - Definitions of multisets, semigroups, lattices, quantifiers, and multigraphs. - Determining if relations are reflexive, symmetric, transitive, or partial orders. - Using induction to prove inequalities. - Constructing logic circuits from NAND gates. - Evaluating the truth values of logical statements. - Using rules of inference to derive conclusions from hypotheses. - Solving recurrence relations using generating functions. - Defining graph theory concepts like isomorphism, subgraphs, trees, and chromatic number. The exam tests knowledge of core

Uploaded by

Neeraj Baishwar
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

Babu Banarasi Das University Lucknow b) If we consider the group (Z4, +4) then find H1={0,2} and H2={0,1,3}

B.Tech Fourth Sem (2016-17) with respect to addition modulo 4 are subgroup or not?
c) Let p, q, and r be the propositions
p :You have the flu.
Sub Code: BCS-2402 Sub Name: Discrete Mathematics q :You miss the final examination.
Max. Marks: 60 Time: 3 Hours r :You pass the course.
Express each of these propositions as an English sentence.
a) p → q b) ￢q ↔ r
Note: This paper contains three sections A, B and C. Attempt all sections. c) q →￢r d) p ∨ q ∨ r
e) (p →￢r) ∨ (q →￢r)
Section-A f ) (p ∧ q) ∨ (￢q ∧ r)
Q1. Attempt all questions (8 X 1 =8)
d) Differentiate between Euler circuit & Hamiltonian circuit with example.
Section-C
a) Define multi sets.
b) Define a semi group. Q3 Attempt any two parts: (2 X 5=10)
c) When a lattice is called bounded lattice. a) What are the recursively defined functions? Give the recursive definition
d) When a lattice is called complemented lattice. of factorial function.
e) Define universal and existential quantifiers. b) List all possible functions from A to B, A = {a, b, c}, B = {0, 1}. Also
f) Show the propositions p → q and ⌐ p V q are logically equivalent. indicate in each case whether the function is one-to-one, is onto and one-
g) Define Multi Graph. to-one-onto.
h) Define Binary Search Tree. c) Use mathematical induction to prove the inequality
n
Section-B n < 2 for all positive integers n.

Q2 Attempt any two parts: (2 X 6 =12)

a) For each of these relations on the set {1, 2, 3, 4}, decide Q4. Attempt any two parts: (2 X 5=10)
whether it is reflexive, whether it is symmetric, whether a) Which of these relations on {0, 1, 2, 3} are partial orderings?
it is anti-symmetric, and whether it is transitive. Determine the properties of a partial ordering that the others lack.
a) {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)} a) {(0, 0), (1, 1), (2, 2), (3, 3)}
b) {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)} b) {(0, 0), (1, 1), (2, 0), (2, 2), (2, 3), (3, 2), (3, 3)}
c) {(2, 4), (4, 2)} c) {(0, 0), (1, 1), (1, 2), (2, 2), (3, 3)}
d) {(1, 2), (2, 3), (3, 4)} d) {(0, 0), (1, 1), (1, 2), (1, 3), (2, 2), (2, 3), (3, 3)}
e) {(1, 1), (2, 2), (3, 3), (4, 4)} e) {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0),
(2, 2), (3, 3)}
f ) {(1, 3), (1, 4), (2, 3), (2, 4), (3, 1), (3, 4)}
b) Find whether algebraic structure (Z7, ×7) is a field or not.
c) Find whether Dn is a complemented lattice or not.

Q5. Attempt any two parts: (2 X 5=10)


a) Use NAND gates to construct circuits with these outputs.
a) ̅x b) x + y
c) xy d) x ⊕ y
b) Let Q(x) be the statement “x + 1 > 2x.” If the domain
consists of all integers, what are these truth values?
a) Q(0) b) Q(−1) c) Q(1)
d) ∃xQ(x) e) ∀xQ(x) f ) ∃x￢Q(x)
g) ∀x￢Q(x)

c) Use rules of inference to show that the hypotheses "Randy works hard,"
"If Randy works hard, then he is a dull boy," and "If Randy is a dull boy,
then he will not get the job" imply the conclusion "Randy will not get the
job."

Q6. Attempt any two parts: (2 X 5=10)

a) Solve the following recurrence relation a n+2 - 2 a n+1 + an = 2n with


a0 = 2 , a1 = 1 using generating functions.
b) What do you mean by graph isomorphism, show it by example?
c) Define the following with one example:
(i) Pendant Vertex
(ii) Sub graph.
(iii) Binary tree.
(iv) Chromatic number of a graph.
(v) Null Graph

You might also like

pFad - Phonifier reborn

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

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


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy