ANSAL INSTITUTE OF TECHNOLOGY, GURGAON Course Code Course Title Credit Instructor Contact No.

: : : : : AMTH 174 / 419 Discrete Mathematical Structures 3 Shikha Gupta 0124 - 4750467

Course Objectives: The objective of this course is to acquaint the students with the basic concepts of discrete algebraic structures and its application to communication systems and computer designs. Course Description: Topics Covered Sets, Relations and Functions Brief introduction to Set theory, Relation, properties of binary Relation, operation on binary Relation, closures, partial ordering, equivalence relation, Function properties of function, composition of function, inverse, binary and n-ary operations, characteristics Define Sets , Describe their applications Define & compare Relation and function List & compare Different operations Explain Warshalls algorithm, Hasse diagram Define Graphs, trees, minimum spanning trees , Evaluate the need of graphs, Describe Knig's Bridge problem, Explain applications of different types of graphs studied Define Boolean functions, Explain & compare various representations Outline & Evaluate the need of Boolean functions, Describe K Maps, List various applications of Boolean Algebra Explain general theory of inference, List rules of inference, Explain Logic of identity , Describe Theorems of 8 Learning Outcomes No. of Lectures

Graphs Minimum spanning trees, Kruskal's algorithm, Dijkstra-Prim algorithm, Shortest paths, Edge-coloring, Application of edgecoloring, Matching, Knig's matching theorem, maximum matching algorithm for bipartite graphs. Boolean algebra and Lattices Boolean functions, Representation and minimization of Boolean functions, Karnaugh map, Applications of Boolean algebra. Lattices: definition, sublattices, direct product, homomorphism 9 10

Prepositional logic Brief review of general theory of inference, Further rules of inference, Logic of identity, Theorems of logic, Derived rules of inference, 10

Transition from informal proofs.

Groups, Ring and Feild Binary

formal

to logic , compare formal and informal proofs. 8

operation, Groups, Subgroups, Homomorphism, Isomorphism, Lagrange theorem, Eulers theorem, Rings, integer rings, Polynomial rings, Field, Division algorithm, Euclidean algorithm, Finite fields.

Evaluation: Final grades will be based on a raw numerical score obtained by weighting grades on assignments and exams according to the table below. Assignments 10% Quizzes/Regular assessment 30% Class participation 10% Mid Term exam 20 % End Term exam 30% Total Textbook:
Discrete Mathematical Structures, Kolman, Busby & Ross.

100%

Reference books: Discrete Mathematical Structures with Application to Computer Science, J. P. Tremblay and R. Manohar, Tata McGraw Hill, Elements of Discrete Mathematics, C. L. Liu, Second Edition, McGraw Hill Discrete Science for Computer and Mathematics, J. L. Mott, A. Kandell, T. P. Baker Introduction to Logic, Patrick Suppes, Affiliated East West Press Private Limited. Attendance: Student(s) are expected to attend classes(s) regularly as per the timetable. Surprise test(s)/quizzes can be conducted on any day. No makeup test(s)/quizzes shall be conducted for missed test(s)/quizzes.