Updated and enhanced new edition with additional material on directed graphs, and on drawing and coloring graphs, as well as more than 100 new exercises (with solutions)
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
Contains examples and exercises throughout the text, and highlights the most important concepts in each section
Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
This clearly written textbook presents an accessible introduction to discrete mathematics for computer science students, offering the reader an enjoyable and stimulating path to improve their programming competence. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Its motivational and interactive style provokes a conversation with the reader through a questioning commentary, and supplies detailed walkthroughs of several algorithms.
This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises).
Topics and features: assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed; designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations; describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task; includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts; selects examples that demonstrate a practical use for the concept in question.
Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course.
|
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.
|
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
Contains examples and exercises throughout the text, and highlights the most important concepts in each section
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
This clearly written textbook presents an accessible introduction to discrete mathematics for computer science students, offering the reader an enjoyable and stimulating path to improve their programming competence. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Its motivational and interactive style provokes a conversation with the reader through a questioning commentary, and supplies detailed walkthroughs of several algorithms.
This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises).
Topics and features:
- Assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed
- Designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations
- Describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task
- Includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts
- Selects examples that demonstrate a practical use for the concept in question
Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course.
Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada. Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
This book offers an engaging introduction to traditional topics in discrete mathematics, in a manner designed to appeal to computer science students. Presents detailed walkthroughs of several algorithms, along with exercises and practical examples throughout.
This clearly written textbook presents an accessible introduction to discrete mathematics for computer science students, offering the reader an enjoyable and stimulating path to improve their programming competence. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Its motivational and interactive style provokes a conversation with the reader through a questioning commentary, and supplies detailed walkthroughs of several algorithms.
This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises).
Topics and features: assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed; designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations; describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task; includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts; selects examples that demonstrate a practical use for the concept in question.
Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course.
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.
Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
Über den Autor
Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
Inhaltsverzeichnis
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.
Klappentext
This clearly written textbook presents an accessible introduction to discrete mathematics for computer science students, offering the reader an enjoyable and stimulating path to improve their programming competence. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Its motivational and interactive style provokes a conversation with the reader through a questioning commentary, and supplies detailed walkthroughs of several algorithms.
This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises).
Topics and features: assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed; designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations; describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task; includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts; selects examples that demonstrate a practical use for the concept in question.
Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course.
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
Contains examples and exercises throughout the text, and highlights the most important concepts in each section
