Top 20 Questions of DS (B-TECH Computer Science Engineering 4th)
Most Repeated Questions
Top 20 Questions of Discrete structures
Previous year question paper with solutions for Top repeated questions of Discrete structures
PTU • B-TECH • Computer Science Engineering • 4th
Browse Top 20 questions of DS (B-TECH Computer Science Engineering 4th) previous year question papers for Top repeated questions of Discrete structures. This page helps DS students find semester-wise papers for revision, exam practice, and understanding previous exam patterns. These are the top twenty repeated questions identified from previous year papers for DS (B-TECH Computer Science Engineering 4th), helping students focus on the most frequently asked topics.
PART-A
1. Sets, relations and functions: Introduction, Combination of Sets, ordered pairs, proofs of general
identities of sets, relations, operations on relations, properties of relations and functions, Hashing
Functions, equivalence relations, compatibility relations, partial order relations. [7]
2. Rings and Boolean algebra: Rings, Subrings, morphism of rings ideals and quotient rings.
Euclidean domains Integral domains and fields Boolean Algebra direct product morphisms Boolean
sub-algebra Boolean Rings Application of Boolean algebra (Logic Implications, Logic Gates, Karnaughmap)
[8]
3. Combinatorial Mathematics: Basic counting principles Permutations and combinations
Inclusion and Exclusion Principle Recurrence relations, Generating Function, Application. [7]
4. Monoids and Groups: Groups Semigroups and monoids Cyclic semigraphs and submonoids,
Subgroups and Cosets. Congruence relations on semigroups. Morphisms. Normal subgroups. Dihedral
groups. [7]
5. Graph Theory: Graph- Directed and undirected, Eulerian chains and cycles, Hamiltonian chains and
cycles Trees, Chromatic number Connectivity, Graph coloring, Plane and connected graphs, Isomorphism
and Homomorphism. Applications.
Top repeated questions
Top 20-
1.
Show that the edge chromatic number of a graph must be at least as large as the maximum degree of a vertex of the graph.
Appeared 2 times
Appeared in: May 2023
-
2.
Define reflexive closure.
Appeared 1 times
Appeared in: May 2023
-
3.
What is Proset?
Appeared 1 times
Appeared in: May 2023
-
4.
List two applications of recurrence relation.
Appeared 1 times
Appeared in: May 2023
-
5.
Define semi group.
Appeared 1 times
Appeared in: May 2023
Login to see the full list of questions for this subject.
Login to see all