skip to content
Discrete mathematics and its applications Preview this item
ClosePreview this item
Checking...

Discrete mathematics and its applications

Author: Kenneth H Rosen
Publisher: Boston : McGraw-Hill, ©2003.
Edition/Format:   Print book : English : 5th edView all editions and formats
Summary:
[This text] is appropriate for a one- or two-term introductory discrete mathematics course to be taken by students in a wide variety of majors, including computer science, mathematics, and engineering. College Algebra is the only explicit prerequisite.-Pref.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Kenneth H Rosen
ISBN: 0072424346 9780072424348 0071198814 9780071198813 0071233741 9780071233743
OCLC Number: 49719375
Description: xxi, 787, 9, 8, 83, 1, 18 pages : illustrations (some color) ; 26 cm
Contents: The foundations: logic and proof, sets, and functions : Logic ; Propositional equivalences ; Predicates and quantifiers ; Nested quantifiers ; Methods of proof ; Sets ; Set operations ; Functions --
The fundamentals: algorithms, the integers, and matrices : Algorithms ; The growth of functions ; Complexity of algorithms ; The integers and division ; Applications of number theory ; Matrices --
Mathematical reasoning, induction, and recursion : Proof strategy ; Sequences and summations ; Mathematical induction ; Recursive definitions and structural induction ; Recursive algorithms ; Program correctness --
Counting : The basics of counting ; The pigeonhole principle ; Permutations and combinations ; Binomial coefficients ; Generalized permutations and combinations ; Generating permutations and combinations --
Discrete probability : An introduction to discrete probability ; Probability theory ; Expected value and variance --
Advanced counting techniques : Recurrence relations ; Solving recurrence relations ; Divide-and-conquer algorithms and recurrence relations ; Generating functions ; Inclusion-exclusion ; Applications of inclusion-exclusion --
Relations : Relations and their properties ; n-ary relations and their applications ; Representing relations ; Closures of relations ; Equivalence relations ; Partial orderings --
Graphs : Introduction to graphs ; Graph terminology ; Representing graphs and graph isomorphism ; Connectivity ; Euler and Hamilton paths ; Shortest-path problems ; Planar graphs ; Graph coloring --
Trees : introduction to trees ; Applications of trees ; Tree traversal ; Spanning trees ; Minimum spanning trees --
Boolean algebra : Boolean functions ; Representing Boolean functions ; Logic gates ; Minimization of circuits --
Modeling computation : Languages and grammars ; Finite-state machines with output ; Finite-state machines with no output ; Language recognition ; Turing machines --
Appendixes : A.1. Exponential and logarithmic functions ; A.2. Pseudocode.
Responsibility: Kenneth H. Rosen.
More information:

Abstract:

Providing an introduction to the primary themes in a discrete mathematics course, this work includes a linear presentation of logic, proof types and proof writing, and mathematical reasoning. It also  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

All user tags (1)

View most popular tags as: tag list | tag cloud

  • BS  (by 1 person)
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http:\/\/www.worldcat.org\/oclc\/49719375<\/a>>
library:oclcnum<\/a><\/td>\"49719375<\/span>\"<\/td><\/tr>
library:placeOfPublication<\/a><\/td>
<http:\/\/id.loc.gov\/vocabulary\/countries\/mau<\/a>>
dcterms:identifier<\/a><\/td>\"mau<\/span>\"<\/td><\/tr>
rdf:type<\/a><\/td>schema:Place<\/a><\/td><\/tr><\/table><\/div><\/td><\/tr>
library:placeOfPublication<\/a><\/td>
<http:\/\/dbpedia.org\/resource\/Boston<\/a>>
rdf:type<\/a><\/td>schema:Place<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"Boston<\/span>\"<\/td><\/tr><\/table><\/div><\/td><\/tr>
rdf:type<\/a><\/td>schema:MediaObject<\/a><\/td><\/tr>
rdf:type<\/a><\/td>schema:Book<\/a><\/td><\/tr>
schema:about<\/a><\/td>
<http:\/\/dewey.info\/class\/511\/e21\/<\/a>>
rdf:type<\/a><\/td>schema:Intangible<\/a><\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:about<\/a><\/td>
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/843220#Topic\/diskrete_mathematik<\/a>>
rdf:type<\/a><\/td>schema:Intangible<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"Diskrete Mathematik.<\/span>\"@en<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:about<\/a><\/td>
<http:\/\/id.loc.gov\/authorities\/subjects\/sh85042295<\/a>>
rdf:type<\/a><\/td>schema:Intangible<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"Computer science--Mathematics.<\/span>\"@en<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:about<\/a><\/td>
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/843220#Topic\/computer_science_mathematics<\/a>>
rdf:type<\/a><\/td>schema:Intangible<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"Computer science--Mathematics.<\/span>\"@en<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:about<\/a><\/td>
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/843220#Topic\/mathematique_discrete<\/a>>
rdf:type<\/a><\/td>schema:Intangible<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"Math\u00E9matique discr\u00E8te.<\/span>\"@en<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:about<\/a><\/td>
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/843220#Topic\/mathematics<\/a>>
rdf:type<\/a><\/td>schema:Intangible<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"Mathematics.<\/span>\"@en<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:bookEdition<\/a><\/td>\"5th ed.<\/span>\"<\/td><\/tr>
schema:copyrightYear<\/a><\/td>\"2003<\/span>\"<\/td><\/tr>
schema:creator<\/a><\/td>
<http:\/\/viaf.org\/viaf\/22203109<\/a>>
rdf:type<\/a><\/td>schema:Person<\/a><\/td><\/tr>
schema:familyName<\/a><\/td>\"Rosen<\/span>\"<\/td><\/tr>
schema:givenName<\/a><\/td>\"Kenneth H.<\/span>\"<\/td><\/tr>
schema:name<\/a><\/td>\"Rosen, Kenneth H.<\/span>\"<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:datePublished<\/a><\/td>\"2003<\/span>\"<\/td><\/tr>
schema:description<\/a><\/td>\"[This text] is appropriate for a one- or two-term introductory discrete mathematics course to be taken by students in a wide variety of majors, including computer science, mathematics, and engineering. College Algebra is the only explicit prerequisite.-Pref.<\/span>\"@en<\/td><\/tr>
schema:description<\/a><\/td>\"The foundations: logic and proof, sets, and functions : Logic ; Propositional equivalences ; Predicates and quantifiers ; Nested quantifiers ; Methods of proof ; Sets ; Set operations ; Functions -- The fundamentals: algorithms, the integers, and matrices : Algorithms ; The growth of functions ; Complexity of algorithms ; The integers and division ; Applications of number theory ; Matrices -- Mathematical reasoning, induction, and recursion : Proof strategy ; Sequences and summations ; Mathematical induction ; Recursive definitions and structural induction ; Recursive algorithms ; Program correctness -- Counting : The basics of counting ; The pigeonhole principle ; Permutations and combinations ; Binomial coefficients ; Generalized permutations and combinations ; Generating permutations and combinations -- Discrete probability : An introduction to discrete probability ; Probability theory ; Expected value and variance -- Advanced counting techniques : Recurrence relations ; Solving recurrence relations ; Divide-and-conquer algorithms and recurrence relations ; Generating functions ; Inclusion-exclusion ; Applications of inclusion-exclusion -- Relations : Relations and their properties ; n-ary relations and their applications ; Representing relations ; Closures of relations ; Equivalence relations ; Partial orderings -- Graphs : Introduction to graphs ; Graph terminology ; Representing graphs and graph isomorphism ; Connectivity ; Euler and Hamilton paths ; Shortest-path problems ; Planar graphs ; Graph coloring -- Trees : introduction to trees ; Applications of trees ; Tree traversal ; Spanning trees ; Minimum spanning trees -- Boolean algebra : Boolean functions ; Representing Boolean functions ; Logic gates ; Minimization of circuits -- Modeling computation : Languages and grammars ; Finite-state machines with output ; Finite-state machines with no output ; Language recognition ; Turing machines -- Appendixes : A.1. Exponential and logarithmic functions ; A.2. Pseudocode.<\/span>\"@en<\/td><\/tr>
schema:exampleOfWork<\/a><\/td><http:\/\/worldcat.org\/entity\/work\/id\/843220<\/a>><\/td><\/tr>
schema:inLanguage<\/a><\/td>\"en<\/span>\"<\/td><\/tr>
schema:name<\/a><\/td>\"Discrete mathematics and its applications<\/span>\"@en<\/td><\/tr>
schema:publication<\/a><\/td>
<http:\/\/www.worldcat.org\/title\/-\/oclc\/49719375#PublicationEvent\/boston_mcgraw_hill_2003<\/a>>
rdf:type<\/a><\/td>schema:PublicationEvent<\/a><\/td><\/tr>
schema:location<\/a><\/td>
<http:\/\/dbpedia.org\/resource\/Boston<\/a>>
rdf:type<\/a><\/td>schema:Place<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"Boston<\/span>\"<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:organizer<\/a><\/td>
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/843220#Agent\/mcgraw_hill<\/a>>
rdf:type<\/a><\/td>bgn:Agent<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"McGraw-Hill<\/span>\"<\/td><\/tr><\/table><\/div><\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:publisher<\/a><\/td>
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/843220#Agent\/mcgraw_hill<\/a>>
rdf:type<\/a><\/td>bgn:Agent<\/a><\/td><\/tr>
schema:name<\/a><\/td>\"McGraw-Hill<\/span>\"<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:workExample<\/a><\/td>
<http:\/\/worldcat.org\/isbn\/9780071198813<\/a>>
rdf:type<\/a><\/td>schema:ProductModel<\/a><\/td><\/tr>
schema:isbn<\/a><\/td>\"0071198814<\/span>\"<\/td><\/tr>
schema:isbn<\/a><\/td>\"9780071198813<\/span>\"<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:workExample<\/a><\/td>
<http:\/\/worldcat.org\/isbn\/9780071233743<\/a>>
rdf:type<\/a><\/td>schema:ProductModel<\/a><\/td><\/tr>
schema:isbn<\/a><\/td>\"0071233741<\/span>\"<\/td><\/tr>
schema:isbn<\/a><\/td>\"9780071233743<\/span>\"<\/td><\/tr><\/table><\/div><\/td><\/tr>
schema:workExample<\/a><\/td>
<http:\/\/worldcat.org\/isbn\/9780072424348<\/a>>
rdf:type<\/a><\/td>schema:ProductModel<\/a><\/td><\/tr>
schema:isbn<\/a><\/td>\"0072424346<\/span>\"<\/td><\/tr>
schema:isbn<\/a><\/td>\"9780072424348<\/span>\"<\/td><\/tr><\/table><\/div><\/td><\/tr>
wdrs:describedby<\/a><\/td>
<http:\/\/www.worldcat.org\/title\/-\/oclc\/49719375<\/a>>
rdf:type<\/a><\/td>genont:InformationResource<\/a><\/td><\/tr>
rdf:type<\/a><\/td>genont:ContentTypeGenericResource<\/a><\/td><\/tr>
schema:about<\/a><\/td><http:\/\/www.worldcat.org\/oclc\/49719375<\/a>><\/td><\/tr>
void:inDataset<\/a><\/td><http:\/\/purl.oclc.org\/dataset\/WorldCat<\/a>><\/td><\/tr><\/table><\/div><\/td><\/tr><\/table><\/div>

Content-negotiable representations<\/p>