Mathematics for Algorithm and Systems Analysis
Mathematics for Algorithm and Systems Analysis is backordered and will ship as soon as it is back in stock.
Couldn't load pickup availability
Genuine Products Guarantee
Genuine Products Guarantee
We guarantee 100% genuine products, and if proven otherwise, we will compensate you with 10 times the product's cost.
Delivery and Shipping
Delivery and Shipping
Products are generally ready for dispatch within 1 day and typically reach you in 3 to 5 days.
Mathematics for Algorithm and Systems Analysis
Book Details
-
Publisher: Dover
-
Author: Edward A. Bender, S. Gill Williamson, Edward A. Bender
-
Language: English
-
ISBN: 9780486442501
-
Pages: 256
-
Binding: Paperback
-
Release Date: 27-10-2011
-
Model Number: Illustrations
-
Part Number: Illustrations
About The Book
"Discrete Mathematics for Computer Science" by Edward A. Bender and S. Gill Williamson is a comprehensive textbook designed for undergraduate students in computer science. This text introduces the essential concepts of discrete mathematics, which are foundational to computer science and its many applications.
The book is organized into four main units of study:
-
Counting and Listing: An exploration of the fundamental techniques used in combinatorics, such as counting principles and methods for listing objects.
-
Functions: A discussion on functions, relations, and their significance in mathematics and computer science.
-
Decision Trees and Recursion: This unit focuses on decision-making processes and recursive structures, which are key to algorithm design.
-
Basic Concepts of Graph Theory: A fundamental introduction to graph theory, which is widely used in computer science for analyzing networks, relationships, and pathways.
With a focus on clarity and accessibility, the book presents mathematical ideas and their language in a way that makes them easier to understand and apply. Numerous examples and illustrations are provided to guide students in mastering the mathematical concepts essential for solving problems in computer science. This textbook serves as a practical resource for anyone seeking to strengthen their understanding of discrete mathematics.
