Skip to Main Content

Discrete Structures: Home

Discrete structure A set of discrete elements on which certain operations are defined. The term discrete structure covers many of the concepts of modern algebra, including integer arithmetic, monoids, semigroups, groups, graphs, lattices, semirings, rings


Mathematical reasoning, propositional and predicate logic, rules of inference, proof by induction, proof by contraposition, proof by contradiction, proof by implication, set theory, relations, equivalence relations and partitions, partial orderings, recurrence relations, functions, mappings, function composition, inverse functions, recursive functions, Number Theory, sequences, series, counting, inclusion, and exclusion principle, pigeonhole principle, permutations, and combinations, elements of graph theory, planar graphs, graph coloring, Euler graph, Hamiltonian path, rooted trees, traversals.



The course guide is useful
Yes: 1 votes (100%)
No: 0 votes (0%)
May be: 0 votes (0%)
Total Votes: 1



Library Timings


Monday-Thursday  8:00 am - 4:00 pm

Friday  8:00 am - 7:00 pm

Saturday 10:00 am - 07:00 pm

Sunday  9:00 am- 5:00 pm

Library Sitting Area

Find Out More


Information Advisor

Find Out E-books & articles

Search the Library Catalog

Welcome to the Online Public Access Catalog (OPAC). This catalog provides you bibliographic information of print books available in all campus libraries of the University and provides you the facility of 2 types of searches; basic search and advance search to find the exact book or list of books you required.

Important Features for Patrons

  1. Easy access to information due to effective searching.
  2. Alert messages for patron i.e. overdue items or arrival of new items.
  3. Patron can suggest books for purchase through this system.
  4. Patrons can check his circulation history and hold on desired books.
  5. OPAC brings together library users and staff, as both can see various aspects of the system.

Search You Required Book