25 Books to Read Before You Die
 
 

Recently Viewed clear list


Q&A | August 19, 2014

Richard Kadrey: IMG Powell’s Q&A: Richard Kadrey



Describe your latest book. The Getaway God is the sixth book in the Sandman Slim series. In it, the very unholy nephilim, James Stark, aka Sandman... Continue »
  1. $17.49 Sale Hardcover add to wish list

spacer
Qualifying orders ship free.
$67.25
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Computers Reference- General

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science)

by

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science) Cover

 

Synopses & Reviews

Publisher Comments:

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 mathematicsIdeally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendationsDescribes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expectedContains examples and exercises throughout the text, and highlights the most important concepts in each sectionSelects examples that demonstrate a practical use for the concept in questionThis 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.

Synopsis:

This book offers an engaging introduction to traditional topics in discrete mathematics, in a manner designed to appeal to computer science students. Presents detailed walkthroughs of several algorithms, along with exercises and practical examples throughout.

Synopsis:

This textbook 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. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; 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.

About the Author

Dr. Tom Jenkyns is an Associate Professor in the Department of Mathematics and the Department of Computer Science at Brock University, Canada. Dr. Ben Stephenson is an Instructor in the Department of Computer Science at the University of Calgary, Canada.

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

Product Details

ISBN:
9781447140689
Author:
Jenkyns, Tom
Publisher:
Springer
Author:
Stephenson, Ben
Subject:
Data processing
Subject:
analysis of algorithms
Subject:
complexity analysis
Subject:
Discrete Mathematics
Subject:
Proof of Correctness
Subject:
Discrete Mathematics in Computer Science
Subject:
Algorithm Analysis and Problem Complexity
Subject:
Computers-Reference - General
Copyright:
Edition Description:
2012
Series:
Undergraduate Topics in Computer Science
Publication Date:
20120731
Binding:
TRADE PAPER
Language:
English
Pages:
428
Dimensions:
235 x 155 mm

Related Subjects

Computers and Internet » Computers Reference » General
Computers and Internet » Software Engineering » Algorithms
Science and Mathematics » Mathematics » Computer

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science) New Trade Paper
0 stars - 0 reviews
$67.25 In Stock
Product details 428 pages Springer - English 9781447140689 Reviews:
"Synopsis" by , This book offers an engaging introduction to traditional topics in discrete mathematics, in a manner designed to appeal to computer science students. Presents detailed walkthroughs of several algorithms, along with exercises and practical examples throughout.
"Synopsis" by , This textbook 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. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; 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.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.