Discrete Structures and Graph Theory

DISCRETE MATHEMATICS AND GRAPH THEORY
UNIT-I: Mathematical Logic and Set Theory

Propositions and Logical Operations, Quantifiers, Conditional Statements and Tautologies, Methods of
Proof, Principle of Mathematical Induction. Basic concepts of set theory, Operations on Sets, The power
set.
UNIT-II: Relations and Functions
Relations: Ordered pairs and n-tuples, Product Sets and Partitions, Relations and Digraphs, Matrix of
Relation, Paths in Relations and Digraphs, Properties of Relations, Equivalence Relations & Partitions,
Compatible Relation, Manipulation of Relations, Composition of Relations
Functions: Definition, Composition of functions, Types of Functions, Invertible Function, Permutation
Function, Characteristics function of a set with Theorems.
UNIT-III: Group Theory
Binary Operations, Properties, Semigroups, Monoids,Subsemigroup,Submonoid, Isomorphism &
Homomorphism, , Groups (only definitions and examples) Subgroups and Homomorphism, Cosets and
Lagranges Theorem, Normal subgroups.
Unit- IV:Rings, Lattices & Boolean Algebra
Rings, Fields, Integral Domain, Ring Homomorphism (definitions & examples), Lattices: Properties,
Types of Lattices, Sub lattices, Isomorphic Lattices, Complemented & Modular Lattices (definitions &
examples), Boolean Algebra: Definition, Properties, Simplification of Switching Circuits.
Unit-V: Graph Theory
Basic concepts of Graph Theory, Digraphs, Basic definitions, Paths and Circuits, Reachability and
Connectedness, Matrix representation of graphs, Subgraphs& Quotient Graphs, Isomorphic digraphs &
Transitive Closure digraph, Eulers Path & Circuit (only definitions and examples).
Unit-VI : Trees and Graphs
Trees, Binary Tree, Labeled Trees, Undirected Trees, Spanning Trees of Connected Relations, Prims
Algorithm to construct Spanning Trees, Weighted Graphs, Minimal Spanning Trees by Prims Algorithm
&Kruskals Algorithm.
Text Books
1. Discrete Mathematical Structures(3rd Edition) by Kolman, Busby & Ross PHI.
2. Discrete Mathematical Structures with Applications to Computer Science by Tremblay &Manohar, Tata
McGraw- Hill.
3. Combinatorial Mathematics, C.L. Liu (McGraw Hill)

Reference Books
1. Discrete Maths for Computer Scientists & Mathematicians by Mott, Kandel, Baker.
2. Elements of Discrete Mathematics by C. L. Liu.
3. Discrete Mathematics by Lipschutz.
4. Discrete Mathematics by R.Johnsonbaugh.
5. Higher Engineering Mathematics by B.S. Grewal, 40th Edition, Khanna Publication
DISTRIBUTED SYSTEMS
UNIT I
Characterization of Distributed Systems: Introduction, Examples of Distributed systems, Resource
sharing and web, challenges, System models: Introduction, Architectural and Fundamental models,
Networking and Internetworking, Interprocess Communication.
UNIT II
Distributed objects and Remote Invocation: Introduction, Communication between distributed objects,
RPC, Events and notifications, Case study-Java RMI. Operating System Support: Introduction, OS layer,
Protection, Processes and Threads, Communication and Invocation, Operating system architecture,
Distributed File Systems-Introduction, File Service architecture, case study- SUN network file systems.
UNIT III
Name Services: Introduction, Name Services and the Domain Name System, Case study of the Global
Name Service, Case study of the X.500 Directory Service. Peer to Peer Systems: Introduction, Napster
and its legacy, Peer to Peer middleware, Routing overlays, Overlay case studies-Pastry, Tapestry,
Application case studies-Squirrel, OceanStore.
UNIT IV
Transactions and Concurrency control: Introduction, Transactions, Nested Transactions, Locks,
Optimistic concurrency control, Timestamp ordering, Comparison of methods for concurrency control.
UNIT V
Distributed Transactions: Introduction, Flat and Nested Distributed Transactions, Atomic commit
protocols, Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery,
Replication-Introduction, System model and group communication, Fault tolerant services, Transactions
with replicated data.
UNIT VI
Distributed shared memory, Design and Implementation issues, Sequential consistency and Ivy case
study, Release consistency and Munin case study, Other consistency models, CORBA case study:
Introduction, CORBA RMI,CORBA Services.
TEXT BOOKS:
1. Distributed Systems Concepts and Design, G Coulouris, J Dollimore and T Kindberg, Fourth Edition,
Pearson Education.
2. Distributed Systems, S.Ghosh, Chapman and Hall/CRC, Taylor & Francis Group, 2010.
REFERENCES:
1 .Distributed Computing, S.Mahajan and S.Shah, Oxford University Press.
2. Distributed Operating Systems Concepts and Design, Pradeep K.Sinha, PHI.
3. Advanced Concepts in Operating Systems, M Singhal, N G Shivarathri, Tata McGraw-Hill Edition.
4. Reliable Distributed Systems, K.P.Birman, Springer.
5 .Distributed Systems: Principles and Paradigms, A.S. Tanenbaum and M.V. Steen, Pearson Education.
6. Distributed Operating Systems and Algorithm Analysis,R.Chow, T.Johnson,Pearson.
7. Distributed Operating Systems, A.S.Tanenbaum, Pearson Education.

Discrete Structures and Graph Theory

Uploaded by

Copyright:

Available Formats

Discrete Structures and Graph Theory

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Discrete Structures and Graph Theory

Uploaded by

Copyright:

Available Formats

DISCRETE MATHEMATICS AND GRAPH THEORY

UNIT-I: Mathematical Logic and Set Theory

3. Combinatorial Mathematics, C.L. Liu (McGraw Hill)

You might also like