Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/748| Title: | Guide to Discrete Mathematics: |
| Other Titles: | An Accessible Introduction to the History, Theory, Logic and Applications/ |
| Authors: | O’Regan, Gerard |
| Keywords: | Discrete mathematics Mathematical logic Sets, relations and functions Number theory |
| Issue Date: | 2016 |
| Publisher: | Springer |
| 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 |
| Description: | 365 pages: illustrations, includes an index. |
| URI: | http://localhost:8080/xmlui/handle/123456789/748 |
| ISBN: | 978-3-319-44560-1 |
| ISSN: | 978-3-319-44561-8 |
| Appears in Collections: | ICT |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Guide To Discrete Mathematics.pdf | 3.5 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.