1 option
Fundamentals of Discrete Math for Computer Science : A Problem-Solving Primer / by Tom Jenkyns, Ben Stephenson.
- Format:
- Book
- Author/Creator:
- Jenkyns, T. A. (Tom A.), author.
- Stephenson, Ben (Benjamin David), author.
- Series:
- Computer Science (Springer-11645)
- Undergraduate topics in computer science 1863-7310
- Undergraduate Topics in Computer Science, 1863-7310
- Language:
- English
- Subjects (All):
- Computer science--Mathematics.
- Computer science.
- Algorithms.
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Physical Description:
- 1 online resource (XII, 416 pages) : 143 illustrations.
- Edition:
- First edition 2013.
- Contained In:
- Springer eBooks
- Place of Publication:
- London : Springer London : Imprint: Springer, 2013.
- System Details:
- text file PDF
- 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 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-1-4471-4069-6
- 9781447140696
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.