Guide to Discrete Mathematics:

O’Regan, Gerard

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/748

Full metadata record

DC Field	Value	Language
dc.contributor.author	O’Regan, Gerard	-
dc.date.accessioned	2026-10-16T10:11:00Z	-
dc.date.available	2026-10-16T10:11:00Z	-
dc.date.issued	2016	-
dc.identifier.isbn	978-3-319-44560-1	-
dc.identifier.issn	978-3-319-44561-8	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/748	-
dc.description	365 pages: illustrations, includes an index.	en_US
dc.description.abstract	This book provides a comprehensive and accessible introduction to the fundamental concepts of discrete mathematics and their applications in computer science. It covers sets, relations, functions, number theory, mathematical induction, recursion, sequences, permutations, combinations, algebra, matrix theory and graph theory. The book also explores automata theory, cryptography, coding theory, formal logic, computability, decidability and theorem proving. In addition, it examines the applications of discrete mathematics in software engineering, software reliability, artificial intelligence, probability, statistics, operations research and financial mathematics. It is a valuable resource for undergraduate students, lecturers, researchers and computing professionals seeking to understand the mathematical principles underlying computing and information technology	en_US
dc.language.iso	en	en_US
dc.publisher	Springer	en_US
dc.subject	Discrete mathematics	en_US
dc.subject	Mathematical logic	en_US
dc.subject	Sets, relations and functions	en_US
dc.subject	Number theory	en_US
dc.title	Guide to Discrete Mathematics:	en_US
dc.title.alternative	An Accessible Introduction to the History, Theory, Logic and Applications/	en_US
dc.type	Book	en_US
Appears in Collections:	ICT

Files in This Item:

File	Description	Size	Format
Guide To Discrete Mathematics.pdf		3.5 MB	Adobe PDF	View/Open

Show simple item record