Hello friends, in today’s new blog “Discrete Structure (CS-302) Important Topics For RGPV Exam” we are going to see the important topic of Discrete Structure.
RGPV is conducting the offline exam in this session, for this everyone has to keep their preparation well, this time again the exam will be like before. So if you want to see the important topic of Discrete Structure then read this blog till the end.
RGPV 2nd Year 3rd Sem Discrete Structure Important Topic
As you all know that colleges have started and the cases of corona are also decreasing, now RGPV has started preparing for an offline exam. So all of us now have to speed up our preparation, now we have to focus on the important topics and important questions.
Important questions given below are an estimate, all of you are requested not to depend only on the questions/topics.
RGPV Paper Scheme
THEORY (Total Marks 100)
- End Semester – 70 (RGPV)
- Mid Semester Examination – 20
- Quiz/Assignment – 10
Practical (Total Marks 50)
(Except Energy & Environmental Engineering and Discrete Structure)
- End Semester – 30
- Sessional – 20
Unit Wise Comparative Analysis Of Papers
(November 2018 and May 2019)
| Unit | Nov. 2018 | May 2019 |
| Marks | Marks | |
| Unit-1 | 28 | 28 |
| Unit-2 | 21 | 7 |
| Unit-3 | 21 | 14 |
| Unit-4 | 21 | 35 |
| Unit-5 | 14 | 7 |
RGPV Discrete Structure Important Question Topic Dec 2021
We have divided the important topic of a data structure into three categories:
- Passing Mark
- Good Marks
- Excellent Marks
Now read the subject given in that category for whichever category you want to get marks, after reading these topics you will be able to get marks.
Passing Marks (Theory Marks 25-30)
Unit-1
- Mathematical Induction
- Problems on Set Theory
Unit-2
- Group and Subgroups
- Coset and Lagranage’s Theorem
Unit-3
- Tautology, Contradiction and logical Implication
- Predicates and Normal Forms
Unit-4
- Shortest path in weighted graph (Dijkstra’s Algorithm)
- Minimum Spanning Tree(Prims and Kruskal Algorithms)
Unit-5
- Recurrence Relation
- Discrete Numeric Function
- Generating Function
Good Marks (Theory Marks 35-50)
Unit-1
- Mathematical Induction
- Partial Order Relation
- Set operation Problems
Unit-2
- Group and Subgroups
- Coset and Lagranage’s Theorem
- Ring and Field Problems with theorem
Unit-3
- Tautology, Contradiction and logical Implication
- Predicates and Normal Forms
Unit-4
- Shortest path in weighted graph (Dijkstra’s Algorithm)
- Minimum Spanning Tree(Prims and Kruskal Algorithms)
- Euler, Isomorphic, Coloring, Path and Cycles
Unit-5
- Recurrence Relation
- Discrete Numeric Function
- Generating Function
Excellent Marks (Theory Marks 50-65)
Unit-1
- Mathematical Induction
- Partial Order Relation
- Set operation Problems
- Job-Scheduling, pigeonhole and Relations
Unit-2
- Group and Subgroups
- Coset and Lagranage’s Theorem
- Ring and Field Problems with theorem
- Homomorphism and isomorphism of Groups
Unit-3
- Tautology, Contradiction and logical Implication
- Predicates and Normal Forms
- Universal and existential quantifiers, logical equivalence
Unit-4
- Shortest path in weighted graph (Dijkstra’s Algorithm)
- Minimum Spanning Tree(Prims and Kruskal Algorithms)
- Euler, Isomorphic, Coloring, Path and Cycles
- Hasse Diagram and Lattices, bounded and complemented lattices
Unit-5
- Recurrence Relation
- Discrete Numeric Function
- Generating Function
I hope you like this post. Please comment if you have any suggestions or questions.
Also, Read B.Tech RGPV First Year Question Paper PDF DEC 2020 – Click Here