Continuous Mathematics and Discrete Mathematics are the two main branches of the subject Mathematical Science. Discrete Mathematics is an essential tool in the study of Computer Science. The objective of this book is to introduce some discrete structures to undergraduate courses of Computer Science in an easy and simple way. The topics which are very relevant with respect to university syllabus are fully covered by this book and will support in self study. Each chapter of this book covers a module as per the latest syllabus prescribed by Mahatma Gandhi University for the third semester of B.Tech. Courses in Computer Science. Almost all problems are worked out and additional problems are incorporated from latest Mahatma Gandhi University Question papers to increase the flavor of the book.
Additional Info
  • Publisher: Laxmi Publications
  • Language: English
  • ISBN : 978-93-81159-56-9
  • Chapter 1

    Chapter 1 Mathematical Logic Price 2.99  |  2.99 Rewards Points

    Logic is concerned with methods of reasoning. Logical reasoning is the essence of mathematics
    and is therefore an important starting point for study of discrete mathematics. One component
    of logic is proposition calculus which deals with statements with values true and false
    and is concerned with analysis of propositions, and the other part is predicate calculus which
    deals with predicates which are propositions containing variables.

  • Chapter 2

    Chapter 2 Number Theory Price 2.99  |  2.99 Rewards Points

    Number theory, that deals with integers more specifically, positive integers and their properties,
    plays an important role in discrete mathematics. The theory of numbers finds its applications
    in computer science arithmetic that includes transmission, coding and manipulation of
    numerical data and also in Cryptography—the study of secret messages

  • Chapter 3

    Chapter 3 Relations and Functions Price 2.99  |  2.99 Rewards Points

    Let A and B be any two sets. Then the product set of A and B is defined as
    A × B = {(a, b)/a ∈ A, b ∈ B}.
    The product set of A × B is sometimes called direct product or Cartesian product.

  • Chapter 4

    Chapter 4 Partially Ordered Set and Lattices Price 2.99  |  2.99 Rewards Points

    A Relation R on a set S is called a partial ordering, if it is reflexive, anti-symmetric and

  • Chapter 5

    Chapter 5 Graph Theory Price 2.99  |  2.99 Rewards Points

    Definition: A graph G = (V(G), E(G)), consists of two finite sets:
    V(G), the vertex set, of the graph, often denoted by V., which is non-empty set of elements
    called vertices and E(G), the edge set of the graph, often denoted by E., which is a possibly
    empty set of elements called edges, such that each edge e ∈ E is assigned an unordered pair of
    vertices (u, v) called the end vertices of e.

  • Chapter 6

    Model Question Price 2.99  |  2.99 Rewards Points

    Third Semester
    Branch: Computer Science/Information Technology

About the Author