Discrete Mathematics and Applications
Regular price
€110.99
14 days return policy
Shipping & Delivery
A01=Kevin Ferland
Adjacency Lists
Adjacency Matrix
Age Group_Uncategorized
Age Group_Uncategorized
Author_Kevin Ferland
automatic-update
Binary Search Tree
Category1=Non-Fiction
Category=PBC
Chromatic Number
Combinatorics
COP=United States
Crossing Number
Delivery_Delivery within 10-20 working days
Directed Graph
Discrete mathematics
eq_isMigrated=2
eq_nobargain
Euler Circuit
Euler Trail
Graph Isomorphism
Graph Theory
Hamiltonian Cycle
Hamiltonian Path
Inorder Traversal
Insertion Sort
Kruskal’s Algorithm
Language_English
Logic
Loop Edge
Merge Sort
PA=Available
Petersen Graph
Planar Embedding
Postfix Notation
Price_€50 to €100
Prim’s Algorithm
Proofs
PS=Active
Shortest Path Tree
softlaunch
Trees and algorithms
Truth Table
Vertex Transitive
Weighted Graph
Worst Case Complexity
Product details
- ISBN 9781498730655
- Weight: 2000g
- Dimensions: 178 x 254mm
- Publication Date: 01 May 2017
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
Discrete Mathematics and Applications, Second Edition is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book.
Part one focuses on how to write proofs, then moves on to topics in number theory, employing set theory in the process. Part two focuses on computations, combinatorics, graph theory, trees, and algorithms.
- Emphasizes proofs, which will appeal to a subset of this course market
- Links examples to exercise sets
- Offers edition that has been heavily reviewed and developed
- Focuses on graph theory
- Covers trees and algorithms
