Scribd
Upload
1K views3 pages

Discrete Mathematics Syllabus

This document outlines the syllabus for the MATH 1041 Discrete Mathematics course for the B.Tech second semester Computer Science program. The course introduces topics like logic operators, normal forms, sets, relations, recurrence relations, and algebraic structures. It aims to provide hands-on exploration of mathematics applications and develop skills like verifying data consistency, identifying equivalence relations, solving recurrence relations, and understanding group structures and Lagrange's theorem. The course will be delivered through 2 lecture hours per week over 5 units covering these essential discrete mathematics concepts.

Uploaded by

Punya Vardhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1K views3 pages

Discrete Mathematics Syllabus

This document outlines the syllabus for the MATH 1041 Discrete Mathematics course for the B.Tech second semester Computer Science program. The course introduces topics like logic operators, normal forms, sets, relations, recurrence relations, and algebraic structures. It aims to provide hands-on exploration of mathematics applications and develop skills like verifying data consistency, identifying equivalence relations, solving recurrence relations, and understanding group structures and Lagrange's theorem. The course will be delivered through 2 lecture hours per week over 5 units covering these essential discrete mathematics concepts.

Uploaded by

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

MATH 1041 :Discrete Mathematics

B.Tech (Second Semester)


(Syllabus for CSE)

L T P C

2 0 0 2
Preamble :
Discrete Mathematics introduces students to the mathematics of networks, social choice, and
decision making . This course provides students with a hands-on exploration of the relevancy of
mathematics in the real world. This course reflects the rigor taught in many entry-level
mathematics courses.

Course Objectives:
 To introduce basics of mathematical logical operators and connectives
 To impart knowledge on normal forms and rules of inference.
 To impart knowledge on partially ordered and total ordered sets.
 To familiarize closed form solution of linear recurrence relations by various methods.
 To impart knowledge on basic concepts of algebraic structures.
 To write program structures, and understand when programming is most applicable

Unit-1: Logic Operators and Connectives (5 hrs)

Negation, conjunction, disjunction, conditional and bi-conditional, well formed


formulae, tautologies, equivalence of formulae, duality, tautological implications.
Learning outcomes:
After completion of this unit, student will be able to
 construct the truth table for given expressions (L3)
 identify tautologies, Contradiction or at least satisfiable and solve the decision problem.
(L3)
 find equivalence formulas (L3)
Unit-2: Mathematical logic ( 5 hrs)

Conjunctive and disjunctive normal forms- principal disjunctive and conjunctive normal forms,
Rules of inference for propositional calculus (Rule P, Rule T and CP rule).

Learning Outcomes:

After completion of this unit, student will be able to


 implement logic for mathematical proofs (L4)
 apply inference theory to verify the consistence of data (L3)

Unit-3: Sets and Relations (5 hrs)


Basic concepts of set theory, Power set, relations, properties of binary relations in a set,
Equivalence relations, composition of binary relations, Partial ordering, Partially ordered set.
Hasse diagram.
Learning Outcomes:
After completion of this unit, student will be able to
 identify different types of sets and relations (L3)
 test the given set is an equivalence relation or not (L4)

Unit-4: Recurrence relations (5hrs)


Recurrence relations, solving linear recurrence relations by characteristic roots method,
system of recurrence relations.

Learning Outcomes:
After completion of this unit, student will be able to

 construct recurrence relations of the sequences (L3)


 solve homogeneous linear recurrence relations (L3)
 solve complementary function and particular integral for non-homogeneous linear
recurrence relations (L3)

Unit-5: Algebraic Structures ( 6 hrs)


Algebraic Structures-Semi group, Monoid ,Groups, subgroups, cosets((definition and examples)
Lagrange's theorem on finite groups

Learning Outcomes:
After completion of this unit, student will be able to
 test the given algebraic structure is a group or not (L3)
 identify different types of groups (L2)
 understand the significance and applications of Lagrange’s theorem (L3)

Text Books:

1. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to


Computer Science, Tata McGraw Hill, 1997.
2. Kenneth H. Rosen, Discrete Mathematics and Applications, Seventh edition, Tata
McGrawHill,2012.

Reference books:

1.Bhishma Rao, Mathematical Foundations of Computer Science, SciTech Publications


(India) Pvt Ltd.
2. Discrete Mathematical Structures,Sixth edition-Kolman,Busby,Ross

Course Outcomes:

Upon successful completion of this course the student should be able to

• Check the validity of a statement formula (L2)


• analyze the concepts in set theory and relations (L3)
• find a general solution of recurrence equation (L3)
• build the algebraic structures (L3)
• Apply Lagrange’s theorem on finite groups (L3)
• Convert problem solving strategies to procedural algorithms (L3)

You might also like