Discrete Mathematics

By: Contributor(s): Material type: TextTextPublication details: New York ; Addison Wesley Longman\; 2002Description: 370 p; Includes indexISBN:
  • 981-4119-67-9
Subject(s): DDC classification:
  • C 511.2 W27d
Summary: The discrete mathematics course is looked to more and more as a resource for dealing with them. One such case: Computer science students often do not have room in their curriculum for a logic course, so the learn it in discrete math.In the discrete mathematics course, the student learns essential topics: induction and recursion, combinatorics, graph theory, and proofs and logic. Some of these topics are treated in more depth in the upper-division course.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Barcode
Book Book PCC CIRCULATION C 511.2 W27d (Browse shelf(Opens below)) Available 3186

The discrete mathematics course is looked to more and more as a resource for dealing with them. One such case: Computer science students often do not have room in their curriculum for a logic course, so the learn it in discrete math.In the discrete mathematics course, the student learns essential topics: induction and recursion, combinatorics, graph theory, and proofs and logic. Some of these topics are treated in more depth in the upper-division course.

There are no comments on this title.

to post a comment.
Share