Scribd
Upload
54 views

Important Questions: Galgotias College of Engineering & Technology

Uploaded by

pranavpro2005
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
54 views

Important Questions: Galgotias College of Engineering & Technology

Uploaded by

pranavpro2005
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

Department Of Computer Science & Engineering

Galgotias College of Engineering & Technology


1, Knowledge Park-II, Greater Noida, Uttar Pradesh, 201310

Date: 05 October, 2024

Important Questions
BCS-303: Discrete Structures and Theory of Logic
Course: B.Tech. CSE & Allied Branches
Odd Semester, Session: 2024-25

1. A survey has been taken on methods of computer travel. Each respondent was asked to
check BUS, TRAIN, or AUTOMOBILE as a major method of travelling to work. More
than one answer was permitted. The results reported were as follows: BUS, 30 people;
TRAIN, 35 people; AUTOMOBILE, 100 people; BUS and TRAIN, 15 people; BUS and
AUTOMOBILE, 15 people; TRAIN and AUTOMOBILE, 20 people; and all three
methods, 5 people. How many people completed a survey form?

2. Explain why (A × B) × (C × D) and A × (B × C) × D are not the same.

3. Prove that for any sets A, B, and C: (A – (B ∩ C)) = (A – B) U (A – C)

4. If A and B are two sets, then show that


(A – B)  (B – A) = (A  B) – (A  B).

5. Let A denotes the set of real numbers and a relation R is defined on A such that (a,
b) R(c, d) if and only if a2 + b2 = c2 + d2. Justify that R is an equivalence relation.

6. Let R be the relation R = {(a, b) | a divides b} on the set of positive integers. Find inverse
and complement of R.

7. For each of these relations on the set {1, 2, 3, 4}, decide whether it is reflexive, whether it
is symmetric, whether it is antisymmetric, and whether it is transitive.
i) {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)} ii) {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)}
iii) {(2, 4), (4, 2)} iv) {(1, 2), (2, 3), (3, 4)}
v) {(1, 1), (2, 2), (3, 3), (4, 4)}
8. Suppose that the relation R is irreflexive. Is the relation R2 necessarily irreflexive?
9. Which of these are posets? State the reason of each one.
i) (R, =) ii) (R, <) iii) (R, ≤) iv) (R, ≠)
10. Draw the Hasse diagram for the given posets
i) (D30, /), where Dn is the set of positive divisors of n.
ii) Consider a set S={a, b, c, d}, and the poset (P(S), ⊆) where P(S) is the power set of
the set S.
11. Which of the following posets are lattice? If you find some lattices then state their
types i.e. bounded lattice, complemented lattice, distributive and complete lattice.
Department Of Computer Science & Engineering
Galgotias College of Engineering & Technology
1, Knowledge Park-II, Greater Noida, Uttar Pradesh, 201310

12. Define Modular lattice. Let L1 be the lattice defined as (D6, /) and L2 be the lattice (P(S),
⊆), where P(S) be the power set defined on set S= {a, b}. Justify that the two lattices are
isomorphic
13. Let A=B=Z, and C be the set of even integers. Let f: A→B and g: B→C be defined by
f(a) = a + 1 and g(b) = 2b, find gof.
14. Explain bijective function with the help of an example. Find the inverse of the following
functions
f(x) = (3x+2) / (x-1)
15. If f: R → R, g: R → R and h: R → R defined by f(x) = x2, g(x) = 2x and h(x) = x+4.
Compute the following composition functions.
i) (fogoh)(x) ii. (gog)(x)
iii. (goh)(x) iv. (hogof)(x)
16. Let f be a function from A to B. Determine whether each function f is one to one and
whether it is onto
i) A = R, B = {x | x is real and x≥0}; ii) A = R x R, B = R; f((a, b)) = a

17. Simplify the Boolean function F(A, B, C, D): ∑(1, 3, 7, 11, 12, 13) which has the don't
care condition d(A, B, C, D ): ∑(0, 2, 5, 9) and then express the simplified function in sum
of min-terms form.
18. Explain different logic gates families in digital circuits. Write a short note on universal
gates.
19. Minimize Boolean expression AB'C + A'BC + ABC' + A'B'C + AB'C' using Boolean
identities.
20. Give minimum sum of product expression for shown in Karnaugh-map below

You might also like