The Resource Fundamentals of discrete math for computer science : a problemsolving primer, Tom Jenkyns, Ben Stephenson
Fundamentals of discrete math for computer science : a problemsolving primer, Tom Jenkyns, Ben Stephenson
Resource Information
The item Fundamentals of discrete math for computer science : a problemsolving primer, Tom Jenkyns, Ben Stephenson represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Fundamentals of discrete math for computer science : a problemsolving primer, Tom Jenkyns, Ben Stephenson represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 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 universitylevel background in mathematicsIdeally structured for classroomuse and selfstudy, with modular chapters following ACM curriculum recommendationsDescribes mathematical processes in an algorithmic manner, often including a walkthrough 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 easytounderstand and funtoread 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
 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
 Label
 Fundamentals of discrete math for computer science : a problemsolving primer
 Title
 Fundamentals of discrete math for computer science
 Title remainder
 a problemsolving primer
 Statement of responsibility
 Tom Jenkyns, Ben Stephenson
 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 universitylevel background in mathematicsIdeally structured for classroomuse and selfstudy, with modular chapters following ACM curriculum recommendationsDescribes mathematical processes in an algorithmic manner, often including a walkthrough 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 easytounderstand and funtoread 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
 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 problemsolving primer, Tom Jenkyns, Ben Stephenson
 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 problemsolving primer, Tom Jenkyns, Ben Stephenson
 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
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Fundamentalsofdiscretemathforcomputer/0nKaZUVM0TU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Fundamentalsofdiscretemathforcomputer/0nKaZUVM0TU/">Fundamentals of discrete math for computer science : a problemsolving primer, Tom Jenkyns, Ben Stephenson</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Fundamentals of discrete math for computer science : a problemsolving primer, Tom Jenkyns, Ben Stephenson
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Fundamentalsofdiscretemathforcomputer/0nKaZUVM0TU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Fundamentalsofdiscretemathforcomputer/0nKaZUVM0TU/">Fundamentals of discrete math for computer science : a problemsolving primer, Tom Jenkyns, Ben Stephenson</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>