gogogo
Syndetics cover image
Image from Syndetics

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

By: Contributor(s): Material type: TextTextSeries: Undergraduate topics in computer sciencePublication details: London ; New York : Springer, c2013.Description: xii, 416 p. ill. 24 cmISBN:
  • 1447140680
  • 9781447140689
Subject(s): DDC classification:
  • 004.015 JEN
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.
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Standard Loan Moylish Library Main Collection 004.015 JEN (Browse shelf(Opens below)) 1 Available 39002100516278

Enhanced descriptions from Syndetics:

This textbook 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. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; 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.

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.

Author notes provided by Syndetics

Dr. Tom Jenkyns is an Associate Professor in the Department of Mathematics and the Department of Computer Science at Brock University, Canada.

Dr. Ben Stephenson is an Instructor in the Department of Computer Science at the University of Calgary, Canada.

Powered by Koha