Scribd
Upload
23 views2 pages

Discrete

The document outlines the Discrete Structures course offered by Deenbandhu Chhotu Ram University, detailing its objectives, topics, and assessment structure. Key areas of study include sets, relations, functions, logic, combinatorics, graph theory, and algebraic structures, which are essential for various computing applications. The course aims to enhance students' analytical and problem-solving skills in computer science and engineering.

Uploaded by

mananjuneja101
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
23 views2 pages

Discrete

The document outlines the Discrete Structures course offered by Deenbandhu Chhotu Ram University, detailing its objectives, topics, and assessment structure. Key areas of study include sets, relations, functions, logic, combinatorics, graph theory, and algebraic structures, which are essential for various computing applications. The course aims to enhance students' analytical and problem-solving skills in computer science and engineering.

Uploaded by

mananjuneja101
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

DEENBANDHUCHHOTURAMUNIVERSITYOFSCIENCE&TECHNOLOGY

MURTHAL (SONEPAT) HARYANA-131039


DEPARTMENTOFCOMPUTER SCIENCE AND ENGINEERING
II Semester Course
(EffectivefromSession2024-25)

Course Code: PCCSE102D InternalMarks:40


Title of the Course: DISCRETE STRUCTURES ExternalMarks:60
L-T-P: 3-1-0 Maximum Marks: 100
Credits: 4 Durationof Exam: 3 Hrs.
Brief Write-UpAbout theCourse(100-150 words)
Discrete Structures is a fundamental course in Computer Science and Engineering that provides the
mathematical foundation for various computing concepts. It introduces students to essential topics
such as sets, relations, functions, logic, counting principles, graph theory, and algebraic structures,
which are crucial for problem-solving, algorithm design, data structuring and database
management.
The course emphasizes logical reasoning, proof techniques, and combinatorial analysis, enabling
students to develop analytical thinking skills necessary for areas like database systems,
cryptography, artificial intelligence, network security, and software engineering and many more.

CourseObjective(CO):
1. Understand the fundamental concepts of sets, relations, functions, and logic, which form the basis
of computing and mathematical reasoning.
2. Learn combinatorial techniques such as permutations, combinations, recurrence relations, and
generating functions, which are essential for algorithm analysis.
3. Explore graph theory and trees, which play a vital role in network analysis, computer architecture,
and database indexing.
4. Study algebraic structures like groups, rings, fields, and Boolean algebra to understand their
applications in cryptography, data security, and logic design.

UNIT 1(Lecture-10): Mathematical Foundations and Logic


Sets, Relations, and Functions: Operations on Sets (Union, Intersection, Difference, Complement),
Finite and infinite Sets, Countable and uncountable Sets, Cartesian Products and Power Sets,
Binary Relations, Types of Relations, Equivalence Relations, Partial Ordering Relation, Functions:
Injective, Surjective, Bijective, Inverse, and Composition of Functions
Propositional and Predicate Logic: Propositional Logic: Syntax, Semantics, Truth Tables, Logical
Equivalence, Normal Forms (CNF, DNF), Predicate Logic: Quantifiers, Free and Bound Variables,

UNIT-II (Lecture-10): Combinatorics and Recurrence Relations

Counting Techniques:Permutations and Combinations, Pigeonhole Principle


Generating Functions and Recurrence Relations:Recurrence Relations: Linear and Non-Linear,
Solving Recurrence Relations using Iteration and Substitution, Generating Functions for Counting

UNIT-III(Lecture-10): Graph Theory and Trees

Graphs and Their Properties: Graphs and their properties, Degree, Types of Graphs (Directed,
Undirected, Weighted, Bipartite), Graph Isomorphism and Connectivity, Eulerian and Hamiltonian
Paths, Planar Graphs, Graph Coloring, Colouring maps, Colouring Vertices, Colouring Edges, List
Colouring, Perfect Graph,
Trees: Binary Trees, Spanning Trees, Minimum Spanning Trees (Prim’s and Kruskal’s Algorithms)

UNIT-IV(Lecture-10): Algebraic Structures and Boolean Algebra

Algebraic Structures: Algebraic Structures with one Binary Operation, Semi Groups, Monoids,
Groups, Free and Cyclic Monoids and Groups, Permutation Groups, Substructures, Normal
Subgroups, Algebraic Structures with two Binary Operation, Rings, Integral Domain and Fields.
Applications in Computer Science : Introduction to the applications of Discrete Structures in
Database Management Systems, Computer Networks, Compiler Design, Digital Circuit Design, AI,
Cryptography.

Text Books:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
2. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer Oriented
Approach, 3rd Edition by, Tata McGraw – Hill.
3. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth
Publishing Co. Inc.

Referencebooks:
1. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and It’s Application to
Computer Science”, TMG Edition, TataMcgraw-Hill
2. Eric Gossett, Discrete Mathematics with Proof, Wiley
3. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press.
4. Schaum’s Outlines Series, Seymour Lipschutz, Marc Lipson,Discrete Mathematics, Tata
McGraw - Hill
Outcome(CO):Upon successful completion, students will be able to:
1. Apply logical reasoning and proof techniques to solve computational problems.
2. Utilize combinatorial methods to analyze algorithms and optimize problem-solving.
3. Develop solutions using graph theory and tree structures.
4. Understand algebraic structures and their applications.

Note:
1.The paper setter will set two questions (with/without parts) from each units, the first
questionwill be compulsory and comprising of 5 to 10sub-parts, covering the entire
syllabus .The examinee will attempt 5 questions in all, along with the compulsory question,
selecting one question from each unit. All question will carry equal marks.

You might also like