No label defined (Q4040446)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 193641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 193641 |
Statements
5 June 1993
0 references
graph algorithms
0 references
trees
0 references
Boolean algebra
0 references
group theory
0 references
computer science
0 references
A well-written undergraduate textbook for a today computer science curriculum on combinatorial and algebraic topics of general interest, stressing construction of algorithms and discussion of its running time. There are many concrete examples, a thousand exercises (solutions or hints for odd one are given), and many figures to illustrate treated topics. Chapters 1, 2, 3, 4, 7 contain the core of material on sets, logic, functions, relations and baby algebra; chapter 5 contains counting techniques, chapter 8 graphs and graph algorithms, chapter 9 trees (with, e.g., depth first search algorithms), chapter 10 Boolean algebra (to Karnaugh maps), chapter 11 a bit of group theory with applications to counting. A two-semester course can cover the whole book, various choices of topics are possible for a one-semester course. Coordinating the choice with computer science courses is strongly recommended: the interactive material is enormous.
0 references
