fundamentals of discrete math for computer science a problem solving primer pdf

Fundamentals of Discrete Math for Computer Science

A Problem-Solving Primer

• © 2018
• Latest edition
• Tom Jenkyns 0 ,
• Ben Stephenson 1

Brock University, St. Catharines, Canada

You can also search for this author in PubMed   Google Scholar

University of Calgary, Calgary, Canada

• 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

Part of the book series: Undergraduate Topics in Computer Science (UTICS)

49k Accesses

3 Citations

22 Altmetric

This is a preview of subscription content, log in via an institution to check access.

Access this book

• Available as EPUB and PDF
• Read on any device
• Instant download
• Own it forever
• Compact, lightweight edition
• Dispatched in 3 to 5 business days
• Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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).

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.

Similar content being viewed by others

Algorithmics

Advice for Future Steps

How Mathematicians Learned to Stop Worrying and Love the Computer

• Analysis of Algorithms
• Complexity Analysis
• Discrete Mathematics
• Proof of Correctness
• Graph Theory
• algorithm analysis and problem complexity

Table of contents (11 chapters)

Front matter, algorithms, numbers, and machines.

• Tom Jenkyns, Ben Stephenson

Sets, Sequences, and Counting

Boolean expressions, logic, and proof, searching and sorting, graphs and trees, directed graphs, relations: especially on (integer) sequences, sequences and series, generating sequences and subsets, discrete probability and average-case complexity, turing machines, back matter, authors and affiliations.

Tom Jenkyns

Ben Stephenson

About the authors

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.

Bibliographic Information

Book Title : Fundamentals of Discrete Math for Computer Science

Book Subtitle : A Problem-Solving Primer

Authors : Tom Jenkyns, Ben Stephenson

Series Title : Undergraduate Topics in Computer Science

DOI : https://doi.org/10.1007/978-3-319-70151-6

Publisher : Springer Cham

eBook Packages : Computer Science , Computer Science (R0)

Copyright Information : The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2018

Softcover ISBN : 978-3-319-70150-9 Published: 08 May 2018

eBook ISBN : 978-3-319-70151-6 Published: 03 May 2018

Series ISSN : 1863-7310

Series E-ISSN : 2197-1781

Edition Number : 2

Number of Pages : XIII, 512

Number of Illustrations : 120 b/w illustrations

Topics : Discrete Mathematics in Computer Science , Algorithm Analysis and Problem Complexity

• Publish with us

Policies and ethics

• Find a journal
• Track your research

Linked e-resources

Browse subjects.

• Computer science Mathematics.">Mathematics.

(Stanford users can avoid this Captcha by logging in.)

• Send to text email RefWorks EndNote printer

Fundamentals of discrete math for computer science : a problem-solving primer

Available online.

• SpringerLink

More options

• Find it at other libraries via WorldCat
• Contributors

Description

Creators/contributors, contents/summary.

• 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.
• (source: Nielsen Book Data)

Bibliographic information

Browse related items.

• Stanford Home
• Maps & Directions
• Search Stanford
• Emergency Info
• Terms of Use
• Non-Discrimination
• Accessibility

© Stanford University , Stanford , California 94305 .

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer

About this ebook.

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.

Ratings and reviews

• Flag inappropriate
• Show review history

About the author

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.

Rate this ebook

Reading information, more by tom jenkyns.

Similar ebooks

Visit us today at 314 Main St, Cambridge, MA 02142 Close this alert

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science)

Description.

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

About the Author

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.

Other Books in Series

Understanding Computer Organization: A Guide to Principles Across Risc-V, Arm Cortex, and Intel Architectures (Undergraduate Topics in Computer Science)

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

Concise Guide to the Internet of Things: A Hands-On Introduction to Technologies, Procedures, and Architectures (Undergraduate Topics in Computer Science)

Computational Thinking: First Algorithms, Then Code (Undergraduate Topics in Computer Science)

Introduction to Artificial Intelligence (Undergraduate Topics in Computer Science)

Discrete Mathematics and Graph Theory: A Concise Study Companion and Guide (Undergraduate Topics in Computer Science)

Introduction to Data Science: A Python Approach to Concepts, Techniques and Applications (Undergraduate Topics in Computer Science)

Python Programming Fundamentals (Undergraduate Topics in Computer Science)

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Rigorous Software Development: An Introduction to Program Verification (Undergraduate Topics in Computer Science)

Applied Logic for Computer Scientists: Computational Deduction and Formal Proofs (Undergraduate Topics in Computer Science)

Advanced Guide to Python 3 Programming (Undergraduate Topics in Computer Science)

Introduction to HPC with Mpi for Data Science (Undergraduate Topics in Computer Science)

Proofs and Algorithms: An Introduction to Logic and Computability (Undergraduate Topics in Computer Science)

Mathematics for Computer Graphics (Undergraduate Topics in Computer Science)

Concise Guide to Software Testing (Undergraduate Topics in Computer Science)

Software Quality Assurance: Consistency in the Face of Complexity and Change (Undergraduate Topics in Computer Science)

Programming Language Concepts (Undergraduate Topics in Computer Science)

Concise Guide to Databases: A Practical Introduction (Undergraduate Topics in Computer Science)

You may also like.

Living with Robots: What Every Anxious Human Needs to Know

Big Data Is Not a Monolith (Information Policy)

Practical Linux Forensics: A Guide for Digital Investigators

Racing the Beam: The Atari Video Computer System (Platform Studies)

It's a Question of Space: An Ordinary Astronaut's Answers to Sometimes Extraordinary Questions

Power-Lined: Electricity, Landscape, and the American Mind

LEGO Technic Non-Electric Models: Simple Machines

Floppy Disk Fever: The Curious Afterlives of a Flexible Medium

Robot Ethics (The MIT Press Essential Knowledge series)

101 Things I Learned® in Engineering School

Climate Policy Revolution: What the Science of Complexity Reveals about Saving Our Planet

Models of a Man: Essays in Memory of Herbert A. Simon

More Numbers Every Day: How Data, Stats, and Figures Control Our Lives and How to Set Ourselves Free

New Solutions for Cybersecurity

Model Systems in Biology: History, Philosophy, and Practical Concerns

Bernoulli's Fallacy: Statistical Illogic and the Crisis of Modern Science

Ruler & Compass: Practical Geometric Constructions (Wooden Books North America Editions)

Hamlet's BlackBerry: Building a Good Life in the Digital Age

The Smart Wife: Why Siri, Alexa, and Other Smart Home Devices Need a Feminist Reboot

The Manga Guide to Electricity

You Are Here: A Field Guide for Navigating Polarized Speech, Conspiracy Theories, and Our Polluted Media Landscape

Extracting Accountability: Engineers and Corporate Social Responsibility (Engineering Studies)

The Information Manifold: Why Computers Can't Solve Algorithmic Bias and Fake News (History and Foundations of Information Science)

Micro:bit for Mad Scientists: 30 Clever Coding and Electronics Projects for Kids

Netflix Nations: The Geography of Digital Distribution (Critical Cultural Communication #28)

Size: How It Explains the World

Concurrency in Go: Tools and Techniques for Developers

Einstein's Fridge: How the Difference Between Hot and Cold Explains the Universe

Sign up to receive our newsletter.

News and information from Kendall Square's underground bookstore

Browse Course Material

Course info, instructors.

• Prof. Albert R. Meyer
• Prof. Adam Chlipala

Departments

• Electrical Engineering and Computer Science
• Mathematics

As Taught In

• Computer Science
• Applied Mathematics
• Probability and Statistics

Learning Resource Types

Mathematics for computer science, mit6_042js15_textbook.pdf.

You are leaving MIT OpenCourseWare

• Even more »

Account Options

• Try the new Google Books
• Advanced Book Search
• Barnes&Noble.com
• Books-A-Million
• Find in a library
• All sellers  »

Other editions - View all

About the author  (2018).

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.

Bibliographic information

Fundamentals of Discrete Math for Computer Science A Problem-Sol

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 top

• PDF / 8,297,121 Bytes
• 424 Pages / 439.37 x 666.142 pts Page_size
• 80 Downloads / 677 Views

Undergraduate Topics in Computer Science (UTiCS) delivers high-quality instructional content for undergraduates studying in all areas of computing and information science. From core foundational and theoretical material to final-year topics and applications, UTiCS books take a fresh, concise, and modern approach and are ideal for self-study or for a one- or two-semester course. The texts are all authored by established experts in their fields, reviewed by an international advisory board, and contain numerous examples and problems. Many include fully worked solutions. For further volumes: http://www.springer.com/series/7592 Tom Jenkyns • Ben Stephenson Fundamentals of Discrete Math for Computer Science A Problem-Solving Primer Tom Jenkyns Department of Mathematics Brock University ON, Canada Ben Stephenson Department of Computer Science University of Calgary AB, Canada ISSN 1863-7310 ISBN 978-1-4471-4068-9 ISBN 978-1-4471-4069-6 (eBook) DOI 10.1007/978-1-4471-4069-6 Springer London Heidelberg New York Dordrecht Library of Congress Control Number: 2012945303 # Springer-Verlag London 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Preface This book is directed to computer science students at the beginning of their studies. It presents the elements of d

Data Loading...

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer

Ben stephenson tom jenkyns , ben stephenson.

416 pages, Paperback

First published July 31, 2012

About the author

Ben Stephenson Tom Jenkyns

Ratings & reviews.

What do you think? Rate this book Write a Review

Friends & Following

Community reviews, join the discussion, can't find what you're looking for.

Professional Science Masters (PSM)

Graduate school, main navigation.

Professional Masters in

Computational & Data Science

Are you looking to grow as a professional? Do you want to improve your communication, leadership, and collaboration skills? Explore mathematical models, numerical methods, and data visualization, which are in high demand. You will learn to tackle real-world problems with the full range of skills from these fields.

PSM Admissions

Transferrable Business Skills

(12 credits)

Advanced Quantitative Skills

(6 Credits)

Computational & Data Science Courses

(15 Credits)

Professional Experience Project

(3 Credits)

36 credits & a GPA Higher than 3.0

In graduate school, 9 credits and up is full-time. Full-time students can complete the program in 2 years. Part-time students take 2.5 to 4 years to complete the program.

Transferrable Skills Courses

Data science, computational science.

Expect to take these courses with a cohort of peers from across the different PSM degree tracks.

You may need permission codes to register for classes taught by other departments. Contact advisors in those departments to get those codes. You can find a list of these courses on the PSM canvas course under Module 3: Program of Study.

Professional Development for Scientists & Engineers

MST 6200 - 3 Credits - Fall

Operations & Project Management for Scientists & Engineers

MST 6210 - 3 Credits - Spring

Scientific Reasoning & Inquiry

MST 6500 - 3 Credits - Spring

Business Development for Scientist & Engineers

MST 6110 - 3 Credits - Summer

Applied Statistical Techniques

MST 6600 - 3 Credits - Fall

Core Requirements

Introduction to probability.

MATH 5010 - 3 Credits - Fall

Statistical Inference I

MATH 5080 - 3 Credits - Fall

Graduate Algorithms

CS 6150 - 3 Credits

Advanced Database Systems

CS 6530 - 3 Credits - Fall

Data Mining

CS 6140 - 3 Credits - Fall

Machine Learning

CS 6350 - 3 Credits - Fall

Visualization for Data Science

CS 6630 - Credit 3 - Fall

Focus Area Electives

Students can choose courses from the COMP and CS MATH areas based on their professional goals.

Course availability is subject to change. Substitute classes are available, upon approval. Courses may have prerequisites. Students are responsible for confirming they meet course requirements and prerequisites. These courses are in the General Catalog .

MATH 5080 - 3 Credits - Fall

Statistical Inference II

MATH 5090 - 3 Credits - Fall

Introduction to Numerical Analysis I

MATH 5610 - 4 Credits - Fall

Introduction to Numerical Analysis II

MATH 5620 - 4 Credits - Fall

Analysis of Numerical Methods I

MATH 6610 - 3 Credits - Fall

Analysis of Numerical Methods II

MATH 6620 - 3 Credits - Fall

Introduction to Applied Mathematics I

This project is a critical component of any PSM program & required for graduation.

It is a hands-on project in a real work environment of business & science.

Professional Experience Project Planning

MST 6974 - 1 Credits - Fall/Spring

MST 6975 - 3 Credits - Fall/Spring

This course teaches business management & development skills.

Students will learn:

• Modern business practices
• How to create and use effective business plans
• To make business forecasts and scenarios
• To be effective managers
• Marketing and sales strategies
• Financial planning and analysis

This course teaches scientists & engineers how to excel in their careers.

This course includes:

• Interactive lectures
• Practical exercises
• Real-world case studies
• Self-assessments
• To improve their professional abilities
• To be better communicators
• How to advance their careers

This is a cohort class for first-year MST students.

This course offers functional skills for & the improvement of organizational processes.

• To manage value creation
• Effective and efficient process design
• Operational design and theory
• To plan and organize functions of management
• To carry out and oversee functions of management

This course teaches scientific reasoning, inquiry, & problem-solving skills. 

Topics covered include:

• Simple and theoretical induction
• Bayesianism
• Statistical and causal hypotheses
• Using scientific information in decision making
• Inference to the best explanation
• Science and the individual
• Science and society

Required of all first-year MST students.

This course teaches exploratory data analysis (EDA) & the R coding language.

• Real-world examples
• Scatter plots
• Probability plots
• Residual plots
• The RStudio platform
• Standard and quantitative data evaluation techniques

No prior knowledge of the R coding language needed and you should bring your laptop.

This course assists with methods and skills needed to complete a professional project.

• Realistic goal setting
• Project initiation
• To define objectives and scope
• To identify and manage risk
• Resource allocation
• To keep track of progress

Professional Project

This course bridges the gap between theoretical knowledge and practical skills..

Students will be able to apply diverse skills gained from their studies such as:

• Problem-solving
• Critical thinking
• Communication
• Project management
• Collaboration

This course provides an introduction to the fundamental concepts of probability.

Key topics include:

• Combinatorial problems
• Random variables
• Distributions
• Independence and dependence
• Conditional probability
• Expected value and moments
• Law of large numbers
• Central limit theorems

CS 6150 - 3 Credits - Fall

This course provides an in-depth study of algorithms, focusing on design and analysis.

• Greedy algorithms
• Dynamic programming
• Divide and conquer strategies
• Asymptomatic analysis and recurrence relations
• Graph algorithms and network flows
• Computational complexity and intractability
• NP-hardness and beyond
• Approximation algorithms

3 Credits - Fall

This graduate-level course focuses on the design and implementation of relational database system kernels and other large-scale data management techniques.

• Relational data model and SQL
• File organization, database storage, indexing and hashing
• Query evaluation and optimization
• Transaction processing, concurrency control and recovery
• Database integrity and security
• Latest developments in large-scale data management techniques

Students will participate in a semester-long project to build a mini-database system. Note: This is not a course on building database applications.

Data Mining is about discovering patterns and structures in large data sets. This course will guide you on how to model these problems and find solutions using efficient algorithms. Some of these methods involve the use of randomized algorithms, which are simple to use but can be tricky to analyze. We'll focus on how to use them effectively and provide clear explanations.

This course covers techniques for developing computer programs that can acquire new knowledge automatically or adapt their behavior over time.

The curriculum includes a variety of algorithms for both supervised and unsupervised learning. You'll learn about decision trees, online learning, and linear classifiers.

The course also explores:

• Methods to minimize empirical risk
• Computational learning theory
• Ensemble methods
• Bayesian methods
• Techniques for clustering and dimensionality reduction

CS 6630 - 2 Credits - Fall

This course introduces the principles, methods, and techniques for effective visual analysis of data as applied to data science.

We will explore aspects of visualization related to tabular (high-dimensional) data, graphs, text, and maps.

This course also explores:

• Bootstrapping the necessary technical skills (web development with HTML5 and JavaScript)
• Overview of principles from perception and design
• Visualization fundamentals such as interactions and views
• Visualization techniques and methods for non-spatial data types and maps
• Continual analysis, critique, and redesign of visualizations
• Hands-on experience designing and implementing interactive, web-based visualizations using cutting-edge visualization libraries

A complementary course - Visualization for Scientific Data - that focuses on the visualization of spatial data (e.g., grid-based data from simulations and scanning devices) is offered in the spring.

This course is designed to equip students with the mathematical tools necessary for understanding randomness and uncertainty.

The course covers:

• Problem-solving techniques in combinatorics
• Understanding and working with random variables and their distributions
• Concepts of independence and dependence
• Conditional probability and its applications
• Calculation and interpretation of expected values and moments
• Insights into the law of large numbers
• Introduction to central limit theorems

This course is the first part of a comprehensive introduction to statistical inference, focusing on the theoretical foundations of statistics.

• Principles and techniques of sampling
• Understanding sampling distributions
• Application and interpretation of the Central Limit Theorem
• Methods for data transformation
• Concepts of complete and sufficient statistics
• Techniques for point estimation
• Principles of optimality in statistical inference

This course provides an introduction to the fundamental concepts of numerical analysis. It is designed for students with prior programming experience.

• Numerical methods in linear algebra
• Techniques for numerical interpolation
• Numerical integration and differentiation
• Approaches to approximation, including discrete and continuous least squares, Fourier analysis, and wavelets

This course is a continuation of Introduction to Numerical Analysis I. It delves into the numerical solution of initial value problems in ordinary differential equations and introduces students to numerical approaches for solving partial differential equations.

Analysis of Numerical Methods I

This course explores initial- and boundary-value problems of ordinary and partial differential equations.

The course also covers:

• Linear algebra
• Interpolation
• Integration
• Differentiation
• Approximation techniques including least squares, Fourier analysis, and wavelets

This course is a continuation of Analysis of Numerical Methods I.

MATH 5710 - 3 Credits - Fall

This course covers key mathematical concepts and techniques used in various fields, including computer science and data analysis.

The course focuses on:

• Understanding and solving symmetric linear systems
• Working with positive definite matrices
• Solving eigenvalue problems
• Understanding equilibrium equations for both discrete and continuous systems
• Solving boundary value problems in ordinary and partial differential equations
• Applying boundary integrals

This advanced course is designed for students who seek a deeper understanding of statistical theory and its applications.

The course covers a range of topics including:

• Estimation of intervals
• Testing of hypotheses
• Methods based on likelihood
• Understanding of errors and optimality
• Study of order statistics
• Introduction to nonparametric methods
• Exploration of rank statistics