Fundamentals of Discrete Math for Computer Science : A Problem-Solving Primer/ Tom Jenkyns & Ben Stephenson.

By:

Jenkyns, Tom

Contributor(s):

Stephenson, Ben

Material type: Text

TextLanguage: English Series: Undergraduate topics in computer sciencePublication details: London ; New York : Springer ; 2013.Edition: 2nd edDescription: xiii, 512p. ; illISBN:

9783319701509

DDC classification:

23 004.015 JEN

Contents:

1: Algorithms, Numbers and Machines -- 2: Sets, Sequences and Counting -- 3: Boolean Expressions, Logic and Proof -- 4: Searching and Sorting -- 5: Graphs and Trees -- 6: Relations: Especially on (Integer) Sequences -- 7: Sequences and Series -- 8: Generating Sequences and Subsets -- 9: Discrete Probability and Average Case Complexity -- 10: Turing Machines.

Summary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
General Books	CUTN Central Library Generalia	Non-fiction	004.015 JEN (Browse shelf(Opens below))	Available		38532

Electronic books
Computer software

1: Algorithms, Numbers and Machines --
2: Sets, Sequences and Counting --
3: Boolean Expressions, Logic and Proof --
4: Searching and Sorting --
5: Graphs and Trees --
6: Relations: Especially on (Integer) Sequences --
7: Sequences and Series --
8: Generating Sequences and Subsets --
9: Discrete Probability and Average Case Complexity --
10: Turing Machines.

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.

There are no comments on this title.

to post a comment.