Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Fundamentals of Discrete Math for Computer Science - A Problem-Solving Primer

Fundamentals of Discrete Math for Computer Science

A Problem-Solving Primer

Jenkyns, Tom, Stephenson, Ben

2013, XII, 416 p. 143 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$39.95

(net) price for USA

ISBN 978-1-4471-4069-6

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$59.95

(net) price for USA

ISBN 978-1-4471-4068-9

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics
  • Ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations
  • Contains examples and exercises throughout the text, and highlights the most important concepts in each section

An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence.

Fundamentals of Discrete Math for Computer Science provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions.

Topics and features:

  • Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics
  • Ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations
  • Describes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expected
  • Contains examples and exercises throughout the text, and highlights the most important concepts in each section
  • Selects examples that demonstrate a practical use for the concept in question

This easy-to-understand and fun-to-read textbook is ideal for an introductory discrete mathematics course for computer science students at the beginning of their studies. The book assumes no prior mathematical knowledge, and discusses concepts in programming as needed, allowing it to be used in a mathematics course taken concurrently with a student’s first programming course.

Content Level » Lower undergraduate

Keywords » Analysis of Algorithms - Complexity Analysis - Discrete Mathematics - Proof of Correctness

Related subjects » Theoretical Computer Science

Table of contents 

Algorithms, Numbers and Machines

Sets, Sequences and Counting

Boolean Expressions, Logic and Proof

Searching and Sorting

Graphs and Trees

Relations: Especially on (Integer) Sequences

Sequences and Series

Generating Sequences and Subsets

Discrete Probability and Average Case Complexity

Turing Machines

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Discrete Mathematics in Computer Science.