Discrete and combinatorial mathematics :an applied introduction

By:

Ralph P Grimaldi

Material type: Text

TextLanguage: English Publication details: Chennai Pearson 2024Edition: 5th edDescription: xix,1049p. PB 26x20cmISBN:

9789353433055

Subject(s):

mathematics

DDC classification:

23 511 GRID

Summary: Fundamentals of discrete mathematics; fundamental principles of counting; fundamentals of logic; set theory; properties of the integers; mathematical induction; relations and functions; languages: finite state machines;relations:the second time around; further topics in enumeration; the principle of inclusion and exclusion; generating functions; recurrence relations; graph theory and applications; an introduction to graph theory ;trees; optimization and matching; rings and modular arithmetic; Boolean algebra and switching functions ;groups, coding theory and polys method of enumeration; finite and combinatorial designs.

List(s) this item appears in: New Arrivals - Febry 2025

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Barcode
Book	St Aloysius PG Library	Mathematics	511 GRID (Browse shelf(Opens below))	Available	PG024794
Book	St Aloysius PG Library	Mathematics	511 GRID (Browse shelf(Opens below))	Available	PG024795

Total holds: 0

Browsing St Aloysius PG Library shelves, Collection: Mathematics Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511 ANAD Discrete mathematics : a concept-based approach	511 GRAN Numerical mathematics	511 GRID Discrete and combinatorial mathematics :an applied introduction	511 GRID Discrete and combinatorial mathematics :an applied introduction	511 KOSD Discrete mathematics with applications	511 KOSD Discrete mathematics with applications	511 NANS Fuzzy mathematical concepts.	Next

Fundamentals of discrete mathematics; fundamental principles of counting; fundamentals of logic; set theory; properties of the integers; mathematical induction; relations and functions; languages: finite state machines;relations:the second time around; further topics in enumeration; the principle of inclusion and exclusion; generating functions; recurrence relations; graph theory and applications; an introduction to graph theory ;trees; optimization and matching; rings and modular arithmetic; Boolean algebra and switching functions ;groups, coding theory and polys method of enumeration; finite and combinatorial designs.

There are no comments on this title.

to post a comment.