Scribd
Upload
3 views2 pages

Important Topic DSTL

The document outlines important topics for the 3rd semester B.Tech course in Discrete Structure & Theory of Logics at Galgotias College of Engineering and Technology. It includes course objectives, unit-wise important topics, and specific problems related to sets, relations, functions, logic, group theory, and graph theory. Each unit contains various questions and concepts that are essential for examination preparation.

Uploaded by

vishakhasingh.official16
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
3 views2 pages

Important Topic DSTL

The document outlines important topics for the 3rd semester B.Tech course in Discrete Structure & Theory of Logics at Galgotias College of Engineering and Technology. It includes course objectives, unit-wise important topics, and specific problems related to sets, relations, functions, logic, group theory, and graph theory. Each unit contains various questions and concepts that are essential for examination preparation.

Uploaded by

vishakhasingh.official16
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

Galgotias College of Engineering and Technology, Greater Noida

IMPORTANT TOPICS
Course/Branch : B.Tech / CSE & Allied Specialized Branches
Semester : 3rd
Subject Name : Discrete Structure & Theory of Logics
Subject Code : BCS-303
CO-1 : Acquire Knowledge of sets and relations for solving the problems of POSET and lattices
CO-2 : Apply fundamental concepts of functions and Boolean algebra for solving the problems
of logical abilities.
CO-3 : Employ the rules of propositions and predicate logic to solve the complex and logical
problems.
CO-4 : Explore the concepts of group theory and their applications for solving the advance
technological
CO-5 : Illustrate the principles and concepts of graph theory for solving problems related to
computer science
Important Topics Unit-wise with AKTU Examination Year

UNIT -1
1. Prove that for any sets A, B, and C:
(i) (A – (B ∩ C)) = (A – B) U (A – C), (ii) A ∩ (B U C) = (A ∩ B) U (A∩ C) (2021, 2022)
2. State De Morgan‟s law and Absorption Law. (2022, 2023)
3. Briefly discuss about Power set. (2019, 2022, 2023)
4. Discuss type of function and growth of function (2020, 2021)
5. Let R be a relation on the set A with cardinality n. Writ down the number of reflexive and
symmetric relation on the set A. (2021, 2012)
6. Write the contra positive of the implementation. “if it is Sunday, then it is a holiday” (2019,
2020, 2022)
7. How many symmetric and reflexive relations are possible from a set A containing „n‟
elements. (2019, 2023)
8. Draw the Hasse diagram for (D30, /), where Dn is the set of positive divisors of n. (2021, 2022, 2023)
9. For a given set A= {1, 2, 3}, Let R1, and R2 are two relations. Find below relations are
POSET or not. R1= {(1,1), (2,2), (3.3)}, R2= {(1,1), (2,2), (3.3), (1,3), (2,3). (2019, 2021,
2022)
10. Discuss about the modular lattice with an appropriate example. (2021, 2023)
UNIT -2
1. Solve E (x, y, z, t) = ∑ (0,2,6,8,10,12,14,15) using K-map. (2021,2023)
2. Use Karnaugh map representation to find minimal sum of products expression for the
following Boolean function: F (A, B, C) = ∑ (0, 2, 3, 4, 7) (2023)
3. 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. (2023-24)
i. (fogoh)(x) ii. (gog)(x)
iii. (goh)(x) iv. (hogof)(x)
4. Let f be the function from R to R, find the inverse of f:
i) f(x) = (7x+3) / (x-2), given x is neither 2 nor 7
ii) f (x) = x2 then find f −1({1}), f −1({x | 0 <x< 1}), and f −1({x | x > 4}).(2020-21)
5. Define injective, surjective and bijective function. Check whether the function f(x) =x2 -1 is
injective or not for f: R->R. (2023-24)
UNIT -3
1. State De Morgan‟s law and Absorption Law. (2019, 2021, 2022, 2023)
2. Show that the propositions 𝑝→𝑞𝑎𝑛𝑑 ¬𝑝𝗏𝑞 are logically equivalent. (2020)
3. Suppose that (p→¬q) is false, find all the combinations of „r‟ and„s‟ for which (¬q → r) ˄ (¬p
˅ s) is true. (2020, 2022)
4. Define Semi-Group with appropriate example. (2020, 2021, 2023)
5. Define predicates with appropriate example. (2020, 2022, 2023)
6. Show that ((p → q) ˄ (q → r)) → (p → r) is a tautology. (2022, 2023)

UNIT -4
1. Let G = {1,-1, i ,-i} be a multiplicative group then Determine whether is an abelian group .
Also if G is Cyclic group then find the order of every element, where i is the fourth root of
unity (2023, 2024)
2. What is Ring? Define elementary properties of Ring with example. (2020, 2021)
3. Describe and proof Lagrange Theorem. (2019, 2020, 2022, 2023)
4. Define the binary operation * on Z by x*y=x + y + 1 for all x, y belongs to set of integers. Verify that
(Z, *) is abelian group? Discuss the properties of abelian group. (2019, 2020, 2021)

5. Define field and ring with appropriate example. (2021, 2020)

UNIT -5
1. Isomorphic Graph and Hamiltonian graph. (2021, 2022, 2023)
2. Compare bipartite graph, complete graph and Hamiltonian Circuit. (2021, 2022, 2023)
3. Define planar graph. Prove that for any connected planar graph, v – e+ r = 2 Where v, e, r is the
number of vertices, edges, and regions of the graph respectively. (2019, 2022, 2023)
4. Draw the adjacency matrix of a given graph (2019, 2021, 2022)
5. Explain pigeon hole principle with example. (2020, 2023)

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