Scribd
Upload
42 views1 page

Discrete Mathematics

Uploaded by

20btcse23
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
42 views1 page

Discrete Mathematics

Uploaded by

20btcse23
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/ 1

Discrete Mathematics (CODE: MAC351)

(B.Tech CSE)

Prerequisite: Basics of set theory and combinatory L-P-T:Cr. 3-0-1: 4


Objective: The objective is to introduce Logic, Graphs and Algebraic structures.
Outcome Logics and graphs are the key points for algorithm, Networking, coding and
many more recent areas. This course helps to understand some areas of
computer science in detail.
UNIT – I: Logic
Mathematical reasoning; propositions; negation disjunction and
conjunction; implication and equivalence; normal form; truth tables;
predicates; quantifiers; natural deduction; rules of Inference; methods of
proofs; resolution principle; Automatic theorem proving, Fuzzy logic: fuzzy
relation,, pattern classification, fuzzy analysis, distance between fuzzy
sets, area perimeter, height, width of fuzzy subsets.

UNIT – II: Sets, Relation & Functions


Set theory; Paradoxes in set theory; inductive definition of sets and proof
by induction;Peono postulates; Relations; representation of relations by
graphs, Warshall’s algorithm; properties of relations; equivalence relations
and partitions; Partial orderings; Posets; Linear and well-ordered sets;
Functions; mappings; injection and surjections; composition of functions;
inverse functions;special functions; pigeonhole principle.

UNIT – III: Graph Theory


Graph Theory; elements of graph theory, Graph Isomorphism, connected
graph, Euler graph, Hamiltonian path, Grinberg’s theorem, trees, tree
traversals, spanning trees, BFS & DFS; minimal spanning tree, Kruskal’s
algorithm, Prim’s algorithm, planar graph, dual of a graph, Euler formula

UNIT – IV: Algebraic Structures & Combinatories


Definition and elementary properties of groups, semigroups, monoids,
rings, fields, vector spaces and lattices; Elementary combinatory; counting
techniques; recurrence relation; generating functions
TEXT BOOKS:
C. L. Liu, Elements of Discrete Mathematics, McGraw-Hill.
K. H. Rosen, Discrete Mathematics and applications, TataMcGraw Hill
REFERENCE BOOKS:
J .L. Mott, A. Kandel, T.P .Baker, Discrete Mathematics for Computer
Scientists and Mathematicians, second edition 1986, Prentice Hall of India.
R. Grimaldi and B V Ramana, Discrete and combinatorial mathematics: An
applied introduction, Pearson education

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy