0% found this document useful (0 votes)
41 views3 pages

DSGT Model Paper 2024

Uploaded by

Prince Kaswala
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
0% found this document useful (0 votes)
41 views3 pages

DSGT Model Paper 2024

Uploaded by

Prince Kaswala
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/ 3

Paper / Subject Code: 49*** / Discrete Structures & Graph Theory

1T01873 - S.E. Computer Engineering (R-2019) SEMESTER - III / 493**

QP CODE: 𝟏𝟎𝟎𝟑 ∗∗∗ DATE: 14/11/2024


(3 hours) Total Marks: 80
N.B. 1. Question No. 1 is compulsory
2. Attempt any three questions from remaining five questions
3. Assume suitable data if necessary and justify the assumptions
4. Figures to the right indicate full marks.

FOR Exact questions with solution join our crash course


Click here for IT
Click here for CS, AIML,AIDS,CYB etc
Q1
(a) Logic [5]
(Mathematical Induction)
(b) Graph Theory [5]
Types of graphs, Graph Representation, Sub graphs, Operations on Graphs.
Relations and Functions : Warshall’s algorithm
(c) Counting [5]
Pigeonhole Principle, , Inclusion Exclusion Principle
OR
Algebraic Structures
Semi group, Monoid, Groups, Subgroups, Abelian Group, Cyclic group, Isomorphism
(d) Relations and Functions [5]
(Functions: Definition, Types of functions, Composition of functions.)

Q2
(a) Graph Theory [8]
(Euler and Hamiltonian Graphs)
(b) Counting [8]
Basic Counting Principle-Sum Rule, Product Rule, Inclusion Exclusion Principle
(c) Posets and Lattice [4]
(Lattice, Types of Lattice, Sub lattice)

Q3
(a) Relations and Functions [8]
(Warshall’s algorithm, Equivalence relations and Equivalence Classes.)
(b) Counting [8]
(Recurrence relations, Solving recurrence relations) OR
[6]
(c) Logic [4]
(Propositional Logic, Quantifiers, Normal Forms.) OR
(Predicate Logic , Inference Theory of Predicate Calculus.) [6]

Q4
(a) Posets and Lattice [8]
(Partial Order Relations, Poset, Hasse Diagram, Chain and Anti chains)
(b) Relations and Functions [8]
(Basic concepts of Set Theory)
(c) Counting [4]
Pigeonhole Principle

Q5
(a) Algebraic Structures [8]
(Coding Theory: Coding, binary information and error detection, decoding and error
correction)
(b) Graph Theory [8]
(Homomorphism and Isomorphism of Graphs,
(c) Relations and Functions [4]
(Closures of Relations, Identity and Inverse function)

Q6
(a) Algebraic Structures [8]
Semi group, Monoid, Groups, Subgroups, Abelian Group, Cyclic group, Isomorphism

(b) Algebraic Structures [8]


(Coding Theory: Coding, binary information and error detection, decoding and error
correction)
(c) Graph Theory [4]
Walk, Path, Circuit, Connected Graphs, Disconnected Graph, Components,
Planar Graph, Cut Set, Cut Vertex, Applications.
9049091373

You might also like