Normal view MARC view ISBD view

Discrete mathematics and its applications / Kenneth H. Rosen.

By: Rosen, Kenneth H.
Material type: TextTextPublisher: Boston ; New Delhi : Tata McGraw-Hill, c2003Edition: 5th ed.Description: xxi, (various pagings) : ill. ; 26 cm.ISBN: 0072424346 (acidfree paper); 9780072424348; 0071198814.Subject(s): Mathematics | Computer science -- MathematicsDDC classification: 511 Online resources: WorldCat details | E-book Fulltext
Contents:
Table of 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.
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Copy number Status Date due Barcode Item holds
E-Book E-Book EWU Library
E-book
Non-fiction 511 ROD 2003 (Browse shelf) Not for loan
Text Text EWU Library
Reserve Section
Non-fiction 511 ROD 2003 (Browse shelf) C-1 Not For Loan 10971
Text Text EWU Library
Reserve Section
Non-fiction 511 ROD 2003 (Browse shelf) C-2 Not For Loan 10972
Text Text EWU Library
Reserve Section
Non-fiction 511 ROD 2003 (Browse shelf) C-3 Not For Loan 10973
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-4 Available 10974
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-6 Checked out 18/04/2019 10976
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-7 Available 10977
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-8 Available 10978
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-9 Available 10979
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-10 Available 10980
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-11 Available 10981
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-12 Available 10982
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-13 Available 10983
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-14 Available 10984
Text Text EWU Library
Non-fiction 511 ROD (Browse shelf) C-15 Available 135-10985
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-16 Available 10986
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-18 Available 10988
Text Text EWU Library
Circulation Section
Non-fiction 511 ROD 2003 (Browse shelf) C-19 Available 10989
Total holds: 0

Includes bibliographic references and indexes.

Table of 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.

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.

Business Administration

There are no comments for this item.

Log in to your account to post a comment.

Library Home | Contacts | E-journals
Copyright @ 2011-2019 EWU Library
East West University