menu
{ "item_title" : "Introductory Discrete Mathematics", "item_author" : [" Gordon Vining", "Joel Helms "], "item_description" : "Fundamental Concepts: Provide an overview of foundational concepts in discrete mathematics, including sets, relations, functions, and basic logic. Explain how these concepts form the basis for more advanced topics in discrete mathematics.Combinatorics and Counting: Explore combinatorial methods and counting principles, including permutations, combinations, the pigeonhole principle, and inclusion-exclusion principles. Discuss their applications in solving counting problems and understanding discrete structures.Graph Theory: Introduce the basics of graph theory, including definitions and properties of graphs, types of graphs (e.g., directed, undirected, weighted), and key concepts such as paths, cycles, connectivity, and graph coloring.Applications of Discrete Mathematics: Explore the practical applications of discrete mathematics in computer science, including its role in cryptography, network design, coding theory, and algorithm design. Discuss how discrete mathematics provides tools for solving real-world problems in these areas.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/78/715/376/1787153762_b.jpg", "price_data" : { "retail_price" : "144.99", "online_price" : "144.99", "our_price" : "144.99", "club_price" : "144.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Introductory Discrete Mathematics|Gordon Vining

Introductory Discrete Mathematics

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Fundamental Concepts: Provide an overview of foundational concepts in discrete mathematics, including sets, relations, functions, and basic logic. Explain how these concepts form the basis for more advanced topics in discrete mathematics.

Combinatorics and Counting: Explore combinatorial methods and counting principles, including permutations, combinations, the pigeonhole principle, and inclusion-exclusion principles. Discuss their applications in solving counting problems and understanding discrete structures.

Graph Theory: Introduce the basics of graph theory, including definitions and properties of graphs, types of graphs (e.g., directed, undirected, weighted), and key concepts such as paths, cycles, connectivity, and graph coloring.

Applications of Discrete Mathematics: Explore the practical applications of discrete mathematics in computer science, including its role in cryptography, network design, coding theory, and algorithm design. Discuss how discrete mathematics provides tools for solving real-world problems in these areas.

This item is Non-Returnable

Details

  • ISBN-13: 9781787153769
  • ISBN-10: 1787153762
  • Publisher: Kruger Brentt Publisher Uk. Ltd.
  • Publish Date: January 2025
  • Dimensions: 10 x 7 x 0.75 inches
  • Shipping Weight: 1.66 pounds
  • Page Count: 308

Related Categories

You May Also Like...

    1

BAM Customer Reviews