Borrow it
Coverart for item
The Resource Fundamentals of discrete math for computer science : a problem-solving primer, Tom Jenkyns, Ben Stephenson

Fundamentals of discrete math for computer science : a problem-solving primer, Tom Jenkyns, Ben Stephenson

Creator
Contributor
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
Language
eng
Work
Publication
Extent
1 online resource (xii, 416 pages)
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
Isbn
9781447140696
Instance
Label
Fundamentals of discrete math for computer science : a problem-solving primer
Title
Fundamentals of discrete math for computer science
Title remainder
a problem-solving primer
Statement of responsibility
Tom Jenkyns, Ben Stephenson
Creator
Contributor
Subject
Genre
Language
eng
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
Member of
Cataloging source
YDXCP
http://library.link/vocab/creatorName
Jenkyns, T. A.
Dewey number
004.015/1
Illustrations
illustrations
Index
index present
LC call number
QA76.9.M35
LC item number
J46 2013
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Stephenson, Ben
Series statement
Undergraduate topics in computer science
http://library.link/vocab/subjectName
  • Computer science
  • Computer science
  • Informatique
  • Algorithmes
Label
Fundamentals of discrete math for computer science : a problem-solving primer, Tom Jenkyns, Ben Stephenson
Instantiates
Publication
Bibliography note
With bibliogr. references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
816818828
Dimensions
unknown
Extent
1 online resource (xii, 416 pages)
Form of item
online
Isbn
9781447140696
Lccn
2012945303
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Specific material designation
remote
System control number
(OCoLC)816818828
Label
Fundamentals of discrete math for computer science : a problem-solving primer, Tom Jenkyns, Ben Stephenson
Publication
Bibliography note
With bibliogr. references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
816818828
Dimensions
unknown
Extent
1 online resource (xii, 416 pages)
Form of item
online
Isbn
9781447140696
Lccn
2012945303
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Specific material designation
remote
System control number
(OCoLC)816818828

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...