rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Fundamentals of Discrete Math for Computer Science
    sub title: A Problem-Solving Primer
  name:
    name part: Jenkyns, Tom.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Stephenson, Ben.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxk
    date issued: 2013
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 416 p. 143 illus. online resource.
  abstract: 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.
  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.
  note: by Tom Jenkyns, Ben Stephenson.
  subject:
    topic: Computer science
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Algorithm Analysis and Problem Complexity
  classification: QA76.9.M35
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Undergraduate Topics in Computer Science
  identifier: 9781447140696
  identifier: http://dx.doi.org/10.1007/978-1-4471-4069-6
  record info:
    record creation date: 121026
    record change date: 20151123191602.0
    record identifier: 978-1-4471-4069-6